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-177969019900145.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-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 82K 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-07-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779699337373

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 08:55:38] [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 08:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:55:39] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2026-05-25 08:55:39] [INFO ] Transformed 145 places.
[2026-05-25 08:55:39] [INFO ] Transformed 287 transitions.
[2026-05-25 08:55:39] [INFO ] Found NUPN structural information;
[2026-05-25 08:55:39] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-07-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 285
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 123 transition count 265
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 123 transition count 265
Applied a total of 38 rules in 23 ms. Remains 123 /143 variables (removed 20) and now considering 265/285 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-797462081844429880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10747746236575528247.kers'
[2026-05-25 08:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-797462081844429880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10747746236575528247.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 123 cols 1194 entries
Finished phase 1 with 109 SingleSign rule and 4 generalized
[2026-05-25 08:55:39] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10747746236575528247.kers
Total runtime 3 ms.
[2026-05-25 08:55:39] [INFO ] Implicit Places using invariants in 499 ms returned []
[2026-05-25 08:55:39] [INFO ] Invariant cache hit.
[2026-05-25 08:55:40] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-25 08:55:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/123 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/19 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/20 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 265/388 variables, 123/143 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/144 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/145 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 1/146 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/146 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/146 constraints. Problems are: Problem set: 48 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 146 constraints, problems are : Problem set: 48 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 48 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 4/4 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 11/21 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 265/388 variables, 123/144 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 216/360 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 6/366 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/370 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/371 constraints. Problems are: Problem set: 48 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/373 constraints. Problems are: Problem set: 48 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 373 constraints, problems are : Problem set: 48 solved, 216 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 216/264 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60351ms problems are : Problem set: 48 solved, 216 unsolved
Search for dead transitions found 48 dead transitions in 60376ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/143 places, 217/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61192 ms. Remains : 123/143 places, 217/285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12654271180783517921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3031206461123909512.kers'
[2026-05-25 08:56:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12654271180783517921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3031206461123909512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 123 cols 842 entries
Finished phase 1 with 109 SingleSign rule and 4 generalized
[2026-05-25 08:56:40] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3031206461123909512.kers
Total runtime 9 ms.
[2026-05-25 08:56:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 08:56:40] [INFO ] Invariant cache hit.
[2026-05-25 08:56:40] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-25 08:56:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/340 variables, 123/142 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 145 constraints, problems are : Problem set: 0 solved, 216 unsolved in 18454 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/340 variables, 123/143 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 216/359 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 375 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48560ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 48561ms
Finished structural reductions in LTL mode , in 1 iterations and 48792 ms. Remains : 123/123 places, 217/217 transitions.
Support contains 55 out of 123 places after structural reductions.
[2026-05-25 08:57:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 08:57:29] [INFO ] Flatten gal took : 65 ms
FORMULA MedleyA-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:57:29] [INFO ] Flatten gal took : 16 ms
[2026-05-25 08:57:29] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 49 out of 123 places (down from 55) after GAL structural reductions.
RANDOM walk for 40000 steps (1405 resets) in 1659 ms. (24 steps per ms) remains 19/32 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (30 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (32 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (30 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (29 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
[2026-05-25 08:57:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 71/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 4/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 202/306 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 31/337 variables, 17/129 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 3/340 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 133 constraints, problems are : Problem set: 0 solved, 19 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 71/100 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/14 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 4/104 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 202/306 variables, 104/122 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 15/137 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/141 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 2/143 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 31/337 variables, 17/161 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 2/163 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/337 variables, 3/166 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/337 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 3/340 variables, 2/168 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 168 constraints, problems are : Problem set: 1 solved, 18 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5858ms problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 118 transition count 193
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 34 place count 108 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 106 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 36 place count 106 transition count 189
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 104 transition count 189
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 98 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 98 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 98 transition count 180
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 97 transition count 180
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 94 place count 77 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 77 transition count 158
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 109 place count 70 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 142 place count 70 transition count 156
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 70 transition count 152
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 150 place count 66 transition count 152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 66 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 65 transition count 151
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 155 place count 65 transition count 151
Applied a total of 155 rules in 128 ms. Remains 65 /123 variables (removed 58) and now considering 151/217 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 65/123 places, 151/217 transitions.
RANDOM walk for 40000 steps (4590 resets) in 456 ms. (87 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40002 steps (1336 resets) in 110 ms. (360 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31312 steps (1076 resets) in 76 ms. (406 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2026-05-25 08:57:36] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:57:36] [INFO ] Flatten gal took : 11 ms
[2026-05-25 08:57:36] [INFO ] Input system was already deterministic with 217 transitions.
Computed a total of 16 stabilizing places and 18 stable transitions
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 117 transition count 200
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 14 rules applied. Total rules applied 28 place count 105 transition count 198
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 104 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 103 transition count 196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 32 place count 103 transition count 191
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 42 place count 98 transition count 191
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 53 place count 87 transition count 178
Iterating global reduction 4 with 11 rules applied. Total rules applied 64 place count 87 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 87 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 86 transition count 177
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 91 place count 73 transition count 165
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 71 transition count 161
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 71 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 103 place count 71 transition count 153
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 106 place count 71 transition count 150
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 109 place count 68 transition count 150
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 109 place count 68 transition count 147
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 115 place count 65 transition count 147
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 6 with 4 rules applied. Total rules applied 119 place count 63 transition count 145
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 120 place count 63 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 122 place count 61 transition count 143
Applied a total of 122 rules in 35 ms. Remains 61 /123 variables (removed 62) and now considering 143/217 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15730892958560721176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17430701597416971217.kers'
[2026-05-25 08:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15730892958560721176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17430701597416971217.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 61 cols 530 entries
Finished phase 1 with 53 SingleSign rule and 1 generalized
[2026-05-25 08:57:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17430701597416971217.kers
Total runtime 1 ms.
[2026-05-25 08:57:36] [INFO ] Implicit Places using invariants in 42 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/123 places, 143/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 86 ms. Remains : 60/123 places, 143/217 transitions.
[2026-05-25 08:57:36] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:57:36] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:57:36] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-25 08:57:36] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:57:36] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:57:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality4941946401183582722.gal : 3 ms
[2026-05-25 08:57:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2827218813082766012.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4941946401183582722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2827218813082766012.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,697556,0.305448,14468,2,1683,5,36735,6,0,373,53411,0


Converting to forward existential form...Done !
original formula: AF(((!(A((p52==1) U (((AG((p139==1)) * (((p49==0)||(p39==0))||(p88==1))) + (p80==0)) + (p53==1)))) * (p10==0)) * (p122==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((((!(E(TRUE U !((p139==1)))) * (((p49==0)||(p39==0))||(p88==1))) + (p80==0)) + (p53==1))...404
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t16, t17, t20, t22, t23, t25, t27, t28, t...381
Using saturation style SCC detection
(forward)formula 0,0,1.38128,44044,1,0,363,187175,325,152,3409,194366,410
FORMULA MedleyA-PT-07-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 106 transition count 198
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 104 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 104 transition count 194
Applied a total of 38 rules in 14 ms. Remains 104 /123 variables (removed 19) and now considering 194/217 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16619571669831961544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17313133740476415815.kers'
[2026-05-25 08:57:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16619571669831961544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17313133740476415815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 104 cols 796 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 08:57:38] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17313133740476415815.kers
Total runtime 2 ms.
[2026-05-25 08:57:38] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 08:57:38] [INFO ] Invariant cache hit.
[2026-05-25 08:57:38] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-25 08:57:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14368 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 24550 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38968ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 38969ms
Starting structural reductions in LTL mode, iteration 1 : 104/123 places, 194/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39188 ms. Remains : 104/123 places, 194/217 transitions.
[2026-05-25 08:58:17] [INFO ] Flatten gal took : 23 ms
[2026-05-25 08:58:17] [INFO ] Flatten gal took : 20 ms
[2026-05-25 08:58:17] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-25 08:58:17] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:58:17] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:58:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12880905907109318864.gal : 10 ms
[2026-05-25 08:58:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality6362624430710055816.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/CTLCardinality12880905907109318864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6362624430710055816.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.55422e+07,1.10814,39908,2,3338,5,120055,6,0,610,169928,0


Converting to forward existential form...Done !
original formula: A(EX(((p47==0)||(p131==1))) U (p30==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p30==1))))) * !(E(!((p30==1)) U (!(EX(((p47==0)||(p131==1)))) * !((p30==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
Detected timeout of ITS tools.
[2026-05-25 08:58:47] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:58:47] [INFO ] Applying decomposition
[2026-05-25 08:58:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7283175569335909663.txt' '-o' '/tmp/graph7283175569335909663.bin' '-w' '/tmp/graph7283175569335909663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7283175569335909663.bin' '-l' '-1' '-v' '-w' '/tmp/graph7283175569335909663.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:58:47] [INFO ] Decomposing Gal with order
[2026-05-25 08:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:58:47] [INFO ] Removed a total of 274 redundant transitions.
[2026-05-25 08:58:47] [INFO ] Flatten gal took : 111 ms
[2026-05-25 08:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 18 ms.
[2026-05-25 08:58:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality14736978210235644566.gal : 5 ms
[2026-05-25 08:58:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17913931629391649277.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/CTLCardinality14736978210235644566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17913931629391649277.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55422e+07,0.128904,9400,344,71,10246,688,306,21048,71,2983,0


Converting to forward existential form...Done !
original formula: A(EX(((i1.u9.p47==0)||(i7.u26.p131==1))) U (i3.u6.p30==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i3.u6.p30==1))))) * !(E(!((i3.u6.p30==1)) U (!(EX(((i1.u9.p47==0)||(i7.u26.p131==1)))) * !((i3...181
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.t85, i1.t83, i1.t80, i1.t79, i1.t71, i1.u3.t101, i1.u10.t73, i1.u10.t78, i1.u11....726
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.29146,238456,1,0,352418,2304,1834,1.23958e+06,334,19659,261574
FORMULA MedleyA-PT-07-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 108 transition count 200
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 108 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 106 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 106 transition count 196
Applied a total of 34 rules in 16 ms. Remains 106 /123 variables (removed 17) and now considering 196/217 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4472668728707512779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14266827590355772554.kers'
[2026-05-25 08:58:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4472668728707512779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14266827590355772554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 106 cols 800 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 08:58:55] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14266827590355772554.kers
Total runtime 3 ms.
[2026-05-25 08:58:55] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 08:58:55] [INFO ] Invariant cache hit.
[2026-05-25 08:58:55] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-25 08:58:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/302 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 122 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/302 variables, 106/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 195/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 322 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44310ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 44312ms
Starting structural reductions in LTL mode, iteration 1 : 106/123 places, 196/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44598 ms. Remains : 106/123 places, 196/217 transitions.
[2026-05-25 08:59:39] [INFO ] Flatten gal took : 26 ms
[2026-05-25 08:59:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:59:39] [INFO ] Input system was already deterministic with 196 transitions.
[2026-05-25 08:59:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:59:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:59:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality6621122465844301482.gal : 1 ms
[2026-05-25 08:59:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality7095404187248414240.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/CTLCardinality6621122465844301482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7095404187248414240.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.80391e+07,1.59443,56108,2,4764,5,160733,6,0,620,250903,0


Converting to forward existential form...Done !
original formula: E((p95==0) U !((AG(((!(EG((p83==1))) + (p52==0)) + (p124==1))) * EF(AX(EG((p17==1)))))))
=> equivalent forward existential formula: ([FwdG(((FwdU(FwdU(Init,(p95==0)),TRUE) * !((p124==1))) * !((p52==0))),(p83==1))] != FALSE + [(FwdU(Init,(p95==0...207
Hit Full ! (commute/partial/dont) 185/0/11
Hit Full ! (commute/partial/dont) 193/0/3
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...499
Detected timeout of ITS tools.
[2026-05-25 09:00:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:00:09] [INFO ] Applying decomposition
[2026-05-25 09:00:09] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph161156964471736890.txt' '-o' '/tmp/graph161156964471736890.bin' '-w' '/tmp/graph161156964471736890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph161156964471736890.bin' '-l' '-1' '-v' '-w' '/tmp/graph161156964471736890.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:00:09] [INFO ] Decomposing Gal with order
[2026-05-25 09:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:00:10] [INFO ] Removed a total of 259 redundant transitions.
[2026-05-25 09:00:10] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:00:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2026-05-25 09:00:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7254685268106367202.gal : 2 ms
[2026-05-25 09:00:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality17821786439785819336.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/CTLCardinality7254685268106367202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17821786439785819336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80391e+07,0.188327,12216,550,123,13333,986,337,38001,94,7219,0


Converting to forward existential form...Done !
original formula: E((i4.u20.p95==0) U !((AG(((!(EG((i3.u17.p83==1))) + (i2.u11.p52==0)) + (i7.i0.u26.p124==1))) * EF(AX(EG((i2.u3.p17==1)))))))
=> equivalent forward existential formula: ([FwdG(((FwdU(FwdU(Init,(i4.u20.p95==0)),TRUE) * !((i7.i0.u26.p124==1))) * !((i2.u11.p52==0))),(i3.u17.p83==1))]...251
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Reverse transition relation is NOT exact ! Due to transitions t34, t73, i0.u2.t105, i0.u4.t101, i1.t94, i1.t93, i1.t92, i1.t89, i1.t88, i1.u5.t71, i1.u5.t9...897
(forward)formula 0,0,2.17157,81648,1,0,124539,4951,2417,447865,545,36261,199681
FORMULA MedleyA-PT-07-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 117 transition count 196
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 18 rules applied. Total rules applied 36 place count 101 transition count 194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 100 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 99 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 40 place count 99 transition count 191
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 42 place count 98 transition count 191
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 55 place count 85 transition count 174
Iterating global reduction 4 with 13 rules applied. Total rules applied 68 place count 85 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 68 place count 85 transition count 172
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 72 place count 83 transition count 172
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 97 place count 70 transition count 160
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 69 transition count 158
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 69 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 108 place count 69 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 112 place count 69 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 116 place count 65 transition count 145
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 116 place count 65 transition count 142
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 122 place count 62 transition count 142
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 6 with 4 rules applied. Total rules applied 126 place count 60 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 58 transition count 138
Applied a total of 128 rules in 82 ms. Remains 58 /123 variables (removed 65) and now considering 138/217 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4815512802766921352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-47353714432512029.kers'
[2026-05-25 09:00:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4815512802766921352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-47353714432512029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 58 cols 524 entries
Finished phase 1 with 50 SingleSign rule and 1 generalized
[2026-05-25 09:00:12] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-47353714432512029.kers
Total runtime 3 ms.
[2026-05-25 09:00:12] [INFO ] Implicit Places using invariants in 89 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/123 places, 138/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 183 ms. Remains : 57/123 places, 138/217 transitions.
[2026-05-25 09:00:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:00:12] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:00:12] [INFO ] Input system was already deterministic with 138 transitions.
[2026-05-25 09:00:12] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:00:12] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:00:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality3864841085579010187.gal : 1 ms
[2026-05-25 09:00:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality10903049997537643127.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/CTLCardinality3864841085579010187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10903049997537643127.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,658344,0.306346,15764,2,1114,5,38018,6,0,354,63351,0


Converting to forward existential form...Done !
original formula: AG(EF((((p38==1)||((p84==0)&&(p7==1)))||(((p64==0)&&(p41==1))&&(p99==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p38==1)||((p84==0)&&(p7==1)))||(((p64==0)&&(p41==1))&&(p99==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t16, t17, t20, t22, t23, t25, t26, t28, t...338
(forward)formula 0,0,1.80207,56468,1,0,263,285358,297,95,3248,239125,314
FORMULA MedleyA-PT-07-CTLCardinality-2024-05 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 : 123/123 places, 217/217 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 105 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 105 transition count 195
Applied a total of 36 rules in 9 ms. Remains 105 /123 variables (removed 18) and now considering 195/217 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4480677718754131870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17937986488684860149.kers'
[2026-05-25 09:00:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4480677718754131870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17937986488684860149.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 105 cols 798 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:00:14] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17937986488684860149.kers
Total runtime 1 ms.
[2026-05-25 09:00:14] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:00:14] [INFO ] Invariant cache hit.
[2026-05-25 09:00:14] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-25 09:00:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 123 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 319 constraints, problems are : Problem set: 0 solved, 194 unsolved in 25873 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42948ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 42949ms
Starting structural reductions in LTL mode, iteration 1 : 105/123 places, 195/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43212 ms. Remains : 105/123 places, 195/217 transitions.
[2026-05-25 09:00:57] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:00:57] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:00:57] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-25 09:00:57] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:00:57] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:00:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2086598615995142998.gal : 3 ms
[2026-05-25 09:00:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality11402265667981852597.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/CTLCardinality2086598615995142998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11402265667981852597.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.55425e+07,1.2593,38308,2,3372,5,114374,6,0,615,165495,0


Converting to forward existential form...Done !
original formula: EF(AG(EX((p120!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX((p120!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t12, t14, t15, t16, t18, t24, t25, t26, t28, t33, t34, t35, t36, t38, t39, t41, t42,...456
(forward)formula 0,0,16.2412,366160,1,0,406,2.30056e+06,411,167,4937,1.57994e+06,462
FORMULA MedleyA-PT-07-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 105 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 105 transition count 195
Applied a total of 36 rules in 10 ms. Remains 105 /123 variables (removed 18) and now considering 195/217 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7935747079070456095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2659363584769822582.kers'
[2026-05-25 09:01:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7935747079070456095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2659363584769822582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 105 cols 798 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:01:13] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2659363584769822582.kers
Total runtime 2 ms.
[2026-05-25 09:01:14] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 09:01:14] [INFO ] Invariant cache hit.
[2026-05-25 09:01:14] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 105/123 places, 195/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 105/123 places, 195/217 transitions.
[2026-05-25 09:01:14] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:01:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:01:14] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-25 09:01:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:01:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:01:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality17365766069121636621.gal : 9 ms
[2026-05-25 09:01:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9125656785762731471.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/CTLCardinality17365766069121636621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9125656785762731471.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.80005e+07,1.12162,38988,2,4467,5,109964,6,0,615,169764,0


Converting to forward existential form...Done !
original formula: AF(((p86==1) + (AX((p66==0)) * (p132==0))))
=> equivalent forward existential formula: [FwdG(Init,!(((p86==1) + (!(EX(!((p66==0)))) * (p132==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...487
(forward)formula 0,1,4.77279,124252,1,0,413,532902,415,148,4998,568776,438
FORMULA MedleyA-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 117 transition count 195
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 100 transition count 191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 98 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 44 place count 98 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 94 transition count 185
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 66 place count 80 transition count 167
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 80 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 80 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 79 transition count 166
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 63 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 61 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 61 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 61 transition count 142
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 61 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 59 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 126 place count 59 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 58 transition count 139
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 132 place count 56 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 54 transition count 135
Applied a total of 134 rules in 35 ms. Remains 54 /123 variables (removed 69) and now considering 135/217 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13869445846951318507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16352859901558695781.kers'
[2026-05-25 09:01:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13869445846951318507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16352859901558695781.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 54 cols 558 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-25 09:01:19] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-16352859901558695781.kers
Total runtime 13 ms.
[2026-05-25 09:01:19] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 09:01:19] [INFO ] Invariant cache hit.
[2026-05-25 09:01:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:01:19] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2026-05-25 09:01:19] [INFO ] Redundant transitions in 18 ms returned []
Running 126 sub problems to find dead transitions.
[2026-05-25 09:01:19] [INFO ] Invariant cache hit.
[2026-05-25 09:01:19] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 135/189 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 73 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 135/189 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 126/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 199 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5945 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10022ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10022ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/123 places, 135/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10313 ms. Remains : 54/123 places, 135/217 transitions.
[2026-05-25 09:01:29] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:01:29] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:01:29] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-25 09:01:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12788350059700882576.gal : 1 ms
[2026-05-25 09:01:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8743749010222724981.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/CTLCardinality12788350059700882576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8743749010222724981.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,802332,0.186819,10204,2,553,5,21517,6,0,339,30726,0


Converting to forward existential form...Done !
original formula: EG(((p34==0) + AF(((p20==0)||(p64==1)))))
=> equivalent forward existential formula: [FwdG(Init,((p34==0) + !(EG(!(((p20==0)||(p64==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t16, t17, t20, t25, t27, t28, t40, t41, t121,...274
(forward)formula 0,1,7.29954,206444,1,0,539,988593,298,278,3256,1.3338e+06,640
FORMULA MedleyA-PT-07-CTLCardinality-2024-08 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 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 117 transition count 195
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 100 transition count 191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 98 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 44 place count 98 transition count 185
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 52 place count 94 transition count 185
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 67 place count 79 transition count 166
Iterating global reduction 3 with 15 rules applied. Total rules applied 82 place count 79 transition count 166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 82 place count 79 transition count 164
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 77 transition count 164
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 114 place count 62 transition count 151
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 60 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 60 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 60 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 60 transition count 137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 57 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 131 place count 57 transition count 135
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 135 place count 55 transition count 135
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 5 with 4 rules applied. Total rules applied 139 place count 53 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 51 transition count 131
Applied a total of 141 rules in 31 ms. Remains 51 /123 variables (removed 72) and now considering 131/217 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1505136634278953812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8245342315885753004.kers'
[2026-05-25 09:01:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1505136634278953812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8245342315885753004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 51 cols 496 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 09:01:36] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8245342315885753004.kers
Total runtime 1 ms.
[2026-05-25 09:01:37] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 09:01:37] [INFO ] Invariant cache hit.
[2026-05-25 09:01:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:01:37] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2026-05-25 09:01:37] [INFO ] Redundant transitions in 15 ms returned []
Running 123 sub problems to find dead transitions.
[2026-05-25 09:01:37] [INFO ] Invariant cache hit.
[2026-05-25 09:01:37] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 2/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 131/182 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 69 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 2/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 131/182 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 123/192 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 192 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7479 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11819ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 11820ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/123 places, 131/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12191 ms. Remains : 51/123 places, 131/217 transitions.
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:01:49] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12213636263879776141.gal : 3 ms
[2026-05-25 09:01:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6295839066717220606.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12213636263879776141.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6295839066717220606.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 18184 steps (2127 resets) in 44 ms. (404 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-07-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 117 transition count 197
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 102 transition count 193
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 100 transition count 191
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 40 place count 100 transition count 188
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 97 transition count 188
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 60 place count 83 transition count 170
Iterating global reduction 3 with 14 rules applied. Total rules applied 74 place count 83 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 74 place count 83 transition count 168
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 81 transition count 168
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 105 place count 67 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 67 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 67 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 65 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 115 place count 65 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 64 transition count 146
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 121 place count 62 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 60 transition count 142
Applied a total of 123 rules in 27 ms. Remains 60 /123 variables (removed 63) and now considering 142/217 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4873997912812137921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3146381841135084471.kers'
[2026-05-25 09:01:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4873997912812137921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3146381841135084471.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 60 cols 523 entries
Finished phase 1 with 52 SingleSign rule and 1 generalized
[2026-05-25 09:01:49] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3146381841135084471.kers
Total runtime 1 ms.
[2026-05-25 09:01:49] [INFO ] Implicit Places using invariants in 43 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/123 places, 142/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 78 ms. Remains : 59/123 places, 142/217 transitions.
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:01:49] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2829154530167525660.gal : 0 ms
[2026-05-25 09:01:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality8035131744319292644.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/CTLCardinality2829154530167525660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8035131744319292644.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,674082,0.109448,8412,2,1008,5,17621,6,0,366,19638,0


Converting to forward existential form...Done !
original formula: AF(AG(((AG((((p34==0)&&(p60==1))||((p59==0)&&(p83==1)))) * (p103==0)) * (p96==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(E(TRUE U !((((p34==0)&&(p60==1))||((p59==0)&&(p83==1)))))) * (p103==0)) * (p96==1)...170
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t20, t22, t23, t25, t29, t32, ...322
(forward)formula 0,0,1.32682,44088,1,0,283,212602,312,102,3385,188047,341
FORMULA MedleyA-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 117 transition count 195
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 100 transition count 191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 44 place count 98 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 44 place count 98 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 94 transition count 185
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 66 place count 80 transition count 167
Iterating global reduction 3 with 14 rules applied. Total rules applied 80 place count 80 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 80 place count 80 transition count 165
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 78 transition count 165
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 111 place count 64 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 63 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 63 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 63 transition count 143
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 63 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 126 place count 60 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 126 place count 60 transition count 138
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 130 place count 58 transition count 138
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 134 place count 56 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 54 transition count 134
Applied a total of 136 rules in 40 ms. Remains 54 /123 variables (removed 69) and now considering 134/217 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16744274971839697187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2675599191295757701.kers'
[2026-05-25 09:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16744274971839697187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2675599191295757701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 54 cols 511 entries
Finished phase 1 with 46 SingleSign rule and 1 generalized
[2026-05-25 09:01:50] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2675599191295757701.kers
Total runtime 1 ms.
[2026-05-25 09:01:50] [INFO ] Implicit Places using invariants in 177 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/123 places, 134/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 220 ms. Remains : 53/123 places, 134/217 transitions.
[2026-05-25 09:01:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:01:50] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-25 09:01:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:01:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:01:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14729316871302981366.gal : 1 ms
[2026-05-25 09:01:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3704161350061247849.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/CTLCardinality14729316871302981366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3704161350061247849.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,454130,0.109886,8596,2,552,5,17738,6,0,335,23360,0


Converting to forward existential form...Done !
original formula: EG(((p103==0)||(p82==1)))
=> equivalent forward existential formula: [FwdG(Init,((p103==0)||(p82==1)))] != FALSE
Hit Full ! (commute/partial/dont) 127/0/7
(forward)formula 0,1,0.241527,11764,1,0,8,34291,19,4,2230,33002,8
FORMULA MedleyA-PT-07-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 : 123/123 places, 217/217 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 204
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 202
Applied a total of 26 rules in 4 ms. Remains 110 /123 variables (removed 13) and now considering 202/217 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8216560774793125187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16961238654987637840.kers'
[2026-05-25 09:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8216560774793125187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16961238654987637840.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 110 cols 812 entries
Finished phase 1 with 96 SingleSign rule and 4 generalized
[2026-05-25 09:01:51] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16961238654987637840.kers
Total runtime 2 ms.
[2026-05-25 09:01:51] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 09:01:51] [INFO ] Invariant cache hit.
[2026-05-25 09:01:51] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-25 09:01:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/312 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 128 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16614 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/312 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 201/328 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 336 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46680ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 46681ms
Starting structural reductions in LTL mode, iteration 1 : 110/123 places, 202/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46992 ms. Remains : 110/123 places, 202/217 transitions.
[2026-05-25 09:02:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:02:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:02:38] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-25 09:02:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:02:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:02:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11119860692830359762.gal : 1 ms
[2026-05-25 09:02:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality5242376905991337136.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/CTLCardinality11119860692830359762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5242376905991337136.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.11266e+07,2.87326,76096,2,5409,5,217642,6,0,642,365650,0


Converting to forward existential form...Done !
original formula: E((EX(EF((p45!=1))) + EG(!(EG(E(((p7==0)||(p130==1)) U (p98==1)))))) U (EX((p48==0)) * AG(!((((((p43==1)||(p83==1))&&((p95==0)||(p43==1))...200
=> equivalent forward existential formula: [((FwdU(Init,(EX(E(TRUE U (p45!=1))) + EG(!(EG(E(((p7==0)||(p130==1)) U (p98==1))))))) * EX((p48==0))) * !(E(TRU...264
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...529
Detected timeout of ITS tools.
[2026-05-25 09:03:08] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:03:08] [INFO ] Applying decomposition
[2026-05-25 09:03:08] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15647800091978773594.txt' '-o' '/tmp/graph15647800091978773594.bin' '-w' '/tmp/graph15647800091978773594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15647800091978773594.bin' '-l' '-1' '-v' '-w' '/tmp/graph15647800091978773594.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:03:08] [INFO ] Decomposing Gal with order
[2026-05-25 09:03:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:03:08] [INFO ] Removed a total of 316 redundant transitions.
[2026-05-25 09:03:08] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:03:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2026-05-25 09:03:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality9080552404181548025.gal : 2 ms
[2026-05-25 09:03:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality16948243767556447903.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/CTLCardinality9080552404181548025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16948243767556447903.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11266e+07,0.216919,12660,549,85,14133,422,435,40071,90,1857,0


Converting to forward existential form...Done !
original formula: E((EX(EF((i2.i2.u14.p45!=1))) + EG(!(EG(E(((i2.i0.u3.p7==0)||(i7.i1.u30.p130==1)) U (i4.u21.p98==1)))))) U (EX((i2.i1.u13.p48==0)) * AG(!...306
=> equivalent forward existential formula: [((FwdU(Init,(EX(E(TRUE U (i2.i2.u14.p45!=1))) + EG(!(EG(E(((i2.i0.u3.p7==0)||(i7.i1.u30.p130==1)) U (i4.u21.p98...370
Reverse transition relation is NOT exact ! Due to transitions t34, i0.u2.t109, i0.u5.t106, i1.t99, i1.t98, i1.t97, i1.t94, i1.t93, i1.u6.t71, i1.u6.t104, i...990
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,27.522,642136,1,0,966524,2845,3086,2.83526e+06,506,20822,702696
FORMULA MedleyA-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 117 transition count 195
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 19 rules applied. Total rules applied 38 place count 100 transition count 193
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 99 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 40 place count 99 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 97 transition count 190
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 58 place count 83 transition count 172
Iterating global reduction 3 with 14 rules applied. Total rules applied 72 place count 83 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 72 place count 83 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 81 transition count 170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 101 place count 68 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 66 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 66 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 114 place count 66 transition count 145
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 66 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 62 transition count 141
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 122 place count 62 transition count 138
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 59 transition count 138
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 132 place count 57 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 55 transition count 134
Applied a total of 134 rules in 40 ms. Remains 55 /123 variables (removed 68) and now considering 134/217 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16699230197639333468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4514362696859753792.kers'
[2026-05-25 09:03:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16699230197639333468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4514362696859753792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 55 cols 515 entries
Finished phase 1 with 47 SingleSign rule and 1 generalized
[2026-05-25 09:03:35] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4514362696859753792.kers
Total runtime 1 ms.
[2026-05-25 09:03:36] [INFO ] Implicit Places using invariants in 77 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/123 places, 134/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 122 ms. Remains : 54/123 places, 134/217 transitions.
[2026-05-25 09:03:36] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:03:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:03:36] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-25 09:03:36] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:03:36] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:03:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6141274371713995723.gal : 1 ms
[2026-05-25 09:03:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3058320250186799181.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/CTLCardinality6141274371713995723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3058320250186799181.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,571653,0.21727,11744,2,838,5,28191,6,0,339,37474,0


Converting to forward existential form...Done !
original formula: EF(AG((((p8!=0)&&(p38!=1))&&((p54!=0)&&((p12==0)||(p26==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p8!=0)&&(p38!=1))&&((p54!=0)&&((p12==0)||(p26==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t25, t26, t27, t37, t40, t117, t121, t122, t12...258
(forward)formula 0,0,0.368809,15328,1,0,203,58518,290,72,3133,43111,278
FORMULA MedleyA-PT-07-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Graph (complete) has 380 edges and 123 vertex of which 118 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 117 transition count 194
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 99 transition count 190
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 97 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 97 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 95 transition count 186
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 64 place count 81 transition count 168
Iterating global reduction 3 with 14 rules applied. Total rules applied 78 place count 81 transition count 168
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 81 transition count 166
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 79 transition count 166
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 63 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 61 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 61 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 61 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 61 transition count 138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 58 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 129 place count 58 transition count 136
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 133 place count 56 transition count 136
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 137 place count 54 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 52 transition count 132
Applied a total of 139 rules in 36 ms. Remains 52 /123 variables (removed 71) and now considering 132/217 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2981901405673486725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13488902488742367669.kers'
[2026-05-25 09:03:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2981901405673486725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13488902488742367669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 52 cols 498 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 09:03:36] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13488902488742367669.kers
Total runtime 1 ms.
[2026-05-25 09:03:36] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 09:03:36] [INFO ] Invariant cache hit.
[2026-05-25 09:03:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:03:36] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2026-05-25 09:03:36] [INFO ] Redundant transitions in 84 ms returned []
Running 124 sub problems to find dead transitions.
[2026-05-25 09:03:36] [INFO ] Invariant cache hit.
[2026-05-25 09:03:36] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 132/184 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 71 constraints, problems are : Problem set: 0 solved, 124 unsolved in 4326 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 132/184 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 124/195 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 195 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9757ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 9758ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/123 places, 132/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10085 ms. Remains : 52/123 places, 132/217 transitions.
[2026-05-25 09:03:46] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:03:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:03:46] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-25 09:03:46] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:03:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:03:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality14119431518683846345.gal : 1 ms
[2026-05-25 09:03:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14287444311565057371.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/CTLCardinality14119431518683846345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14287444311565057371.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,422978,0.10396,8016,2,382,5,15273,6,0,327,19992,0


Converting to forward existential form...Done !
original formula: AF(((p26!=0)&&(p6!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p26!=0)&&(p6!=1))))] = FALSE
Hit Full ! (commute/partial/dont) 128/0/4
(forward)formula 0,0,0.22791,11476,1,0,10,32852,20,4,2113,31853,8
FORMULA MedleyA-PT-07-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 217/217 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 106 transition count 198
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 104 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 104 transition count 194
Applied a total of 38 rules in 7 ms. Remains 104 /123 variables (removed 19) and now considering 194/217 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7829837132822510092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13772255782432786055.kers'
[2026-05-25 09:03:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7829837132822510092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13772255782432786055.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 104 cols 796 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 09:03:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13772255782432786055.kers
Total runtime 1 ms.
[2026-05-25 09:03:46] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 09:03:46] [INFO ] Invariant cache hit.
[2026-05-25 09:03:47] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-25 09:03:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13246 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 23405 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36709ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 36710ms
Starting structural reductions in LTL mode, iteration 1 : 104/123 places, 194/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36974 ms. Remains : 104/123 places, 194/217 transitions.
[2026-05-25 09:04:23] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:04:23] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:04:23] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-25 09:04:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:04:23] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:04:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2526348227154095045.gal : 1 ms
[2026-05-25 09:04:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality17822505476439434339.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/CTLCardinality2526348227154095045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17822505476439434339.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.55422e+07,1.05412,39936,2,3338,5,120055,6,0,610,169928,0


Converting to forward existential form...Done !
original formula: AG(AX(EG(AX(EF((p29==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!(EX(!(E(TRUE U (p29==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:04:53] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:04:53] [INFO ] Applying decomposition
[2026-05-25 09:04:53] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1872892037565478602.txt' '-o' '/tmp/graph1872892037565478602.bin' '-w' '/tmp/graph1872892037565478602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1872892037565478602.bin' '-l' '-1' '-v' '-w' '/tmp/graph1872892037565478602.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:04:53] [INFO ] Decomposing Gal with order
[2026-05-25 09:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:04:54] [INFO ] Removed a total of 274 redundant transitions.
[2026-05-25 09:04:54] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 3 ms.
[2026-05-25 09:04:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17547412251836638882.gal : 1 ms
[2026-05-25 09:04:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2455361831063808126.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/CTLCardinality17547412251836638882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2455361831063808126.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55422e+07,0.114214,9656,373,71,10119,646,307,24522,74,2904,0


Converting to forward existential form...Done !
original formula: AG(AX(EG(AX(EF((i2.u6.p29==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!(EX(!(E(TRUE U (i2.u6.p29==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.u2.t103, i1.u4.t100, i2.t91, i2.t87, i2.u5.t70, i2.u5.t98, i2.u5.t99, i2.u6.t95,...756
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,6.13355,228324,1,0,335752,1904,1961,1.22377e+06,366,12287,291385
FORMULA MedleyA-PT-07-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:05:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:05:00] [INFO ] Flatten gal took : 7 ms
Total runtime 561302 ms.

BK_STOP 1779699900266

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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