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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:25 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 48K 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-02-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779698976751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 08:49:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:49:39] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2026-05-25 08:49:39] [INFO ] Transformed 69 places.
[2026-05-25 08:49:39] [INFO ] Transformed 168 transitions.
[2026-05-25 08:49:39] [INFO ] Found NUPN structural information;
[2026-05-25 08:49:39] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 56 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 158
Applied a total of 8 rules in 16 ms. Remains 65 /69 variables (removed 4) and now considering 158/162 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2897106384126425840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5135538109876953216.kers'
[2026-05-25 08:49:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2897106384126425840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5135538109876953216.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 65 cols 588 entries
Finished phase 1 with 55 SingleSign rule and 1 generalized
[2026-05-25 08:49:39] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5135538109876953216.kers
Total runtime 1 ms.
[2026-05-25 08:49:39] [INFO ] Implicit Places using invariants in 470 ms returned []
[2026-05-25 08:49:39] [INFO ] Invariant cache hit.
[2026-05-25 08:49:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:49:40] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2026-05-25 08:49:40] [INFO ] Invariant cache hit.
[2026-05-25 08:49:40] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 158/223 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 60/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 152 constraints, problems are : Problem set: 0 solved, 157 unsolved in 19692 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 158/223 variables, 65/92 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 60/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 157/309 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/223 variables, and 316 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49907ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 49930ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 158/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50793 ms. Remains : 65/69 places, 158/162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2026-05-25 08:50:30] [INFO ] Invariant cache hit.
[2026-05-25 08:50:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 08:50:30] [INFO ] Invariant cache hit.
[2026-05-25 08:50:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:50:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 65/65 places, 158/158 transitions.
Support contains 56 out of 65 places after structural reductions.
[2026-05-25 08:50:30] [INFO ] Flatten gal took : 38 ms
[2026-05-25 08:50:30] [INFO ] Flatten gal took : 14 ms
[2026-05-25 08:50:30] [INFO ] Input system was already deterministic with 158 transitions.
Reduction of identical properties reduced properties to check from 74 to 71
RANDOM walk for 40000 steps (3980 resets) in 1412 ms. (28 steps per ms) remains 31/71 properties
BEST_FIRST walk for 4004 steps (89 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (83 resets) in 22 ms. (174 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (116 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (95 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (99 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (93 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (92 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (90 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (94 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (87 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (90 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (94 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (93 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (88 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (72 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (87 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (93 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (94 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (120 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (94 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (89 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (95 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (87 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (70 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (86 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (90 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (87 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (20 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (91 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (120 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
[2026-05-25 08:50:31] [INFO ] Invariant cache hit.
[2026-05-25 08:50:31] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/60 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/62 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 2/64 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 157/221 variables, 64/79 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 60/139 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 2/223 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 1/141 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/223 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 141 constraints, problems are : Problem set: 1 solved, 29 unsolved in 2745 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/54 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 7/61 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 2/63 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 9/25 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 7/32 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/63 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 157/220 variables, 63/97 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 60/157 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 13/170 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 1/171 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 18 (OVERLAPS) 3/223 variables, 2/173 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/223 variables, 15/188 constraints. Problems are: Problem set: 2 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/223 variables, and 190 constraints, problems are : Problem set: 2 solved, 28 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 28/30 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7764ms problems are : Problem set: 2 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 158/158 transitions.
Graph (complete) has 280 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 56 transition count 144
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 56 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 55 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 55 transition count 139
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 55 transition count 139
Applied a total of 27 rules in 60 ms. Remains 55 /65 variables (removed 10) and now considering 139/158 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 55/65 places, 139/158 transitions.
RANDOM walk for 40000 steps (4162 resets) in 1182 ms. (33 steps per ms) remains 18/28 properties
BEST_FIRST walk for 4003 steps (90 resets) in 17 ms. (222 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (93 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (93 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (98 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (100 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (91 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (97 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (105 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (95 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (94 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (93 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (98 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (92 resets) in 17 ms. (222 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (103 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (74 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (96 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (94 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5977879985992262409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8846656093114953763.kers'
[2026-05-25 08:50:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5977879985992262409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8846656093114953763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 55 cols 542 entries
Finished phase 1 with 45 SingleSign rule and 1 generalized
[2026-05-25 08:50:39] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8846656093114953763.kers
Total runtime 1 ms.
[2026-05-25 08:50:39] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 30/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 6/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 139/193 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/194 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/194 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 130 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 30/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 6/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 139/193 variables, 54/74 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 60/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/193 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 1/194 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 11/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/194 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/194 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/194 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (OVERLAPS) 0/194 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 155 constraints, problems are : Problem set: 0 solved, 15 unsolved in 9747 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12825ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 12 properties in 1947 ms.
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 139/139 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 55 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 50 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 50 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 48 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 47 transition count 133
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 47 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 46 transition count 136
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 46 transition count 136
Applied a total of 24 rules in 22 ms. Remains 46 /55 variables (removed 9) and now considering 136/139 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 46/55 places, 136/139 transitions.
RANDOM walk for 40000 steps (4345 resets) in 123 ms. (322 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (1276 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1235 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2123956408200821612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3810731988741520606.kers'
[2026-05-25 08:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2123956408200821612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3810731988741520606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 46 cols 566 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 08:50:54] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3810731988741520606.kers
Total runtime 1 ms.
[2026-05-25 08:50:54] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/43 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 136/181 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 62/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/182 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/43 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 136/181 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 62/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/182 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 136/136 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 134
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 45 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 44 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 43 transition count 132
Applied a total of 6 rules in 16 ms. Remains 43 /46 variables (removed 3) and now considering 132/136 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 43/46 places, 132/136 transitions.
RANDOM walk for 40000 steps (4920 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1302 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1299 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 23857 steps, run visited all 2 properties in 282 ms. (steps per millisecond=84 )
Probabilistic random walk after 23857 steps, saw 6556 distinct states, run finished after 294 ms. (steps per millisecond=81 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-02-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:50:55] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:50:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:50:55] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:50:55] [INFO ] Input system was already deterministic with 158 transitions.
Support contains 53 out of 65 places (down from 55) after GAL structural reductions.
Computed a total of 16 stabilizing places and 65 stable transitions
Graph (complete) has 345 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 56 transition count 144
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 56 transition count 144
Applied a total of 18 rules in 2 ms. Remains 56 /65 variables (removed 9) and now considering 144/158 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14749659801774789426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4763792205175541965.kers'
[2026-05-25 08:50:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14749659801774789426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4763792205175541965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 56 cols 552 entries
Finished phase 1 with 46 SingleSign rule and 1 generalized
[2026-05-25 08:50:56] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4763792205175541965.kers
Total runtime 1 ms.
[2026-05-25 08:50:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 08:50:56] [INFO ] Invariant cache hit.
[2026-05-25 08:50:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:50:56] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-25 08:50:56] [INFO ] Invariant cache hit.
[2026-05-25 08:50:56] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 144/200 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 137 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9187 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 144/200 variables, 56/77 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 60/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 143/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 285 constraints, problems are : Problem set: 0 solved, 143 unsolved in 17829 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27068ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 27069ms
Starting structural reductions in LTL mode, iteration 1 : 56/65 places, 144/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27171 ms. Remains : 56/65 places, 144/158 transitions.
[2026-05-25 08:51:23] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:51:23] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:51:23] [INFO ] Input system was already deterministic with 144 transitions.
[2026-05-25 08:51:23] [INFO ] Flatten gal took : 12 ms
[2026-05-25 08:51:23] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:51:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12944795141735756846.gal : 4 ms
[2026-05-25 08:51:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2501072829838208448.ctl : 4 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/CTLFireability12944795141735756846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2501072829838208448.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,461512,0.495112,20604,2,3791,5,51665,6,0,365,81601,0


Converting to forward existential form...Done !
original formula: (AF((((p7==1)&&(p8==1))&&(p25==1))) + ((EG((((((p5==0)||(p57==0))||(p61==0))&&(((p7==0)||(p27==0))||((p57==0)||(p65==0))))&&((((p35==0)||...393
=> equivalent forward existential formula: (([((Init * !(!(EG(!((((p7==1)&&(p8==1))&&(p25==1))))))) * !(EG((((((p5==0)||(p57==0))||(p61==0))&&(((p7==0)||(p...800
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t...495
(forward)formula 0,0,22.4647,507216,1,0,605,2.54208e+06,317,272,3436,3.04704e+06,631
FORMULA MedleyA-PT-02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 53 transition count 138
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 50 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 50 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 48 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 48 transition count 114
Applied a total of 34 rules in 3 ms. Remains 48 /65 variables (removed 17) and now considering 114/158 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6702944519625319024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4900166077753494964.kers'
[2026-05-25 08:51:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6702944519625319024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4900166077753494964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 48 cols 452 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 08:51:46] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4900166077753494964.kers
Total runtime 1 ms.
[2026-05-25 08:51:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 08:51:46] [INFO ] Invariant cache hit.
[2026-05-25 08:51:46] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:51:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-25 08:51:46] [INFO ] Invariant cache hit.
[2026-05-25 08:51:46] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/162 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4703 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 113/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 227 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6516 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11256ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 11257ms
Starting structural reductions in LTL mode, iteration 1 : 48/65 places, 114/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11425 ms. Remains : 48/65 places, 114/158 transitions.
[2026-05-25 08:51:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:51:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:51:57] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-25 08:51:57] [INFO ] Flatten gal took : 13 ms
[2026-05-25 08:51:57] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:51:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15677399852467454118.gal : 2 ms
[2026-05-25 08:51:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15140343981084477364.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15677399852467454118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15140343981084477364.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,269479,0.188128,12180,2,1550,5,29776,6,0,303,40136,0


Converting to forward existential form...Done !
original formula: AX(E((AX(!(((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1)))||(((p30==1)&&(p43==1))&&(p56==1))))) * (p14!=1)) U ((p9==1) * AG((((p35==1)&&(p41...175
=> equivalent forward existential formula: [(EY(Init) * !(E((!(EX(!(!(((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1)))||(((p30==1)&&(p43==1))&&(p56==1))))))) *...240
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...415
(forward)formula 0,0,0.483102,21284,1,0,230,88785,256,75,2881,83066,245
FORMULA MedleyA-PT-02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Graph (complete) has 345 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 53 transition count 140
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 53 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 52 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 52 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 50 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 50 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 34 place count 50 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 49 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 48 transition count 125
Applied a total of 38 rules in 34 ms. Remains 48 /65 variables (removed 17) and now considering 125/158 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7613728074732659584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7529233525900733276.kers'
[2026-05-25 08:51:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7613728074732659584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7529233525900733276.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 48 cols 490 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 08:51:58] [INFO ] Computed 9 invariants in 11 ms
Computed 9 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-7529233525900733276.kers
Total runtime 11 ms.
[2026-05-25 08:51:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 08:51:58] [INFO ] Invariant cache hit.
[2026-05-25 08:51:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 08:51:58] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-25 08:51:58] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2026-05-25 08:51:58] [INFO ] Invariant cache hit.
[2026-05-25 08:51:58] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 125/173 variables, 48/69 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 57/126 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 127 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 13/13 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/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 125/173 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 124/251 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 252 constraints, problems are : Problem set: 0 solved, 124 unsolved in 10189 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16533ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 16535ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/65 places, 125/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16730 ms. Remains : 48/65 places, 125/158 transitions.
[2026-05-25 08:52:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 08:52:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:52:14] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-25 08:52:14] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:52:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:52:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12435049236944677011.gal : 2 ms
[2026-05-25 08:52:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16629611236029592211.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/CTLFireability12435049236944677011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16629611236029592211.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,139873,0.226623,12180,2,1601,5,27936,6,0,315,40567,0


Converting to forward existential form...Done !
original formula: AG(EF((((EF(!(A((p24==1) U (p37==1)))) * (p35==1)) * ((p41==1)&&(p53==1))) * ((AG((((p7==1)&&(p27==1))&&((p35==1)&&(p42==1)))) + E((p16==...245
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((E(TRUE U !(!((E(!((p37==1)) U (!((p24==1)) * !((p37==1)))) + EG(!((p37==1)))))...368
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...474
(forward)formula 0,0,9.2335,220484,1,0,533,1.21588e+06,292,207,2993,1.07744e+06,625
FORMULA MedleyA-PT-02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 57 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 57 transition count 146
Applied a total of 16 rules in 2 ms. Remains 57 /65 variables (removed 8) and now considering 146/158 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-274536350954270668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12840223642524377242.kers'
[2026-05-25 08:52:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-274536350954270668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12840223642524377242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 57 cols 556 entries
Finished phase 1 with 47 SingleSign rule and 1 generalized
[2026-05-25 08:52:24] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12840223642524377242.kers
Total runtime 3 ms.
[2026-05-25 08:52:24] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 08:52:24] [INFO ] Invariant cache hit.
[2026-05-25 08:52:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 08:52:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-25 08:52:24] [INFO ] Invariant cache hit.
[2026-05-25 08:52:24] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/203 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/203 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 143 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12957 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/203 variables, 57/84 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 145/289 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/203 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 290 constraints, problems are : Problem set: 0 solved, 145 unsolved in 17838 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30845ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 30847ms
Starting structural reductions in LTL mode, iteration 1 : 57/65 places, 146/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31052 ms. Remains : 57/65 places, 146/158 transitions.
[2026-05-25 08:52:55] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:52:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:52:55] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-25 08:52:55] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:52:55] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:52:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8646579358442446391.gal : 1 ms
[2026-05-25 08:52:55] [INFO ] Time to serialize properties into /tmp/CTLFireability7779693081159459534.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/CTLFireability8646579358442446391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7779693081159459534.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,436561,0.48326,19548,2,2730,5,52425,6,0,371,70828,0


Converting to forward existential form...Done !
original formula: A(((AF(((!(((p35==1)&&(p36==1))&&(p51==1)))&&(p24==1))) * (p33==1)) * ((p57==1)&&(p67==1))) U (E((((p30==1)&&(p43==1))&&(p56==1)) U !(EF(...564
=> equivalent forward existential formula: [((Init * !(EG(!((E((((p30==1)&&(p43==1))&&(p56==1)) U !(E(TRUE U ((((p35==1)&&(p36==1))&&(p53==1))||(p23==1))))...3703
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...516
Detected timeout of ITS tools.
[2026-05-25 08:53:25] [INFO ] Flatten gal took : 27 ms
[2026-05-25 08:53:25] [INFO ] Applying decomposition
[2026-05-25 08:53:25] [INFO ] Flatten gal took : 15 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/graph9178204450691159094.txt' '-o' '/tmp/graph9178204450691159094.bin' '-w' '/tmp/graph9178204450691159094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9178204450691159094.bin' '-l' '-1' '-v' '-w' '/tmp/graph9178204450691159094.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:53:25] [INFO ] Decomposing Gal with order
[2026-05-25 08:53:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:53:25] [INFO ] Removed a total of 235 redundant transitions.
[2026-05-25 08:53:25] [INFO ] Flatten gal took : 71 ms
[2026-05-25 08:53:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2026-05-25 08:53:25] [INFO ] Time to serialize gal into /tmp/CTLFireability14071202252627739635.gal : 2 ms
[2026-05-25 08:53:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12992105984619172556.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/CTLFireability14071202252627739635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12992105984619172556.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,436561,0.238033,13340,414,303,13594,1624,229,48456,143,11787,0


Converting to forward existential form...Done !
original formula: A(((AF(((!(((i2.u7.p35==1)&&(i2.u5.p36==1))&&(i2.u7.p51==1)))&&(i1.u4.p24==1))) * (i0.u1.p33==1)) * ((i3.u8.p57==1)&&(i3.u12.p67==1))) U ...819
=> equivalent forward existential formula: [((Init * !(EG(!((E((((i2.u7.p30==1)&&(i2.u5.p43==1))&&(i2.u7.p56==1)) U !(E(TRUE U ((((i2.u7.p35==1)&&(i2.u5.p3...5252
Reverse transition relation is NOT exact ! Due to transitions t49, t82, i0.t42, i0.u1.t43, i0.u1.t44, i0.u1.t45, i0.u1.t144, i0.u2.t23, i0.u2.t46, i0.u2.t4...651
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
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 3
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
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,11.3606,246880,1,0,271202,52645,1500,1.30406e+06,805,512705,267663
FORMULA MedleyA-PT-02-CTLFireability-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 LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 54 transition count 140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 54 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 52 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 52 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 50 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 50 transition count 122
Applied a total of 30 rules in 5 ms. Remains 50 /65 variables (removed 15) and now considering 122/158 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14543398507211223681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14575920806809333416.kers'
[2026-05-25 08:53:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14543398507211223681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14575920806809333416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 50 cols 480 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 08:53:37] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14575920806809333416.kers
Total runtime 2 ms.
[2026-05-25 08:53:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 08:53:37] [INFO ] Invariant cache hit.
[2026-05-25 08:53:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-25 08:53:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-25 08:53:37] [INFO ] Invariant cache hit.
[2026-05-25 08:53:37] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/172 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 120 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/172 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 121/241 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 247 constraints, problems are : Problem set: 0 solved, 121 unsolved in 22434 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28473ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 28474ms
Starting structural reductions in LTL mode, iteration 1 : 50/65 places, 122/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28685 ms. Remains : 50/65 places, 122/158 transitions.
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 19 ms
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:54:05] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:54:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13028073434939761522.gal : 1 ms
[2026-05-25 08:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14067133243292728316.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/CTLFireability13028073434939761522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14067133243292728316.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,348916,0.441615,18404,2,2837,5,44388,6,0,319,74316,0


Converting to forward existential form...Done !
original formula: EG((AF(EX(((p10==0)||(p23==0)))) * ((!(A(EG((((p7==1)&&(p27==1))&&((p35==1)&&(p42==1)))) U ((p51==1)&&(p22==1)))) + EG((((p31==1)&&(p43==...318
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EX(((p10==0)||(p23==0)))))) * ((!(!((E(!(((p51==1)&&(p22==1))) U (!(EG((((p7==1)&&(p27==1))&&...448
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...439
Using saturation style SCC detection
(forward)formula 0,1,19.6101,418496,1,0,800,2.08099e+06,298,368,3130,2.54146e+06,892
FORMULA MedleyA-PT-02-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 53 transition count 139
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 53 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 52 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 52 transition count 133
Applied a total of 26 rules in 2 ms. Remains 52 /65 variables (removed 13) and now considering 133/158 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8084610449904261537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17068221338614168466.kers'
[2026-05-25 08:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8084610449904261537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17068221338614168466.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 52 cols 516 entries
Finished phase 1 with 42 SingleSign rule and 1 generalized
[2026-05-25 08:54:25] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17068221338614168466.kers
Total runtime 1 ms.
[2026-05-25 08:54:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 08:54:25] [INFO ] Invariant cache hit.
[2026-05-25 08:54:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-25 08:54:25] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-25 08:54:25] [INFO ] Invariant cache hit.
[2026-05-25 08:54:25] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/185 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 132 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10927 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 133/185 variables, 52/76 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 58/134 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 132/266 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 266 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10577 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21563ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 21577ms
Starting structural reductions in LTL mode, iteration 1 : 52/65 places, 133/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21778 ms. Remains : 52/65 places, 133/158 transitions.
[2026-05-25 08:54:47] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:54:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:54:47] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-25 08:54:47] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:54:47] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:54:47] [INFO ] Time to serialize gal into /tmp/CTLFireability269849117019295808.gal : 3 ms
[2026-05-25 08:54:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6527748849728139330.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/CTLFireability269849117019295808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6527748849728139330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,324712,0.243905,13956,2,1963,5,34724,6,0,338,46231,0


Converting to forward existential form...Done !
original formula: AF((!(A(EX(((((p5==1)&&(p35==1))&&(p42==1))||(((p7==1)&&(p14==1))&&(p33==1)))) U (EF((((p35==1)&&(p41==1))&&(p48==1))) * (AG((((p7==1)&&(...319
=> equivalent forward existential formula: [FwdG(Init,!((!(!((E(!((E(TRUE U (((p35==1)&&(p41==1))&&(p48==1))) * (!(E(TRUE U !((((p7==1)&&(p8==1))&&(p20==1)...667
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t19, t20, t21, t22, t23, t...484
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,14.8109,396292,1,0,729,2.09547e+06,315,381,3292,2.32396e+06,774
FORMULA MedleyA-PT-02-CTLFireability-2024-06 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 : 65/65 places, 158/158 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 52 transition count 137
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 52 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 48 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 48 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 46 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 46 transition count 107
Applied a total of 38 rules in 6 ms. Remains 46 /65 variables (removed 19) and now considering 107/158 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15056968966218536014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13086799687923509193.kers'
[2026-05-25 08:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15056968966218536014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13086799687923509193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 46 cols 424 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 08:55:02] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13086799687923509193.kers
Total runtime 1 ms.
[2026-05-25 08:55:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 08:55:02] [INFO ] Invariant cache hit.
[2026-05-25 08:55:02] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-25 08:55:02] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-25 08:55:02] [INFO ] Invariant cache hit.
[2026-05-25 08:55:02] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/153 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (OVERLAPS) 0/153 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 110 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8587 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/153 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 106/216 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 216 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6755 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15372ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15372ms
Starting structural reductions in LTL mode, iteration 1 : 46/65 places, 107/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15531 ms. Remains : 46/65 places, 107/158 transitions.
[2026-05-25 08:55:17] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:55:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:17] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-25 08:55:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:55:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2201933242345198381.gal : 1 ms
[2026-05-25 08:55:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2738028689102616307.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/CTLFireability2201933242345198381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2738028689102616307.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,226168,0.166704,10492,2,1138,5,22916,6,0,288,33059,0


Converting to forward existential form...Done !
original formula: AX(AX(EF((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (((p35==1)&&(p55==1))&&((p57==1)&&(p67==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...374
(forward)formula 0,0,0.521055,21948,1,0,231,85942,235,80,2708,76808,264
FORMULA MedleyA-PT-02-CTLFireability-2024-07 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 : 65/65 places, 158/158 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 54 transition count 139
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 54 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 52 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 52 transition count 128
Applied a total of 26 rules in 5 ms. Remains 52 /65 variables (removed 13) and now considering 128/158 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6510335805783941934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9892824037411083570.kers'
[2026-05-25 08:55:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6510335805783941934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9892824037411083570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 52 cols 498 entries
Finished phase 1 with 42 SingleSign rule and 1 generalized
[2026-05-25 08:55:18] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9892824037411083570.kers
Total runtime 2 ms.
[2026-05-25 08:55:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 08:55:18] [INFO ] Invariant cache hit.
[2026-05-25 08:55:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 08:55:18] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-25 08:55:18] [INFO ] Invariant cache hit.
[2026-05-25 08:55:18] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/180 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 56/124 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 124 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/180 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 56/124 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 127/251 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 13 (OVERLAPS) 0/180 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 257 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20354 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25468ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 25471ms
Starting structural reductions in LTL mode, iteration 1 : 52/65 places, 128/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25623 ms. Remains : 52/65 places, 128/158 transitions.
[2026-05-25 08:55:44] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:44] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:44] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-25 08:55:44] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:55:44] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:55:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13101825219178603485.gal : 2 ms
[2026-05-25 08:55:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13682136376349045278.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/CTLFireability13101825219178603485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13682136376349045278.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,422923,0.526131,20020,2,3195,5,52982,6,0,333,76595,0


Converting to forward existential form...Done !
original formula: !(A(A(AX((((p49!=1)||(((p32==1)&&(p43==1))&&(p56==1)))||(p46==1))) U (((p7==1)&&(p14==1))&&((p35==1)&&(p55==1)))) U AF(E(A((((p7==1)&&(p1...345
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(E(!((E(!((((p33==1)&&(p57==1))&&(p67==1))) U (!((((p7==1)&&(p13==1))&&(p25==1))) * !(...1260
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t...504
(forward)formula 0,1,28.5037,581172,1,0,1054,3.23245e+06,310,468,3254,3.15183e+06,1214
FORMULA MedleyA-PT-02-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Graph (complete) has 345 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 52 transition count 137
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 52 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 50 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 50 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 49 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 49 transition count 122
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 46 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 41 place count 46 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 41 place count 46 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 45 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 44 transition count 113
Applied a total of 45 rules in 23 ms. Remains 44 /65 variables (removed 21) and now considering 113/158 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4783047844895309815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4937807704481409246.kers'
[2026-05-25 08:56:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4783047844895309815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4937807704481409246.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 44 cols 454 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 08:56:12] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4937807704481409246.kers
Total runtime 2 ms.
[2026-05-25 08:56:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 08:56:12] [INFO ] Invariant cache hit.
[2026-05-25 08:56:12] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 08:56:13] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-25 08:56:13] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-25 08:56:13] [INFO ] Invariant cache hit.
[2026-05-25 08:56:13] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/157 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 111 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4753 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/157 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 53/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 112/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 224 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16041ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 16042ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/65 places, 113/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16263 ms. Remains : 44/65 places, 113/158 transitions.
[2026-05-25 08:56:29] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:56:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:56:29] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 08:56:29] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:56:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4624297878703883538.gal : 2 ms
[2026-05-25 08:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16577104016495490447.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/CTLFireability4624297878703883538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16577104016495490447.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,111009,0.232365,11024,2,1560,5,28680,6,0,287,27685,0


Converting to forward existential form...Done !
original formula: !(A(!(A((!(E((p46==1) U (((p7==1)&&(p11==1))&&((p35==1)&&(p55==1))))) + (p49==1)) U (A((((p35==1)&&(p36==1))&&(p48==1)) U (((p34==1)&&(p4...228
=> equivalent forward existential formula: ([(((FwdU(Init,!((((p35==1)&&(p36==1))&&(p53==1)))) * !((((p35==1)&&(p36==1))&&(p53==1)))) * !(EG(!((!((E(!((((p...894
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t17, t18, t19, t20, t21, t22...416
Hit Full ! (commute/partial/dont) 62/0/51
(forward)formula 0,1,5.83633,183528,1,0,379,1.00319e+06,272,158,2850,798711,425
FORMULA MedleyA-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Graph (complete) has 345 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 51 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 37 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 43 place count 43 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 43 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 49 place count 43 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 53 place count 41 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 57 place count 39 transition count 94
Applied a total of 57 rules in 28 ms. Remains 39 /65 variables (removed 26) and now considering 94/158 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13320437731717097971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3984632966643350447.kers'
[2026-05-25 08:56:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13320437731717097971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3984632966643350447.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 39 cols 387 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 08:56:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3984632966643350447.kers
Total runtime 0 ms.
[2026-05-25 08:56:35] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 08:56:35] [INFO ] Invariant cache hit.
[2026-05-25 08:56:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-25 08:56:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 08:56:35] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-25 08:56:35] [INFO ] Invariant cache hit.
[2026-05-25 08:56:35] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 94/133 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 48/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 97 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 94/133 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 48/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 93/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 190 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5226 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7576ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 7576ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/65 places, 94/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7775 ms. Remains : 39/65 places, 94/158 transitions.
[2026-05-25 08:56:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:56:42] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:56:42] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-25 08:56:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1220977782157554352.gal : 1 ms
[2026-05-25 08:56:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10622774916511253.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/CTLFireability1220977782157554352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10622774916511253.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 -...281
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,62971,0.085543,7492,2,721,5,15492,6,0,248,15389,0


Converting to forward existential form...Done !
original formula: EG((((p35==0)||(p55==0))||((p57==0)||(p67==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p35==0)||(p55==0))||((p57==0)||(p67==0))))] != FALSE
Hit Full ! (commute/partial/dont) 36/0/58
(forward)formula 0,1,0.173051,9880,1,0,13,27895,19,4,1672,17626,9
FORMULA MedleyA-PT-02-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Graph (complete) has 345 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 54 transition count 141
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 54 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 51 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 51 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 50 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 50 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 48 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 48 transition count 113
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 38 place count 48 transition count 111
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 46 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 44 transition count 109
Applied a total of 46 rules in 11 ms. Remains 44 /65 variables (removed 21) and now considering 109/158 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2707691470611930631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1437261606423929870.kers'
[2026-05-25 08:56:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2707691470611930631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1437261606423929870.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 44 cols 434 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 08:56:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1437261606423929870.kers
Total runtime 0 ms.
[2026-05-25 08:56:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 08:56:43] [INFO ] Invariant cache hit.
[2026-05-25 08:56:43] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:56:43] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-25 08:56:43] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-25 08:56:43] [INFO ] Invariant cache hit.
[2026-05-25 08:56:43] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/153 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 52/110 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 110 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/153 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 108/219 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 219 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6952 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10650ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10650ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/65 places, 109/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10865 ms. Remains : 44/65 places, 109/158 transitions.
[2026-05-25 08:56:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:53] [INFO ] Input system was already deterministic with 109 transitions.
[2026-05-25 08:56:53] [INFO ] Flatten gal took : 18 ms
[2026-05-25 08:56:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2217117089814053350.gal : 1 ms
[2026-05-25 08:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4882090064635859654.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/CTLFireability2217117089814053350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4882090064635859654.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,90181,0.28734,11844,2,1782,5,29349,6,0,283,33741,0


Converting to forward existential form...Done !
original formula: EG(A((p13!=1) U EF(!(((p19!=1)&&((((p30==1)&&(p43==1))&&(p56==1))||(p16==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U !(((p19!=1)&&((((p30==1)&&(p43==1))&&(p56==1))||(p16==1)))))) U (!((p13!=1)) * !(E(TR...315
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...408
(forward)formula 0,1,0.884521,31292,1,0,231,119698,251,72,2683,126055,252
FORMULA MedleyA-PT-02-CTLFireability-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 : 65/65 places, 158/158 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 52 transition count 137
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 47 transition count 113
Applied a total of 36 rules in 8 ms. Remains 47 /65 variables (removed 18) and now considering 113/158 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5599325888527713612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1817776101774013391.kers'
[2026-05-25 08:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5599325888527713612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1817776101774013391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 47 cols 448 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 08:56:54] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1817776101774013391.kers
Total runtime 2 ms.
[2026-05-25 08:56:54] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 08:56:54] [INFO ] Invariant cache hit.
[2026-05-25 08:56:54] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-25 08:56:55] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2026-05-25 08:56:55] [INFO ] Invariant cache hit.
[2026-05-25 08:56:55] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 112 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7528 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 224 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13710ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 13711ms
Starting structural reductions in LTL mode, iteration 1 : 47/65 places, 113/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13920 ms. Remains : 47/65 places, 113/158 transitions.
[2026-05-25 08:57:08] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:57:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:08] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 08:57:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9161784279643823845.gal : 1 ms
[2026-05-25 08:57:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13870051421142936077.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/CTLFireability9161784279643823845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13870051421142936077.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,241300,0.202017,11348,2,1336,5,25937,6,0,298,37414,0


Converting to forward existential form...Done !
original formula: AX(AF((p23==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((p23==1)))] = FALSE
Hit Full ! (commute/partial/dont) 103/0/10
(forward)formula 0,0,0.502796,17540,1,0,11,60043,20,4,2038,55977,10
FORMULA MedleyA-PT-02-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Graph (complete) has 345 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 51 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 51 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 49 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 49 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 48 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 48 transition count 121
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 45 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 43 place count 45 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 43 place count 45 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 43 transition count 112
Applied a total of 47 rules in 33 ms. Remains 43 /65 variables (removed 22) and now considering 112/158 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2040086293379762237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11559877481421426557.kers'
[2026-05-25 08:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2040086293379762237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11559877481421426557.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 43 cols 450 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 08:57:09] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11559877481421426557.kers
Total runtime 0 ms.
[2026-05-25 08:57:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 08:57:09] [INFO ] Invariant cache hit.
[2026-05-25 08:57:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 08:57:09] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2026-05-25 08:57:09] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-25 08:57:09] [INFO ] Invariant cache hit.
[2026-05-25 08:57:09] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/155 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 109 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3255 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/155 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 111/220 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (OVERLAPS) 0/155 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 224 constraints, problems are : Problem set: 0 solved, 111 unsolved in 18813 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22132ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 22133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/65 places, 112/158 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22472 ms. Remains : 43/65 places, 112/158 transitions.
[2026-05-25 08:57:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:57:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:57:31] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-25 08:57:31] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:31] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8523480774126095156.gal : 1 ms
[2026-05-25 08:57:31] [INFO ] Time to serialize properties into /tmp/CTLFireability616532056793757433.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/CTLFireability8523480774126095156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability616532056793757433.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,97017,0.151095,9252,2,1145,5,21737,6,0,282,21818,0


Converting to forward existential form...Done !
original formula: E((EG(!(AG((((p7==1)&&(p8==1))&&(p18==1))))) + (((p35==1)&&(p36==1))&&(p48==1))) U (p14==1))
=> equivalent forward existential formula: [(FwdU(Init,(EG(!(!(E(TRUE U !((((p7==1)&&(p8==1))&&(p18==1))))))) + (((p35==1)&&(p36==1))&&(p48==1)))) * (p14==...168
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t15, t16, t17, t18, t19, t20, t21, t22...408
(forward)formula 0,1,3.37632,110800,1,0,307,581021,252,118,2742,535010,351
FORMULA MedleyA-PT-02-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 158/158 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 52 transition count 137
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 49 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 49 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 48 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 48 transition count 116
Applied a total of 34 rules in 5 ms. Remains 48 /65 variables (removed 17) and now considering 116/158 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14122910863223819226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7590405758079125001.kers'
[2026-05-25 08:57:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14122910863223819226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7590405758079125001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 48 cols 456 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 08:57:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7590405758079125001.kers
Total runtime 1 ms.
[2026-05-25 08:57:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 08:57:35] [INFO ] Invariant cache hit.
[2026-05-25 08:57:35] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 08:57:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-25 08:57:35] [INFO ] Invariant cache hit.
[2026-05-25 08:57:35] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/164 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 53/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 116 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3733 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/164 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 53/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 115/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 231 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6405 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10171ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 10171ms
Starting structural reductions in LTL mode, iteration 1 : 48/65 places, 116/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10325 ms. Remains : 48/65 places, 116/158 transitions.
[2026-05-25 08:57:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:57:45] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:57:45] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-25 08:57:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:57:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12261784302735028784.gal : 1 ms
[2026-05-25 08:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3659815932088554247.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/CTLFireability12261784302735028784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3659815932088554247.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,254152,0.205207,11432,2,1314,5,27240,6,0,305,36931,0


Converting to forward existential form...Done !
original formula: A(!((EX(!(AX((((p5==1)&&(p57==1))&&(p61==1))))) * AF((((p35==1)&&(p36==1))&&(p53==1))))) U ((p35==1)&&(p49==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p35==1)&&(p49==1)))))) * !(E(!(((p35==1)&&(p49==1))) U (!(!((EX(!(!(EX(!((((p5==1)&&(p57==1))...259
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t19, t20, t21, t22, t23, t...417
(forward)formula 0,0,8.73301,262432,1,0,792,1.5154e+06,263,359,2882,1.50393e+06,923
FORMULA MedleyA-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 08:57:54] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:57:54] [INFO ] Flatten gal took : 3 ms
Total runtime 495476 ms.

BK_STOP 1779699474533

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-02"
export BK_EXAMINATION="CTLFireability"
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-02, examination is CTLFireability"
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-177969019900106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-02.tgz
mv MedleyA-PT-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;