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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 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 89K 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-16-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779700567061

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:16:08] [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 09:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:16:08] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-25 09:16:08] [INFO ] Transformed 196 places.
[2026-05-25 09:16:08] [INFO ] Transformed 392 transitions.
[2026-05-25 09:16:08] [INFO ] Found NUPN structural information;
[2026-05-25 09:16:08] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 96 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 367
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 180 transition count 357
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 178 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 178 transition count 355
Applied a total of 46 rules in 32 ms. Remains 178 /196 variables (removed 18) and now considering 355/390 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8571410568101113135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7859447279485306539.kers'
[2026-05-25 09:16:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8571410568101113135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7859447279485306539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 355 rows 178 cols 1092 entries
Finished phase 1 with 170 SingleSign rule and 1 generalized
[2026-05-25 09:16:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7859447279485306539.kers
Total runtime 2 ms.
[2026-05-25 09:16:09] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-25 09:16:09] [INFO ] Invariant cache hit.
[2026-05-25 09:16:09] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2026-05-25 09:16:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (OVERLAPS) 355/533 variables, 178/208 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/533 variables, and 210 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/533 variables, 178/211 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 354/565 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/533 variables, and 567 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 178/196 places, 355/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60842 ms. Remains : 178/196 places, 355/390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2026-05-25 09:17:09] [INFO ] Invariant cache hit.
[2026-05-25 09:17:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:17:09] [INFO ] Invariant cache hit.
[2026-05-25 09:17:09] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 178/178 places, 355/355 transitions.
Support contains 96 out of 178 places after structural reductions.
[2026-05-25 09:17:10] [INFO ] Flatten gal took : 44 ms
[2026-05-25 09:17:10] [INFO ] Flatten gal took : 40 ms
[2026-05-25 09:17:10] [INFO ] Input system was already deterministic with 355 transitions.
Reduction of identical properties reduced properties to check from 89 to 88
RANDOM walk for 40000 steps (8 resets) in 2691 ms. (14 steps per ms) remains 76/88 properties
BEST_FIRST walk for 4002 steps (8 resets) in 101 ms. (39 steps per ms) remains 75/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 73/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 71/72 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 68/71 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 82 ms. (48 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
[2026-05-25 09:17:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 103/178 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 62 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/14 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/17 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/18 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 355/533 variables, 178/196 constraints. Problems are: Problem set: 4 solved, 61 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/533 variables, and 196 constraints, problems are : Problem set: 4 solved, 61 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 106/178 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 11/18 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 355/533 variables, 178/197 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 61/258 constraints. Problems are: Problem set: 4 solved, 61 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/533 variables, and 260 constraints, problems are : Problem set: 4 solved, 61 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 61/65 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10060ms problems are : Problem set: 4 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 61 edges and 178 vertex of which 4 / 178 are part of one of the 1 SCC in 12 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 175 transition count 341
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 14 rules applied. Total rules applied 25 place count 165 transition count 337
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 161 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 160 transition count 335
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 32 place count 160 transition count 327
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 48 place count 152 transition count 327
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 57 place count 143 transition count 314
Iterating global reduction 4 with 9 rules applied. Total rules applied 66 place count 143 transition count 314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 143 transition count 312
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 141 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 140 transition count 308
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 140 transition count 308
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 92 place count 130 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 128 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 101 place count 128 transition count 293
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 126 transition count 291
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 126 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 125 transition count 297
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 115 place count 125 transition count 289
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 123 place count 117 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 117 transition count 288
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 127 place count 117 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 117 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 116 transition count 286
Applied a total of 129 rules in 123 ms. Remains 116 /178 variables (removed 62) and now considering 286/355 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 116/178 places, 286/355 transitions.
RANDOM walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
Probabilistic random walk after 1000001 steps, saw 207374 distinct states, run finished after 2949 ms. (steps per millisecond=339 ) properties seen :57
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4184283202256184503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-636344838100013216.kers'
[2026-05-25 09:17:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4184283202256184503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-636344838100013216.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 286 rows 114 cols 926 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-25 09:17:25] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-636344838100013216.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 283/395 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/402 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 124 constraints, problems are : Problem set: 0 solved, 3 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 283/395 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/402 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/402 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 127 constraints, problems are : Problem set: 0 solved, 3 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1211 ms.
Support contains 11 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 286/286 transitions.
Graph (trivial) has 91 edges and 116 vertex of which 2 / 116 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 115 transition count 277
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 108 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 105 transition count 273
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 105 transition count 268
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 34 place count 98 transition count 268
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 92 edges and 98 vertex of which 23 / 98 are part of one of the 8 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 83 transition count 267
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 95 place count 83 transition count 208
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 104 place count 74 transition count 186
Iterating global reduction 5 with 9 rules applied. Total rules applied 113 place count 74 transition count 186
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 5 with 1 rules applied. Total rules applied 114 place count 74 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 115 place count 73 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 115 place count 73 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 117 place count 72 transition count 184
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 127 place count 67 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 141 place count 60 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 143 place count 60 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 8 with 65 rules applied. Total rules applied 208 place count 60 transition count 148
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 8 with 2 rules applied. Total rules applied 210 place count 60 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 212 place count 58 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 212 place count 58 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 216 place count 56 transition count 144
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 218 place count 54 transition count 142
Iterating global reduction 10 with 2 rules applied. Total rules applied 220 place count 54 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 224 place count 52 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 226 place count 51 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 232 place count 51 transition count 141
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 243 place count 51 transition count 130
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 255 place count 40 transition count 129
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 256 place count 39 transition count 127
Iterating global reduction 11 with 1 rules applied. Total rules applied 257 place count 39 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 262 place count 39 transition count 122
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 263 place count 38 transition count 117
Iterating global reduction 11 with 1 rules applied. Total rules applied 264 place count 38 transition count 117
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 266 place count 38 transition count 117
Applied a total of 266 rules in 55 ms. Remains 38 /116 variables (removed 78) and now considering 117/286 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 38/116 places, 117/286 transitions.
RANDOM walk for 40000 steps (1561 resets) in 292 ms. (136 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (72 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2026-05-25 09:17:28] [INFO ] Flow matrix only has 113 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3483188966517744197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9969574172528373111.kers'
[2026-05-25 09:17:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3483188966517744197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9969574172528373111.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 38 cols 458 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:17:28] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9969574172528373111.kers
Total runtime 0 ms.
[2026-05-25 09:17:28] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/151 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 47 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 4/4 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/151 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 48 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 117/117 transitions.
Graph (trivial) has 20 edges and 38 vertex of which 4 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 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 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 35 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 35 transition count 111
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 5 place count 34 transition count 111
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 11 place count 31 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 31 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 31 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 31 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 30 transition count 109
Applied a total of 19 rules in 11 ms. Remains 30 /38 variables (removed 8) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 30/38 places, 109/117 transitions.
RANDOM walk for 40000 steps (1728 resets) in 686 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (22 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1797 steps, run visited all 1 properties in 6 ms. (steps per millisecond=299 )
Probabilistic random walk after 1797 steps, saw 723 distinct states, run finished after 14 ms. (steps per millisecond=128 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-25 09:17:28] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:17:28] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:17:28] [INFO ] Input system was already deterministic with 355 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 324
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 159 transition count 319
Applied a total of 43 rules in 6 ms. Remains 159 /178 variables (removed 19) and now considering 319/355 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14001133859073546322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11120837377902701083.kers'
[2026-05-25 09:17:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14001133859073546322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11120837377902701083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 159 cols 1010 entries
Finished phase 1 with 151 SingleSign rule and 1 generalized
[2026-05-25 09:17:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11120837377902701083.kers
Total runtime 2 ms.
[2026-05-25 09:17:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 09:17:28] [INFO ] Invariant cache hit.
[2026-05-25 09:17:28] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2026-05-25 09:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 319/478 variables, 159/190 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 196 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 319/478 variables, 159/198 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 318/516 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 521 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 159/178 places, 319/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60315 ms. Remains : 159/178 places, 319/355 transitions.
[2026-05-25 09:18:28] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:18:28] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:18:28] [INFO ] Input system was already deterministic with 319 transitions.
[2026-05-25 09:18:29] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:18:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:18:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3850530135977695826.gal : 7 ms
[2026-05-25 09:18:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11726987472296719883.ctl : 10 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/CTLFireability3850530135977695826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11726987472296719883.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,6.29838e+06,1.19039,35708,2,8684,5,104460,6,0,957,148115,0


Converting to forward existential form...Done !
original formula: (EG(EF((p32==1))) * (A(!(AX((p9==1))) U ((EG(EF((p140==1))) * (A(((p73==1)&&(p138==1)) U (p148==1)) + (E(((p73==1)&&(p138==1)) U (p152==1...317
=> equivalent forward existential formula: ([(((Init * EG(E(TRUE U (p32==1)))) * !(EG(!(((EG(E(TRUE U (p140==1))) * (!((E(!((p148==1)) U (!(((p73==1)&&(p13...1044
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t14, t18, t24, t27, t28, t29, t30, t31, t33, t34, t37, t38, t43, t47, t50, t51, t54,...679
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,16.2482,478508,1,0,797,2.94202e+06,703,377,7497,2.2143e+06,871
FORMULA MedleyA-PT-16-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 193 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 167 transition count 315
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 138 transition count 311
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 136 transition count 311
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 65 place count 136 transition count 304
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 79 place count 129 transition count 304
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 104 place count 104 transition count 261
Iterating global reduction 3 with 25 rules applied. Total rules applied 129 place count 104 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 7 rules applied. Total rules applied 136 place count 104 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 102 transition count 254
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 138 place count 102 transition count 250
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 146 place count 98 transition count 250
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 149 place count 95 transition count 242
Iterating global reduction 5 with 3 rules applied. Total rules applied 152 place count 95 transition count 242
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 172 place count 85 transition count 232
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 174 place count 83 transition count 228
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 83 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 188 place count 83 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 188 place count 83 transition count 214
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 192 place count 81 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 198 place count 78 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 77 transition count 210
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 75 vertex of which 26 / 75 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 202 place count 59 transition count 210
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 244 place count 59 transition count 168
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 246 place count 57 transition count 151
Iterating global reduction 7 with 2 rules applied. Total rules applied 248 place count 57 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 7 with 42 rules applied. Total rules applied 290 place count 57 transition count 109
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 295 place count 57 transition count 104
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 301 place count 52 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 302 place count 51 transition count 103
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 304 place count 49 transition count 98
Iterating global reduction 10 with 2 rules applied. Total rules applied 306 place count 49 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 310 place count 47 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 313 place count 47 transition count 93
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 10 with 2 rules applied. Total rules applied 315 place count 47 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 317 place count 45 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 317 place count 45 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 319 place count 44 transition count 90
Applied a total of 319 rules in 77 ms. Remains 44 /178 variables (removed 134) and now considering 90/355 (removed 265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6896250062655722862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17708618782090097149.kers'
[2026-05-25 09:18:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6896250062655722862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17708618782090097149.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 44 cols 314 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 09:18:45] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17708618782090097149.kers
Total runtime 0 ms.
[2026-05-25 09:18:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 09:18:45] [INFO ] Invariant cache hit.
[2026-05-25 09:18:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:18:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-25 09:18:45] [INFO ] Redundant transitions in 17 ms returned [89]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 86 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18263893666780729340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10412649623754781890.kers'
[2026-05-25 09:18:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18263893666780729340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10412649623754781890.kers]
Normalized transition count is 88 out of 89 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 44 cols 310 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-25 09:18:45] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10412649623754781890.kers
Total runtime 1 ms.
[2026-05-25 09:18:45] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 88/132 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 75 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 88/132 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 86/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 161 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3997 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8170ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 8170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/178 places, 89/355 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 87
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 87/89 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6777757940446997697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5883181893234673506.kers'
[2026-05-25 09:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6777757940446997697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5883181893234673506.kers]
Normalized transition count is 86 out of 87 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 42 cols 306 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:18:53] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-5883181893234673506.kers
Total runtime 13 ms.
[2026-05-25 09:18:53] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 09:18:53] [INFO ] Invariant cache hit.
[2026-05-25 09:18:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:18:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/178 places, 87/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8583 ms. Remains : 42/178 places, 87/355 transitions.
[2026-05-25 09:18:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:18:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:18:54] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-25 09:18:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:18:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3605999504600585376.gal : 2 ms
[2026-05-25 09:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3725004741553124785.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/CTLFireability3605999504600585376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3725004741553124785.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,3479,0.046203,6176,2,857,5,7326,5,0,256,6863,0


Converting to forward existential form...Done !
original formula: EF(!(E(!((AF((p26==1)) * (p75==1))) U (p20==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((!(EG(!((p26==1)))) * (p75==1))) U (p20==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, t9, t11, t14, t15, t17, t20, t22, t24, t27, t46, t64, t67, t72, t73, t81, t82, I...251
(forward)formula 0,1,0.53426,27564,1,0,280,125848,201,172,2090,107487,291
FORMULA MedleyA-PT-16-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 321
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 158 transition count 316
Applied a total of 45 rules in 13 ms. Remains 158 /178 variables (removed 20) and now considering 316/355 (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-6184492035504680462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9274496526846930736.kers'
[2026-05-25 09:18:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6184492035504680462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9274496526846930736.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 158 cols 1004 entries
Finished phase 1 with 150 SingleSign rule and 1 generalized
[2026-05-25 09:18:54] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9274496526846930736.kers
Total runtime 5 ms.
[2026-05-25 09:18:54] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 09:18:54] [INFO ] Invariant cache hit.
[2026-05-25 09:18:54] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-25 09:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/474 variables, and 42 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 316/474 variables, 158/201 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 315/516 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 519 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 158/178 places, 316/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60457 ms. Remains : 158/178 places, 316/355 transitions.
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:19:55] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:19:55] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:19:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6578539493943621740.gal : 15 ms
[2026-05-25 09:19:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1729900593641827317.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/CTLFireability6578539493943621740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1729900593641827317.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,6.52744e+06,0.892645,36268,2,9195,5,102098,6,0,950,148310,0


Converting to forward existential form...Done !
original formula: (AF(AG((p44==0))) * EX(((((EG(AF(((p103==1)&&(p160==1)))) + !(E(((p95==1)&&(p156==1)) U (p127==1)))) + ((p99==1)||(p107==1))) + ((((p17==...262
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((p44==0))))))] = FALSE * [(Init * !(EX(((((EG(!(EG(!(((p103==1)&&(p160==1)))))) + !(E...426
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t13, t14, t16, t20, t27, t28, t29, t30, t31, t33, t37, t38, t43, t47, t50, t54, t57, ...612
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-25 09:20:25] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:20:25] [INFO ] Applying decomposition
[2026-05-25 09:20:25] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1641238119852669473.txt' '-o' '/tmp/graph1641238119852669473.bin' '-w' '/tmp/graph1641238119852669473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1641238119852669473.bin' '-l' '-1' '-v' '-w' '/tmp/graph1641238119852669473.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:20:25] [INFO ] Decomposing Gal with order
[2026-05-25 09:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:20:25] [INFO ] Removed a total of 393 redundant transitions.
[2026-05-25 09:20:25] [INFO ] Flatten gal took : 68 ms
[2026-05-25 09:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 9 ms.
[2026-05-25 09:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9638810605495046647.gal : 4 ms
[2026-05-25 09:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9766598482155232908.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/CTLFireability9638810605495046647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9766598482155232908.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52744e+06,0.141048,10224,683,21,11925,339,607,19770,45,1072,0


Converting to forward existential form...Done !
original formula: (AF(AG((i0.i2.u14.p44==0))) * EX(((((EG(AF(((i2.i0.u36.p103==1)&&(i8.u58.p160==1)))) + !(E(((i4.u33.p95==1)&&(i7.i1.u56.p156==1)) U (i9.u...414
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((i0.i2.u14.p44==0))))))] = FALSE * [(Init * !(EX(((((EG(!(EG(!(((i2.i0.u36.p103==1)&&...616
Reverse transition relation is NOT exact ! Due to transitions t2, t20, t28, t37, t43, t61, t62, t87, t94, t100, t118, t119, t165, t167, t173, t175, t299, t...893
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,3.78369,142380,1,0,290825,339,4071,473244,209,1072,488449
FORMULA MedleyA-PT-16-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 200 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 167 transition count 313
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 136 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 134 transition count 309
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 69 place count 134 transition count 302
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 83 place count 127 transition count 302
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 108 place count 102 transition count 259
Iterating global reduction 3 with 25 rules applied. Total rules applied 133 place count 102 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 7 rules applied. Total rules applied 140 place count 102 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 100 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 142 place count 100 transition count 248
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 150 place count 96 transition count 248
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 154 place count 92 transition count 237
Iterating global reduction 5 with 4 rules applied. Total rules applied 158 place count 92 transition count 237
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 180 place count 81 transition count 226
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 79 transition count 222
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 79 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 195 place count 79 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 195 place count 79 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 199 place count 77 transition count 209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 207 place count 73 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 72 transition count 204
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 70 vertex of which 25 / 70 are part of one of the 10 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 211 place count 55 transition count 204
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 243 place count 55 transition count 172
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 244 place count 54 transition count 161
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 54 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 7 with 55 rules applied. Total rules applied 300 place count 54 transition count 106
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 6 rules applied. Total rules applied 306 place count 54 transition count 100
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 312 place count 48 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 312 place count 48 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 314 place count 47 transition count 99
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 315 place count 46 transition count 95
Iterating global reduction 9 with 1 rules applied. Total rules applied 316 place count 46 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 320 place count 44 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 322 place count 44 transition count 91
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 323 place count 44 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 324 place count 43 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 324 place count 43 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 326 place count 42 transition count 89
Applied a total of 326 rules in 69 ms. Remains 42 /178 variables (removed 136) and now considering 89/355 (removed 266) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7731521947129478807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14997888081130681604.kers'
[2026-05-25 09:20:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7731521947129478807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14997888081130681604.kers]
Normalized transition count is 88 out of 89 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 42 cols 294 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:20:29] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14997888081130681604.kers
Total runtime 1 ms.
[2026-05-25 09:20:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 09:20:29] [INFO ] Invariant cache hit.
[2026-05-25 09:20:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:20:29] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-25 09:20:29] [INFO ] Redundant transitions in 21 ms returned [85, 87, 88]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 82 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2620058356470353577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10677431785535563441.kers'
[2026-05-25 09:20:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2620058356470353577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10677431785535563441.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 42 cols 282 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:20:29] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10677431785535563441.kers
Total runtime 0 ms.
[2026-05-25 09:20:29] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 85/127 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/128 variables, and 71 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 85/127 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 82/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/128 variables, and 153 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2495 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4983ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4983ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/178 places, 86/355 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 42 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 40 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 39 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 39 transition count 81
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 1 rules applied. Total rules applied 9 place count 39 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 38 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 12 place count 37 transition count 79
Applied a total of 12 rules in 15 ms. Remains 37 /42 variables (removed 5) and now considering 79/86 (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-11855021363383133541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4553762148112749820.kers'
[2026-05-25 09:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11855021363383133541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4553762148112749820.kers]
Normalized transition count is 78 out of 79 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 37 cols 268 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 09:20:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4553762148112749820.kers
Total runtime 1 ms.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:20:34] [INFO ] Invariant cache hit.
[2026-05-25 09:20:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 37/178 places, 79/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5401 ms. Remains : 37/178 places, 79/355 transitions.
[2026-05-25 09:20:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:20:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:20:34] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-25 09:20:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:20:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10091558516873736840.gal : 1 ms
[2026-05-25 09:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14147887509073043703.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/CTLFireability10091558516873736840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14147887509073043703.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,2270,0.039407,5832,2,780,5,6218,5,0,228,5564,0


Converting to forward existential form...Done !
original formula: AG(AF((p93==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p93==1)))] = FALSE
Hit Full ! (commute/partial/dont) 76/0/3
(forward)formula 0,0,0.101538,8980,1,0,7,20068,19,1,1366,9512,8
FORMULA MedleyA-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 154 transition count 315
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 154 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 154 transition count 310
Applied a total of 53 rules in 4 ms. Remains 154 /178 variables (removed 24) and now considering 310/355 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14372915739575521517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10376539300201753386.kers'
[2026-05-25 09:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14372915739575521517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10376539300201753386.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 154 cols 992 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:20:34] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10376539300201753386.kers
Total runtime 1 ms.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:20:34] [INFO ] Invariant cache hit.
[2026-05-25 09:20:35] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-25 09:20:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 185 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/493 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 309 unsolved
SMT process timed out in 60082ms, After SMT, problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 154/178 places, 310/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60409 ms. Remains : 154/178 places, 310/355 transitions.
[2026-05-25 09:21:35] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:21:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:21:35] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-25 09:21:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:21:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:21:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12317181318043847100.gal : 2 ms
[2026-05-25 09:21:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5373174319540043876.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/CTLFireability12317181318043847100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5373174319540043876.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,5.62177e+06,1.16565,35372,2,8858,5,104904,6,0,928,132668,0


Converting to forward existential form...Done !
original formula: EF(((A((p6==1) U ((A(((p84==1)&&(p149==1)) U (((p18==1)&&(p113==1))&&(p190==1))) * EX((p20==1))) * !(A((p51==1) U (p55==1))))) * (p58==1)...170
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p159==1)) * (p58==1)) * !(EG(!(((!((E(!((((p18==1)&&(p113==1))&&(p190==1))) U (!(((p84==...896
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...553
(forward)formula 0,0,8.97303,222444,1,0,668,1.23473e+06,665,327,7177,958427,761
FORMULA MedleyA-PT-16-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 186 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 167 transition count 316
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 139 transition count 312
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 137 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 135 transition count 310
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 67 place count 135 transition count 305
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 77 place count 130 transition count 305
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 101 place count 106 transition count 264
Iterating global reduction 4 with 24 rules applied. Total rules applied 125 place count 106 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 7 rules applied. Total rules applied 132 place count 106 transition count 257
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 104 transition count 257
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 134 place count 104 transition count 253
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 142 place count 100 transition count 253
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 145 place count 97 transition count 245
Iterating global reduction 6 with 3 rules applied. Total rules applied 148 place count 97 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 168 place count 87 transition count 235
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 169 place count 86 transition count 233
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 86 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 183 place count 86 transition count 220
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 183 place count 86 transition count 217
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 189 place count 83 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 193 place count 81 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 80 transition count 214
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 81 edges and 78 vertex of which 22 / 78 are part of one of the 8 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 197 place count 64 transition count 214
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 237 place count 64 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 238 place count 63 transition count 165
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 63 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 282 place count 63 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 4 rules applied. Total rules applied 286 place count 63 transition count 118
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 291 place count 59 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 292 place count 58 transition count 117
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 11 with 4 rules applied. Total rules applied 296 place count 56 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 298 place count 56 transition count 113
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 11 with 2 rules applied. Total rules applied 300 place count 56 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 302 place count 54 transition count 111
Applied a total of 302 rules in 32 ms. Remains 54 /178 variables (removed 124) and now considering 111/355 (removed 244) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-277005254679163412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9798953737814525044.kers'
[2026-05-25 09:21:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-277005254679163412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9798953737814525044.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 54 cols 356 entries
Finished phase 1 with 48 SingleSign rule and 1 generalized
[2026-05-25 09:21:44] [INFO ] Computed 5 invariants in 7 ms
Computed 5 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9798953737814525044.kers
Total runtime 10 ms.
[2026-05-25 09:21:44] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 09:21:44] [INFO ] Invariant cache hit.
[2026-05-25 09:21:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:21:44] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-25 09:21:44] [INFO ] Redundant transitions in 18 ms returned [42, 43, 44, 104, 105, 108, 110]
Found 7 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
Running 100 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7470059410538879672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4642648282144466690.kers'
[2026-05-25 09:21:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7470059410538879672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4642648282144466690.kers]
Normalized transition count is 103 out of 104 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 54 cols 328 entries
Finished phase 1 with 48 SingleSign rule and 1 generalized
[2026-05-25 09:21:44] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4642648282144466690.kers
Total runtime 1 ms.
[2026-05-25 09:21:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 103/157 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 80 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3159 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 103/157 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 181 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3426 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6610ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6610ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/178 places, 104/355 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 54 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 52 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 51 transition count 101
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 51 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 50 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 50 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 50 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 49 transition count 98
Applied a total of 13 rules in 9 ms. Remains 49 /54 variables (removed 5) and now considering 98/104 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6882601755268112797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-952864673275610085.kers'
[2026-05-25 09:21:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6882601755268112797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-952864673275610085.kers]
Normalized transition count is 97 out of 98 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 49 cols 316 entries
Finished phase 1 with 43 SingleSign rule and 1 generalized
[2026-05-25 09:21:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-952864673275610085.kers
Total runtime 0 ms.
[2026-05-25 09:21:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 09:21:51] [INFO ] Invariant cache hit.
[2026-05-25 09:21:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:21:51] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/178 places, 98/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7042 ms. Remains : 49/178 places, 98/355 transitions.
[2026-05-25 09:21:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:21:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:21:51] [INFO ] Input system was already deterministic with 98 transitions.
[2026-05-25 09:21:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:21:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:21:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10131311585143434796.gal : 0 ms
[2026-05-25 09:21:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16268648276438979998.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/CTLFireability10131311585143434796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16268648276438979998.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,8578,0.071169,7240,2,1144,5,10467,5,0,295,10940,0


Converting to forward existential form...Done !
original formula: E(((p73==1)&&(p131==1)) U (A(!((EG((p70==1)) * (p19==1))) U (((p21==1)&&(p35==1))&&(p192==1))) + (p140==1)))
=> equivalent forward existential formula: ([((FwdU(Init,((p73==1)&&(p131==1))) * !(EG(!((((p21==1)&&(p35==1))&&(p192==1)))))) * !(E(!((((p21==1)&&(p35==1)...318
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t11, t13, t15, t20, t22, t25, t27, t28, t29, t32, t33, t34, t35, t36, t71, t72, t...282
Hit Full ! (commute/partial/dont) 92/5/6
(forward)formula 0,0,1.19537,46388,1,0,335,238017,232,188,2350,202493,387
FORMULA MedleyA-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 195 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 167 transition count 315
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 138 transition count 311
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 136 transition count 311
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 65 place count 136 transition count 304
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 79 place count 129 transition count 304
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 105 place count 103 transition count 259
Iterating global reduction 3 with 26 rules applied. Total rules applied 131 place count 103 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 7 rules applied. Total rules applied 138 place count 103 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 101 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 140 place count 101 transition count 248
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 97 transition count 248
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 152 place count 93 transition count 237
Iterating global reduction 5 with 4 rules applied. Total rules applied 156 place count 93 transition count 237
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 178 place count 82 transition count 226
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 180 place count 80 transition count 222
Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 80 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 194 place count 80 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 194 place count 80 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 196 place count 79 transition count 209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 204 place count 75 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 74 transition count 204
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 84 edges and 72 vertex of which 23 / 72 are part of one of the 8 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 208 place count 57 transition count 204
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 249 place count 57 transition count 163
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 251 place count 55 transition count 146
Iterating global reduction 7 with 2 rules applied. Total rules applied 253 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 291 place count 55 transition count 108
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 294 place count 55 transition count 105
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 297 place count 52 transition count 105
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 299 place count 50 transition count 100
Iterating global reduction 9 with 2 rules applied. Total rules applied 301 place count 50 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 305 place count 48 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 307 place count 48 transition count 96
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 9 with 2 rules applied. Total rules applied 309 place count 48 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 311 place count 46 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 312 place count 46 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 314 place count 45 transition count 92
Applied a total of 314 rules in 49 ms. Remains 45 /178 variables (removed 133) and now considering 92/355 (removed 263) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10802580816206656847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4143222089981280874.kers'
[2026-05-25 09:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10802580816206656847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4143222089981280874.kers]
Normalized transition count is 91 out of 92 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 45 cols 298 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 09:21:52] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4143222089981280874.kers
Total runtime 2 ms.
[2026-05-25 09:21:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 09:21:52] [INFO ] Invariant cache hit.
[2026-05-25 09:21:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:21:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-25 09:21:52] [INFO ] Redundant transitions in 12 ms returned [34, 87]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 86 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10482154242210835452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5110634597412190335.kers'
[2026-05-25 09:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10482154242210835452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5110634597412190335.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 45 cols 290 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-05-25 09:21:52] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5110634597412190335.kers
Total runtime 2 ms.
[2026-05-25 09:21:52] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 73 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 89/134 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 86/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 159 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4931ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 4932ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/178 places, 90/355 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 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 43 transition count 88
Applied a total of 4 rules in 3 ms. Remains 43 /45 variables (removed 2) and now considering 88/90 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14177373719200761570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3536626165697605202.kers'
[2026-05-25 09:21:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14177373719200761570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3536626165697605202.kers]
Normalized transition count is 87 out of 88 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 43 cols 286 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 09:21:57] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3536626165697605202.kers
Total runtime 1 ms.
[2026-05-25 09:21:58] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:21:58] [INFO ] Invariant cache hit.
[2026-05-25 09:21:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:21:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 43/178 places, 88/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5368 ms. Remains : 43/178 places, 88/355 transitions.
[2026-05-25 09:21:58] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:21:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:21:58] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-25 09:21:58] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:21:58] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:21:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5866918773808066623.gal : 1 ms
[2026-05-25 09:21:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5292744154169034014.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/CTLFireability5866918773808066623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5292744154169034014.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,5324,0.04118,5800,2,785,5,6588,5,0,261,5858,0


Converting to forward existential form...Done !
original formula: EF(((p105==0) * AG(((p73==1)&&(p138==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p105==0)) * !(E(TRUE U !(((p73==1)&&(p138==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t10, t12, t14, t16, t19, t20, t22, t24, t26, t29, t30, t31, t66, t67, t70, t71, t...262
(forward)formula 0,0,0.208362,13932,1,0,182,43737,195,87,2075,33758,184
FORMULA MedleyA-PT-16-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 316
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 155 transition count 311
Applied a total of 51 rules in 5 ms. Remains 155 /178 variables (removed 23) and now considering 311/355 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17703544532216665555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9074333470432813883.kers'
[2026-05-25 09:21:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17703544532216665555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9074333470432813883.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 155 cols 994 entries
Finished phase 1 with 147 SingleSign rule and 1 generalized
[2026-05-25 09:21:58] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9074333470432813883.kers
Total runtime 4 ms.
[2026-05-25 09:21:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:21:58] [INFO ] Invariant cache hit.
[2026-05-25 09:21:58] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-25 09:21:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 311/466 variables, 155/181 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 182 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 311/466 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 310/497 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 497 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 155/178 places, 311/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60281 ms. Remains : 155/178 places, 311/355 transitions.
[2026-05-25 09:22:58] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:22:58] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:22:58] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-25 09:22:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:22:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4014261035304945011.gal : 2 ms
[2026-05-25 09:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3651017730813970858.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/CTLFireability4014261035304945011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3651017730813970858.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,5.63137e+06,0.969121,32840,2,8049,5,96961,6,0,933,122198,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((!(A((p52==1) U ((p95==1)&&(p123==1)))) * ((p11==0)||(p51==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((!(!((E(!(((p95==1)&&(p123==1))) U (!((p52==1)) * !(((p95==1)&&(p123==1))))) + EG(!(((p95...213
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,1,7.41305,205708,1,0,659,1.02194e+06,657,320,7408,868698,747
FORMULA MedleyA-PT-16-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 154 transition count 315
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 154 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 154 transition count 310
Applied a total of 53 rules in 7 ms. Remains 154 /178 variables (removed 24) and now considering 310/355 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11515914300157045412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8885314080308632715.kers'
[2026-05-25 09:23:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11515914300157045412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8885314080308632715.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 154 cols 992 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:23:06] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8885314080308632715.kers
Total runtime 2 ms.
[2026-05-25 09:23:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:23:06] [INFO ] Invariant cache hit.
[2026-05-25 09:23:06] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-25 09:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 184 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/493 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 496 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 154/178 places, 310/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60390 ms. Remains : 154/178 places, 310/355 transitions.
[2026-05-25 09:24:06] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:24:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:24:06] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-25 09:24:06] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:24:06] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:24:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12573631405408888091.gal : 1 ms
[2026-05-25 09:24:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5472887099065232204.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/CTLFireability12573631405408888091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5472887099065232204.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,5.53244e+06,1.17093,33980,2,8224,5,100905,6,0,928,127207,0


Converting to forward existential form...Done !
original formula: !(E((EF((p176==1)) + (E((((p175==1)||(p193==1))&&(p70==1)) U AG((((p10==1)&&(p51==1))&&(p192==1)))) * (p77==1))) U ((!((AX(EG(((p33==1)&&...211
=> equivalent forward existential formula: ([(EY(((FwdU(Init,(E(TRUE U (p176==1)) + (E((((p175==1)||(p193==1))&&(p70==1)) U !(E(TRUE U !((((p10==1)&&(p51==...459
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...552
Detected timeout of ITS tools.
[2026-05-25 09:24:36] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:24:36] [INFO ] Applying decomposition
[2026-05-25 09:24:36] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1326786109731726213.txt' '-o' '/tmp/graph1326786109731726213.bin' '-w' '/tmp/graph1326786109731726213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1326786109731726213.bin' '-l' '-1' '-v' '-w' '/tmp/graph1326786109731726213.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:24:36] [INFO ] Decomposing Gal with order
[2026-05-25 09:24:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:24:36] [INFO ] Removed a total of 386 redundant transitions.
[2026-05-25 09:24:36] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:24:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 5 ms.
[2026-05-25 09:24:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2906291534724993595.gal : 2 ms
[2026-05-25 09:24:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1338393216550537654.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/CTLFireability2906291534724993595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1338393216550537654.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.53244e+06,0.082688,7864,478,20,6489,221,641,12952,43,642,0


Converting to forward existential form...Done !
original formula: !(E((EF((i10.u60.p176==1)) + (E((((i10.u60.p175==1)||(i11.i1.u63.p193==1))&&(i5.i0.u22.p70==1)) U AG((((i11.i0.u5.p10==1)&&(i11.i1.u15.p5...335
=> equivalent forward existential formula: ([(EY(((FwdU(Init,(E(TRUE U (i10.u60.p176==1)) + (E((((i10.u60.p175==1)||(i11.i1.u63.p193==1))&&(i5.i0.u22.p70==...682
Reverse transition relation is NOT exact ! Due to transitions t26, t33, t39, t57, t85, t88, t92, t98, t116, t159, t161, t167, t169, t176, t177, t179, t180,...737
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,2.17809,97052,1,0,124940,221,3884,640216,192,642,235907
FORMULA MedleyA-PT-16-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 316
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 155 transition count 311
Applied a total of 51 rules in 6 ms. Remains 155 /178 variables (removed 23) and now considering 311/355 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18404280695321599639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12941603196320573179.kers'
[2026-05-25 09:24:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18404280695321599639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12941603196320573179.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 155 cols 994 entries
Finished phase 1 with 147 SingleSign rule and 1 generalized
[2026-05-25 09:24:39] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-12941603196320573179.kers
Total runtime 16 ms.
[2026-05-25 09:24:39] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 09:24:39] [INFO ] Invariant cache hit.
[2026-05-25 09:24:39] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-25 09:24:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 311/466 variables, 155/181 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 183 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 311/466 variables, 155/183 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 310/493 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 495 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 155/178 places, 311/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60424 ms. Remains : 155/178 places, 311/355 transitions.
[2026-05-25 09:25:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:25:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:25:39] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-25 09:25:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:25:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11494999950304831291.gal : 2 ms
[2026-05-25 09:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14023857439247976050.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/CTLFireability11494999950304831291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14023857439247976050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(AF((((p61==1)||((p183==0)&&(p111==0)))||(p94==1)))) + ((A(!(AX(((p94==1)&&(p153==1)))) U ((A((p0!=1) U ((p111==1)&&(p155==1))) * (p8=...322
=> equivalent forward existential formula: (((((([(FwdU((FwdU((Init * !(!(E(TRUE U !(!(EG(!((((p61==1)||((p183==0)&&(p111==0)))||(p94==1)))))))))),!(((!((E...1997
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t24, t27, t28, t29, t31, t32, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...556
(forward)formula 0,0,26.9206,733004,1,0,816,4.71824e+06,670,409,7409,3.26041e+06,965
FORMULA MedleyA-PT-16-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 187 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 167 transition count 316
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 139 transition count 314
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 138 transition count 313
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 137 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 136 transition count 311
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 65 place count 136 transition count 304
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 79 place count 129 transition count 304
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 102 place count 106 transition count 263
Iterating global reduction 5 with 23 rules applied. Total rules applied 125 place count 106 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 6 rules applied. Total rules applied 131 place count 106 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 132 place count 105 transition count 257
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 132 place count 105 transition count 254
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 138 place count 102 transition count 254
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 141 place count 99 transition count 245
Iterating global reduction 7 with 3 rules applied. Total rules applied 144 place count 99 transition count 245
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 168 place count 87 transition count 233
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 86 transition count 231
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 86 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 182 place count 86 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 182 place count 86 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 184 place count 85 transition count 218
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 192 place count 81 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 80 transition count 213
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 78 vertex of which 20 / 78 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 196 place count 66 transition count 213
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 220 place count 66 transition count 189
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 221 place count 65 transition count 177
Iterating global reduction 9 with 1 rules applied. Total rules applied 222 place count 65 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 274 place count 65 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 9 with 4 rules applied. Total rules applied 278 place count 65 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 282 place count 61 transition count 121
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 283 place count 60 transition count 116
Iterating global reduction 11 with 1 rules applied. Total rules applied 284 place count 60 transition count 116
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 11 with 4 rules applied. Total rules applied 288 place count 58 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 289 place count 58 transition count 113
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 11 with 1 rules applied. Total rules applied 290 place count 58 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 291 place count 57 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 292 place count 57 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 294 place count 56 transition count 110
Applied a total of 294 rules in 74 ms. Remains 56 /178 variables (removed 122) and now considering 110/355 (removed 245) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9245716181007094600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11475564414789095741.kers'
[2026-05-25 09:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9245716181007094600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11475564414789095741.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 56 cols 342 entries
Finished phase 1 with 50 SingleSign rule and 1 generalized
[2026-05-25 09:26:06] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11475564414789095741.kers
Total runtime 1 ms.
[2026-05-25 09:26:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:26:06] [INFO ] Invariant cache hit.
[2026-05-25 09:26:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-25 09:26:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2026-05-25 09:26:06] [INFO ] Redundant transitions in 16 ms returned [41, 42, 101, 103, 104]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 102 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12849718741461572472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8776345771022503956.kers'
[2026-05-25 09:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12849718741461572472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8776345771022503956.kers]
Normalized transition count is 104 out of 105 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 56 cols 322 entries
Finished phase 1 with 50 SingleSign rule and 1 generalized
[2026-05-25 09:26:06] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8776345771022503956.kers
Total runtime 0 ms.
[2026-05-25 09:26:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 104/160 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/161 variables, and 93 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 104/160 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 102/195 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/161 variables, and 198 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34089ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 34089ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/178 places, 105/355 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 56 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 54 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 53 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 53 transition count 101
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 1 rules applied. Total rules applied 8 place count 53 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9 place count 52 transition count 100
Applied a total of 9 rules in 4 ms. Remains 52 /56 variables (removed 4) and now considering 100/105 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9749376906794683109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14459823830183757685.kers'
[2026-05-25 09:26:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9749376906794683109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14459823830183757685.kers]
Normalized transition count is 99 out of 100 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 52 cols 312 entries
Finished phase 1 with 46 SingleSign rule and 1 generalized
[2026-05-25 09:26:40] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14459823830183757685.kers
Total runtime 0 ms.
[2026-05-25 09:26:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 09:26:40] [INFO ] Invariant cache hit.
[2026-05-25 09:26:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-25 09:26:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/178 places, 100/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 34442 ms. Remains : 52/178 places, 100/355 transitions.
[2026-05-25 09:26:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:26:41] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:26:41] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-25 09:26:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:26:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1155094604784508348.gal : 1 ms
[2026-05-25 09:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6305811815507699634.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/CTLFireability1155094604784508348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6305811815507699634.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,9938,0.050177,6340,2,967,5,7757,5,0,308,7043,0


Converting to forward existential form...Done !
original formula: EG(AF(((!(E((p126==1) U (p27==1))) + (p68==1)) + ((p83==0)&&((p95==0)||(p138==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(E((p126==1) U (p27==1))) + (p68==1)) + ((p83==0)&&((p95==0)||(p138==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t8, t14, t15, t17, t19, t21, t24, t26, t27, t29, t31, t33, t36, t37, t38, t73, t75, t...283
(forward)formula 0,1,0.214424,13636,1,0,204,37599,230,102,2381,32058,216
FORMULA MedleyA-PT-16-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 154 transition count 315
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 154 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 154 transition count 310
Applied a total of 53 rules in 6 ms. Remains 154 /178 variables (removed 24) and now considering 310/355 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16755213240009888007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4212207640651817696.kers'
[2026-05-25 09:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16755213240009888007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4212207640651817696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 154 cols 992 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:26:41] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4212207640651817696.kers
Total runtime 3 ms.
[2026-05-25 09:26:41] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 09:26:41] [INFO ] Invariant cache hit.
[2026-05-25 09:26:41] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2026-05-25 09:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 183 constraints, problems are : Problem set: 0 solved, 309 unsolved in 26571 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 309/493 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 495 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56640ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 56641ms
Starting structural reductions in LTL mode, iteration 1 : 154/178 places, 310/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56996 ms. Remains : 154/178 places, 310/355 transitions.
[2026-05-25 09:27:38] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:27:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:27:38] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-25 09:27:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:27:38] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:27:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9453506302209243181.gal : 2 ms
[2026-05-25 09:27:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14199335814820159437.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/CTLFireability9453506302209243181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14199335814820159437.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,5.44045e+06,1.13288,32960,2,7932,5,95888,6,0,928,121373,0


Converting to forward existential form...Done !
original formula: A((((p68==1) * ((EF(!(((((p17==1)&&(p42==1))&&((p195==1)&&(p74==1)))&&(p160==1)))) + AF(((p39==1)&&(p113==1)))) + (((p108==1) * EX((p148=...359
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(!(!(EG(!((((p26==1)&&(p51==1))&&(p192==1)))))))))))))) * !(E(!(EX(!(E(TRUE U !(...604
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...553
Detected timeout of ITS tools.
[2026-05-25 09:28:08] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:28:08] [INFO ] Applying decomposition
[2026-05-25 09:28:08] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11829581733168758274.txt' '-o' '/tmp/graph11829581733168758274.bin' '-w' '/tmp/graph11829581733168758274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11829581733168758274.bin' '-l' '-1' '-v' '-w' '/tmp/graph11829581733168758274.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:28:08] [INFO ] Decomposing Gal with order
[2026-05-25 09:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:28:08] [INFO ] Removed a total of 382 redundant transitions.
[2026-05-25 09:28:08] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 7 ms.
[2026-05-25 09:28:08] [INFO ] Time to serialize gal into /tmp/CTLFireability18041467754473559302.gal : 2 ms
[2026-05-25 09:28:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1500027990003757485.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/CTLFireability18041467754473559302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1500027990003757485.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44045e+06,0.114805,8952,598,23,9001,295,620,15890,47,940,0


Converting to forward existential form...Done !
original formula: A((((i3.u21.p68==1) * ((EF(!(((((i0.u2.p17==1)&&(i1.u13.p42==1))&&((i11.i1.u61.p195==1)&&(i3.u23.p74==1)))&&(i5.i1.u55.p160==1)))) + AF((...562
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(!(!(EG(!((((i11.i1.u8.p26==1)&&(i11.i1.u15.p51==1))&&(i11.i1.u63.p192==1)))))))...871
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t33, t39, t75, t82, t90, t96, t159, t161, t167, t169, t176, t177, t179, t180, t181,...768
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,1.4562,55236,1,0,98012,295,3930,227119,218,940,228235
FORMULA MedleyA-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 200 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 167 transition count 313
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 136 transition count 309
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 134 transition count 309
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 69 place count 134 transition count 302
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 127 transition count 302
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 108 place count 102 transition count 259
Iterating global reduction 3 with 25 rules applied. Total rules applied 133 place count 102 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 139 place count 102 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 101 transition count 253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 140 place count 101 transition count 249
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 97 transition count 249
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 151 place count 94 transition count 240
Iterating global reduction 5 with 3 rules applied. Total rules applied 154 place count 94 transition count 240
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 178 place count 82 transition count 228
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 181 place count 79 transition count 222
Iterating global reduction 5 with 3 rules applied. Total rules applied 184 place count 79 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 197 place count 79 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 197 place count 79 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 201 place count 77 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 209 place count 73 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 72 transition count 202
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 70 vertex of which 26 / 70 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 54 transition count 202
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 255 place count 54 transition count 160
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 257 place count 52 transition count 143
Iterating global reduction 7 with 2 rules applied. Total rules applied 259 place count 52 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 300 place count 52 transition count 102
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 305 place count 52 transition count 97
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 310 place count 47 transition count 97
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 311 place count 46 transition count 94
Iterating global reduction 9 with 1 rules applied. Total rules applied 312 place count 46 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 316 place count 44 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 319 place count 44 transition count 89
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 9 with 2 rules applied. Total rules applied 321 place count 44 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 323 place count 42 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 323 place count 42 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 325 place count 41 transition count 86
Applied a total of 325 rules in 22 ms. Remains 41 /178 variables (removed 137) and now considering 86/355 (removed 269) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15844398741150218865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3654540940592767797.kers'
[2026-05-25 09:28:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15844398741150218865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3654540940592767797.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 41 cols 286 entries
Finished phase 1 with 35 SingleSign rule and 1 generalized
[2026-05-25 09:28:10] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3654540940592767797.kers
Total runtime 0 ms.
[2026-05-25 09:28:10] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:28:10] [INFO ] Invariant cache hit.
[2026-05-25 09:28:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:28:10] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-25 09:28:10] [INFO ] Redundant transitions in 29 ms returned [83, 85]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 80 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6342093728743336708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3354644607889143316.kers'
[2026-05-25 09:28:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6342093728743336708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3354644607889143316.kers]
Normalized transition count is 83 out of 84 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 41 cols 278 entries
Finished phase 1 with 35 SingleSign rule and 1 generalized
[2026-05-25 09:28:10] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3354644607889143316.kers
Total runtime 1 ms.
[2026-05-25 09:28:10] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 83/124 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 70 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 83/124 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 80/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 150 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4849ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4850ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/178 places, 84/355 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 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 40 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 39 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 39 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 39 transition count 80
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 7 place count 38 transition count 80
Applied a total of 7 rules in 7 ms. Remains 38 /41 variables (removed 3) and now considering 80/84 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16493866714066626945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1200628087680014371.kers'
[2026-05-25 09:28:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16493866714066626945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1200628087680014371.kers]
Normalized transition count is 79 out of 80 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 38 cols 270 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:28:15] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1200628087680014371.kers
Total runtime 0 ms.
[2026-05-25 09:28:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 09:28:15] [INFO ] Invariant cache hit.
[2026-05-25 09:28:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:28:15] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/178 places, 80/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 5217 ms. Remains : 38/178 places, 80/355 transitions.
[2026-05-25 09:28:15] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:28:15] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:28:15] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-25 09:28:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:28:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1670844639938219793.gal : 1 ms
[2026-05-25 09:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17565241511116167898.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/CTLFireability1670844639938219793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17565241511116167898.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,2665,0.044693,5248,2,586,5,4373,5,0,233,3390,0


Converting to forward existential form...Done !
original formula: EF(AG((p155==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p155==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t9, t12, t13, t15, t17, t19, t57, t58, t61, t62, Intersection with reachable...225
(forward)formula 0,0,0.1695,11040,1,0,164,32512,179,79,1937,23045,168
FORMULA MedleyA-PT-16-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 : 178/178 places, 355/355 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 157 transition count 320
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 157 transition count 320
Applied a total of 42 rules in 4 ms. Remains 157 /178 variables (removed 21) and now considering 320/355 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3568899800230198456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7960684331804210897.kers'
[2026-05-25 09:28:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3568899800230198456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7960684331804210897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 157 cols 1022 entries
Finished phase 1 with 149 SingleSign rule and 1 generalized
[2026-05-25 09:28:15] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7960684331804210897.kers
Total runtime 1 ms.
[2026-05-25 09:28:15] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:28:15] [INFO ] Invariant cache hit.
[2026-05-25 09:28:15] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-25 09:28:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 320/477 variables, 157/186 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/477 variables, and 188 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 320/477 variables, 157/188 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 319/507 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 508 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 157/178 places, 320/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60330 ms. Remains : 157/178 places, 320/355 transitions.
[2026-05-25 09:29:15] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:29:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:29:15] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-25 09:29:15] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:29:15] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:29:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3980996190792277757.gal : 2 ms
[2026-05-25 09:29:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17875185716986904964.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/CTLFireability3980996190792277757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17875185716986904964.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,6.35572e+06,0.907434,31088,2,7482,5,92117,6,0,950,114961,0


Converting to forward existential form...Done !
original formula: E(!(EX(((((p68==1)&&(p23==1)) + (AF((p137==1)) * EG((p70==1)))) + EG(((p176==1)||(p83==1)))))) U E(AF(((E((p89==1) U ((p91==1)&&(p160==1)...310
=> equivalent forward existential formula: [((FwdU(FwdU(Init,!(EX(((((p68==1)&&(p23==1)) + (!(EG(!((p137==1)))) * EG((p70==1)))) + EG(((p176==1)||(p83==1))...381
Reverse transition relation is NOT exact ! Due to transitions t5, t15, t19, t26, t27, t28, t30, t34, t35, t40, t44, t47, t51, t52, t53, t56, t58, t60, t61,...569
(forward)formula 0,0,24.2611,606256,1,0,929,3.48549e+06,698,526,7291,3.02416e+06,1074
FORMULA MedleyA-PT-16-CTLFireability-2024-13 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 : 178/178 places, 355/355 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 318
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 156 transition count 313
Applied a total of 49 rules in 2 ms. Remains 156 /178 variables (removed 22) and now considering 313/355 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2457486954591731311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11217961277470608004.kers'
[2026-05-25 09:29:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2457486954591731311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11217961277470608004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 156 cols 998 entries
Finished phase 1 with 148 SingleSign rule and 1 generalized
[2026-05-25 09:29:40] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11217961277470608004.kers
Total runtime 2 ms.
[2026-05-25 09:29:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 09:29:40] [INFO ] Invariant cache hit.
[2026-05-25 09:29:40] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-25 09:29:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 313/469 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 184 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/469 variables, 156/183 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 312/495 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 496 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 156/178 places, 313/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60382 ms. Remains : 156/178 places, 313/355 transitions.
[2026-05-25 09:30:40] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:30:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:30:40] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 09:30:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:30:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:30:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2229818205505846863.gal : 2 ms
[2026-05-25 09:30:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10581707835375136638.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/CTLFireability2229818205505846863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10581707835375136638.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,5.72008e+06,0.841487,29884,2,6537,5,85134,6,0,939,114590,0


Converting to forward existential form...Done !
original formula: AG((E(((A(((p73==1)&&(p138==1)) U ((p74==1)&&(p131==1))) + (p155!=1)) + ((((p74==1)&&(p139==1))||(p108==1))&&(!((p94==1)&&(p168==1))))) U...261
=> equivalent forward existential formula: ([(EY(EY(FwdU((FwdU(Init,TRUE) * !(E(((!((E(!(((p74==1)&&(p131==1))) U (!(((p73==1)&&(p138==1))) * !(((p74==1)&&...731
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t15, t19, t25, t28, t29, t30, t32, t33, t36, t37, t42, t46, t49, t53, t56, t58, t60,...567
(forward)formula 0,0,4.93002,116340,1,0,609,549154,663,299,7186,490587,676
FORMULA MedleyA-PT-16-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 355/355 transitions.
Graph (trivial) has 194 edges and 178 vertex of which 13 / 178 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 167 transition count 314
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 137 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 135 transition count 310
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 67 place count 135 transition count 303
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 81 place count 128 transition count 303
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 105 place count 104 transition count 262
Iterating global reduction 3 with 24 rules applied. Total rules applied 129 place count 104 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 135 place count 104 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 103 transition count 256
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 136 place count 103 transition count 252
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 144 place count 99 transition count 252
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 96 transition count 243
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 96 transition count 243
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 174 place count 84 transition count 231
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 177 place count 81 transition count 225
Iterating global reduction 5 with 3 rules applied. Total rules applied 180 place count 81 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 191 place count 81 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 191 place count 81 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 195 place count 79 transition count 212
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 203 place count 75 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 74 transition count 207
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 80 edges and 72 vertex of which 20 / 72 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 207 place count 60 transition count 207
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 235 place count 60 transition count 179
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 59 transition count 169
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 59 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 7 with 47 rules applied. Total rules applied 284 place count 59 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 287 place count 59 transition count 119
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 291 place count 56 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 292 place count 55 transition count 118
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 294 place count 53 transition count 111
Iterating global reduction 10 with 2 rules applied. Total rules applied 296 place count 53 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 300 place count 51 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 301 place count 51 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 302 place count 51 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 303 place count 50 transition count 107
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 304 place count 50 transition count 107
Applied a total of 304 rules in 76 ms. Remains 50 /178 variables (removed 128) and now considering 107/355 (removed 248) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8537857372260412611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-583343886449185761.kers'
[2026-05-25 09:30:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8537857372260412611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-583343886449185761.kers]
Normalized transition count is 106 out of 107 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 106 rows 50 cols 340 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-25 09:30:45] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-583343886449185761.kers
Total runtime 0 ms.
[2026-05-25 09:30:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:30:45] [INFO ] Invariant cache hit.
[2026-05-25 09:30:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:30:45] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2026-05-25 09:30:45] [INFO ] Redundant transitions in 36 ms returned [36, 37, 38, 98, 100, 101, 102, 104]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 95 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6257296727461635731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7478241845697602303.kers'
[2026-05-25 09:30:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6257296727461635731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7478241845697602303.kers]
Normalized transition count is 98 out of 99 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 50 cols 308 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-25 09:30:45] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7478241845697602303.kers
Total runtime 0 ms.
[2026-05-25 09:30:45] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 98/148 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 79 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 98/148 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 95/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 175 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3693 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6712ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 6712ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/178 places, 99/355 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 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 48 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 48 transition count 94
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 11 place count 46 transition count 92
Applied a total of 11 rules in 5 ms. Remains 46 /50 variables (removed 4) and now considering 92/99 (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-12114440965857419010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6978883707512408222.kers'
[2026-05-25 09:30:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12114440965857419010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6978883707512408222.kers]
Normalized transition count is 91 out of 92 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 46 cols 294 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:30:52] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6978883707512408222.kers
Total runtime 0 ms.
[2026-05-25 09:30:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 09:30:52] [INFO ] Invariant cache hit.
[2026-05-25 09:30:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:30:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/178 places, 92/355 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7205 ms. Remains : 46/178 places, 92/355 transitions.
[2026-05-25 09:30:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:30:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:30:52] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-25 09:30:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:30:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:30:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3719874209011215972.gal : 1 ms
[2026-05-25 09:30:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15610906848092610377.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/CTLFireability3719874209011215972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15610906848092610377.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,7193,0.041506,5860,2,900,5,6238,5,0,277,5711,0


Converting to forward existential form...Done !
original formula: AG(AF(!(A((AG((p92==1)) + (p90==1)) U EG(((p88==1)&&(p168==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(!((E(!(EG(((p88==1)&&(p168==1)))) U (!((!(E(TRUE U !((p92==1)))) + (p90==1))) * !(EG((...228
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t10, t12, t14, t16, t19, t20, t22, t24, t26, t29, t30, t31, t63, t64, t67, t68, t69, ...258
Fast SCC detection found an SCC at level 0
(forward)formula 0,0,0.24547,15360,1,0,195,49323,220,105,2218,40433,220
FORMULA MedleyA-PT-16-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 09:30:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:30:53] [INFO ] Flatten gal took : 10 ms
Total runtime 884541 ms.

BK_STOP 1779701453184

--------------------
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-16"
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-16, 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-177969020000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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