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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 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 28K 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-04-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779699089614

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 08:51:30] [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:51:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:51:31] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2026-05-25 08:51:31] [INFO ] Transformed 115 places.
[2026-05-25 08:51:31] [INFO ] Transformed 107 transitions.
[2026-05-25 08:51:31] [INFO ] Found NUPN structural information;
[2026-05-25 08:51:31] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 79 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 111 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 111 transition count 104
Applied a total of 7 rules in 39 ms. Remains 111 /115 variables (removed 4) and now considering 104/107 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14605768112611579187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12856579570006717680.kers'
[2026-05-25 08:51:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14605768112611579187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12856579570006717680.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 111 cols 293 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-25 08:51:31] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12856579570006717680.kers
Total runtime 1 ms.
[2026-05-25 08:51:31] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-25 08:51:31] [INFO ] Invariant cache hit.
[2026-05-25 08:51:31] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-25 08:51:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/215 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 162 constraints, problems are : Problem set: 0 solved, 103 unsolved in 9791 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/215 variables, 111/167 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 103/270 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 215/215 variables, and 277 constraints, problems are : Problem set: 0 solved, 103 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 39902ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 39926ms
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 104/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40470 ms. Remains : 111/115 places, 104/107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2026-05-25 08:52:11] [INFO ] Invariant cache hit.
[2026-05-25 08:52:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 08:52:11] [INFO ] Invariant cache hit.
[2026-05-25 08:52:11] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 111/111 places, 104/104 transitions.
Support contains 79 out of 111 places after structural reductions.
[2026-05-25 08:52:11] [INFO ] Flatten gal took : 29 ms
[2026-05-25 08:52:12] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:52:12] [INFO ] Input system was already deterministic with 104 transitions.
Reduction of identical properties reduced properties to check from 73 to 72
RANDOM walk for 40000 steps (1120 resets) in 1254 ms. (31 steps per ms) remains 29/72 properties
BEST_FIRST walk for 4001 steps (32 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (33 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (34 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (33 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (31 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (34 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (33 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (28 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (33 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (35 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (32 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (31 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (34 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (30 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
[2026-05-25 08:52:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/99 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 104/203 variables, 99/108 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 12/215 variables, 12/120 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 5/125 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 125 constraints, problems are : Problem set: 1 solved, 27 unsolved in 2144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/99 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 104/203 variables, 99/112 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 7/119 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 4/123 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/123 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 12/215 variables, 12/135 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 18/153 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/154 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 2/156 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 1/157 constraints. Problems are: Problem set: 3 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 215/215 variables, and 157 constraints, problems are : Problem set: 3 solved, 25 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 25/28 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 7206ms problems are : Problem set: 3 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 104/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 111 transition count 92
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 99 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 97 transition count 90
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 28 place count 97 transition count 82
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 44 place count 89 transition count 82
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 85 transition count 78
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 85 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 76 place count 73 transition count 66
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 73 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 72 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 72 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 72 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 71 transition count 64
Applied a total of 82 rules in 45 ms. Remains 71 /111 variables (removed 40) and now considering 64/104 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 71/111 places, 64/104 transitions.
RANDOM walk for 40000 steps (3165 resets) in 396 ms. (100 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (131 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (141 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (92 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (133 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (147 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (145 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (141 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (148 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (145 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (118 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (142 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (129 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (129 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (127 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (130 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (140 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (131 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (122 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (131 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (151 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (141 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (125 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (143 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (132 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
Probabilistic random walk after 1000001 steps, saw 201130 distinct states, run finished after 1517 ms. (steps per millisecond=659 ) properties seen :23
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10283036092993310889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9774170534882339882.kers'
[2026-05-25 08:52:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10283036092993310889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9774170534882339882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 71 cols 222 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-25 08:52:21] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9774170534882339882.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/47 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/111 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/135 variables, 24/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/111 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/135 variables, 24/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/135 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 64/64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 69 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 69 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 66 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 65 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 65 transition count 58
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 2 with 4 rules applied. Total rules applied 16 place count 63 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 62 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 61 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 60 transition count 54
Applied a total of 21 rules in 12 ms. Remains 60 /71 variables (removed 11) and now considering 54/64 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 60/71 places, 54/64 transitions.
RANDOM walk for 40000 steps (3613 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1439 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Probably explored full state space saw : 104123 states, properties seen :0
Probabilistic random walk after 427212 steps, saw 104123 distinct states, run finished after 306 ms. (steps per millisecond=1396 ) properties seen :0
Explored full state space saw : 104123 states, properties seen :0
Exhaustive walk after 427212 steps, saw 104123 distinct states, run finished after 256 ms. (steps per millisecond=1668 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-25 08:52:23] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:52:23] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:52:23] [INFO ] Input system was already deterministic with 104 transitions.
Support contains 70 out of 111 places (down from 74) after GAL structural reductions.
Computed a total of 111 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 104
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA MedleyA-PT-04-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 99 transition count 92
Applied a total of 24 rules in 6 ms. Remains 99 /111 variables (removed 12) and now considering 92/104 (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-61026922916461788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3459780001402893446.kers'
[2026-05-25 08:52:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-61026922916461788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3459780001402893446.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:52:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3459780001402893446.kers
Total runtime 0 ms.
[2026-05-25 08:52:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 08:52:23] [INFO ] Invariant cache hit.
[2026-05-25 08:52:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 08:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6301 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 91/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 219 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36335ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 36335ms
Starting structural reductions in LTL mode, iteration 1 : 99/111 places, 92/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36473 ms. Remains : 99/111 places, 92/104 transitions.
[2026-05-25 08:52:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 08:52:59] [INFO ] Flatten gal took : 7 ms
FORMULA MedleyA-PT-04-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:52:59] [INFO ] Flatten gal took : 13 ms
[2026-05-25 08:52:59] [INFO ] Input system was already deterministic with 92 transitions.
Support contains 0 out of 99 places (down from 10) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 110 transition count 83
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 90 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 40 place count 90 transition count 74
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 81 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 75 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 75 transition count 68
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 96 place count 62 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 59 transition count 53
Applied a total of 100 rules in 23 ms. Remains 59 /111 variables (removed 52) and now considering 53/104 (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-10862185519664814549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4994324564183170132.kers'
[2026-05-25 08:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10862185519664814549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4994324564183170132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 59 cols 181 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-25 08:52:59] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4994324564183170132.kers
Total runtime 2 ms.
[2026-05-25 08:52:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 08:52:59] [INFO ] Invariant cache hit.
[2026-05-25 08:52:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2026-05-25 08:52:59] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2026-05-25 08:52:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 53/112 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 71 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 53/112 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 52/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 124 constraints, problems are : Problem set: 0 solved, 52 unsolved in 4351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6676ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 6676ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/111 places, 53/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6831 ms. Remains : 59/111 places, 53/104 transitions.
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:53:06] [INFO ] Input system was already deterministic with 53 transitions.
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6722179358250185152.gal : 3 ms
[2026-05-25 08:53:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14519669696460460049.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6722179358250185152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14519669696460460049.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4729 resets) in 89 ms. (444 steps per ms) remains 1/1 properties

BEST_FIRST walk for 40001 steps (2183 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14519669696460460049.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :59 after 191
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :510 after 1389
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1389 after 28672
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,359404,0.030296,4632,2,646,14,3004,7,0,295,2003,0
Total reachable state count : 359404

Verifying 1 reachability properties.
Reachability property MedleyA-PT-04-CTLFireability-2024-01 is true.
FORMULA MedleyA-PT-04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-04-CTLFireability-2024-01,3072,0.030781,4744,2,82,14,3004,7,0,298,2003,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 111246 steps, run visited all 1 properties in 87 ms. (steps per millisecond=1278 )
Probabilistic random walk after 111246 steps, saw 27929 distinct states, run finished after 90 ms. (steps per millisecond=1236 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 110 transition count 83
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 90 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 40 place count 90 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 81 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 75 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 75 transition count 68
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 96 place count 62 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 59 transition count 53
Applied a total of 100 rules in 12 ms. Remains 59 /111 variables (removed 52) and now considering 53/104 (removed 51) transitions.
[2026-05-25 08:53:06] [INFO ] Invariant cache hit.
[2026-05-25 08:53:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 08:53:06] [INFO ] Invariant cache hit.
[2026-05-25 08:53:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-25 08:53:06] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/111 places, 53/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 59/111 places, 53/104 transitions.
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:06] [INFO ] Input system was already deterministic with 53 transitions.
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10111553718869922694.gal : 1 ms
[2026-05-25 08:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability860103346650931848.ctl : 3 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/CTLFireability10111553718869922694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability860103346650931848.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,359404,0.023046,4428,2,646,5,2788,6,0,291,2003,0


Converting to forward existential form...Done !
original formula: EG(EF((EF(((p84==0)||(p110==0))) + !(A(((p84==1)&&(p93==1)) U ((p84==1)&&(p107==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (E(TRUE U ((p84==0)||(p110==0))) + !(!((E(!(((p84==1)&&(p107==1))) U (!(((p84==1)&&(p93==1))...232
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t12, t39, t49, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,1,0.550642,32912,1,0,767,176282,139,131,1987,190007,779
FORMULA MedleyA-PT-04-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 100 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 100 transition count 93
Applied a total of 22 rules in 13 ms. Remains 100 /111 variables (removed 11) and now considering 93/104 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4660133041849507652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10286379162397339513.kers'
[2026-05-25 08:53:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4660133041849507652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10286379162397339513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 100 cols 271 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-25 08:53:07] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10286379162397339513.kers
Total runtime 0 ms.
[2026-05-25 08:53:07] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-25 08:53:07] [INFO ] Invariant cache hit.
[2026-05-25 08:53:07] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 08:53:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5455 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 222 constraints, problems are : Problem set: 0 solved, 92 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35489ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 35489ms
Starting structural reductions in LTL mode, iteration 1 : 100/111 places, 93/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35902 ms. Remains : 100/111 places, 93/104 transitions.
[2026-05-25 08:53:43] [INFO ] Flatten gal took : 12 ms
[2026-05-25 08:53:43] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:53:43] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 08:53:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:53:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:53:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12566935140586269951.gal : 3 ms
[2026-05-25 08:53:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10579651896987090096.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/CTLFireability12566935140586269951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10579651896987090096.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,4.15336e+07,0.032044,5248,2,1665,5,5466,6,0,495,4478,0


Converting to forward existential form...Done !
original formula: AF(AG(((EX((p1==0)) + (p63==1)) + (p21==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((EX((p1==0)) + (p63==1)) + (p21==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t20, t22, t23, t27, t29, t34, t36, t41, t44, t47, t49, t52, t79, Inter...247
(forward)formula 0,0,2.52253,92592,1,0,1248,495279,212,118,3192,474797,1258
FORMULA MedleyA-PT-04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 110 transition count 89
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 96 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 95 transition count 88
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 30 place count 95 transition count 79
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 48 place count 86 transition count 79
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 54 place count 80 transition count 73
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 80 transition count 73
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 76 place count 72 transition count 65
Applied a total of 76 rules in 26 ms. Remains 72 /111 variables (removed 39) and now considering 65/104 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17911092713577449884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8486202920777025697.kers'
[2026-05-25 08:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17911092713577449884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8486202920777025697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 72 cols 214 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-25 08:53:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8486202920777025697.kers
Total runtime 1 ms.
[2026-05-25 08:53:46] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 08:53:46] [INFO ] Invariant cache hit.
[2026-05-25 08:53:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2026-05-25 08:53:46] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-25 08:53:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/137 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 87 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2330 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 65/137 variables, 72/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 64/151 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 151 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6020ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6021ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/111 places, 65/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6196 ms. Remains : 72/111 places, 65/104 transitions.
[2026-05-25 08:53:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:53:52] [INFO ] Input system was already deterministic with 65 transitions.
[2026-05-25 08:53:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15230090005914828423.gal : 1 ms
[2026-05-25 08:53:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4201321935961363158.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/CTLFireability15230090005914828423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4201321935961363158.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((((!(A((p28==1) U (p85==1))) * (p48==1)) * ((p3==0) * (AF(((p23==0)||(p33==0))) + !(E(((p78==1)&&(p86==1)) U ((p78==1)&&(p86==1)))))))...216
=> equivalent forward existential formula: [FwdG(Init,!((((!(!((E(!((p85==1)) U (!((p28==1)) * !((p85==1)))) + EG(!((p85==1)))))) * (p48==1)) * ((p3==0) * ...312
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t6, t9, t14, t16, t19, t46, t52, t61, t62, Intersection with reachable at ea...219
(forward)formula 0,0,3.00184,99304,1,0,2419,587271,171,1165,2223,694929,1943
FORMULA MedleyA-PT-04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 94
Applied a total of 20 rules in 3 ms. Remains 101 /111 variables (removed 10) and now considering 94/104 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5365913444963429245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8740491600968016320.kers'
[2026-05-25 08:53:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5365913444963429245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8740491600968016320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 101 cols 273 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-25 08:53:55] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8740491600968016320.kers
Total runtime 0 ms.
[2026-05-25 08:53:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 08:53:55] [INFO ] Invariant cache hit.
[2026-05-25 08:53:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-25 08:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 124 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5682 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 15/15 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/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/195 variables, and 225 constraints, problems are : Problem set: 0 solved, 93 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35714ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 35714ms
Starting structural reductions in LTL mode, iteration 1 : 101/111 places, 94/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35900 ms. Remains : 101/111 places, 94/104 transitions.
[2026-05-25 08:54:31] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:54:31] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:54:31] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-25 08:54:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:54:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:54:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10075001845533404038.gal : 2 ms
[2026-05-25 08:54:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8214307073717967382.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/CTLFireability10075001845533404038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8214307073717967382.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15299e+07,0.034446,5296,2,1751,5,5773,6,0,500,4653,0


Converting to forward existential form...Done !
original formula: (EG(((EF((p31==0)) * (AF((p39==0)) + EF(((p84==1)&&(p101==1))))) * !(E(!(((p84==1)&&(p105==1))) U !(AF(((p84==1)&&(p96==1)))))))) + !(A(A...245
=> equivalent forward existential formula: ([FwdG(Init,((E(TRUE U (p31==0)) * (!(EG(!((p39==0)))) + E(TRUE U ((p84==1)&&(p101==1))))) * !(E(!(((p84==1)&&(p...502
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t47, t49, t50, t53, t79, Inter...247
dead was empty
dead was empty
dead was empty
(forward)formula 0,0,7.11722,255204,1,0,1972,1.59158e+06,232,484,3064,1.69491e+06,2076
FORMULA MedleyA-PT-04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 105 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 105 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 97
Applied a total of 14 rules in 4 ms. Remains 104 /111 variables (removed 7) and now considering 97/104 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-426153029615956879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3766894280580011356.kers'
[2026-05-25 08:54:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-426153029615956879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3766894280580011356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 104 cols 279 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-25 08:54:38] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3766894280580011356.kers
Total runtime 1 ms.
[2026-05-25 08:54:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 08:54:38] [INFO ] Invariant cache hit.
[2026-05-25 08:54:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 08:54:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/201 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 128 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/201 variables, 104/128 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 96/224 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/201 variables, and 231 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36614ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 36615ms
Starting structural reductions in LTL mode, iteration 1 : 104/111 places, 97/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36785 ms. Remains : 104/111 places, 97/104 transitions.
[2026-05-25 08:55:15] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:55:15] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:55:15] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-25 08:55:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:55:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability18088844343242191605.gal : 8 ms
[2026-05-25 08:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12821021468380542881.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/CTLFireability18088844343242191605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12821021468380542881.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,4.15467e+07,0.048759,5364,2,1813,5,5872,6,0,515,4739,0


Converting to forward existential form...Done !
original formula: A(!(((((E(((p84==1)&&(p107==1)) U ((p84==1)&&(p108==1))) + (p4==1)) * (AF((p82==1)) + AX((p15==1)))) + AG(!(AG((p74==1))))) + A(((EG((p2=...323
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX(EX(((p21==1)||((p84==1)&&(p92==1)))))))))))) * !(E(!(!(EG(!(EX(EX(((p21==1)||((p84==1...707
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t13, t15, t16, t21, t23, t24, t28, t30, t35, t38, t41, t43, t46, t49, t53, t56, t...257
(forward)formula 0,0,8.01417,276636,1,0,1776,1.66286e+06,248,472,3157,1.99178e+06,1819
FORMULA MedleyA-PT-04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 100 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 99 transition count 92
Applied a total of 24 rules in 20 ms. Remains 99 /111 variables (removed 12) and now considering 92/104 (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-7674866905548607635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15116799060368866851.kers'
[2026-05-25 08:55:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7674866905548607635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15116799060368866851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:55:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15116799060368866851.kers
Total runtime 1 ms.
[2026-05-25 08:55:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 08:55:23] [INFO ] Invariant cache hit.
[2026-05-25 08:55:23] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 08:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 125 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/125 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 219 constraints, problems are : Problem set: 0 solved, 91 unsolved in 27562 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34587ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 34587ms
Starting structural reductions in LTL mode, iteration 1 : 99/111 places, 92/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34803 ms. Remains : 99/111 places, 92/104 transitions.
[2026-05-25 08:55:58] [INFO ] Flatten gal took : 13 ms
[2026-05-25 08:55:58] [INFO ] Flatten gal took : 16 ms
[2026-05-25 08:55:58] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-25 08:55:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7861896602652947039.gal : 1 ms
[2026-05-25 08:55:58] [INFO ] Time to serialize properties into /tmp/CTLFireability12246773409404537179.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/CTLFireability7861896602652947039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12246773409404537179.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15299e+07,0.044834,5248,2,1679,5,5593,6,0,490,4567,0


Converting to forward existential form...Done !
original formula: EX(EX(AG(EF((((p78==1)&&(p86==1))&&(p16==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !(E(TRUE U (((p78==1)&&(p86==1))&&(p16==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t48, t51, t52, t78, Intersecti...242
(forward)formula 0,0,2.53593,106104,1,0,297,646571,205,139,2885,543231,317
FORMULA MedleyA-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 110 transition count 85
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 92 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 90 transition count 83
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 40 place count 90 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 54 place count 83 transition count 76
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 58 place count 79 transition count 72
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 79 transition count 72
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 88 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 65 transition count 58
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 63 transition count 57
Applied a total of 92 rules in 35 ms. Remains 63 /111 variables (removed 48) and now considering 57/104 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8935151255806910935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15743295900300802376.kers'
[2026-05-25 08:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8935151255806910935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15743295900300802376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 63 cols 194 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-25 08:56:00] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15743295900300802376.kers
Total runtime 0 ms.
[2026-05-25 08:56:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 08:56:00] [INFO ] Invariant cache hit.
[2026-05-25 08:56:00] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-25 08:56:00] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2026-05-25 08:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 57/120 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 77 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 57/120 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 55/132 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 135 constraints, problems are : Problem set: 0 solved, 55 unsolved in 6388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8187ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 8188ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/111 places, 57/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8355 ms. Remains : 63/111 places, 57/104 transitions.
[2026-05-25 08:56:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:56:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:56:09] [INFO ] Input system was already deterministic with 57 transitions.
[2026-05-25 08:56:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10850712500359367987.gal : 0 ms
[2026-05-25 08:56:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7803013262996648829.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/CTLFireability10850712500359367987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7803013262996648829.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,360106,0.017782,4548,2,715,5,2993,6,0,310,2081,0


Converting to forward existential form...Done !
original formula: EF((EG(((p84!=1)||(p107!=1))) * (!(A((p64==1) U (p31==1))) + ((p84==1)&&(p94==1)))))
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * EG(((p84!=1)||(p107!=1)))),!((p31==1))) * (!((p64==1)) * !((p31==1))))] != FALSE + [...314
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t12, t39, t43, t44, t51, Intersection with reachable at each step enable...205
Hit Full ! (commute/partial/dont) 55/0/2
(forward)formula 0,1,0.680321,36020,1,0,770,196926,147,127,2046,211382,771
FORMULA MedleyA-PT-04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 110 transition count 83
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 90 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 40 place count 90 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 81 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 75 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 75 transition count 68
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 96 place count 62 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 59 transition count 53
Applied a total of 100 rules in 7 ms. Remains 59 /111 variables (removed 52) and now considering 53/104 (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-9492245222413337397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3835777172233787933.kers'
[2026-05-25 08:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9492245222413337397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3835777172233787933.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 59 cols 181 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-25 08:56:09] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3835777172233787933.kers
Total runtime 0 ms.
[2026-05-25 08:56:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 08:56:09] [INFO ] Invariant cache hit.
[2026-05-25 08:56:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-25 08:56:09] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2026-05-25 08:56:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 53/112 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 71 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1606 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 53/112 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 52/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 124 constraints, problems are : Problem set: 0 solved, 52 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6017ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 6017ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/111 places, 53/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6166 ms. Remains : 59/111 places, 53/104 transitions.
[2026-05-25 08:56:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:56:16] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:56:16] [INFO ] Input system was already deterministic with 53 transitions.
[2026-05-25 08:56:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:56:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:56:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10179703719499776924.gal : 1 ms
[2026-05-25 08:56:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1851115833452937314.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10179703719499776924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1851115833452937314.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1851115833452937314.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :59 after 191
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :510 after 1389
Invariant property MedleyA-PT-04-CTLFireability-2024-09 does not hold.
FORMULA MedleyA-PT-04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,28672,0.035953,4456,2,557,14,1939,6,0,292,1089,0
Total reachable state count : 28672

Verifying 1 reachability properties.
Invariant property MedleyA-PT-04-CTLFireability-2024-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-04-CTLFireability-2024-09,2586,0.036483,4716,2,120,14,1939,7,0,298,1089,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 30878 steps (3647 resets) in 150 ms. (204 steps per ms) remains 0/1 properties
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 101 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 101 transition count 94
Applied a total of 20 rules in 3 ms. Remains 101 /111 variables (removed 10) and now considering 94/104 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8461692182738517181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5308375167982392349.kers'
[2026-05-25 08:56:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8461692182738517181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5308375167982392349.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 101 cols 273 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-25 08:56:16] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5308375167982392349.kers
Total runtime 1 ms.
[2026-05-25 08:56:16] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 08:56:16] [INFO ] Invariant cache hit.
[2026-05-25 08:56:16] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-25 08:56:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 127 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6339 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 18/18 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/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/195 variables, 101/129 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 93/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/195 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 226 constraints, problems are : Problem set: 0 solved, 93 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36360ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 36360ms
Starting structural reductions in LTL mode, iteration 1 : 101/111 places, 94/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36499 ms. Remains : 101/111 places, 94/104 transitions.
[2026-05-25 08:56:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:52] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-25 08:56:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8953696743823874358.gal : 1 ms
[2026-05-25 08:56:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16414004522990876005.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/CTLFireability8953696743823874358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16414004522990876005.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20545e+07,0.032859,5244,2,1672,5,5518,6,0,500,4490,0


Converting to forward existential form...Done !
original formula: EF(((AX(((p41==0)&&(p46==0))) * ((EF((p70==1)) + (p84==0)) + (p114==0))) * (AF((EF(((p84==1)&&(p105==1))) + ((EG((p2==1)) * (p84==1)) * (...295
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EX(!(((p41==0)&&(p46==0))))) * ((E(TRUE U (p70==1)) + (p84==0)) + (p114==0)))) * !(EG(!...557
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t15, t18, t20, t22, t28, t30, t31, t36, t38, t39, t43, t45, t50, t53, t80, t...257
(forward)formula 0,1,9.22572,326036,1,0,1724,2.00607e+06,225,401,3061,2.43976e+06,1749
FORMULA MedleyA-PT-04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 99 transition count 92
Applied a total of 24 rules in 2 ms. Remains 99 /111 variables (removed 12) and now considering 92/104 (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-1744615333701302465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13908453821296127835.kers'
[2026-05-25 08:57:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1744615333701302465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13908453821296127835.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:57:01] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13908453821296127835.kers
Total runtime 0 ms.
[2026-05-25 08:57:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 08:57:01] [INFO ] Invariant cache hit.
[2026-05-25 08:57:02] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 08:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5557 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35586ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 35587ms
Starting structural reductions in LTL mode, iteration 1 : 99/111 places, 92/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35723 ms. Remains : 99/111 places, 92/104 transitions.
[2026-05-25 08:57:37] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:57:37] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:57:37] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-25 08:57:37] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:57:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:57:37] [INFO ] Time to serialize gal into /tmp/CTLFireability18302622294430549080.gal : 2 ms
[2026-05-25 08:57:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6221616850957058656.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/CTLFireability18302622294430549080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6221616850957058656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15336e+07,0.047052,5252,2,1675,5,5542,6,0,490,4516,0


Converting to forward existential form...Done !
original formula: EX(((AX((p17==1)) + EG(EF(((p84==1)&&(p102==1))))) + (((EF(EX(((p56==1)&&(p66==1)))) * AF(((p84==1)&&(p96==1)))) * ((p21==0)&&((p56==0)||...192
=> equivalent forward existential formula: (([(EY(Init) * !(EX(!((p17==1)))))] != FALSE + [FwdG(EY(Init),E(TRUE U ((p84==1)&&(p102==1))))] != FALSE) + [(((...307
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t43, t46, t48, t51, t78, Intersecti...242
dead was empty
(forward)formula 0,0,6.84133,252720,1,0,1687,1.57214e+06,217,345,3034,1.64378e+06,1754
FORMULA MedleyA-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 110 transition count 84
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 91 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 38 place count 91 transition count 76
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 83 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 78 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 78 transition count 71
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 64 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 63 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 61 transition count 55
Applied a total of 96 rules in 23 ms. Remains 61 /111 variables (removed 50) and now considering 55/104 (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-14585892846259245294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2879042767717683943.kers'
[2026-05-25 08:57:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14585892846259245294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2879042767717683943.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 61 cols 185 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-25 08:57:44] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2879042767717683943.kers
Total runtime 2 ms.
[2026-05-25 08:57:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 08:57:44] [INFO ] Invariant cache hit.
[2026-05-25 08:57:44] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-25 08:57:44] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2026-05-25 08:57:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/116 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 73 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/116 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 54/127 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 127 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4613ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 4614ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/111 places, 55/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4801 ms. Remains : 61/111 places, 55/104 transitions.
[2026-05-25 08:57:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:57:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:49] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 08:57:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6624253815519388272.gal : 0 ms
[2026-05-25 08:57:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15826498856789053395.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/CTLFireability6624253815519388272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15826498856789053395.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,595366,0.020293,4532,2,650,5,2813,6,0,301,2020,0


Converting to forward existential form...Done !
original formula: AG(E(((p84==1)&&(p97==1)) U AF(AG((p13==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p84==1)&&(p97==1)) U !(EG(!(!(E(TRUE U !((p13==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t13, t40, t51, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,0,0.400948,22408,1,0,701,105148,138,66,1926,92423,704
FORMULA MedleyA-PT-04-CTLFireability-2024-12 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 : 111/111 places, 104/104 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 102 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 95
Applied a total of 18 rules in 5 ms. Remains 102 /111 variables (removed 9) and now considering 95/104 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15513346679927703806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17973922347177870353.kers'
[2026-05-25 08:57:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15513346679927703806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17973922347177870353.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 102 cols 275 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-25 08:57:49] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17973922347177870353.kers
Total runtime 0 ms.
[2026-05-25 08:57:49] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-25 08:57:49] [INFO ] Invariant cache hit.
[2026-05-25 08:57:50] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-25 08:57:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/197 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 124 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4992 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/197 variables, 102/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/197 variables, and 226 constraints, problems are : Problem set: 0 solved, 94 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35023ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 35023ms
Starting structural reductions in LTL mode, iteration 1 : 102/111 places, 95/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35300 ms. Remains : 102/111 places, 95/104 transitions.
[2026-05-25 08:58:25] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:58:25] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:58:25] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-25 08:58:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:58:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:58:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10680148977279481229.gal : 1 ms
[2026-05-25 08:58:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11367529151956876196.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/CTLFireability10680148977279481229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11367529151956876196.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,4.15336e+07,0.046328,5264,2,1679,5,5535,6,0,505,4524,0


Converting to forward existential form...Done !
original formula: AG((E((p21==1) U (E(AF((p2==1)) U (((p40==1)&&(p47==1))||(p14==1))) + (!((((p56==1)&&(p66==1))&&(p35==1))) * AX((p53==1))))) * EX((p57==0...159
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((p21==1) U (E(!(EG(!((p2==1)))) U (((p40==1)&&(p47==1))||(p14==1))) + (!((((p56==1)&&(p...258
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t20, t22, t23, t27, t29, t35, t37, t38, t42, t45, t48, t49, t50, t80, t...257
(forward)formula 0,0,0.664785,26516,1,0,211,130916,206,94,2882,99476,197
FORMULA MedleyA-PT-04-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 104/104 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 110 transition count 83
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 89 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 42 place count 89 transition count 74
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 58 place count 81 transition count 74
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 75 transition count 68
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 75 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 75 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 74 transition count 67
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 58 transition count 52
Applied a total of 102 rules in 22 ms. Remains 58 /111 variables (removed 53) and now considering 52/104 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7668131527212880521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12478805685113242518.kers'
[2026-05-25 08:58:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7668131527212880521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12478805685113242518.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 52 rows 58 cols 179 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-25 08:58:25] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12478805685113242518.kers
Total runtime 1 ms.
[2026-05-25 08:58:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 08:58:25] [INFO ] Invariant cache hit.
[2026-05-25 08:58:26] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2026-05-25 08:58:26] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2026-05-25 08:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 70 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 51/120 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 121 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2422 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5080ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 5080ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/111 places, 52/104 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5356 ms. Remains : 58/111 places, 52/104 transitions.
[2026-05-25 08:58:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:58:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:58:31] [INFO ] Input system was already deterministic with 52 transitions.
RANDOM walk for 1163 steps (177 resets) in 7 ms. (145 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-04-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 08:58:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:58:31] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:58:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12073556883276700167.gal : 1 ms
[2026-05-25 08:58:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5656717631894079157.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12073556883276700167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5656717631894079157.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 08:58:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:58:31] [INFO ] Flatten gal took : 6 ms
Total runtime 420459 ms.

BK_STOP 1779699511342

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-04"
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-04, 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-177969019900122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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