Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000209.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 110K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779700452919

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 09:14:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:14:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:14:14] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-25 09:14:14] [INFO ] Transformed 192 places.
[2026-05-25 09:14:14] [INFO ] Transformed 475 transitions.
[2026-05-25 09:14:14] [INFO ] Found NUPN structural information;
[2026-05-25 09:14:14] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-15-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 82 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 172 transition count 442
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 172 transition count 442
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 49 place count 172 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 171 transition count 431
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 171 transition count 431
Applied a total of 51 rules in 29 ms. Remains 171 /192 variables (removed 21) and now considering 431/473 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3982548042929281147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4583875170635314390.kers'
[2026-05-25 09:14:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3982548042929281147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4583875170635314390.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 431 rows 171 cols 1418 entries
Finished phase 1 with 163 SingleSign rule and 1 generalized
[2026-05-25 09:14:14] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4583875170635314390.kers
Total runtime 3 ms.
[2026-05-25 09:14:14] [INFO ] Implicit Places using invariants in 348 ms returned []
[2026-05-25 09:14:14] [INFO ] Invariant cache hit.
[2026-05-25 09:14:15] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-25 09:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (OVERLAPS) 431/602 variables, 171/210 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/602 variables, and 211 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 431/602 variables, 171/215 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 430/645 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 648 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in LTL mode, iteration 1 : 171/192 places, 431/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60938 ms. Remains : 171/192 places, 431/473 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 171 /171 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-25 09:15:15] [INFO ] Invariant cache hit.
[2026-05-25 09:15:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:15:15] [INFO ] Invariant cache hit.
[2026-05-25 09:15:15] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 171/171 places, 431/431 transitions.
Support contains 82 out of 171 places after structural reductions.
[2026-05-25 09:15:15] [INFO ] Flatten gal took : 61 ms
[2026-05-25 09:15:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-15-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:15:15] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:15:15] [INFO ] Input system was already deterministic with 431 transitions.
Support contains 70 out of 171 places (down from 82) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1501 ms. (26 steps per ms) remains 37/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
[2026-05-25 09:15:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 113/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 431/602 variables, 171/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 0/602 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 186 constraints, problems are : Problem set: 0 solved, 31 unsolved in 3534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 113/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 3/171 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 431/602 variables, 171/191 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 31/222 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 223 constraints, problems are : Problem set: 0 solved, 31 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8555ms problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 431/431 transitions.
Graph (trivial) has 92 edges and 171 vertex of which 3 / 171 are part of one of the 1 SCC in 12 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 169 transition count 414
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 155 transition count 411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 152 transition count 411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 35 place count 152 transition count 409
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 150 transition count 409
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 146 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 146 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 47 place count 146 transition count 402
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 145 transition count 402
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 81 place count 129 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 129 transition count 385
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 106 place count 117 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 142 place count 117 transition count 426
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 116 transition count 435
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 154 place count 116 transition count 423
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 169 place count 106 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 176 place count 106 transition count 411
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 106 transition count 411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 105 transition count 410
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 17 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 180 place count 101 transition count 410
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 188 place count 101 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 213 place count 101 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 215 place count 100 transition count 389
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 218 place count 100 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 229 place count 100 transition count 375
Applied a total of 229 rules in 151 ms. Remains 100 /171 variables (removed 71) and now considering 375/431 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 100/171 places, 375/431 transitions.
RANDOM walk for 40000 steps (8 resets) in 509 ms. (78 steps per ms) remains 22/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 9/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 6/8 properties
[2026-05-25 09:15:25] [INFO ] Flow matrix only has 338 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15512379491544173361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8021113273698185510.kers'
[2026-05-25 09:15:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15512379491544173361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8021113273698185510.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 100 cols 1154 entries
Finished phase 1 with 93 SingleSign rule and 1 generalized
[2026-05-25 09:15:25] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8021113273698185510.kers
Total runtime 1 ms.
[2026-05-25 09:15:25] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 80/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 333/427 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 37/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/438 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 143 constraints, problems are : Problem set: 0 solved, 6 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 80/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 333/427 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 37/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 11/438 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/438 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 153 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1367 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 13083 steps, including 601 resets, run visited all 3 properties in 23 ms. (steps per millisecond=568 )
Parikh walk visited 6 properties in 578 ms.
[2026-05-25 09:15:27] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:15:27] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:15:27] [INFO ] Input system was already deterministic with 431 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 145 transition count 389
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 145 transition count 389
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 66 place count 145 transition count 375
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 144 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 144 transition count 373
Applied a total of 68 rules in 8 ms. Remains 144 /171 variables (removed 27) and now considering 373/431 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2922639829933707997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18222492630509870765.kers'
[2026-05-25 09:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2922639829933707997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18222492630509870765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 144 cols 1276 entries
Finished phase 1 with 136 SingleSign rule and 1 generalized
[2026-05-25 09:15:27] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18222492630509870765.kers
Total runtime 1 ms.
[2026-05-25 09:15:28] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:15:28] [INFO ] Invariant cache hit.
[2026-05-25 09:15:28] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2026-05-25 09:15:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/517 variables, 144/166 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 172 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/517 variables, 144/172 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 372/544 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 547 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 144/171 places, 373/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60351 ms. Remains : 144/171 places, 373/431 transitions.
[2026-05-25 09:16:28] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:16:28] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:16:28] [INFO ] Input system was already deterministic with 373 transitions.
[2026-05-25 09:16:28] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:16:28] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:16:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2636513353443504270.gal : 8 ms
[2026-05-25 09:16:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3251961301903291886.ctl : 12 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/CTLCardinality2636513353443504270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3251961301903291886.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.91209e+06,0.401266,20240,2,4504,5,47051,6,0,951,65115,0


Converting to forward existential form...Done !
original formula: EF((EX(AF(EX((p33==1)))) + ((p35==1)&&((p52==0)||(p133==1)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EG(!(EX((p33==1))))))] != FALSE + [(FwdU(Init,TRUE) * ((p35==1)&&((p52==0)||(p133==1)...169
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t48, t52, t56, t58, t64,...538
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.05731,77268,1,0,666,381396,770,342,7964,296589,779
FORMULA MedleyA-PT-15-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 142 transition count 383
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 142 transition count 383
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 141 transition count 364
Applied a total of 77 rules in 8 ms. Remains 141 /171 variables (removed 30) and now considering 364/431 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9850026348751558824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10234853780870059914.kers'
[2026-05-25 09:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9850026348751558824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10234853780870059914.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:16:30] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10234853780870059914.kers
Total runtime 1 ms.
[2026-05-25 09:16:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:16:30] [INFO ] Invariant cache hit.
[2026-05-25 09:16:30] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:16:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 28122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 58194ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 58195ms
Starting structural reductions in LTL mode, iteration 1 : 141/171 places, 364/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58428 ms. Remains : 141/171 places, 364/431 transitions.
[2026-05-25 09:17:28] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:17:29] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:17:29] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-25 09:17:29] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:17:29] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:17:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2609784292000053958.gal : 4 ms
[2026-05-25 09:17:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6172705849742426087.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/CTLCardinality2609784292000053958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6172705849742426087.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.81482e+06,0.415358,20640,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: EX(EG((p124!=1)))
=> equivalent forward existential formula: [FwdG(EY(Init),(p124!=1))] != FALSE
Hit Full ! (commute/partial/dont) 348/0/16
(forward)formula 0,1,1.6381,55628,1,0,27,222891,19,2,5212,160587,26
FORMULA MedleyA-PT-15-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 143 transition count 384
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 143 transition count 384
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 70 place count 143 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 142 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 142 transition count 368
Applied a total of 72 rules in 21 ms. Remains 142 /171 variables (removed 29) and now considering 368/431 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13557108757224588782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17176772923875244717.kers'
[2026-05-25 09:17:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13557108757224588782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17176772923875244717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 142 cols 1266 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:17:30] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17176772923875244717.kers
Total runtime 3 ms.
[2026-05-25 09:17:30] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:17:30] [INFO ] Invariant cache hit.
[2026-05-25 09:17:31] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:17:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/510 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 172 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/510 variables, 142/172 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 367/539 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 542 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 142/171 places, 368/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60353 ms. Remains : 142/171 places, 368/431 transitions.
[2026-05-25 09:18:31] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:18:31] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:18:31] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-25 09:18:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:18:31] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:18:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17408613584069621632.gal : 2 ms
[2026-05-25 09:18:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality12076569758103074299.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/CTLCardinality17408613584069621632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12076569758103074299.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,2.70661e+06,0.50746,20652,2,4300,5,47028,6,0,938,65619,0


Converting to forward existential form...Done !
original formula: (AF(AX((((p134==1)&&(p61==1)) + AG(((p166==0)||(p60==1)))))) + EX(AG(AX((p134==0)))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(!(E(TRUE U !(!(EX(!((p134==0)))))))))),!(!(EX(!((((p134==1)&&(p61==1)) + !(E(TRUE U !(((p166=...187
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...514
(forward)formula 0,0,16.9393,396544,1,0,980,2.02473e+06,767,559,7871,2.10074e+06,1060
FORMULA MedleyA-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Graph (trivial) has 183 edges and 171 vertex of which 9 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 164 transition count 403
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 143 transition count 403
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 43 place count 143 transition count 399
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 139 transition count 399
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 77 place count 113 transition count 354
Iterating global reduction 2 with 26 rules applied. Total rules applied 103 place count 113 transition count 354
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 119 place count 113 transition count 338
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 119 place count 113 transition count 333
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 108 transition count 333
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 153 place count 96 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 96 transition count 320
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 157 place count 93 transition count 312
Iterating global reduction 4 with 3 rules applied. Total rules applied 160 place count 93 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 173 place count 93 transition count 299
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 177 place count 91 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 90 transition count 296
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 106 edges and 88 vertex of which 36 / 88 are part of one of the 14 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 181 place count 66 transition count 296
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 5 with 83 rules applied. Total rules applied 264 place count 66 transition count 213
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 270 place count 60 transition count 156
Iterating global reduction 6 with 6 rules applied. Total rules applied 276 place count 60 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 278 place count 60 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 58 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 323 place count 58 transition count 111
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 328 place count 58 transition count 106
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 334 place count 53 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 335 place count 52 transition count 105
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 337 place count 50 transition count 100
Iterating global reduction 10 with 2 rules applied. Total rules applied 339 place count 50 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 343 place count 48 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 347 place count 48 transition count 94
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 348 place count 48 transition count 93
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 350 place count 47 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 351 place count 46 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 351 place count 46 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 353 place count 45 transition count 91
Applied a total of 353 rules in 77 ms. Remains 45 /171 variables (removed 126) and now considering 91/431 (removed 340) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10607528764277983320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5883113758095124579.kers'
[2026-05-25 09:18:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10607528764277983320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5883113758095124579.kers]
Normalized transition count is 90 out of 91 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 45 cols 318 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 09:18:48] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5883113758095124579.kers
Total runtime 1 ms.
[2026-05-25 09:18:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 09:18:48] [INFO ] Invariant cache hit.
[2026-05-25 09:18:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:18:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2026-05-25 09:18:48] [INFO ] Redundant transitions in 28 ms returned [90]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 84 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1967210868927993042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6956517200883744740.kers'
[2026-05-25 09:18:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1967210868927993042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6956517200883744740.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 45 cols 314 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 09:18:48] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6956517200883744740.kers
Total runtime 0 ms.
[2026-05-25 09:18:48] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 74 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 84/158 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 159 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2963 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5365ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 5367ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/171 places, 90/431 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 88
Applied a total of 4 rules in 7 ms. Remains 43 /45 variables (removed 2) and now considering 88/90 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1625037020868131648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7117235630603337990.kers'
[2026-05-25 09:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1625037020868131648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7117235630603337990.kers]
Normalized transition count is 87 out of 88 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 43 cols 310 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 09:18:53] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7117235630603337990.kers
Total runtime 1 ms.
[2026-05-25 09:18:53] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 09:18:53] [INFO ] Invariant cache hit.
[2026-05-25 09:18:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:18:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 43/171 places, 88/431 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5760 ms. Remains : 43/171 places, 88/431 transitions.
[2026-05-25 09:18:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:18:54] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-25 09:18:54] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:18:54] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:18:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality2170423091321620082.gal : 1 ms
[2026-05-25 09:18:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality7551451866255815644.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/CTLCardinality2170423091321620082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7551451866255815644.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,4220,0.085227,8108,2,1337,5,13516,5,0,261,11937,0


Converting to forward existential form...Done !
original formula: (AG(((p109==0)||(p33==0))) + EF(EG((EF((p21==1)) * EF(((p187==0)&&(p15==1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U EG((E(TRUE U (p21==1)) * E(TRUE U ((p187==0)&&(p15==1)))))))),TRUE) * !(((p109==0)||(p...173
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t10, t12, t13, t14, t19, t22, t24, t26, t33, t65, t66, t69, t70, t82, t83, Inter...247
Fast SCC detection found an SCC at level 0
(forward)formula 0,1,0.653561,28052,1,0,210,116201,204,103,2242,74700,222
FORMULA MedleyA-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 145 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 145 transition count 387
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 68 place count 145 transition count 371
Applied a total of 68 rules in 11 ms. Remains 145 /171 variables (removed 26) and now considering 371/431 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14439504867367860364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10625661115328439342.kers'
[2026-05-25 09:18:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14439504867367860364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10625661115328439342.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 145 cols 1266 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-05-25 09:18:54] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10625661115328439342.kers
Total runtime 2 ms.
[2026-05-25 09:18:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 09:18:54] [INFO ] Invariant cache hit.
[2026-05-25 09:18:55] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2026-05-25 09:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/516 variables, 145/177 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 178 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/516 variables, 145/178 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 370/548 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 552 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 145/171 places, 371/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60450 ms. Remains : 145/171 places, 371/431 transitions.
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:19:55] [INFO ] Input system was already deterministic with 371 transitions.
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:19:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13686346997257892696.gal : 4 ms
[2026-05-25 09:19:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1080414802709563451.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/CTLCardinality13686346997257892696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1080414802709563451.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((AF(((p100==0)||(p22==1))) * AX((((p179==0)||(p20==1))||((p86==0)||(p145==1))))) * (p187==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p187==1)) * !(EG(!(((p100==0)||(p22==1)))))) * !(EX(!((((p179==0)||(p20==1))||((p86==0)||...180
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t15, t17, t22, t23, t26, t27, t34, t35, t37, t38, t41, t42, t43, t46, t49, t51, t...544
(forward)formula 0,1,1.94908,73484,1,0,676,324707,768,345,7754,247446,778
FORMULA MedleyA-PT-15-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 152 transition count 400
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 152 transition count 400
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 52 place count 152 transition count 386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 151 transition count 384
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 151 transition count 384
Applied a total of 54 rules in 12 ms. Remains 151 /171 variables (removed 20) and now considering 384/431 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2668782025706407585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2089427234135163236.kers'
[2026-05-25 09:19:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2668782025706407585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2089427234135163236.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 151 cols 1298 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-25 09:19:57] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2089427234135163236.kers
Total runtime 4 ms.
[2026-05-25 09:19:57] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 09:19:57] [INFO ] Invariant cache hit.
[2026-05-25 09:19:57] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2026-05-25 09:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (OVERLAPS) 384/535 variables, 151/182 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 183 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 384/535 variables, 151/184 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 383/567 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 571 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 151/171 places, 384/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 151/171 places, 384/431 transitions.
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:20:57] [INFO ] Input system was already deterministic with 384 transitions.
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:20:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12031096328660515912.gal : 2 ms
[2026-05-25 09:20:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality16294373659882816808.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/CTLCardinality12031096328660515912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16294373659882816808.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,3.45353e+06,0.495219,24932,2,4862,5,56978,6,0,990,80345,0


Converting to forward existential form...Done !
original formula: E(E(((E((((p177==1)||(p104==0))||(p175==1)) U !(((p181==0)||(p40==1)))) + !((((p30==0)||(p62==0))||(p92==1)))) + ((AX((p125==0)) * E((p68...395
=> equivalent forward existential formula: [(FwdU(Init,E(((E((((p177==1)||(p104==0))||(p175==1)) U !(((p181==0)||(p40==1)))) + !((((p30==0)||(p62==0))||(p9...510
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t11, t16, t21, t23, t24, t25, t27, t28, t35, t36, t38, t41, t42, t45, t48, t50, t...583
(forward)formula 0,1,25.0962,788632,1,0,1328,4.39615e+06,838,725,8280,4.43231e+06,1483
FORMULA MedleyA-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Graph (trivial) has 186 edges and 171 vertex of which 6 / 171 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 166 transition count 404
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 144 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 143 transition count 403
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 47 place count 143 transition count 398
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 57 place count 138 transition count 398
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 84 place count 111 transition count 352
Iterating global reduction 3 with 27 rules applied. Total rules applied 111 place count 111 transition count 352
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 127 place count 111 transition count 336
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 127 place count 111 transition count 331
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 137 place count 106 transition count 331
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 105 transition count 327
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 105 transition count 327
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
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 159 place count 95 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 95 transition count 316
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 163 place count 92 transition count 309
Iterating global reduction 5 with 3 rules applied. Total rules applied 166 place count 92 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 180 place count 92 transition count 295
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 184 place count 90 transition count 293
Applied a total of 184 rules in 32 ms. Remains 90 /171 variables (removed 81) and now considering 293/431 (removed 138) transitions.
[2026-05-25 09:21:23] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4867851845857070804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11373046764970516342.kers'
[2026-05-25 09:21:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4867851845857070804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11373046764970516342.kers]
Normalized transition count is 290 out of 291 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 290 rows 89 cols 965 entries
Finished phase 1 with 82 SingleSign rule and 1 generalized
[2026-05-25 09:21:23] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11373046764970516342.kers
Total runtime 5 ms.
[2026-05-25 09:21:23] [INFO ] Implicit Places using invariants in 148 ms returned [29, 57]
[2026-05-25 09:21:23] [INFO ] Actually due to overlaps returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/171 places, 293/431 transitions.
Graph (trivial) has 96 edges and 89 vertex of which 18 / 89 are part of one of the 7 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 75 transition count 209
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 75 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 208
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 1 with 2 rules applied. Total rules applied 10 place count 74 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 74 transition count 200
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 74 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 73 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 72 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 72 transition count 188
Applied a total of 21 rules in 21 ms. Remains 72 /89 variables (removed 17) and now considering 188/293 (removed 105) transitions.
[2026-05-25 09:21:23] [INFO ] Flow matrix only has 144 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7432175094156984696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10563625243645625122.kers'
[2026-05-25 09:21:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7432175094156984696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10563625243645625122.kers]
Normalized transition count is 143 out of 144 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 72 cols 435 entries
Finished phase 1 with 65 SingleSign rule and 1 generalized
[2026-05-25 09:21:23] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10563625243645625122.kers
Total runtime 0 ms.
[2026-05-25 09:21:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:21:23] [INFO ] Flow matrix only has 144 transitions (discarded 44 similar events)
[2026-05-25 09:21:23] [INFO ] Invariant cache hit.
[2026-05-25 09:21:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:21:23] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 72/171 places, 188/431 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 344 ms. Remains : 72/171 places, 188/431 transitions.
[2026-05-25 09:21:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:21:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:21:23] [INFO ] Input system was already deterministic with 188 transitions.
[2026-05-25 09:21:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:21:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:21:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality16414734098431094582.gal : 1 ms
[2026-05-25 09:21:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality13016364983656183147.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/CTLCardinality16414734098431094582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13016364983656183147.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,29451,0.101986,8288,2,1650,5,13079,6,0,469,13275,0


Converting to forward existential form...Done !
original formula: EF(!(E(E((p8==1) U EF((p153==0))) U !(((p179==0)||(p2==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E((p8==1) U E(TRUE U (p153==0))) U !(((p179==0)||(p2==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t14, t15, t18, t19, t23, t26, t29, t33, t36, t40, t41, t43, t45, t47, t51, t52, t54, ...344
(forward)formula 0,1,0.992037,35060,1,0,346,158717,396,191,3543,116448,415
FORMULA MedleyA-PT-15-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 143 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 143 transition count 385
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 73 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 142 transition count 366
Applied a total of 75 rules in 14 ms. Remains 142 /171 variables (removed 29) and now considering 366/431 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9395088904920392560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12594645283375866902.kers'
[2026-05-25 09:21:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9395088904920392560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12594645283375866902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:21:24] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12594645283375866902.kers
Total runtime 3 ms.
[2026-05-25 09:21:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:21:24] [INFO ] Invariant cache hit.
[2026-05-25 09:21:24] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:21:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 170 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 539 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 142/171 places, 366/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60399 ms. Remains : 142/171 places, 366/431 transitions.
[2026-05-25 09:22:24] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:22:24] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:22:24] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-25 09:22:24] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:22:24] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:22:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1952800989214452292.gal : 1 ms
[2026-05-25 09:22:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality8488438440219974464.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/CTLCardinality1952800989214452292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8488438440219974464.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.88428e+06,0.400608,21232,2,4407,5,47633,6,0,936,67338,0


Converting to forward existential form...Done !
original formula: EF(EX((p20!=0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p20!=0))] != FALSE
(forward)formula 0,1,0.465011,21452,1,0,8,47633,8,1,1680,67338,2
FORMULA MedleyA-PT-15-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Graph (trivial) has 183 edges and 171 vertex of which 9 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 164 transition count 404
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 144 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 41 place count 144 transition count 401
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 141 transition count 401
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 73 place count 115 transition count 355
Iterating global reduction 2 with 26 rules applied. Total rules applied 99 place count 115 transition count 355
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 115 place count 115 transition count 339
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 115 place count 115 transition count 335
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 111 transition count 335
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 110 transition count 331
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 110 transition count 331
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 97 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 97 transition count 317
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 154 place count 95 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 95 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 170 place count 95 transition count 299
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 174 place count 93 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 92 transition count 296
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 105 edges and 90 vertex of which 33 / 90 are part of one of the 13 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 178 place count 70 transition count 296
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 5 with 80 rules applied. Total rules applied 258 place count 70 transition count 216
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 264 place count 64 transition count 159
Iterating global reduction 6 with 6 rules applied. Total rules applied 270 place count 64 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 272 place count 64 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 276 place count 62 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 314 place count 62 transition count 117
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 319 place count 62 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 324 place count 57 transition count 112
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 327 place count 54 transition count 104
Iterating global reduction 9 with 3 rules applied. Total rules applied 330 place count 54 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 334 place count 52 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 336 place count 52 transition count 100
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 337 place count 52 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 338 place count 51 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 338 place count 51 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 340 place count 50 transition count 98
Applied a total of 340 rules in 45 ms. Remains 50 /171 variables (removed 121) and now considering 98/431 (removed 333) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10812103492279644487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15930837564883256702.kers'
[2026-05-25 09:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10812103492279644487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15930837564883256702.kers]
Normalized transition count is 97 out of 98 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 50 cols 334 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-25 09:22:25] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15930837564883256702.kers
Total runtime 0 ms.
[2026-05-25 09:22:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 09:22:25] [INFO ] Invariant cache hit.
[2026-05-25 09:22:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:22:25] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-25 09:22:25] [INFO ] Redundant transitions in 21 ms returned [96, 97]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 88 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-135268295160760031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3519204024303806933.kers'
[2026-05-25 09:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-135268295160760031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3519204024303806933.kers]
Normalized transition count is 95 out of 96 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 50 cols 326 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-25 09:22:25] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3519204024303806933.kers
Total runtime 0 ms.
[2026-05-25 09:22:25] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 95/145 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/146 variables, and 78 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 95/145 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 88/166 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/146 variables, and 166 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6861ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6861ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/171 places, 96/431 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 48 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 48 transition count 91
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 8 place count 47 transition count 91
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 10 place count 46 transition count 90
Applied a total of 10 rules in 7 ms. Remains 46 /50 variables (removed 4) and now considering 90/96 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8541099763698733316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10845366501655819325.kers'
[2026-05-25 09:22:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8541099763698733316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10845366501655819325.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 46 cols 314 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:22:32] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10845366501655819325.kers
Total runtime 1 ms.
[2026-05-25 09:22:32] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:22:32] [INFO ] Invariant cache hit.
[2026-05-25 09:22:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:22:32] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/171 places, 90/431 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7258 ms. Remains : 46/171 places, 90/431 transitions.
[2026-05-25 09:22:32] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:22:32] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:22:32] [INFO ] Input system was already deterministic with 90 transitions.
[2026-05-25 09:22:32] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:22:32] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:22:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1413244611605017114.gal : 1 ms
[2026-05-25 09:22:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality1531024889401809319.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/CTLCardinality1413244611605017114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1531024889401809319.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,7068,0.062952,6776,2,872,5,9351,5,0,275,8303,0


Converting to forward existential form...Done !
original formula: AG(AF(((A((p11!=1) U (p126==1)) + (p127!=0)) + (E((p117==0) U (p179==0)) + ((p150==1)&&(p39==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!((E(!((p126==1)) U (!((p11!=1)) * !((p126==1)))) + EG(!((p126==1))))) + (p127!=0)) + ...217
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t16, t18, t22, t23, t25, t27, t29, t39, t57, t60, t67, t68, Intersection with reac...230
(forward)formula 0,0,0.58016,28500,1,0,309,132046,217,180,2272,97475,386
FORMULA MedleyA-PT-15-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 148 transition count 392
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 148 transition count 392
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 58 place count 148 transition count 380
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 147 transition count 378
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 147 transition count 378
Applied a total of 60 rules in 11 ms. Remains 147 /171 variables (removed 24) and now considering 378/431 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3177482237115207280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11155210353349602950.kers'
[2026-05-25 09:22:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3177482237115207280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11155210353349602950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 147 cols 1290 entries
Finished phase 1 with 139 SingleSign rule and 1 generalized
[2026-05-25 09:22:33] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11155210353349602950.kers
Total runtime 1 ms.
[2026-05-25 09:22:33] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 09:22:33] [INFO ] Invariant cache hit.
[2026-05-25 09:22:33] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2026-05-25 09:22:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/525 variables, 147/175 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 180 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/525 variables, 147/185 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 377/562 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 566 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 147/171 places, 378/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60454 ms. Remains : 147/171 places, 378/431 transitions.
[2026-05-25 09:23:33] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:23:33] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:23:33] [INFO ] Input system was already deterministic with 378 transitions.
[2026-05-25 09:23:33] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:23:33] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:23:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3145609191280868490.gal : 2 ms
[2026-05-25 09:23:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12659980513427611432.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/CTLCardinality3145609191280868490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12659980513427611432.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.92209e+06,0.66294,29096,2,5980,5,70515,6,0,968,102756,0


Converting to forward existential form...Done !
original formula: AF(((AX(EF(((p122==0)&&(p187==1)))) * EF(EG((((p158==0)||(p99==1))||((p65==0)||(p78==1)))))) * A(EF(AG(((p160==0)||(p115==1)))) U ((p80==...171
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(E(TRUE U ((p122==0)&&(p187==1)))))) * E(TRUE U EG((((p158==0)||(p99==1))||((p65==0)||(p78=...321
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t15, t20, t21, t23, t24, t26, t28, t29, t36, t37, t39, t42, t43, t46, t49, t51, t...555
(forward)formula 0,1,15.098,433260,1,0,774,2.72283e+06,796,398,8183,1.75388e+06,928
FORMULA MedleyA-PT-15-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 142 transition count 383
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 142 transition count 383
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 141 transition count 364
Applied a total of 77 rules in 9 ms. Remains 141 /171 variables (removed 30) and now considering 364/431 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8904315873660313907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1810388865000750121.kers'
[2026-05-25 09:23:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8904315873660313907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1810388865000750121.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:23:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1810388865000750121.kers
Total runtime 2 ms.
[2026-05-25 09:23:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:23:49] [INFO ] Invariant cache hit.
[2026-05-25 09:23:49] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:23:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 29931 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60020ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60021ms
Starting structural reductions in LTL mode, iteration 1 : 141/171 places, 364/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60333 ms. Remains : 141/171 places, 364/431 transitions.
[2026-05-25 09:24:49] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:24:49] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:24:49] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-25 09:24:49] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:24:49] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:24:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17501371041005543045.gal : 2 ms
[2026-05-25 09:24:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality6409799599364372325.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/CTLCardinality17501371041005543045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6409799599364372325.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(((p156==0)&&(p159==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p156==0)&&(p159==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,1,1.66097,60640,1,0,628,277675,745,332,7525,205151,735
FORMULA MedleyA-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Graph (trivial) has 189 edges and 171 vertex of which 9 / 171 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 164 transition count 403
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 143 transition count 403
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 43 place count 143 transition count 398
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 138 transition count 398
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 81 place count 110 transition count 350
Iterating global reduction 2 with 28 rules applied. Total rules applied 109 place count 110 transition count 350
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 125 place count 110 transition count 334
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 125 place count 110 transition count 328
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 137 place count 104 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 103 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 103 transition count 324
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 157 place count 94 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 94 transition count 314
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 91 transition count 307
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 91 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 178 place count 91 transition count 293
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 89 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 88 transition count 290
Applied a total of 183 rules in 65 ms. Remains 88 /171 variables (removed 83) and now considering 290/431 (removed 141) transitions.
[2026-05-25 09:24:51] [INFO ] Flow matrix only has 287 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3439116152178879912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2002566291313434568.kers'
[2026-05-25 09:24:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3439116152178879912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2002566291313434568.kers]
Normalized transition count is 286 out of 287 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 286 rows 87 cols 956 entries
Finished phase 1 with 80 SingleSign rule and 1 generalized
[2026-05-25 09:24:51] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2002566291313434568.kers
Total runtime 3 ms.
[2026-05-25 09:24:51] [INFO ] Implicit Places using invariants in 131 ms returned [28, 56]
[2026-05-25 09:24:51] [INFO ] Actually due to overlaps returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 87/171 places, 290/431 transitions.
Graph (trivial) has 96 edges and 87 vertex of which 15 / 87 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 75 transition count 208
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 75 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 75 transition count 207
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 1 with 2 rules applied. Total rules applied 10 place count 74 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 74 transition count 200
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 74 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 73 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 72 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 72 transition count 188
Applied a total of 20 rules in 18 ms. Remains 72 /87 variables (removed 15) and now considering 188/290 (removed 102) transitions.
[2026-05-25 09:24:51] [INFO ] Flow matrix only has 152 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5730723609124736098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-941989909130138769.kers'
[2026-05-25 09:24:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5730723609124736098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-941989909130138769.kers]
Normalized transition count is 151 out of 152 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 72 cols 470 entries
Finished phase 1 with 65 SingleSign rule and 1 generalized
[2026-05-25 09:24:51] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-941989909130138769.kers
Total runtime 1 ms.
[2026-05-25 09:24:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:24:51] [INFO ] Flow matrix only has 152 transitions (discarded 36 similar events)
[2026-05-25 09:24:51] [INFO ] Invariant cache hit.
[2026-05-25 09:24:51] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-25 09:24:51] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 72/171 places, 188/431 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 451 ms. Remains : 72/171 places, 188/431 transitions.
[2026-05-25 09:24:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:24:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:24:51] [INFO ] Input system was already deterministic with 188 transitions.
[2026-05-25 09:24:51] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:24:51] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:24:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2238360122442303386.gal : 2 ms
[2026-05-25 09:24:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7374648456808423434.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/CTLCardinality2238360122442303386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7374648456808423434.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,28829,0.102603,6904,2,1115,5,8863,6,0,469,8231,0


Converting to forward existential form...Done !
original formula: AG(AF(E(AF((p151==1)) U EF((p56==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(!(EG(!((p151==1)))) U E(TRUE U (p56==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t12, t17, t18, t21, t22, t26, t29, t32, t36, t39, t43, t44, t46, t48, t50, t54, t55, ...321
(forward)formula 0,1,0.387458,19152,1,0,318,71452,405,182,3668,56874,397
FORMULA MedleyA-PT-15-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 147 transition count 392
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 147 transition count 392
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 58 place count 147 transition count 382
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 146 transition count 380
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 146 transition count 380
Applied a total of 60 rules in 10 ms. Remains 146 /171 variables (removed 25) and now considering 380/431 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18275379714964799311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5352252031857470256.kers'
[2026-05-25 09:24:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18275379714964799311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5352252031857470256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 380 rows 146 cols 1298 entries
Finished phase 1 with 138 SingleSign rule and 1 generalized
[2026-05-25 09:24:52] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5352252031857470256.kers
Total runtime 1 ms.
[2026-05-25 09:24:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 09:24:52] [INFO ] Invariant cache hit.
[2026-05-25 09:24:52] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2026-05-25 09:24:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/526 variables, 146/166 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 168 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (OVERLAPS) 380/526 variables, 146/171 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 379/550 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 553 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 146/171 places, 380/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60452 ms. Remains : 146/171 places, 380/431 transitions.
[2026-05-25 09:25:52] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:25:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:25:52] [INFO ] Input system was already deterministic with 380 transitions.
[2026-05-25 09:25:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:25:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:25:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8632299866265049699.gal : 2 ms
[2026-05-25 09:25:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15930350620607488862.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/CTLCardinality8632299866265049699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15930350620607488862.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.03517e+06,0.423818,22016,2,4353,5,50521,6,0,966,68357,0


Converting to forward existential form...Done !
original formula: EF(((EF(EX((EG((p1==1)) * AX((p93==1))))) * (p31==0)) * EG((((p74==0)||(p24==1)) + A(((p32==0)||(p155==1)) U (p138==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (E(TRUE U EX((EG((p1==1)) * !(EX(!((p93==1))))))) * (p31==0))),(((p74==0)||(p24==1)) + ...250
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t26, t33, t34, t36, t39, t40, t43, t46, t47, t48, t50, t54, t58,...542
(forward)formula 0,0,14.3392,477708,1,0,913,3.13093e+06,799,481,7981,2.44501e+06,1078
FORMULA MedleyA-PT-15-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 431/431 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 146 transition count 391
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 146 transition count 391
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 64 place count 146 transition count 377
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 145 transition count 375
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 145 transition count 375
Applied a total of 66 rules in 10 ms. Remains 145 /171 variables (removed 26) and now considering 375/431 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5270797046573477928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13304516381629303892.kers'
[2026-05-25 09:26:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5270797046573477928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13304516381629303892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 375 rows 145 cols 1280 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-05-25 09:26:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13304516381629303892.kers
Total runtime 2 ms.
[2026-05-25 09:26:07] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 09:26:07] [INFO ] Invariant cache hit.
[2026-05-25 09:26:07] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2026-05-25 09:26:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/520 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/520 variables, and 174 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/520 variables, 145/175 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 374/549 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 552 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 145/171 places, 375/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60370 ms. Remains : 145/171 places, 375/431 transitions.
[2026-05-25 09:27:07] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:27:07] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:27:07] [INFO ] Input system was already deterministic with 375 transitions.
[2026-05-25 09:27:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:27:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:27:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17452951484547112846.gal : 2 ms
[2026-05-25 09:27:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15698310463688612820.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/CTLCardinality17452951484547112846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15698310463688612820.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.94822e+06,0.472801,24208,2,4769,5,56082,6,0,957,77548,0


Converting to forward existential form...Done !
original formula: AF((EF(EX((((p70!=1)&&((p79==0)||(p97==1)))&&(p98==1)))) * EF(((p114==0)||(p39==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EX((((p70!=1)&&((p79==0)||(p97==1)))&&(p98==1)))) * E(TRUE U ((p114==0)||(p39==1))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...546
(forward)formula 0,1,6.55944,208092,1,0,706,1.23032e+06,778,363,8035,779261,839
FORMULA MedleyA-PT-15-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 09:27:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:27:14] [INFO ] Flatten gal took : 6 ms
Total runtime 779948 ms.

BK_STOP 1779701234138

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-15"
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 MedleyA-PT-15, 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 r178-oct2-177969020000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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