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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 130K 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-20-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779701636275

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:33:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:33:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:33:58] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2026-05-25 09:33:58] [INFO ] Transformed 273 places.
[2026-05-25 09:33:58] [INFO ] Transformed 518 transitions.
[2026-05-25 09:33:58] [INFO ] Found NUPN structural information;
[2026-05-25 09:33:58] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 93 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 194 transition count 439
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 194 transition count 439
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 161 place count 194 transition count 436
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 176 place count 179 transition count 393
Iterating global reduction 1 with 15 rules applied. Total rules applied 191 place count 179 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 192 place count 179 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 178 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 178 transition count 390
Applied a total of 194 rules in 53 ms. Remains 178 /273 variables (removed 95) and now considering 390/518 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-880290969944937077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7651055980228557576.kers'
[2026-05-25 09:33:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-880290969944937077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7651055980228557576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 178 cols 1395 entries
Finished phase 1 with 162 SingleSign rule and 5 generalized
[2026-05-25 09:33:58] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7651055980228557576.kers
Total runtime 2 ms.
[2026-05-25 09:33:58] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-25 09:33:58] [INFO ] Invariant cache hit.
[2026-05-25 09:33:58] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2026-05-25 09:33:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 389 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 178/568 variables, and 51 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/178 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 390/568 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 389/627 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 628 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in LTL mode, iteration 1 : 178/273 places, 390/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61067 ms. Remains : 178/273 places, 390/518 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2026-05-25 09:34:59] [INFO ] Invariant cache hit.
[2026-05-25 09:34:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:34:59] [INFO ] Invariant cache hit.
[2026-05-25 09:34:59] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 178/178 places, 390/390 transitions.
Support contains 93 out of 178 places after structural reductions.
[2026-05-25 09:34:59] [INFO ] Flatten gal took : 63 ms
[2026-05-25 09:34:59] [INFO ] Flatten gal took : 41 ms
[2026-05-25 09:34:59] [INFO ] Input system was already deterministic with 390 transitions.
Support contains 92 out of 178 places (down from 93) after GAL structural reductions.
RANDOM walk for 40000 steps (61 resets) in 1870 ms. (21 steps per ms) remains 40/71 properties
BEST_FIRST walk for 4003 steps (19 resets) in 43 ms. (90 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4003 steps (14 resets) in 47 ms. (83 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 45 ms. (87 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4003 steps (23 resets) in 56 ms. (70 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (17 resets) in 56 ms. (70 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (16 resets) in 17 ms. (222 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (25 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (20 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4001 steps (15 resets) in 13 ms. (285 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (14 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (18 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (16 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
[2026-05-25 09:35:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/169 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 9/178 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 390/568 variables, 178/189 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/568 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 189 constraints, problems are : Problem set: 3 solved, 14 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 138/169 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 9/178 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 390/568 variables, 178/189 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 14/203 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 1/204 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/568 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 204 constraints, problems are : Problem set: 3 solved, 14 unsolved in 2520 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 14/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3259ms problems are : Problem set: 3 solved, 14 unsolved
Parikh walk visited 8 properties in 4043 ms.
Support contains 19 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 131 edges and 178 vertex of which 21 / 178 are part of one of the 3 SCC in 5 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 160 transition count 357
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 158 transition count 355
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 158 transition count 352
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 13 place count 155 transition count 352
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 41 place count 127 transition count 296
Iterating global reduction 2 with 28 rules applied. Total rules applied 69 place count 127 transition count 296
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 76 place count 127 transition count 289
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 78 place count 126 transition count 288
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 78 place count 126 transition count 285
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 84 place count 123 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 122 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 122 transition count 282
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 122 place count 104 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 104 transition count 262
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 127 place count 101 transition count 253
Iterating global reduction 5 with 3 rules applied. Total rules applied 130 place count 101 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 101 transition count 252
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 100 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 99 transition count 247
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 99 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 136 place count 99 transition count 246
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 150 place count 92 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 160 place count 92 transition count 247
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 163 place count 89 transition count 238
Iterating global reduction 7 with 3 rules applied. Total rules applied 166 place count 89 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 169 place count 89 transition count 235
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 193 place count 89 transition count 211
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 217 place count 65 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 220 place count 65 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 221 place count 64 transition count 207
Applied a total of 221 rules in 78 ms. Remains 64 /178 variables (removed 114) and now considering 207/390 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 64/178 places, 207/390 transitions.
RANDOM walk for 40000 steps (10 resets) in 860 ms. (46 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 65 ms. (606 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 75 ms. (526 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 75 ms. (526 steps per ms) remains 1/2 properties
BEST_FIRST walk for 7380 steps (2 resets) in 9 ms. (738 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-25 09:35:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:35:08] [INFO ] Flatten gal took : 17 ms
FORMULA MedleyA-PT-20-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:35:08] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:35:08] [INFO ] Input system was already deterministic with 390 transitions.
Support contains 88 out of 178 places (down from 90) after GAL structural reductions.
Computed a total of 14 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 136 edges and 178 vertex of which 21 / 178 are part of one of the 3 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 159 transition count 359
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 156 transition count 357
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 156 transition count 354
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 15 place count 153 transition count 354
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 46 place count 122 transition count 291
Iterating global reduction 2 with 31 rules applied. Total rules applied 77 place count 122 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 84 place count 122 transition count 284
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 86 place count 121 transition count 283
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 86 place count 121 transition count 279
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 94 place count 117 transition count 279
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 115 transition count 274
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 115 transition count 274
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 114 transition count 271
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 114 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 114 transition count 270
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 127 place count 101 transition count 257
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 131 place count 97 transition count 245
Iterating global reduction 5 with 4 rules applied. Total rules applied 135 place count 97 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 137 place count 97 transition count 243
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 139 place count 96 transition count 242
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 141 place count 94 transition count 238
Iterating global reduction 7 with 2 rules applied. Total rules applied 143 place count 94 transition count 238
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 145 place count 92 transition count 232
Iterating global reduction 7 with 2 rules applied. Total rules applied 147 place count 92 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 149 place count 92 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 154 place count 92 transition count 225
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 8 with 1 rules applied. Total rules applied 155 place count 92 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 156 place count 91 transition count 224
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 162 place count 88 transition count 221
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 165 place count 85 transition count 212
Iterating global reduction 10 with 3 rules applied. Total rules applied 168 place count 85 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 171 place count 85 transition count 209
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 172 place count 85 transition count 209
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 174 place count 83 transition count 207
Applied a total of 174 rules in 50 ms. Remains 83 /178 variables (removed 95) and now considering 207/390 (removed 183) transitions.
[2026-05-25 09:35:08] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9526106320602192242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14115561238159282583.kers'
[2026-05-25 09:35:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9526106320602192242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14115561238159282583.kers]
Normalized transition count is 197 out of 198 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 83 cols 766 entries
Finished phase 1 with 67 SingleSign rule and 5 generalized
[2026-05-25 09:35:08] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14115561238159282583.kers
Total runtime 3 ms.
[2026-05-25 09:35:08] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:35:08] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2026-05-25 09:35:08] [INFO ] Invariant cache hit.
[2026-05-25 09:35:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:35:08] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2026-05-25 09:35:08] [INFO ] Redundant transitions in 5 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-25 09:35:08] [INFO ] Flow matrix only has 198 transitions (discarded 9 similar events)
[2026-05-25 09:35:08] [INFO ] Invariant cache hit.
[2026-05-25 09:35:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 197/280 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 100 constraints, problems are : Problem set: 0 solved, 179 unsolved in 15375 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 197/280 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 179/277 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 279 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 25481ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 25482ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/178 places, 207/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25741 ms. Remains : 83/178 places, 207/390 transitions.
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:35:34] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14402101696159441524.gal : 11 ms
[2026-05-25 09:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9917709788097189536.ctl : 11 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/CTLFireability14402101696159441524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9917709788097189536.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,3.39925e+07,2.24824,65720,2,7522,5,212102,6,0,538,256285,0


Converting to forward existential form...Done !
original formula: EF((EG((((E(((p227==1)&&(p245==1)) U (p173==1)) * AG((p139==1))) * ((p10==1)&&(p25==1))) * ((p110==1)&&(p214==1)))) * (((p10==0)||(p21==0...170
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (((p10==0)||(p21==0))||(p99==0))),(((E(((p227==1)&&(p245==1)) U (p173==1)) * !(E(TRUE U...232
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t18, t21, t22, t25, t30, t34, t37, t38, t44, t86, t87, t88, t89, t90, t91, t98, t...481
(forward)formula 0,0,10.4028,270196,1,0,435,1.39674e+06,444,190,4757,1.17706e+06,429
FORMULA MedleyA-PT-20-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 142 transition count 322
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 142 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 142 transition count 317
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 90 place count 129 transition count 286
Iterating global reduction 1 with 13 rules applied. Total rules applied 103 place count 129 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 129 transition count 285
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 125 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 125 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 125 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 124 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 124 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 124 transition count 270
Applied a total of 117 rules in 24 ms. Remains 124 /178 variables (removed 54) and now considering 270/390 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11233588567697272803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1761838224368429854.kers'
[2026-05-25 09:35:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11233588567697272803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1761838224368429854.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 124 cols 939 entries
Finished phase 1 with 108 SingleSign rule and 5 generalized
[2026-05-25 09:35:44] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1761838224368429854.kers
Total runtime 3 ms.
[2026-05-25 09:35:45] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 09:35:45] [INFO ] Invariant cache hit.
[2026-05-25 09:35:45] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2026-05-25 09:35:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 270/394 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 11 (OVERLAPS) 0/394 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 29047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 270/394 variables, 124/161 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 269/430 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 439 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 59128ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 59130ms
Starting structural reductions in LTL mode, iteration 1 : 124/178 places, 270/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59527 ms. Remains : 124/178 places, 270/390 transitions.
[2026-05-25 09:36:44] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:36:44] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:44] [INFO ] Input system was already deterministic with 270 transitions.
[2026-05-25 09:36:44] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:36:44] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:36:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4544842264162492096.gal : 8 ms
[2026-05-25 09:36:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10828214049230967604.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/CTLFireability4544842264162492096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10828214049230967604.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.
Detected timeout of ITS tools.
[2026-05-25 09:37:14] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:37:14] [INFO ] Applying decomposition
[2026-05-25 09:37: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/graph2459825045210032655.txt' '-o' '/tmp/graph2459825045210032655.bin' '-w' '/tmp/graph2459825045210032655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2459825045210032655.bin' '-l' '-1' '-v' '-w' '/tmp/graph2459825045210032655.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:37:14] [INFO ] Decomposing Gal with order
[2026-05-25 09:37:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:37:14] [INFO ] Removed a total of 384 redundant transitions.
[2026-05-25 09:37:14] [INFO ] Flatten gal took : 71 ms
[2026-05-25 09:37:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 9 ms.
[2026-05-25 09:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11450302825302390322.gal : 4 ms
[2026-05-25 09:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10821814603155241669.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/CTLFireability11450302825302390322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10821814603155241669.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.41404e+08,1.29417,39684,823,148,69890,2180,550,112850,145,8486,0


Converting to forward existential form...Done !
original formula: EF((A(!(((i8.u27.p255==1)||((i2.u5.p20==1)&&(i4.u16.p128==1)))) U ((((i4.u14.p113==1)&&(i0.u2.p10==1))&&((i2.u5.p21==1)&&(i5.u19.p204==1)...285
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((E(!(((((i4.u14.p113==1)&&(i0.u2.p10==1))&&((i2.u5.p21==1)&&(i5.u19.p204==1)))&&(!((...601
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t45, t99, t100, t102, t112, t146, t168, t174, t175, t176, t177, t178, t179, t180, t1...736
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 146 edges and 178 vertex of which 24 / 178 are part of one of the 3 SCC in 2 ms
Free SCC test removed 21 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 156 transition count 353
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 153 transition count 351
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 153 transition count 345
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 147 transition count 345
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 55 place count 113 transition count 275
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 113 transition count 275
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 98 place count 113 transition count 266
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 100 place count 112 transition count 265
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 100 place count 112 transition count 261
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 108 place count 108 transition count 261
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 112 place count 104 transition count 250
Iterating global reduction 4 with 4 rules applied. Total rules applied 116 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 103 transition count 247
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 103 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 103 transition count 246
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 145 place count 90 transition count 233
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 148 place count 87 transition count 224
Iterating global reduction 5 with 3 rules applied. Total rules applied 151 place count 87 transition count 224
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 5 with 3 rules applied. Total rules applied 154 place count 87 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 156 place count 86 transition count 220
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 158 place count 84 transition count 216
Iterating global reduction 7 with 2 rules applied. Total rules applied 160 place count 84 transition count 216
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 162 place count 82 transition count 210
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 82 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 166 place count 82 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 169 place count 82 transition count 205
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 175 place count 79 transition count 202
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 177 place count 77 transition count 196
Iterating global reduction 8 with 2 rules applied. Total rules applied 179 place count 77 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 181 place count 77 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 183 place count 75 transition count 192
Applied a total of 183 rules in 119 ms. Remains 75 /178 variables (removed 103) and now considering 192/390 (removed 198) transitions.
[2026-05-25 09:37:44] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15875488433160808773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12663961288886301993.kers'
[2026-05-25 09:37:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15875488433160808773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12663961288886301993.kers]
Normalized transition count is 181 out of 182 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 181 rows 74 cols 648 entries
Finished phase 1 with 59 SingleSign rule and 5 generalized
[2026-05-25 09:37:44] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12663961288886301993.kers
Total runtime 3 ms.
[2026-05-25 09:37:45] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 09:37:45] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
[2026-05-25 09:37:45] [INFO ] Invariant cache hit.
[2026-05-25 09:37:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:37:45] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-05-25 09:37:45] [INFO ] Redundant transitions in 3 ms returned []
Running 166 sub problems to find dead transitions.
[2026-05-25 09:37:45] [INFO ] Flow matrix only has 182 transitions (discarded 10 similar events)
[2026-05-25 09:37:45] [INFO ] Invariant cache hit.
[2026-05-25 09:37:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 181/256 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/257 variables, and 92 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9400 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 181/256 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 166/258 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/257 variables, and 261 constraints, problems are : Problem set: 0 solved, 166 unsolved in 20462 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29896ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 29897ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/178 places, 192/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30242 ms. Remains : 75/178 places, 192/390 transitions.
[2026-05-25 09:38:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:38:15] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:38:15] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-25 09:38:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:38:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:38:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5054147799124749447.gal : 2 ms
[2026-05-25 09:38:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3592364420599182967.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/CTLFireability5054147799124749447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3592364420599182967.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,7.64411e+06,4.90535,120824,2,7757,5,357023,6,0,491,448238,0


Converting to forward existential form...Done !
original formula: AG((AG((p189==0)) * AF(((p127==0)||(p245==0)))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((p189==0)))] = FALSE * [FwdG(FwdU(Init,TRUE),!(((p127==0)||(p245==0))))] = FAL...158
Hit Full ! (commute/partial/dont) 180/11/12
(forward)formula 0,0,6.67811,121464,1,0,9,437999,20,2,2903,448238,8
FORMULA MedleyA-PT-20-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 144 transition count 323
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 144 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 144 transition count 318
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 83 place count 134 transition count 294
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 134 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 134 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 132 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 132 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 132 transition count 287
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 131 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 131 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 131 transition count 283
Applied a total of 103 rules in 15 ms. Remains 131 /178 variables (removed 47) and now considering 283/390 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-294596477978177095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5111699041226208984.kers'
[2026-05-25 09:38:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-294596477978177095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5111699041226208984.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 131 cols 983 entries
Finished phase 1 with 115 SingleSign rule and 5 generalized
[2026-05-25 09:38:21] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5111699041226208984.kers
Total runtime 2 ms.
[2026-05-25 09:38:22] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-25 09:38:22] [INFO ] Invariant cache hit.
[2026-05-25 09:38:22] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 09:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 283/414 variables, 131/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 162 constraints, problems are : Problem set: 0 solved, 282 unsolved in 27807 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 283/414 variables, 131/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 282/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 452 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 57877ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 57877ms
Starting structural reductions in LTL mode, iteration 1 : 131/178 places, 283/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58175 ms. Remains : 131/178 places, 283/390 transitions.
[2026-05-25 09:39:20] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:39:20] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:39:20] [INFO ] Input system was already deterministic with 283 transitions.
[2026-05-25 09:39:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:39:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:39:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11601829196703004471.gal : 2 ms
[2026-05-25 09:39:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7252215264036390817.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/CTLFireability11601829196703004471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7252215264036390817.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.
Detected timeout of ITS tools.
[2026-05-25 09:39:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:39:50] [INFO ] Applying decomposition
[2026-05-25 09:39:50] [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/graph3078901770739248558.txt' '-o' '/tmp/graph3078901770739248558.bin' '-w' '/tmp/graph3078901770739248558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3078901770739248558.bin' '-l' '-1' '-v' '-w' '/tmp/graph3078901770739248558.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:39:50] [INFO ] Decomposing Gal with order
[2026-05-25 09:39:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:39:50] [INFO ] Removed a total of 414 redundant transitions.
[2026-05-25 09:39:50] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:39:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 11 ms.
[2026-05-25 09:39:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8611780109040624700.gal : 2 ms
[2026-05-25 09:39:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7685223593890964507.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/CTLFireability8611780109040624700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7685223593890964507.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,1.31454e+09,0.977787,33284,939,104,52569,1328,565,93925,126,2980,0


Converting to forward existential form...Done !
original formula: (EG(AX((EG((((i0.u1.p10==0)||(i4.u4.p21==0))||(i2.u9.p68==0))) * AX((i2.u8.p37==0))))) + ((EG(EF((((i0.u1.p10==0)||(i4.u4.p21==0))||(i6.u...336
=> equivalent forward existential formula: (([((Init * !(EG(!(EX(!((EG((((i0.u1.p10==0)||(i4.u4.p21==0))||(i2.u9.p68==0))) * !(EX(!((i2.u8.p37==0))))))))))...671
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t49, t106, t107, t109, t127, t147, t169, t188, t189, t190, t191, t192, t193, t194, t...693
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 142 transition count 319
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 142 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 142 transition count 315
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 129 transition count 282
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 129 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 129 transition count 279
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 125 transition count 270
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 125 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 125 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 124 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 124 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 124 transition count 264
Applied a total of 118 rules in 11 ms. Remains 124 /178 variables (removed 54) and now considering 264/390 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5147499746095041318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10075057619435195027.kers'
[2026-05-25 09:40:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5147499746095041318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10075057619435195027.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 124 cols 903 entries
Finished phase 1 with 108 SingleSign rule and 5 generalized
[2026-05-25 09:40:20] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10075057619435195027.kers
Total runtime 2 ms.
[2026-05-25 09:40:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:40:20] [INFO ] Invariant cache hit.
[2026-05-25 09:40:20] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2026-05-25 09:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 264/388 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 161 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 264/388 variables, 124/162 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 263/425 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 435 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 124/178 places, 264/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60334 ms. Remains : 124/178 places, 264/390 transitions.
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:41:20] [INFO ] Input system was already deterministic with 264 transitions.
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:41:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13226213422176671264.gal : 2 ms
[2026-05-25 09:41:20] [INFO ] Time to serialize properties into /tmp/CTLFireability260063287706575053.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/CTLFireability13226213422176671264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability260063287706575053.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.
Detected timeout of ITS tools.
[2026-05-25 09:41:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:41:50] [INFO ] Applying decomposition
[2026-05-25 09:41:50] [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/graph8692706784738008327.txt' '-o' '/tmp/graph8692706784738008327.bin' '-w' '/tmp/graph8692706784738008327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8692706784738008327.bin' '-l' '-1' '-v' '-w' '/tmp/graph8692706784738008327.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:41:50] [INFO ] Decomposing Gal with order
[2026-05-25 09:41:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:41:50] [INFO ] Removed a total of 361 redundant transitions.
[2026-05-25 09:41:50] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2026-05-25 09:41:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7996787403790643426.gal : 2 ms
[2026-05-25 09:41:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9323677925310227137.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/CTLFireability7996787403790643426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9323677925310227137.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,8.72585e+08,1.23253,40012,712,176,67660,1916,507,122610,124,6130,0


Converting to forward existential form...Done !
original formula: (EF((AG(EF((i5.u19.p154==0))) * ((i4.u13.p86==1) + AG(AF(((u4.p20==0)||(i6.u20.p206==0))))))) * AF(((A((((EF((((i1.u1.p10==1)&&(u5.p25==1...414
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(E(TRUE U !(E(TRUE U (i5.u19.p154==0))))) * ((i4.u13.p86==1) + !(E(TRUE U !(!(EG(!(((u4.p...626
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t45, t100, t102, t112, t146, t168, t177, t178, t179, t180, t181, t182, t183, t206, t...661
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 139 transition count 316
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 139 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 83 place count 139 transition count 311
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 96 place count 126 transition count 281
Iterating global reduction 1 with 13 rules applied. Total rules applied 109 place count 126 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 126 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 123 transition count 271
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 123 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 123 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 122 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 122 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 122 transition count 265
Applied a total of 123 rules in 25 ms. Remains 122 /178 variables (removed 56) and now considering 265/390 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10988619251635923956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7521774811924623849.kers'
[2026-05-25 09:42:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10988619251635923956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7521774811924623849.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 122 cols 935 entries
Finished phase 1 with 106 SingleSign rule and 5 generalized
[2026-05-25 09:42:21] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7521774811924623849.kers
Total runtime 1 ms.
[2026-05-25 09:42:21] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:42:21] [INFO ] Invariant cache hit.
[2026-05-25 09:42:21] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-25 09:42:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 265/387 variables, 122/146 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 153 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 265/387 variables, 122/150 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 264/414 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 426 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 122/178 places, 265/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 122/178 places, 265/390 transitions.
[2026-05-25 09:43:21] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:43:21] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:43:21] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-25 09:43:21] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:43:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:43:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2768931061523549272.gal : 2 ms
[2026-05-25 09:43:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4212518999483598569.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/CTLFireability2768931061523549272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4212518999483598569.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,7.95299e+08,27.8817,515316,2,17931,5,1.39268e+06,6,0,755,2.03106e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:43:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:43:51] [INFO ] Applying decomposition
[2026-05-25 09:43:51] [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/graph4179952245163113233.txt' '-o' '/tmp/graph4179952245163113233.bin' '-w' '/tmp/graph4179952245163113233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4179952245163113233.bin' '-l' '-1' '-v' '-w' '/tmp/graph4179952245163113233.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:43:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:43:51] [INFO ] Removed a total of 390 redundant transitions.
[2026-05-25 09:43:51] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2026-05-25 09:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6046192402322027225.gal : 2 ms
[2026-05-25 09:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17887143152723907718.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/CTLFireability6046192402322027225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17887143152723907718.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,7.95299e+08,0.357429,18208,622,95,27031,1116,513,46255,130,2399,0


Converting to forward existential form...Done !
original formula: A(!((!(A(!(((i1.u3.p16==1)&&(i6.u22.p190==1))) U ((((i1.u1.p10==1)&&(u5.p25==1))&&((i6.u20.p215==1)&&(i1.u1.p10==1)))&&((i1.u3.p17==1)&&(...292
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((EX((i6.u22.p198==1)) * EX(((i1.u1.p10==1)&&(i9.u28.p265==1)))))))))))) * !(E(!(...782
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t45, t95, t97, t166, t167, t168, t169, t170, t171, t173, t174, t175, t176, t177, t17...601
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 113 edges and 178 vertex of which 14 / 178 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 165 transition count 369
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 163 transition count 368
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 163 transition count 364
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 159 transition count 364
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 47 place count 126 transition count 299
Iterating global reduction 2 with 33 rules applied. Total rules applied 80 place count 126 transition count 299
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 126 transition count 293
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 88 place count 125 transition count 292
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 88 place count 125 transition count 288
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 96 place count 121 transition count 288
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 105 place count 112 transition count 265
Iterating global reduction 4 with 9 rules applied. Total rules applied 114 place count 112 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 112 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 111 transition count 263
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 122 place count 106 transition count 252
Iterating global reduction 6 with 5 rules applied. Total rules applied 127 place count 106 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 130 place count 106 transition count 249
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 132 place count 104 transition count 243
Iterating global reduction 7 with 2 rules applied. Total rules applied 134 place count 104 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 136 place count 104 transition count 241
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 164 place count 90 transition count 227
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 165 place count 89 transition count 224
Iterating global reduction 8 with 1 rules applied. Total rules applied 166 place count 89 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 170 place count 89 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 171 place count 89 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 172 place count 88 transition count 219
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 10 with 2 rules applied. Total rules applied 174 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 175 place count 86 transition count 215
Iterating global reduction 10 with 1 rules applied. Total rules applied 176 place count 86 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 177 place count 86 transition count 214
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 178 place count 86 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 180 place count 86 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 182 place count 85 transition count 211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 184 place count 83 transition count 209
Applied a total of 184 rules in 45 ms. Remains 83 /178 variables (removed 95) and now considering 209/390 (removed 181) transitions.
[2026-05-25 09:44:21] [INFO ] Flow matrix only has 201 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16409376509737391276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9773333611440559620.kers'
[2026-05-25 09:44:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16409376509737391276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9773333611440559620.kers]
Normalized transition count is 200 out of 201 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 83 cols 760 entries
Finished phase 1 with 67 SingleSign rule and 5 generalized
[2026-05-25 09:44:21] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9773333611440559620.kers
Total runtime 1 ms.
[2026-05-25 09:44:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:44:21] [INFO ] Flow matrix only has 201 transitions (discarded 8 similar events)
[2026-05-25 09:44:21] [INFO ] Invariant cache hit.
[2026-05-25 09:44:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:44:21] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-25 09:44:21] [INFO ] Redundant transitions in 5 ms returned []
Running 187 sub problems to find dead transitions.
[2026-05-25 09:44:21] [INFO ] Flow matrix only has 201 transitions (discarded 8 similar events)
[2026-05-25 09:44:21] [INFO ] Invariant cache hit.
[2026-05-25 09:44:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 200/283 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/284 variables, and 99 constraints, problems are : Problem set: 0 solved, 187 unsolved in 12595 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 200/283 variables, 83/97 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 187/286 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/284 variables, and 286 constraints, problems are : Problem set: 0 solved, 187 unsolved in 10770 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23411ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 23412ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/178 places, 209/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23684 ms. Remains : 83/178 places, 209/390 transitions.
[2026-05-25 09:44:45] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:44:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:44:45] [INFO ] Input system was already deterministic with 209 transitions.
[2026-05-25 09:44:45] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:44:45] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:44:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1315919175121198445.gal : 3 ms
[2026-05-25 09:44:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7714146560512925013.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/CTLFireability1315919175121198445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7714146560512925013.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.46993e+07,2.16295,61984,2,6940,5,215414,6,0,541,236451,0


Converting to forward existential form...Done !
original formula: (EF(EG((p160==1))) + E((((EG((p162==1)) * EG(AF((p169==1)))) * ((p10==1)&&(p21==1))) * (p35==1)) U E(EF(!(((p20==1)&&(p190==1)))) U AF(((...191
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(p160==1))] != FALSE + [(FwdU(FwdU(Init,(((EG((p162==1)) * EG(!(EG(!((p169==1)))))) * ((p...281
Hit Full ! (commute/partial/dont) 204/0/5
(forward)formula 0,1,3.95799,86868,1,0,9,417011,19,2,3143,236451,8
FORMULA MedleyA-PT-20-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 138 transition count 313
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 138 transition count 313
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 85 place count 138 transition count 308
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 99 place count 124 transition count 275
Iterating global reduction 1 with 14 rules applied. Total rules applied 113 place count 124 transition count 275
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 116 place count 124 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 121 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 121 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 121 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 120 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 120 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 120 transition count 259
Applied a total of 127 rules in 13 ms. Remains 120 /178 variables (removed 58) and now considering 259/390 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13794274029352283864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7293790603890681662.kers'
[2026-05-25 09:44:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13794274029352283864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7293790603890681662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 120 cols 899 entries
Finished phase 1 with 104 SingleSign rule and 5 generalized
[2026-05-25 09:44:49] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7293790603890681662.kers
Total runtime 1 ms.
[2026-05-25 09:44:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 09:44:49] [INFO ] Invariant cache hit.
[2026-05-25 09:44:49] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-25 09:44:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 259/379 variables, 120/146 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 21256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 259/379 variables, 120/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 419 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 51314ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 51315ms
Starting structural reductions in LTL mode, iteration 1 : 120/178 places, 259/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51575 ms. Remains : 120/178 places, 259/390 transitions.
[2026-05-25 09:45:41] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:45:41] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:45:41] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-25 09:45:41] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:45:41] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:45:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13738236912684840500.gal : 2 ms
[2026-05-25 09:45:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3586840660295787405.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/CTLFireability13738236912684840500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3586840660295787405.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.31358e+08,22.8637,486496,2,17774,5,1.44392e+06,6,0,741,2.16526e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:46:11] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:46:11] [INFO ] Applying decomposition
[2026-05-25 09:46:11] [INFO ] Flatten gal took : 10 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/graph11252302497572924924.txt' '-o' '/tmp/graph11252302497572924924.bin' '-w' '/tmp/graph11252302497572924924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11252302497572924924.bin' '-l' '-1' '-v' '-w' '/tmp/graph11252302497572924924.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:46:11] [INFO ] Decomposing Gal with order
[2026-05-25 09:46:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:46:11] [INFO ] Removed a total of 377 redundant transitions.
[2026-05-25 09:46:11] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:46:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 6 ms.
[2026-05-25 09:46:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12068113650823171862.gal : 3 ms
[2026-05-25 09:46:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7474996350181488514.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/CTLFireability12068113650823171862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7474996350181488514.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,7.31358e+08,0.330247,15664,570,111,21061,1342,515,36360,118,3347,0


Converting to forward existential form...Done !
original formula: AG(E((EF((i5.u15.p117==1)) * !(((i6.u20.p208==1)&&(i7.u25.p236==1)))) U EX(EX(AX((i5.u16.p135==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E(TRUE U (i5.u15.p117==1)) * !(((i6.u20.p208==1)&&(i7.u25.p236==1)))) U EX(EX(!(EX(!((i...186
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t95, t97, t169, t170, t171, t173, t174, t175, t176, t177, t178, t201, t202, t20...639
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 142 transition count 321
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 142 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 142 transition count 316
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 88 place count 131 transition count 290
Iterating global reduction 1 with 11 rules applied. Total rules applied 99 place count 131 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 131 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 129 transition count 283
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 129 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 129 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 128 transition count 279
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 128 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 128 transition count 278
Applied a total of 109 rules in 6 ms. Remains 128 /178 variables (removed 50) and now considering 278/390 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13531451697493003721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9554829443283655424.kers'
[2026-05-25 09:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13531451697493003721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9554829443283655424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 278 rows 128 cols 961 entries
Finished phase 1 with 112 SingleSign rule and 5 generalized
[2026-05-25 09:46:41] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9554829443283655424.kers
Total runtime 5 ms.
[2026-05-25 09:46:41] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 09:46:41] [INFO ] Invariant cache hit.
[2026-05-25 09:46:41] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2026-05-25 09:46:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 278/406 variables, 128/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 12 (OVERLAPS) 0/406 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 166 constraints, problems are : Problem set: 0 solved, 277 unsolved in 28894 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 278/406 variables, 128/168 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 277/445 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 457 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 58966ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 58970ms
Starting structural reductions in LTL mode, iteration 1 : 128/178 places, 278/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59353 ms. Remains : 128/178 places, 278/390 transitions.
[2026-05-25 09:47:40] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:47:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:47:40] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-25 09:47:40] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:47:40] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:47:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9384913352934258349.gal : 1 ms
[2026-05-25 09:47:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5087745531653869694.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/CTLFireability9384913352934258349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5087745531653869694.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.
Detected timeout of ITS tools.
[2026-05-25 09:48:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:48:10] [INFO ] Applying decomposition
[2026-05-25 09:48:10] [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/graph5632555052204500672.txt' '-o' '/tmp/graph5632555052204500672.bin' '-w' '/tmp/graph5632555052204500672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5632555052204500672.bin' '-l' '-1' '-v' '-w' '/tmp/graph5632555052204500672.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:48:10] [INFO ] Decomposing Gal with order
[2026-05-25 09:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:48:10] [INFO ] Removed a total of 405 redundant transitions.
[2026-05-25 09:48:10] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2026-05-25 09:48:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13572313955227626527.gal : 2 ms
[2026-05-25 09:48:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15736114417553907658.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/CTLFireability13572313955227626527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15736114417553907658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2533e+09,1.07001,38800,894,86,64564,1492,550,106422,106,4901,0


Converting to forward existential form...Done !
original formula: EF(AG(((((EX(((i4.u19.p141==1)&&(i8.u28.p252==1))) + AX(((i4.u19.p161==1)&&(i8.u29.p259==1)))) + (EG((i4.u14.p137==1)) + A((((i1.u1.p10==...429
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((EX(((i4.u19.p141==1)&&(i8.u28.p252==1))) + !(EX(!(((i4.u19.p161==1)&&(i8.u2...673
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t44, t104, t106, t124, t126, t145, t147, t168, t170, t182, t183, t184, t186, t187, t...725
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 139 transition count 318
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 139 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 83 place count 139 transition count 313
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 97 place count 125 transition count 279
Iterating global reduction 1 with 14 rules applied. Total rules applied 111 place count 125 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 114 place count 125 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 121 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 121 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 121 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 120 transition count 262
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 120 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 120 transition count 261
Applied a total of 127 rules in 6 ms. Remains 120 /178 variables (removed 58) and now considering 261/390 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7957519149164312675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13376728543203979280.kers'
[2026-05-25 09:48:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7957519149164312675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13376728543203979280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 120 cols 909 entries
Finished phase 1 with 104 SingleSign rule and 5 generalized
[2026-05-25 09:48:40] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13376728543203979280.kers
Total runtime 2 ms.
[2026-05-25 09:48:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:48:41] [INFO ] Invariant cache hit.
[2026-05-25 09:48:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 09:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/381 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (OVERLAPS) 0/381 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 156 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23975 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/381 variables, 120/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 260/413 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 422 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 54029ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54029ms
Starting structural reductions in LTL mode, iteration 1 : 120/178 places, 261/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54253 ms. Remains : 120/178 places, 261/390 transitions.
[2026-05-25 09:49:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:49:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:49:35] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-25 09:49:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:49:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:49:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15221405249790745005.gal : 1 ms
[2026-05-25 09:49:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7737641914818426640.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/CTLFireability15221405249790745005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7737641914818426640.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.35949e+08,28.8885,509468,2,18726,5,1.45178e+06,6,0,743,2.1914e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:50:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:50:05] [INFO ] Applying decomposition
[2026-05-25 09:50:05] [INFO ] Flatten gal took : 9 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/graph18419379366999513920.txt' '-o' '/tmp/graph18419379366999513920.bin' '-w' '/tmp/graph18419379366999513920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18419379366999513920.bin' '-l' '-1' '-v' '-w' '/tmp/graph18419379366999513920.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:50:05] [INFO ] Decomposing Gal with order
[2026-05-25 09:50:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:50:05] [INFO ] Removed a total of 390 redundant transitions.
[2026-05-25 09:50:05] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:50:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2026-05-25 09:50:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12135430774951856184.gal : 2 ms
[2026-05-25 09:50:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7812803899019408767.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/CTLFireability12135430774951856184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7812803899019408767.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,7.35949e+08,1.05039,32964,737,60,53646,680,504,102069,85,1963,0


Converting to forward existential form...Done !
original formula: A((EG(!((((AG((i4.u16.p150==1)) + (((i0.u1.p10==1)&&(u4.p21==1))&&(i6.u22.p213==1))) + (i4.u14.p132==1)) * (EX(((u4.p20==1)&&(i6.u24.p193...288
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (((i0.u1.p10==1)&&(i0.u5.p25==1))&&(i3.u11.p79==1)))))))) * !(E(!(!(E(TRUE U (((i0.u...511
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t94, t96, t113, t133, t155, t168, t169, t170, t171, t172, t173, t174, t175, t17...623
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 143 edges and 178 vertex of which 21 / 178 are part of one of the 3 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 159 transition count 358
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 156 transition count 356
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 156 transition count 350
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 21 place count 150 transition count 350
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 55 place count 116 transition count 282
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 116 transition count 282
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 116 transition count 274
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 99 place count 115 transition count 273
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 99 place count 115 transition count 269
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 111 transition count 269
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 107 transition count 258
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 107 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 106 transition count 255
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 106 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 106 transition count 254
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 144 place count 93 transition count 241
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 148 place count 89 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 152 place count 89 transition count 229
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 5 with 3 rules applied. Total rules applied 155 place count 89 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 88 transition count 225
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 159 place count 86 transition count 221
Iterating global reduction 7 with 2 rules applied. Total rules applied 161 place count 86 transition count 221
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 163 place count 84 transition count 215
Iterating global reduction 7 with 2 rules applied. Total rules applied 165 place count 84 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 167 place count 84 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 172 place count 84 transition count 208
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 8 with 1 rules applied. Total rules applied 173 place count 84 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 174 place count 83 transition count 207
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 180 place count 80 transition count 204
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 183 place count 77 transition count 195
Iterating global reduction 10 with 3 rules applied. Total rules applied 186 place count 77 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 189 place count 77 transition count 192
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 190 place count 77 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 192 place count 75 transition count 190
Applied a total of 192 rules in 35 ms. Remains 75 /178 variables (removed 103) and now considering 190/390 (removed 200) transitions.
[2026-05-25 09:50:35] [INFO ] Flow matrix only has 180 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7844673250695471838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14355750598757238012.kers'
[2026-05-25 09:50:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7844673250695471838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14355750598757238012.kers]
Normalized transition count is 179 out of 180 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 179 rows 74 cols 638 entries
Finished phase 1 with 59 SingleSign rule and 5 generalized
[2026-05-25 09:50:35] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14355750598757238012.kers
Total runtime 1 ms.
[2026-05-25 09:50:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:50:35] [INFO ] Flow matrix only has 180 transitions (discarded 10 similar events)
[2026-05-25 09:50:35] [INFO ] Invariant cache hit.
[2026-05-25 09:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:50:35] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2026-05-25 09:50:35] [INFO ] Redundant transitions in 1 ms returned []
Running 164 sub problems to find dead transitions.
[2026-05-25 09:50:35] [INFO ] Flow matrix only has 180 transitions (discarded 10 similar events)
[2026-05-25 09:50:35] [INFO ] Invariant cache hit.
[2026-05-25 09:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 179/254 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/255 variables, and 91 constraints, problems are : Problem set: 0 solved, 164 unsolved in 15489 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 179/254 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 164/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/255 variables, and 255 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8980 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24491ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 24491ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/178 places, 190/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24705 ms. Remains : 75/178 places, 190/390 transitions.
[2026-05-25 09:51:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:51:00] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:51:00] [INFO ] Input system was already deterministic with 190 transitions.
[2026-05-25 09:51:00] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:51:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:51:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15570167668650094224.gal : 1 ms
[2026-05-25 09:51:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16381881100126919752.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15570167668650094224.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16381881100126919752.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16381881100126919752.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 350
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :350 after 540
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :540 after 1020
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1020 after 1226
RANDOM walk for 40000 steps (18 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30126 steps (12 resets) in 32 ms. (912 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1226 after 2087
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 143 edges and 178 vertex of which 24 / 178 are part of one of the 3 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 156 transition count 353
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 153 transition count 351
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 153 transition count 347
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 149 transition count 347
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 52 place count 114 transition count 276
Iterating global reduction 2 with 35 rules applied. Total rules applied 87 place count 114 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 96 place count 114 transition count 267
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 98 place count 113 transition count 266
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 98 place count 113 transition count 262
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 109 transition count 262
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 106 transition count 254
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 106 transition count 254
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 105 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 105 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 105 transition count 250
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 141 place count 92 transition count 237
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 145 place count 88 transition count 225
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 88 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 151 place count 88 transition count 223
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 87 transition count 222
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 155 place count 85 transition count 218
Iterating global reduction 7 with 2 rules applied. Total rules applied 157 place count 85 transition count 218
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 159 place count 83 transition count 212
Iterating global reduction 7 with 2 rules applied. Total rules applied 161 place count 83 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 163 place count 83 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 166 place count 83 transition count 207
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 172 place count 80 transition count 204
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 175 place count 77 transition count 195
Iterating global reduction 8 with 3 rules applied. Total rules applied 178 place count 77 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 181 place count 77 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 183 place count 75 transition count 190
Applied a total of 183 rules in 34 ms. Remains 75 /178 variables (removed 103) and now considering 190/390 (removed 200) transitions.
[2026-05-25 09:51:00] [INFO ] Flow matrix only has 181 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15275286962908069528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12007132083768166664.kers'
[2026-05-25 09:51:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15275286962908069528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12007132083768166664.kers]
Normalized transition count is 180 out of 181 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 75 cols 702 entries
Finished phase 1 with 59 SingleSign rule and 5 generalized
[2026-05-25 09:51:00] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12007132083768166664.kers
Total runtime 1 ms.
[2026-05-25 09:51:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:51:00] [INFO ] Flow matrix only has 181 transitions (discarded 9 similar events)
[2026-05-25 09:51:00] [INFO ] Invariant cache hit.
[2026-05-25 09:51:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:51:00] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-25 09:51:00] [INFO ] Redundant transitions in 0 ms returned []
Running 164 sub problems to find dead transitions.
[2026-05-25 09:51:00] [INFO ] Flow matrix only has 181 transitions (discarded 9 similar events)
[2026-05-25 09:51:00] [INFO ] Invariant cache hit.
[2026-05-25 09:51:00] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/75 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 180/255 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/255 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/255 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 92 constraints, problems are : Problem set: 0 solved, 164 unsolved in 15029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/75 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 180/255 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 164/255 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 0/255 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 257 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12868 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27930ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 27931ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/178 places, 190/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28126 ms. Remains : 75/178 places, 190/390 transitions.
[2026-05-25 09:51:28] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:51:28] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:51:28] [INFO ] Input system was already deterministic with 190 transitions.
[2026-05-25 09:51:28] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:51:28] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15495869869964242325.gal : 2 ms
[2026-05-25 09:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15323289008142194099.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/CTLFireability15495869869964242325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15323289008142194099.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.50685e+07,1.28818,45596,2,6063,5,151525,6,0,489,163208,0


Converting to forward existential form...Done !
original formula: EG(EF((((p10==1)&&(p21==1))&&(p99==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p10==1)&&(p21==1))&&(p99==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t17, t18, t24, t28, t31, t32, t38, t76, t77, t78, t79, t80, t81, t88, t...459
Detected timeout of ITS tools.
[2026-05-25 09:51:58] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:51:58] [INFO ] Applying decomposition
[2026-05-25 09:51:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9538542804986046338.txt' '-o' '/tmp/graph9538542804986046338.bin' '-w' '/tmp/graph9538542804986046338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9538542804986046338.bin' '-l' '-1' '-v' '-w' '/tmp/graph9538542804986046338.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:51:58] [INFO ] Decomposing Gal with order
[2026-05-25 09:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:51:58] [INFO ] Removed a total of 314 redundant transitions.
[2026-05-25 09:51:58] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2026-05-25 09:51:58] [INFO ] Time to serialize gal into /tmp/CTLFireability629839561002717970.gal : 2 ms
[2026-05-25 09:51:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18310842416944530673.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/CTLFireability629839561002717970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18310842416944530673.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,1.50685e+07,0.089473,7308,243,78,6076,336,342,10109,81,993,0


Converting to forward existential form...Done !
original formula: EG(EF((((u1.p10==1)&&(u3.p21==1))&&(i4.u8.p99==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((u1.p10==1)&&(u3.p21==1))&&(i4.u8.p99==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t79, t80, t81, t88, t89, t90, t109, t110, t111, t136, t138, t140, t143, t147, t148, t155, t15...427
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,5.03626,166716,1,0,270821,6935,1987,585939,417,43960,617151
FORMULA MedleyA-PT-20-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 120 edges and 178 vertex of which 18 / 178 are part of one of the 2 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 161 transition count 362
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 159 transition count 361
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 159 transition count 357
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 155 transition count 357
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 49 place count 120 transition count 286
Iterating global reduction 2 with 35 rules applied. Total rules applied 84 place count 120 transition count 286
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 93 place count 120 transition count 277
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 95 place count 119 transition count 276
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 95 place count 119 transition count 272
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 103 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 109 place count 109 transition count 257
Iterating global reduction 4 with 6 rules applied. Total rules applied 115 place count 109 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 109 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 108 transition count 255
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 121 place count 105 transition count 249
Iterating global reduction 6 with 3 rules applied. Total rules applied 124 place count 105 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 126 place count 105 transition count 247
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 127 place count 104 transition count 244
Iterating global reduction 7 with 1 rules applied. Total rules applied 128 place count 104 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 104 transition count 243
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 155 place count 91 transition count 230
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 157 place count 89 transition count 224
Iterating global reduction 8 with 2 rules applied. Total rules applied 159 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 160 place count 88 transition count 222
Iterating global reduction 8 with 1 rules applied. Total rules applied 161 place count 88 transition count 222
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 162 place count 87 transition count 219
Iterating global reduction 8 with 1 rules applied. Total rules applied 163 place count 87 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 164 place count 87 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 169 place count 87 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 87 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 171 place count 86 transition count 212
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 175 place count 84 transition count 210
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 177 place count 82 transition count 204
Iterating global reduction 11 with 2 rules applied. Total rules applied 179 place count 82 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 181 place count 82 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 183 place count 80 transition count 200
Applied a total of 183 rules in 83 ms. Remains 80 /178 variables (removed 98) and now considering 200/390 (removed 190) transitions.
[2026-05-25 09:52:03] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12457789363319171915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5731760853280888477.kers'
[2026-05-25 09:52:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12457789363319171915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5731760853280888477.kers]
Normalized transition count is 191 out of 192 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 80 cols 736 entries
Finished phase 1 with 64 SingleSign rule and 5 generalized
[2026-05-25 09:52:03] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5731760853280888477.kers
Total runtime 2 ms.
[2026-05-25 09:52:03] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 09:52:03] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2026-05-25 09:52:03] [INFO ] Invariant cache hit.
[2026-05-25 09:52:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:52:04] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2026-05-25 09:52:04] [INFO ] Redundant transitions in 0 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-25 09:52:04] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2026-05-25 09:52:04] [INFO ] Invariant cache hit.
[2026-05-25 09:52:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 191/271 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 97 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 191/271 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 181/277 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 278 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9355 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23626ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 23627ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/178 places, 200/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23947 ms. Remains : 80/178 places, 200/390 transitions.
[2026-05-25 09:52:27] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:52:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:52:27] [INFO ] Input system was already deterministic with 200 transitions.
[2026-05-25 09:52:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:52:27] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:52:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13168571029138797573.gal : 1 ms
[2026-05-25 09:52:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1753655938333024631.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/CTLFireability13168571029138797573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1753655938333024631.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(E((A((p162==1) U (p64==1)) + ((p16==1)&&(p60==1))) U !((((p10==1)&&(p25==1))&&(p215==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((!((E(!((p64==1)) U (!((p162==1)) * !((p64==1)))) + EG(!((p64==1))))) + ((p16...225
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t14, t17, t18, t25, t29, t32, t33, t37, t41, t82, t83, t84, t85, t86, t87, t97, t98, ...476
Detected timeout of ITS tools.
[2026-05-25 09:52:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:52:57] [INFO ] Applying decomposition
[2026-05-25 09:52:57] [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/graph17015131669027346463.txt' '-o' '/tmp/graph17015131669027346463.bin' '-w' '/tmp/graph17015131669027346463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17015131669027346463.bin' '-l' '-1' '-v' '-w' '/tmp/graph17015131669027346463.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:52:57] [INFO ] Decomposing Gal with order
[2026-05-25 09:52:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:52:57] [INFO ] Removed a total of 305 redundant transitions.
[2026-05-25 09:52:57] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2026-05-25 09:52:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16384138832368082133.gal : 1 ms
[2026-05-25 09:52:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14123160717903505806.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/CTLFireability16384138832368082133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14123160717903505806.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.06408e+07,0.095647,8016,224,153,7013,659,346,12266,118,2689,0


Converting to forward existential form...Done !
original formula: EF(AG(E((A((i4.u8.p162==1) U (i3.u4.p64==1)) + ((u1.p16==1)&&(i3.u4.p60==1))) U !((((u0.p10==1)&&(u3.p25==1))&&(i6.u9.p215==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((!((E(!((i3.u4.p64==1)) U (!((i4.u8.p162==1)) * !((i3.u4.p64==1)))) + EG(!((i...270
Reverse transition relation is NOT exact ! Due to transitions t85, t86, t87, t100, t101, t102, t118, t119, t120, t146, t148, t152, t154, t155, t158, t161, ...438
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,6.07316,201296,1,0,277447,27076,2037,851623,589,242475,549073
FORMULA MedleyA-PT-20-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Graph (trivial) has 146 edges and 178 vertex of which 24 / 178 are part of one of the 3 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 156 transition count 353
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 153 transition count 351
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 153 transition count 345
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 21 place count 147 transition count 345
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 56 place count 112 transition count 274
Iterating global reduction 2 with 35 rules applied. Total rules applied 91 place count 112 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 100 place count 112 transition count 265
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 102 place count 111 transition count 264
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 102 place count 111 transition count 260
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 110 place count 107 transition count 260
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 103 transition count 249
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 103 transition count 249
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 102 transition count 246
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 102 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 102 transition count 245
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 147 place count 89 transition count 232
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 151 place count 85 transition count 220
Iterating global reduction 5 with 4 rules applied. Total rules applied 155 place count 85 transition count 220
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 5 with 3 rules applied. Total rules applied 158 place count 85 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 160 place count 84 transition count 216
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 162 place count 82 transition count 212
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 82 transition count 212
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 166 place count 80 transition count 206
Iterating global reduction 7 with 2 rules applied. Total rules applied 168 place count 80 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 170 place count 80 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 173 place count 80 transition count 201
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 179 place count 77 transition count 198
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 181 place count 75 transition count 192
Iterating global reduction 8 with 2 rules applied. Total rules applied 183 place count 75 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 185 place count 75 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 187 place count 73 transition count 188
Applied a total of 187 rules in 64 ms. Remains 73 /178 variables (removed 105) and now considering 188/390 (removed 202) transitions.
[2026-05-25 09:53:04] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-188723666203871694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8534501233249311468.kers'
[2026-05-25 09:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-188723666203871694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8534501233249311468.kers]
Normalized transition count is 177 out of 178 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 177 rows 72 cols 634 entries
Finished phase 1 with 57 SingleSign rule and 5 generalized
[2026-05-25 09:53:04] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8534501233249311468.kers
Total runtime 4 ms.
[2026-05-25 09:53:04] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 09:53:04] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
[2026-05-25 09:53:04] [INFO ] Invariant cache hit.
[2026-05-25 09:53:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:53:04] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2026-05-25 09:53:04] [INFO ] Redundant transitions in 0 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-25 09:53:04] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
[2026-05-25 09:53:04] [INFO ] Invariant cache hit.
[2026-05-25 09:53:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 3/73 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 177/250 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/251 variables, and 90 constraints, problems are : Problem set: 0 solved, 162 unsolved in 13991 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 3/73 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 177/250 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 162/250 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/251 variables, and 253 constraints, problems are : Problem set: 0 solved, 162 unsolved in 20146 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 34170ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 34171ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/178 places, 188/390 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34494 ms. Remains : 73/178 places, 188/390 transitions.
[2026-05-25 09:53:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:53:38] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:53:38] [INFO ] Input system was already deterministic with 188 transitions.
[2026-05-25 09:53:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:53:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:53:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17908859952643664014.gal : 1 ms
[2026-05-25 09:53:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4257013113308378350.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17908859952643664014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4257013113308378350.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 30043 steps (28 resets) in 125 ms. (238 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 390/390 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 143 transition count 324
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 143 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 143 transition count 321
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 86 place count 130 transition count 289
Iterating global reduction 1 with 13 rules applied. Total rules applied 99 place count 130 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 102 place count 130 transition count 286
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 126 transition count 277
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 126 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 126 transition count 275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 124 transition count 269
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 124 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 124 transition count 267
Applied a total of 118 rules in 11 ms. Remains 124 /178 variables (removed 54) and now considering 267/390 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5965488926227936440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14401929045407585761.kers'
[2026-05-25 09:53:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5965488926227936440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14401929045407585761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 124 cols 927 entries
Finished phase 1 with 108 SingleSign rule and 5 generalized
[2026-05-25 09:53:38] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14401929045407585761.kers
Total runtime 1 ms.
[2026-05-25 09:53:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:53:38] [INFO ] Invariant cache hit.
[2026-05-25 09:53:38] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-25 09:53:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 267/391 variables, 124/154 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/391 variables, and 165 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 267/391 variables, 124/162 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 266/428 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 435 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 124/178 places, 267/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60348 ms. Remains : 124/178 places, 267/390 transitions.
[2026-05-25 09:54:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:54:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:54:39] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-25 09:54:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:54:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:54:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12794985811496450205.gal : 2 ms
[2026-05-25 09:54:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3995577664270636270.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/CTLFireability12794985811496450205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3995577664270636270.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,9.22327e+08,23.1212,547812,2,19027,5,1.61808e+06,6,0,765,2.42073e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:55:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:55:09] [INFO ] Applying decomposition
[2026-05-25 09:55:09] [INFO ] Flatten gal took : 3 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/graph18200966292929386667.txt' '-o' '/tmp/graph18200966292929386667.bin' '-w' '/tmp/graph18200966292929386667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18200966292929386667.bin' '-l' '-1' '-v' '-w' '/tmp/graph18200966292929386667.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:55:09] [INFO ] Decomposing Gal with order
[2026-05-25 09:55:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:55:09] [INFO ] Removed a total of 400 redundant transitions.
[2026-05-25 09:55:09] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:55:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 6 ms.
[2026-05-25 09:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6742284210321563805.gal : 3 ms
[2026-05-25 09:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15053722678293234293.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6742284210321563805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15053722678293234293.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,9.22327e+08,0.765897,31552,856,99,53792,1260,533,97955,96,2993,0


Converting to forward existential form...Done !
original formula: E((i4.i1.u19.p154==1) U A(((!((!(((i0.u1.p10==1)&&(u4.p21==1))&&((i6.u22.p182==1)&&(i4.i1.u19.p126==1))))&&((((i4.i0.u18.p159==1)&&(i7.u2...328
=> equivalent forward existential formula: [((FwdU(Init,(i4.i1.u19.p154==1)) * !(EG(!(!(E(TRUE U !(!(((i6.u22.p185==1) * EX((i4.i1.u13.p121==1))))))))))) *...544
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t43, t97, t99, t110, t146, t170, t180, t181, t182, t184, t185, t186, t187, t188, t18...702
Detected timeout of ITS tools.
[2026-05-25 09:55:39] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:55:39] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:55:39] [INFO ] Applying decomposition
[2026-05-25 09:55:39] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7589610145955585527.txt' '-o' '/tmp/graph7589610145955585527.bin' '-w' '/tmp/graph7589610145955585527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7589610145955585527.bin' '-l' '-1' '-v' '-w' '/tmp/graph7589610145955585527.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:55:39] [INFO ] Decomposing Gal with order
[2026-05-25 09:55:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:55:39] [INFO ] Removed a total of 607 redundant transitions.
[2026-05-25 09:55:39] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:55:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 5 ms.
[2026-05-25 09:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2552622572914976348.gal : 3 ms
[2026-05-25 09:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1134848302250116243.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/CTLFireability2552622572914976348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1134848302250116243.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 8 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,8.10625e+09,4.69506,137792,2944,386,228636,9220,852,458606,166,35500,0


Converting to forward existential form...Done !
original formula: EF((A(!(((i7.i1.u44.p255==1)||((i0.u4.p20==1)&&(i3.i3.u28.p128==1)))) U ((((i3.i3.u28.p113==1)&&(i0.u1.p10==1))&&((i0.u4.p21==1)&&(i4.u34...301
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((E(!(((((i3.i3.u28.p113==1)&&(i0.u1.p10==1))&&((i0.u4.p21==1)&&(i4.u34.p204==1)))&&(...629
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t63, t146, t147, t149, t161, t164, t166, t173, t176, t177, t178, t196, t199, t200, t2...1082
ITS-tools command line returned an error code 139
[2026-05-25 10:10:38] [INFO ] Applying decomposition
[2026-05-25 10:10:38] [INFO ] Flatten gal took : 143 ms
[2026-05-25 10:10:38] [INFO ] Decomposing Gal with order
[2026-05-25 10:10:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:10:39] [INFO ] Removed a total of 429 redundant transitions.
[2026-05-25 10:10:39] [INFO ] Flatten gal took : 255 ms
[2026-05-25 10:10:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 263 labels/synchronizations in 129 ms.
[2026-05-25 10:10:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15280462883272013501.gal : 10 ms
[2026-05-25 10:10:39] [INFO ] Time to serialize properties into /tmp/CTLFireability9855964330838866181.ctl : 7 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/CTLFireability15280462883272013501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9855964330838866181.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 8 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,8.10625e+09,38.4102,993440,3304,3924,1.37302e+06,160083,331,5.45685e+06,414,3.94159e+06,0


Converting to forward existential form...Done !
original formula: EF((A(!(((i1.i0.u17.p255==1)||((i0.i0.i1.i0.u7.p20==1)&&(i0.i1.i0.u12.p128==1)))) U ((((i0.i1.i0.u12.p113==1)&&(i0.i0.u3.p10==1))&&((i0.i...355
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((E(!(((((i0.i1.i0.u12.p113==1)&&(i0.i0.u3.p10==1))&&((i0.i0.i1.i0.u7.p21==1)&&(i0.i1...731
Reverse transition relation is NOT exact ! Due to transitions t162, t174, t197, t242, i0.t386, i0.t383, i0.t300, i0.i0.t146, i0.i0.u3.t155, i0.i0.i1.t147, ...972

BK_TIME_CONFINEMENT_REACHED

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

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