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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 99K 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-09-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779699552894

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 08:59:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:59:14] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2026-05-25 08:59:14] [INFO ] Transformed 147 places.
[2026-05-25 08:59:14] [INFO ] Transformed 315 transitions.
[2026-05-25 08:59:14] [INFO ] Found NUPN structural information;
[2026-05-25 08:59:14] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Support contains 79 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 127 transition count 297
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 127 transition count 297
Applied a total of 34 rules in 27 ms. Remains 127 /145 variables (removed 18) and now considering 297/313 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1360921947377780518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12220604894828967654.kers'
[2026-05-25 08:59:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1360921947377780518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12220604894828967654.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 127 cols 1545 entries
Finished phase 1 with 113 SingleSign rule and 4 generalized
[2026-05-25 08:59:15] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12220604894828967654.kers
Total runtime 2 ms.
[2026-05-25 08:59:15] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-25 08:59:15] [INFO ] Invariant cache hit.
[2026-05-25 08:59:15] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2026-05-25 08:59:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 10/20 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/23 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 297/424 variables, 127/150 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 4/154 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 2/156 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/158 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 2/160 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/160 constraints. Problems are: Problem set: 64 solved, 232 unsolved
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 424/424 variables, and 161 constraints, problems are : Problem set: 64 solved, 232 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 21/31 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/31 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 297/424 variables, 127/158 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 232/390 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 6/396 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 1/397 constraints. Problems are: Problem set: 64 solved, 232 unsolved
SMT process timed out in 60463ms, After SMT, problems are : Problem set: 64 solved, 232 unsolved
Search for dead transitions found 64 dead transitions in 60485ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/145 places, 233/313 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61032 ms. Remains : 127/145 places, 233/313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Applied a total of 0 rules in 13 ms. Remains 127 /127 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7851412129888019973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7439623898146910151.kers'
[2026-05-25 09:00:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7851412129888019973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7439623898146910151.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 127 cols 1033 entries
Finished phase 1 with 113 SingleSign rule and 4 generalized
[2026-05-25 09:00:15] [INFO ] Computed 10 invariants in 12 ms
Computed 10 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-7439623898146910151.kers
Total runtime 13 ms.
[2026-05-25 09:00:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 09:00:16] [INFO ] Invariant cache hit.
[2026-05-25 09:00:16] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-05-25 09:00:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 233/360 variables, 127/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/360 variables, and 158 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 233/360 variables, 127/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 232/394 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 401 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60431 ms. Remains : 127/127 places, 233/233 transitions.
Support contains 79 out of 127 places after structural reductions.
[2026-05-25 09:01:16] [INFO ] Flatten gal took : 77 ms
[2026-05-25 09:01:16] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:01:16] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 78 out of 127 places (down from 79) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 80
RANDOM walk for 40000 steps (1323 resets) in 1630 ms. (24 steps per ms) remains 40/80 properties
BEST_FIRST walk for 4002 steps (24 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (24 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 66 ms. (59 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (26 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (31 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (28 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (26 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (27 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
[2026-05-25 09:01:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/108 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 31 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/115 variables, 4/10 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 226/341 variables, 115/125 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/125 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 15/356 variables, 10/135 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/135 constraints. Problems are: Problem set: 16 solved, 24 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 9 (OVERLAPS) 4/360 variables, 2/137 constraints. Problems are: Problem set: 17 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/138 constraints. Problems are: Problem set: 17 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/139 constraints. Problems are: Problem set: 17 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/139 constraints. Problems are: Problem set: 17 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/360 variables, 0/139 constraints. Problems are: Problem set: 17 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 139 constraints, problems are : Problem set: 17 solved, 23 unsolved in 2324 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 23 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/106 variables, 6/6 constraints. Problems are: Problem set: 18 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 18 solved, 22 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/114 variables, 4/10 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/11 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/12 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 224/338 variables, 114/126 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 11/137 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 1/138 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 1/139 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 1/140 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/140 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 15/353 variables, 9/149 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 10/159 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/159 constraints. Problems are: Problem set: 19 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 7/360 variables, 4/163 constraints. Problems are: Problem set: 19 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 164 constraints, problems are : Problem set: 19 solved, 21 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 21/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7377ms problems are : Problem set: 19 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 6 rules applied. Total rules applied 7 place count 124 transition count 224
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 119 transition count 224
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 119 transition count 218
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 113 transition count 218
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 37 place count 100 transition count 202
Iterating global reduction 2 with 13 rules applied. Total rules applied 50 place count 100 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 99 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 99 transition count 200
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 2 with 22 rules applied. Total rules applied 74 place count 88 transition count 189
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
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 80 place count 85 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 103 place count 85 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 85 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 84 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 105 place count 84 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 83 transition count 177
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 112 place count 83 transition count 172
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 117 place count 78 transition count 172
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 128 place count 78 transition count 172
Applied a total of 128 rules in 98 ms. Remains 78 /127 variables (removed 49) and now considering 172/233 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 78/127 places, 172/233 transitions.
RANDOM walk for 40000 steps (3165 resets) in 471 ms. (84 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40004 steps (704 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (758 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (579 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (752 resets) in 97 ms. (408 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (730 resets) in 76 ms. (519 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (766 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (738 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (727 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (757 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (752 resets) in 37 ms. (1052 steps per ms) remains 6/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3200109848464777624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7249478994732362099.kers'
[2026-05-25 09:01:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3200109848464777624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7249478994732362099.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 78 cols 918 entries
Finished phase 1 with 64 SingleSign rule and 3 generalized
[2026-05-25 09:01:25] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7249478994732362099.kers
Total runtime 1 ms.
[2026-05-25 09:01:25] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/249 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/250 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 98 constraints, problems are : Problem set: 0 solved, 6 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/249 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/250 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 104 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1882ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 1830 ms.
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 172/172 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 10 place count 78 transition count 162
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 162
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 68 transition count 159
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 26 place count 65 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 63 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 63 transition count 157
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 51 place count 52 transition count 147
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 46 transition count 175
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 65 place count 46 transition count 173
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 46 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 43 transition count 170
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 43 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 42 transition count 171
Applied a total of 73 rules in 31 ms. Remains 42 /78 variables (removed 36) and now considering 171/172 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 42/78 places, 171/172 transitions.
RANDOM walk for 40000 steps (7294 resets) in 243 ms. (163 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1371 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13792373402432657882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12227743859719042793.kers'
[2026-05-25 09:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13792373402432657882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12227743859719042793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 42 cols 973 entries
Finished phase 1 with 30 SingleSign rule and 2 generalized
[2026-05-25 09:01:29] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12227743859719042793.kers
Total runtime 1 ms.
[2026-05-25 09:01:29] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/38 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/41 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 171/212 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 66/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 66/66 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/38 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/41 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 171/212 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 66/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 41 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 170
Applied a total of 2 rules in 13 ms. Remains 41 /42 variables (removed 1) and now considering 170/171 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 41/42 places, 170/171 transitions.
RANDOM walk for 36169 steps (6677 resets) in 281 ms. (128 steps per ms) remains 0/1 properties
Successfully simplified 19 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:01:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:01:30] [INFO ] Flatten gal took : 23 ms
FORMULA MedleyA-PT-09-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:01:30] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:01:30] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 55 out of 127 places (down from 60) after GAL structural reductions.
Computed a total of 13 stabilizing places and 15 stable transitions
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 208
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 208
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 104 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 14 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7474048723192009948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3092694172593638488.kers'
[2026-05-25 09:01:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7474048723192009948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3092694172593638488.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 104 cols 975 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 09:01:30] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3092694172593638488.kers
Total runtime 2 ms.
[2026-05-25 09:01:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:01:30] [INFO ] Invariant cache hit.
[2026-05-25 09:01:30] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-25 09:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 22477 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 333 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52588ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 52589ms
Starting structural reductions in LTL mode, iteration 1 : 104/127 places, 204/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52824 ms. Remains : 104/127 places, 204/233 transitions.
[2026-05-25 09:02:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:23] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-25 09:02:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12283554137787795252.gal : 4 ms
[2026-05-25 09:02:23] [INFO ] Time to serialize properties into /tmp/CTLFireability202516558420084862.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12283554137787795252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability202516558420084862.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,4.81538e+07,1.32614,46816,2,3216,5,135037,6,0,620,189146,0


Converting to forward existential form...Done !
original formula: EX((EG((((p19!=1)||(p58!=1))||((p78!=1)||(p91!=1)))) + A(AF((p120==1)) U (((((((p19==1)&&(p24==1))&&((p121==1)&&(p143==1)))||(((p19==1)&&...239
=> equivalent forward existential formula: ([FwdG(EY(Init),(((p19!=1)||(p58!=1))||((p78!=1)||(p91!=1))))] != FALSE + [((EY(Init) * !(EG(!((((((((p19==1)&&(...634
Hit Full ! (commute/partial/dont) 108/0/96
(forward)formula 0,1,6.89404,183396,1,0,47,691410,19,4,4113,766815,45
FORMULA MedleyA-PT-09-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 123 transition count 214
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 108 transition count 210
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 106 transition count 208
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 39 place count 106 transition count 201
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 53 place count 99 transition count 201
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 72 place count 80 transition count 177
Iterating global reduction 3 with 19 rules applied. Total rules applied 91 place count 80 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 80 transition count 176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 79 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 77 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 77 transition count 172
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 125 place count 62 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 61 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 61 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 132 place count 61 transition count 152
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 61 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 136 place count 59 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 136 place count 59 transition count 148
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 140 place count 57 transition count 148
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 5 with 2 rules applied. Total rules applied 142 place count 56 transition count 147
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 56 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 55 transition count 146
Applied a total of 144 rules in 90 ms. Remains 55 /127 variables (removed 72) and now considering 146/233 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-272119282874970539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11087351411988438564.kers'
[2026-05-25 09:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-272119282874970539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11087351411988438564.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 55 cols 709 entries
Finished phase 1 with 45 SingleSign rule and 2 generalized
[2026-05-25 09:02:30] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11087351411988438564.kers
Total runtime 3 ms.
[2026-05-25 09:02:30] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 09:02:30] [INFO ] Invariant cache hit.
[2026-05-25 09:02:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:02:30] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-25 09:02:30] [INFO ] Redundant transitions in 2 ms returned []
Running 140 sub problems to find dead transitions.
[2026-05-25 09:02:30] [INFO ] Invariant cache hit.
[2026-05-25 09:02:30] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 146/200 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 79 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4447 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 146/200 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 140/218 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 219 constraints, problems are : Problem set: 0 solved, 140 unsolved in 13615 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18135ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 18135ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/127 places, 146/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18456 ms. Remains : 55/127 places, 146/233 transitions.
[2026-05-25 09:02:48] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:02:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:48] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-25 09:02:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:02:48] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:02:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15397790838617392484.gal : 2 ms
[2026-05-25 09:02:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12953338599951705543.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/CTLFireability15397790838617392484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12953338599951705543.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(((AF((((p78==1)&&(p117==1))&&((p121==1)&&(p141==1)))) * (p78==1)) * ((p86==1)&&(p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!((((p78==1)&&(p117==1))&&((p121==1)&&(p141==1)))))) * (p78==1)) * ((p86==1)&&(p105==1)))))]...163
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t7, t11, t13, t16, t17, t19, t20, t22, t23, t24, t27, t29, t34, t35, t36,...414
(forward)formula 0,0,11.0983,318184,1,0,573,1.79269e+06,319,221,3713,1.80618e+06,682
FORMULA MedleyA-PT-09-CTLFireability-2024-01 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 : 127/127 places, 233/233 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 107 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 107 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 105 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 105 transition count 205
Applied a total of 44 rules in 4 ms. Remains 105 /127 variables (removed 22) and now considering 205/233 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16265055339477949935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-827269859083300327.kers'
[2026-05-25 09:02:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16265055339477949935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-827269859083300327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 105 cols 977 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:02:59] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-827269859083300327.kers
Total runtime 1 ms.
[2026-05-25 09:03:00] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 09:03:00] [INFO ] Invariant cache hit.
[2026-05-25 09:03:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-25 09:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 126 constraints, problems are : Problem set: 0 solved, 204 unsolved in 17682 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/328 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 336 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47821ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 47822ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 205/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48082 ms. Remains : 105/127 places, 205/233 transitions.
[2026-05-25 09:03:48] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:03:48] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:03:48] [INFO ] Input system was already deterministic with 205 transitions.
[2026-05-25 09:03:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:03:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8605156629000183219.gal : 2 ms
[2026-05-25 09:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8626445800666539000.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/CTLFireability8605156629000183219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8626445800666539000.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,4.82685e+07,1.69357,56744,2,4484,5,161897,6,0,625,229596,0


Converting to forward existential form...Done !
original formula: EF(AG((AX(AG((((p78==1)&&(p117==1))&&((p121==1)&&(p141==1))))) + EX((p23==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!(!(E(TRUE U !((((p78==1)&&(p117==1))&&((p121==1)&&(p141==1))))))))) + EX...180
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...427
(forward)formula 0,1,24.5114,647720,1,0,455,3.56506e+06,433,183,5561,2.40709e+06,537
FORMULA MedleyA-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 208
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 105 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 105 transition count 206
Applied a total of 44 rules in 13 ms. Remains 105 /127 variables (removed 22) and now considering 206/233 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3322024065971130410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2479854071303388372.kers'
[2026-05-25 09:04:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3322024065971130410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2479854071303388372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 105 cols 979 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:04:12] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2479854071303388372.kers
Total runtime 4 ms.
[2026-05-25 09:04:12] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 09:04:12] [INFO ] Invariant cache hit.
[2026-05-25 09:04:13] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:04:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 127 constraints, problems are : Problem set: 0 solved, 205 unsolved in 20762 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 205/330 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 339 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50862ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 50863ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51137 ms. Remains : 105/127 places, 206/233 transitions.
[2026-05-25 09:05:03] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:05:03] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:05:04] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-25 09:05:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:05:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:05:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5982686350952171096.gal : 5 ms
[2026-05-25 09:05:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1428043849532907035.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/CTLFireability5982686350952171096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1428043849532907035.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,4.8158e+07,1.21062,47692,2,3323,5,137704,6,0,626,193911,0


Converting to forward existential form...Done !
original formula: (EF(AX(FALSE)) * EX(AF(!(E(A(((p71==1)&&(p84==1)) U (((p19==1)&&(p58==1))&&((p121==1)&&(p139==1)))) U ((p45==1)||(((p70==1)&&(p117==1))&&...184
=> equivalent forward existential formula: [(EY((Init * E(TRUE U !(EX(!(FALSE)))))) * !(EG(!(!(E(!((E(!((((p19==1)&&(p58==1))&&((p121==1)&&(p139==1)))) U (...368
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...422
Detected timeout of ITS tools.
[2026-05-25 09:05:34] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:05:34] [INFO ] Applying decomposition
[2026-05-25 09:05:34] [INFO ] Flatten gal took : 6 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/graph11075841384458483518.txt' '-o' '/tmp/graph11075841384458483518.bin' '-w' '/tmp/graph11075841384458483518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11075841384458483518.bin' '-l' '-1' '-v' '-w' '/tmp/graph11075841384458483518.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:05:34] [INFO ] Decomposing Gal with order
[2026-05-25 09:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:05:34] [INFO ] Removed a total of 317 redundant transitions.
[2026-05-25 09:05:34] [INFO ] Flatten gal took : 68 ms
[2026-05-25 09:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 13 ms.
[2026-05-25 09:05:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4620582361181632631.gal : 3 ms
[2026-05-25 09:05:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14339205127190767028.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/CTLFireability4620582361181632631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14339205127190767028.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,4.8158e+07,0.236005,12996,605,189,15696,1214,368,36039,117,7073,0


Converting to forward existential form...Done !
original formula: (EF(AX(FALSE)) * EX(AF(!(E(A(((i7.u15.p71==1)&&(i5.u22.p84==1)) U (((i3.u3.p19==1)&&(i3.u3.p58==1))&&((i7.u27.p121==1)&&(i3.u31.p139==1))...259
=> equivalent forward existential formula: [(EY((Init * E(TRUE U !(EX(!(FALSE)))))) * !(EG(!(!(E(!((E(!((((i3.u3.p19==1)&&(i3.u3.p58==1))&&((i7.u27.p121==1...495
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t32, t37, i1.u2.t95, i1.u4.t92, i2.t85, i2.t79, i2.u6.t60, i2.u6.t90, i2.u6.t91, i2....662
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 208
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 208
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 104 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 4 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11046434145521751989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2869349451472612597.kers'
[2026-05-25 09:06:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11046434145521751989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2869349451472612597.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 104 cols 975 entries
Finished phase 1 with 90 SingleSign rule and 4 generalized
[2026-05-25 09:06:04] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2869349451472612597.kers
Total runtime 1 ms.
[2026-05-25 09:06:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:06:04] [INFO ] Invariant cache hit.
[2026-05-25 09:06:04] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-25 09:06:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 21949 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 333 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52046ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 52047ms
Starting structural reductions in LTL mode, iteration 1 : 104/127 places, 204/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52257 ms. Remains : 104/127 places, 204/233 transitions.
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:06:56] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:06:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2770754497436075727.gal : 2 ms
[2026-05-25 09:06:56] [INFO ] Time to serialize properties into /tmp/CTLFireability1232595520357364507.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/CTLFireability2770754497436075727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1232595520357364507.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,4.81538e+07,1.28727,47008,2,3216,5,135037,6,0,620,189146,0


Converting to forward existential form...Done !
original formula: (EX(A((p37==1) U EF(!((((p19==1)&&(p38==1))&&(p54==1)))))) * EX(EF(((p19==1)&&(p55==1)))))
=> equivalent forward existential formula: [(FwdU(EY((Init * EX(!((E(!(E(TRUE U !((((p19==1)&&(p38==1))&&(p54==1))))) U (!((p37==1)) * !(E(TRUE U !((((p19=...285
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
(forward)formula 0,1,4.91282,130744,1,0,394,518822,441,133,5805,568556,462
FORMULA MedleyA-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 123 transition count 210
Reduce places removed 19 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 23 rules applied. Total rules applied 43 place count 104 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 102 transition count 204
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 47 place count 102 transition count 198
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 96 transition count 198
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 75 place count 80 transition count 177
Iterating global reduction 3 with 16 rules applied. Total rules applied 91 place count 80 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 80 transition count 176
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 93 place count 79 transition count 176
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 125 place count 62 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 60 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 60 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 60 transition count 152
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 60 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 58 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 138 place count 58 transition count 148
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 142 place count 56 transition count 148
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 5 with 2 rules applied. Total rules applied 144 place count 55 transition count 147
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 53 transition count 145
Applied a total of 146 rules in 27 ms. Remains 53 /127 variables (removed 74) and now considering 145/233 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15168185157929979926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17766920003353142549.kers'
[2026-05-25 09:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15168185157929979926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17766920003353142549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 53 cols 665 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-05-25 09:07:01] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17766920003353142549.kers
Total runtime 3 ms.
[2026-05-25 09:07:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:07:01] [INFO ] Invariant cache hit.
[2026-05-25 09:07:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:07:01] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2026-05-25 09:07:01] [INFO ] Redundant transitions in 2 ms returned []
Running 140 sub problems to find dead transitions.
[2026-05-25 09:07:01] [INFO ] Invariant cache hit.
[2026-05-25 09:07:01] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 145/198 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 77 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3695 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 145/198 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 140/217 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 217 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8541 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12290ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 12292ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/127 places, 145/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12457 ms. Remains : 53/127 places, 145/233 transitions.
[2026-05-25 09:07:14] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:07:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:07:14] [INFO ] Input system was already deterministic with 145 transitions.
[2026-05-25 09:07:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:07:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:07:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5700076295421610292.gal : 5 ms
[2026-05-25 09:07:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17974814162711571881.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/CTLFireability5700076295421610292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17974814162711571881.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,665370,0.205519,12152,2,910,5,29473,6,0,353,34066,0


Converting to forward existential form...Done !
original formula: EG(AG(((((p19==0)||(p27==0))||((p46==0)||(p42==1)))||(p47==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((((p19==0)||(p27==0))||((p46==0)||(p42==1)))||(p47==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t8, t9, t11, t12, t14, t15, t21, t22, t24, t25, t27, t29, t51, t53, t96, t99,...304
(forward)formula 0,0,2.15775,75176,1,0,272,345720,318,88,3496,269986,352
FORMULA MedleyA-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 107 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 107 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 105 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 105 transition count 205
Applied a total of 44 rules in 2 ms. Remains 105 /127 variables (removed 22) and now considering 205/233 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8813607779102363378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14998390765717980726.kers'
[2026-05-25 09:07:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8813607779102363378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14998390765717980726.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 105 cols 977 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:07:16] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14998390765717980726.kers
Total runtime 3 ms.
[2026-05-25 09:07:16] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:07:16] [INFO ] Invariant cache hit.
[2026-05-25 09:07:16] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-25 09:07:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 126 constraints, problems are : Problem set: 0 solved, 204 unsolved in 16955 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SMT process timed out in 47051ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 47051ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 205/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47258 ms. Remains : 105/127 places, 205/233 transitions.
[2026-05-25 09:08:03] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:08:03] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:08:03] [INFO ] Input system was already deterministic with 205 transitions.
[2026-05-25 09:08:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:08:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:08:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2296803183572881720.gal : 14 ms
[2026-05-25 09:08:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5390174100750961568.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/CTLFireability2296803183572881720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5390174100750961568.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.16532e+07,1.30581,50460,2,3294,5,144455,6,0,625,202582,0


Converting to forward existential form...Done !
original formula: (EF(((EX((((p19==1)&&(p58==1))&&((p78==1)&&(p95==1)))) + (((p78==1)&&(p117==1))&&((p121==1)&&(p145==1)))) + ((((((p19==1)&&(p24==1))&&((p...416
=> equivalent forward existential formula: ((([(EY(FwdU(Init,TRUE)) * (((p19==1)&&(p58==1))&&((p78==1)&&(p95==1))))] != FALSE + [(FwdU(Init,TRUE) * (((p78=...774
(forward)formula 0,1,1.35832,50460,1,0,8,144455,8,1,1178,202582,2
FORMULA MedleyA-PT-09-CTLFireability-2024-06 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 : 127/127 places, 233/233 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 107 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 107 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 105 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 105 transition count 206
Applied a total of 44 rules in 6 ms. Remains 105 /127 variables (removed 22) and now considering 206/233 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3228050810101502514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17195358393188528876.kers'
[2026-05-25 09:08:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3228050810101502514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17195358393188528876.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 105 cols 979 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 09:08:05] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17195358393188528876.kers
Total runtime 3 ms.
[2026-05-25 09:08:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:08:05] [INFO ] Invariant cache hit.
[2026-05-25 09:08:05] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:08:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 127 constraints, problems are : Problem set: 0 solved, 205 unsolved in 19718 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 205/330 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 339 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49816ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 49817ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50144 ms. Remains : 105/127 places, 206/233 transitions.
[2026-05-25 09:08:55] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:08:55] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:08:55] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-25 09:08:55] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:08:55] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:08:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11338759307879277554.gal : 2 ms
[2026-05-25 09:08:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10698613008401654491.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/CTLFireability11338759307879277554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10698613008401654491.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.16422e+07,2.58547,62208,2,4176,5,180035,6,0,626,253118,0


Converting to forward existential form...Done !
original formula: EX((AG(AF((((p19==1)&&(p58==1))&&((p78==1)&&(p91==1))))) + (AF((EF((p136==1)) * (p116==1))) * EX((((p19==1)&&(p58==1))&&((p78==1)&&(p95==...163
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(!(EG(!((((p19==1)&&(p58==1))&&((p78==1)&&(p91==1))))))))))] != FALSE + [(EY((EY(Init)...262
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t26, t27, t29, t30, t32, t33, t34, t35, t37, t39, t41,...442
Detected timeout of ITS tools.
[2026-05-25 09:09:25] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:09:25] [INFO ] Applying decomposition
[2026-05-25 09:09:25] [INFO ] Flatten gal took : 12 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/graph6516864783975791760.txt' '-o' '/tmp/graph6516864783975791760.bin' '-w' '/tmp/graph6516864783975791760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6516864783975791760.bin' '-l' '-1' '-v' '-w' '/tmp/graph6516864783975791760.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:09:25] [INFO ] Decomposing Gal with order
[2026-05-25 09:09:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:09:25] [INFO ] Removed a total of 365 redundant transitions.
[2026-05-25 09:09:25] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:09:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 5 ms.
[2026-05-25 09:09:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10682835233096584168.gal : 2 ms
[2026-05-25 09:09:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2210019410818900946.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/CTLFireability10682835233096584168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2210019410818900946.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.16422e+07,0.091038,8092,522,96,7441,625,349,17626,91,2505,0


Converting to forward existential form...Done !
original formula: EX((AG(AF((((i4.u2.p19==1)&&(i4.u2.p58==1))&&((i7.u15.p78==1)&&(i6.u20.p91==1))))) + (AF((EF((i1.i1.u29.p136==1)) * (i7.u24.p116==1))) * ...232
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(!(EG(!((((i4.u2.p19==1)&&(i4.u2.p58==1))&&((i7.u15.p78==1)&&(i6.u20.p91==1))))))))))]...331
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t64, i1.i0.u25.t16, i1.i0.u25.t143, i1.i1.t15, i1.i1.u27.t14, i2.u1.t95, i2.u4.t92, ...719
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,29.6153,682916,1,0,1.01666e+06,4249,2142,3.32045e+06,460,34325,748359
FORMULA MedleyA-PT-09-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 109 transition count 211
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 109 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 107 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 107 transition count 207
Applied a total of 40 rules in 8 ms. Remains 107 /127 variables (removed 20) and now considering 207/233 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9451224098134580905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1986051009635877164.kers'
[2026-05-25 09:09:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9451224098134580905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1986051009635877164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 107 cols 981 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:09:55] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1986051009635877164.kers
Total runtime 3 ms.
[2026-05-25 09:09:55] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 09:09:55] [INFO ] Invariant cache hit.
[2026-05-25 09:09:55] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 09:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/314 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 130 constraints, problems are : Problem set: 0 solved, 206 unsolved in 18257 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/314 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 206/334 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 341 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48368ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 48368ms
Starting structural reductions in LTL mode, iteration 1 : 107/127 places, 207/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48721 ms. Remains : 107/127 places, 207/233 transitions.
[2026-05-25 09:10:44] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:10:44] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:44] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:10:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16469304111099927015.gal : 1 ms
[2026-05-25 09:10:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1285325150752096653.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/CTLFireability16469304111099927015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1285325150752096653.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.744e+07,1.58714,49860,2,3681,5,143923,6,0,635,218690,0


Converting to forward existential form...Done !
original formula: (!(A(((AF((p110!=1)) * AX(FALSE)) + AG(EX((p102==1)))) U EF(AG((p4==1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(!((E(!(E(TRUE U !(E(TRUE U !((p4==1)))))) U (!(((!(EG(!((p110!=1)))) * !(EX(!(FALSE)))) + !(E(T...292
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t31, t32, t33, t38, t39, t41, t45, t46, t47,...432
Detected timeout of ITS tools.
[2026-05-25 09:11:14] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:11:14] [INFO ] Applying decomposition
[2026-05-25 09:11:14] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17577313752553295618.txt' '-o' '/tmp/graph17577313752553295618.bin' '-w' '/tmp/graph17577313752553295618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17577313752553295618.bin' '-l' '-1' '-v' '-w' '/tmp/graph17577313752553295618.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:11:14] [INFO ] Decomposing Gal with order
[2026-05-25 09:11:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:11:14] [INFO ] Removed a total of 388 redundant transitions.
[2026-05-25 09:11:14] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:11:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 10 ms.
[2026-05-25 09:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6175744696659756499.gal : 4 ms
[2026-05-25 09:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability316128144369502238.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/CTLFireability6175744696659756499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability316128144369502238.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 -...261
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.744e+07,0.292998,14264,570,112,17647,1098,412,41993,96,6547,0


Converting to forward existential form...Done !
original formula: (!(A(((AF((i8.u24.p110!=1)) * AX(FALSE)) + AG(EX((i8.u23.p102==1)))) U EF(AG((i2.u3.p4==1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(!((E(!(E(TRUE U !(E(TRUE U !((i2.u3.p4==1)))))) U (!(((!(EG(!((i8.u24.p110!=1)))) * !(EX(!(FALS...324
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t72, t77, t79, t96, i0.i1.u28.t14, i0.i1.u28.t15, i1.u4.t93, i1.u27.t16, i1.u27.t144...667
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 108 transition count 210
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 108 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 106 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 106 transition count 206
Applied a total of 42 rules in 3 ms. Remains 106 /127 variables (removed 21) and now considering 206/233 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10624259636100744176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8716764413442362845.kers'
[2026-05-25 09:11:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10624259636100744176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8716764413442362845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 106 cols 979 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:11:44] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8716764413442362845.kers
Total runtime 1 ms.
[2026-05-25 09:11:44] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:11:44] [INFO ] Invariant cache hit.
[2026-05-25 09:11:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:11:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 127 constraints, problems are : Problem set: 0 solved, 205 unsolved in 19684 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/330 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 339 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49782ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 49783ms
Starting structural reductions in LTL mode, iteration 1 : 106/127 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50017 ms. Remains : 106/127 places, 206/233 transitions.
[2026-05-25 09:12:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:12:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:12:34] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-25 09:12:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:12:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:12:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11462557448942705792.gal : 1 ms
[2026-05-25 09:12:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13407553275238832243.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/CTLFireability11462557448942705792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13407553275238832243.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.57657e+07,2.71713,66860,2,5753,5,190369,6,0,630,274155,0


Converting to forward existential form...Done !
original formula: AX(A(E((p125==1) U (p111==1)) U AF((p23==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),!(!(EG(!((p23==1)))))) * !(E((p125==1) U (p111==1)))),!((p23==1)))] = FALSE * [FwdG(EY(Ini...190
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t17, t18, t23, t24, t25, t26, t28, t29, t31, t32, t33, t36, t38, t40, t41,...437
Detected timeout of ITS tools.
[2026-05-25 09:13:04] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:13:04] [INFO ] Applying decomposition
[2026-05-25 09:13:04] [INFO ] Flatten gal took : 5 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/graph17658894632712596294.txt' '-o' '/tmp/graph17658894632712596294.bin' '-w' '/tmp/graph17658894632712596294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17658894632712596294.bin' '-l' '-1' '-v' '-w' '/tmp/graph17658894632712596294.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:13:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:13:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:13:04] [INFO ] Removed a total of 346 redundant transitions.
[2026-05-25 09:13:04] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:13:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2026-05-25 09:13:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9737651177936367105.gal : 2 ms
[2026-05-25 09:13:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6943583915061303875.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/CTLFireability9737651177936367105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6943583915061303875.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.57657e+07,0.201371,13416,761,129,14841,977,405,48687,104,5307,0


Converting to forward existential form...Done !
original formula: AX(A(E((i3.i0.u25.p125==1) U (i5.u24.p111==1)) U AF((i0.u5.p23==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),!(!(EG(!((i0.u5.p23==1)))))) * !(E((i3.i0.u25.p125==1) U (i5.u24.p111==1)))),!((i0.u5.p23=...225
Reverse transition relation is NOT exact ! Due to transitions t7, t25, t63, i0.u2.t95, i0.u5.t91, i0.u5.t92, i1.t78, i1.u6.t61, i1.u6.t89, i1.u6.t90, i1.u7...745
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 110 transition count 212
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 110 transition count 212
Applied a total of 34 rules in 2 ms. Remains 110 /127 variables (removed 17) and now considering 212/233 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10483375805244207937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2981613334859628139.kers'
[2026-05-25 09:13:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10483375805244207937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2981613334859628139.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 110 cols 991 entries
Finished phase 1 with 96 SingleSign rule and 4 generalized
[2026-05-25 09:13:34] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2981613334859628139.kers
Total runtime 1 ms.
[2026-05-25 09:13:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:13:34] [INFO ] Invariant cache hit.
[2026-05-25 09:13:34] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 09:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/322 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 133 constraints, problems are : Problem set: 0 solved, 211 unsolved in 20482 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/322 variables, 110/131 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 211/342 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 350 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50617ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 50621ms
Starting structural reductions in LTL mode, iteration 1 : 110/127 places, 212/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50838 ms. Remains : 110/127 places, 212/233 transitions.
[2026-05-25 09:14:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:14:25] [INFO ] Input system was already deterministic with 212 transitions.
[2026-05-25 09:14:25] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:14:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8230099034681017830.gal : 4 ms
[2026-05-25 09:14:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16103758206408479083.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/CTLFireability8230099034681017830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16103758206408479083.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,7.09068e+07,4.62636,112484,2,8848,5,297554,6,0,652,505413,0


Converting to forward existential form...Done !
original formula: AF((((AF(((!(A((p33==1) U (p45==1))) * (p73==0)) + AX((((p19==1)&&(p58==1))&&((p121==1)&&(p143==1)))))) * (p78==1)) * ((p97==1)&&(p105==1...319
=> equivalent forward existential formula: [FwdG(Init,!((((!(EG(!(((!(!((E(!((p45==1)) U (!((p33==1)) * !((p45==1)))) + EG(!((p45==1)))))) * (p73==0)) + !(...421
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t17, t23, t24, t26, t28, t29, t31, t32, t33, t36, t38, t39, t41, t43, t44,...460
Detected timeout of ITS tools.
[2026-05-25 09:14:55] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:14:55] [INFO ] Applying decomposition
[2026-05-25 09:14:55] [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/graph14278487157874000319.txt' '-o' '/tmp/graph14278487157874000319.bin' '-w' '/tmp/graph14278487157874000319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14278487157874000319.bin' '-l' '-1' '-v' '-w' '/tmp/graph14278487157874000319.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:14:55] [INFO ] Decomposing Gal with order
[2026-05-25 09:14:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:14:55] [INFO ] Removed a total of 406 redundant transitions.
[2026-05-25 09:14:55] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:14:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2026-05-25 09:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3183921144773898137.gal : 2 ms
[2026-05-25 09:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1611431799821474826.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/CTLFireability3183921144773898137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1611431799821474826.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,7.09068e+07,0.216971,13028,597,120,16259,1051,451,40946,92,5899,0


Converting to forward existential form...Done !
original formula: AF((((AF(((!(A((i1.u9.p33==1) U (i2.u13.p45==1))) * (i5.u17.p73==0)) + AX((((i2.u4.p19==1)&&(i2.u14.p58==1))&&((i7.i0.u29.p121==1)&&(i7.i...487
=> equivalent forward existential formula: [FwdG(Init,!((((!(EG(!(((!(!((E(!((i2.u13.p45==1)) U (!((i1.u9.p33==1)) * !((i2.u13.p45==1)))) + EG(!((i2.u13.p4...603
Reverse transition relation is NOT exact ! Due to transitions t7, i1.t90, i1.t89, i1.t88, i1.t84, i1.u7.t65, i1.u7.t95, i1.u7.t96, i1.u8.t92, i1.u8.t93, i1...751
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 123 transition count 211
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 105 transition count 207
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 103 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 102 transition count 204
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 47 place count 102 transition count 199
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 57 place count 97 transition count 199
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 74 place count 80 transition count 176
Iterating global reduction 4 with 17 rules applied. Total rules applied 91 place count 80 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 80 transition count 174
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 95 place count 78 transition count 174
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 129 place count 60 transition count 158
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 58 transition count 154
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 58 transition count 154
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 138 place count 58 transition count 149
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 4 with 1 rules applied. Total rules applied 139 place count 58 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 140 place count 57 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 140 place count 57 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 142 place count 56 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 146 place count 54 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 52 transition count 143
Applied a total of 148 rules in 51 ms. Remains 52 /127 variables (removed 75) and now considering 143/233 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15763385720829153704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5111886635018681286.kers'
[2026-05-25 09:15:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15763385720829153704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5111886635018681286.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 52 cols 598 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-25 09:15:25] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5111886635018681286.kers
Total runtime 0 ms.
[2026-05-25 09:15:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 09:15:25] [INFO ] Invariant cache hit.
[2026-05-25 09:15:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:15:26] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2026-05-25 09:15:26] [INFO ] Redundant transitions in 2 ms returned []
Running 137 sub problems to find dead transitions.
[2026-05-25 09:15:26] [INFO ] Invariant cache hit.
[2026-05-25 09:15:26] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 143/195 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 76 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3958 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 143/195 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 137/213 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 213 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7567 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11584ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 11585ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/127 places, 143/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11862 ms. Remains : 52/127 places, 143/233 transitions.
[2026-05-25 09:15:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:15:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:15:37] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-25 09:15:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:15:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:15:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9808495684607062084.gal : 6 ms
[2026-05-25 09:15:37] [INFO ] Time to serialize properties into /tmp/CTLFireability13037012304554209744.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/CTLFireability9808495684607062084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13037012304554209744.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,509780,0.119871,8804,2,463,5,18576,6,0,347,18071,0


Converting to forward existential form...Done !
original formula: EF((AG((p135!=1)) * (p93==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p93==1)) * !(E(TRUE U !((p135!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t15, t16, t19, t35, t92, t110, t133, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,0.863576,30904,1,0,202,132957,309,69,3244,100415,310
FORMULA MedleyA-PT-09-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 123 transition count 213
Reduce places removed 16 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 20 rules applied. Total rules applied 37 place count 107 transition count 209
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 105 transition count 207
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 41 place count 105 transition count 201
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 99 transition count 201
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 72 place count 80 transition count 176
Iterating global reduction 3 with 19 rules applied. Total rules applied 91 place count 80 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 80 transition count 175
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 93 place count 79 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 78 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 78 transition count 173
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 125 place count 62 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 61 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 61 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 132 place count 61 transition count 152
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 133 place count 61 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 60 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 134 place count 60 transition count 149
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 138 place count 58 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 142 place count 56 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 55 transition count 146
Applied a total of 143 rules in 41 ms. Remains 55 /127 variables (removed 72) and now considering 146/233 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13237742692257726934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11207724954370564357.kers'
[2026-05-25 09:15:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13237742692257726934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11207724954370564357.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 55 cols 707 entries
Finished phase 1 with 45 SingleSign rule and 2 generalized
[2026-05-25 09:15:38] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11207724954370564357.kers
Total runtime 1 ms.
[2026-05-25 09:15:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:15:38] [INFO ] Invariant cache hit.
[2026-05-25 09:15:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:15:38] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2026-05-25 09:15:38] [INFO ] Redundant transitions in 2 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-25 09:15:38] [INFO ] Invariant cache hit.
[2026-05-25 09:15:38] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 146/200 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 79 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5366 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 146/200 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 138/216 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 217 constraints, problems are : Problem set: 0 solved, 138 unsolved in 14759 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20219ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 20225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/127 places, 146/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20478 ms. Remains : 55/127 places, 146/233 transitions.
[2026-05-25 09:15:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:15:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:15:59] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-25 09:15:59] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:15:59] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:15:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10246877500460060174.gal : 1 ms
[2026-05-25 09:15:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2803747756943518646.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/CTLFireability10246877500460060174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2803747756943518646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF((EG(((((p19==0)||(p58==0))||((p121==0)||(p139==0)))&&(p92==0))) + (p131==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EG(((((p19==0)||(p58==0))||((p121==0)||(p139==0)))&&(p92==0))) + (p131==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t6, t9, t10, t12, t15, t18, t19, t21, t22, t23, t26, t28, t30, t36, t37, t38, t39...394
(forward)formula 0,1,23.9622,521404,1,0,789,3.03834e+06,322,316,3912,2.8598e+06,945
FORMULA MedleyA-PT-09-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 424 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 123 transition count 213
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 107 transition count 210
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 106 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 105 transition count 207
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 41 place count 105 transition count 203
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 49 place count 101 transition count 203
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 65 place count 85 transition count 182
Iterating global reduction 4 with 16 rules applied. Total rules applied 81 place count 85 transition count 182
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 83 transition count 178
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 83 transition count 178
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 117 place count 66 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 66 transition count 157
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 2 rules applied. Total rules applied 125 place count 66 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 64 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 127 place count 64 transition count 153
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 131 place count 62 transition count 153
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 135 place count 60 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 137 place count 58 transition count 149
Applied a total of 137 rules in 14 ms. Remains 58 /127 variables (removed 69) and now considering 149/233 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2461326265970285020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1006550435984196676.kers'
[2026-05-25 09:16:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2461326265970285020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1006550435984196676.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 58 cols 754 entries
Finished phase 1 with 48 SingleSign rule and 2 generalized
[2026-05-25 09:16:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1006550435984196676.kers
Total runtime 1 ms.
[2026-05-25 09:16:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:16:23] [INFO ] Invariant cache hit.
[2026-05-25 09:16:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:16:23] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2026-05-25 09:16:23] [INFO ] Redundant transitions in 1 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-25 09:16:23] [INFO ] Invariant cache hit.
[2026-05-25 09:16:23] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 4/58 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 149/207 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 84 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5750 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 4/58 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 149/207 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 141/225 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 225 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35834ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 35834ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/127 places, 149/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36065 ms. Remains : 58/127 places, 149/233 transitions.
[2026-05-25 09:16:59] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:16:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:16:59] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-25 09:16:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:16:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:16:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5778371633857170822.gal : 1 ms
[2026-05-25 09:16:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9863715232441006335.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/CTLFireability5778371633857170822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9863715232441006335.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,2.08216e+06,0.5224,25068,2,1479,5,80109,6,0,380,74228,0


Converting to forward existential form...Done !
original formula: EF(AG((((p31!=1)&&(p73==0))&&((p66==0)&&((p44==0)||((p126==0)&&(((p19==0)||(p32==0))||((p78==0)||(p117==0)))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p31!=1)&&(p73==0))&&((p66==0)&&((p44==0)||((p126==0)&&(((p19==0)||(p32==0))|...196
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t8, t11, t13, t16, t18, t19, t20, t21, t22, t24, t25, t26, t29, t31, ...415
(forward)formula 0,1,5.1542,142552,1,0,295,729406,320,102,3921,498704,346
FORMULA MedleyA-PT-09-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:17:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:17:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:17:04] [INFO ] Applying decomposition
[2026-05-25 09:17:04] [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/graph8881938582434581934.txt' '-o' '/tmp/graph8881938582434581934.bin' '-w' '/tmp/graph8881938582434581934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8881938582434581934.bin' '-l' '-1' '-v' '-w' '/tmp/graph8881938582434581934.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:17:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:17:04] [INFO ] Removed a total of 480 redundant transitions.
[2026-05-25 09:17:04] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2026-05-25 09:17:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15112474420483547671.gal : 2 ms
[2026-05-25 09:17:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14969668282108564073.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/CTLFireability15112474420483547671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14969668282108564073.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81645e+08,0.428343,19348,918,103,23621,475,507,71707,98,2316,0


Converting to forward existential form...Done !
original formula: (EF(AX(FALSE)) * EX(AF(!(E(A(((i4.u14.p71==1)&&(i5.u19.p84==1)) U (((i0.u4.p19==1)&&(i3.u12.p58==1))&&((i7.i1.u29.p121==1)&&(i7.i1.u34.p1...275
=> equivalent forward existential formula: [(EY((Init * E(TRUE U !(EX(!(FALSE)))))) * !(EG(!(!(E(!((E(!((((i0.u4.p19==1)&&(i3.u12.p58==1))&&((i7.i1.u29.p12...525
Reverse transition relation is NOT exact ! Due to transitions t7, i0.u2.t118, i0.u2.t121, i0.u2.t122, i0.u2.t123, i0.u4.t114, i0.u4.t115, i0.u4.t116, i0.u4...1054
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,49.5215,1070848,1,0,1.42939e+06,2170,3216,5.5505e+06,532,11811,1133660
FORMULA MedleyA-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(A(((AF((i6.u27.p110!=1)) * AX(FALSE)) + AG(EX((i6.u25.p102==1)))) U EF(AG((i0.u2.p4==1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(!((E(!(E(TRUE U !(E(TRUE U !((i0.u2.p4==1)))))) U (!(((!(EG(!((i6.u27.p110!=1)))) * !(EX(!(FALS...324
(forward)formula 1,1,69.3502,1397644,1,0,1.79867e+06,2170,3239,6.81683e+06,533,11813,1335247
FORMULA MedleyA-PT-09-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(A(E((i7.i1.u30.p125==1) U (i6.u27.p111==1)) U AF((i1.u6.p23==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),!(!(EG(!((i1.u6.p23==1)))))) * !(E((i7.i1.u30.p125==1) U (i6.u27.p111==1)))),!((i1.u6.p23=...225
(forward)formula 2,0,133.954,2208128,1,0,2.85313e+06,2286,1064,9.53951e+06,210,15742,348469
FORMULA MedleyA-PT-09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((AF(((!(A((i2.u8.p33==1) U (i3.u10.p45==1))) * (i4.u16.p73==0)) + AX((((i0.u4.p19==1)&&(i3.u12.p58==1))&&((i7.i1.u29.p121==1)&&(i7.i...489
=> equivalent forward existential formula: [FwdG(Init,!((((!(EG(!(((!(!((E(!((i3.u10.p45==1)) U (!((i2.u8.p33==1)) * !((i3.u10.p45==1)))) + EG(!((i3.u10.p4...605
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,0,179.65,2208128,1,0,2.85313e+06,2286,1718,9.53951e+06,278,16623,1544817
FORMULA MedleyA-PT-09-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1250187 ms.

BK_STOP 1779700804809

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

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

Sequence of Actions to be Executed by the VM

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

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

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