Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993700322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 DES-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 6 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 68K 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 DES-PT-01b-CTLFireability-2024-00
FORMULA_NAME DES-PT-01b-CTLFireability-2024-01
FORMULA_NAME DES-PT-01b-CTLFireability-2024-02
FORMULA_NAME DES-PT-01b-CTLFireability-2024-03
FORMULA_NAME DES-PT-01b-CTLFireability-2024-04
FORMULA_NAME DES-PT-01b-CTLFireability-2024-05
FORMULA_NAME DES-PT-01b-CTLFireability-2024-06
FORMULA_NAME DES-PT-01b-CTLFireability-2024-07
FORMULA_NAME DES-PT-01b-CTLFireability-2024-08
FORMULA_NAME DES-PT-01b-CTLFireability-2024-09
FORMULA_NAME DES-PT-01b-CTLFireability-2024-10
FORMULA_NAME DES-PT-01b-CTLFireability-2024-11
FORMULA_NAME DES-PT-01b-CTLFireability-2024-12
FORMULA_NAME DES-PT-01b-CTLFireability-2024-13
FORMULA_NAME DES-PT-01b-CTLFireability-2024-14
FORMULA_NAME DES-PT-01b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779649261822

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 19:01:04] [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-24 19:01:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 19:01:04] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2026-05-24 19:01:04] [INFO ] Transformed 284 places.
[2026-05-24 19:01:04] [INFO ] Transformed 235 transitions.
[2026-05-24 19:01:04] [INFO ] Found NUPN structural information;
[2026-05-24 19:01:04] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 425 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Support contains 111 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 264 transition count 218
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 264 transition count 218
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 257 transition count 211
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 257 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 257 transition count 205
Applied a total of 57 rules in 159 ms. Remains 257 /284 variables (removed 27) and now considering 205/235 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11794460285748994896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2115746056040308031.kers'
[2026-05-24 19:01:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11794460285748994896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2115746056040308031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 257 cols 606 entries
Finished phase 1 with 149 SingleSign rule and 46 generalized
[2026-05-24 19:01:05] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2115746056040308031.kers
Total runtime 4 ms.
[2026-05-24 19:01:05] [INFO ] Implicit Places using invariants in 765 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 840 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/284 places, 205/235 transitions.
Applied a total of 0 rules in 27 ms. Remains 255 /255 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1059 ms. Remains : 255/284 places, 205/235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 255 /255 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-275212966862537352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12525665482280297020.kers'
[2026-05-24 19:01:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-275212966862537352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12525665482280297020.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 255 cols 602 entries
Finished phase 1 with 149 SingleSign rule and 46 generalized
[2026-05-24 19:01:05] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12525665482280297020.kers
Total runtime 3 ms.
[2026-05-24 19:01:06] [INFO ] Implicit Places using invariants in 354 ms returned []
[2026-05-24 19:01:06] [INFO ] Invariant cache hit.
[2026-05-24 19:01:06] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-24 19:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (OVERLAPS) 205/460 variables, 255/357 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 367 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/460 variables, 255/367 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 204/571 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 18/589 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 589 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in LTL mode , in 1 iterations and 61097 ms. Remains : 255/255 places, 205/205 transitions.
Support contains 111 out of 255 places after structural reductions.
[2026-05-24 19:02:07] [INFO ] Flatten gal took : 125 ms
[2026-05-24 19:02:07] [INFO ] Flatten gal took : 39 ms
[2026-05-24 19:02:07] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 109 out of 255 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (398 resets) in 2602 ms. (15 steps per ms) remains 3/71 properties
BEST_FIRST walk for 40003 steps (52 resets) in 334 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (59 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 324 ms. (123 steps per ms) remains 2/3 properties
[2026-05-24 19:02:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 95/100 variables, 23/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 70/170 variables, 11/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/229 variables, 22/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/236 variables, 3/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 189/425 variables, 236/296 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 2/298 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/446 variables, 12/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/452 variables, 3/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/456 variables, 2/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/456 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/460 variables, 2/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/460 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/460 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 317 constraints, problems are : Problem set: 1 solved, 1 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/170 variables, 25/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/229 variables, 22/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/236 variables, 3/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 189/425 variables, 236/298 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 1/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 21/446 variables, 12/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/446 variables, 2/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/446 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/452 variables, 3/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 2/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/456 variables, 2/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/456 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/460 variables, 2/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/460 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/460 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 323 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1845ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 248 transition count 176
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 47 place count 226 transition count 176
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 47 place count 226 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 71 place count 214 transition count 164
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 205 transition count 155
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 205 transition count 155
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 95 place count 205 transition count 149
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 97 place count 204 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 97 place count 204 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 203 transition count 147
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 200 transition count 144
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 200 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 200 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 200 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 199 transition count 141
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 247 place count 130 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 253 place count 127 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 127 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 255 place count 126 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 126 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 125 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 258 place count 124 transition count 78
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 124 transition count 78
Applied a total of 259 rules in 186 ms. Remains 124 /255 variables (removed 131) and now considering 78/205 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 124/255 places, 78/205 transitions.
RANDOM walk for 40000 steps (2746 resets) in 732 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (579 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1449269 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1449269 steps, saw 204587 distinct states, run finished after 3007 ms. (steps per millisecond=481 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7608240667310376561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18259716203009214391.kers'
[2026-05-24 19:02:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7608240667310376561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18259716203009214391.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 78 rows 110 cols 337 entries
Finished phase 1 with 39 SingleSign rule and 26 generalized
[2026-05-24 19:02:14] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18259716203009214391.kers
Total runtime 1 ms.
[2026-05-24 19:02:14] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/69 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/88 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/92 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/103 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/103 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/111 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 74/185 variables, 111/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/199 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/199 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/199 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/201 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/201 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/201 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/202 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/202 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/202 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/69 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/88 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/92 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/103 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/103 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/111 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 74/185 variables, 111/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/199 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/199 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/199 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/201 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/201 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/201 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/202 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/202 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/202 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 78/78 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 124/124 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-24 19:02:15] [INFO ] Invariant cache hit.
[2026-05-24 19:02:15] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 19:02:15] [INFO ] Invariant cache hit.
[2026-05-24 19:02:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 19:02:15] [INFO ] Implicit Places using invariants and state equation in 427 ms returned [7, 30, 34, 38, 75, 98, 119]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 655 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 117/124 places, 78/78 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 117 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 14 place count 110 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 109 transition count 70
Applied a total of 15 rules in 20 ms. Remains 109 /117 variables (removed 8) and now considering 70/78 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7016098559524944344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12013797745599507899.kers'
[2026-05-24 19:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7016098559524944344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12013797745599507899.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 70 rows 98 cols 307 entries
Finished phase 1 with 29 SingleSign rule and 28 generalized
[2026-05-24 19:02:15] [INFO ] Computed 52 invariants in 0 ms
Computed 52 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12013797745599507899.kers
Total runtime 1 ms.
[2026-05-24 19:02:15] [INFO ] Implicit Places using invariants in 203 ms returned [51, 68, 84, 87, 93, 96]
[2026-05-24 19:02:15] [INFO ] Actually due to overlaps returned [51, 84, 87, 93, 96]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 206 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/124 places, 70/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 102 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 102 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 101 transition count 66
Applied a total of 6 rules in 13 ms. Remains 101 /104 variables (removed 3) and now considering 66/70 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-44674073792914810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14676491505016947344.kers'
[2026-05-24 19:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-44674073792914810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14676491505016947344.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 66 rows 92 cols 289 entries
Finished phase 1 with 28 SingleSign rule and 26 generalized
[2026-05-24 19:02:15] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14676491505016947344.kers
Total runtime 1 ms.
[2026-05-24 19:02:16] [INFO ] Implicit Places using invariants in 143 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 100/124 places, 66/78 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 100 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 65
Applied a total of 2 rules in 9 ms. Remains 99 /100 variables (removed 1) and now considering 65/66 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12024837766592716967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3441590433884991314.kers'
[2026-05-24 19:02:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12024837766592716967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3441590433884991314.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 65 rows 90 cols 285 entries
Finished phase 1 with 27 SingleSign rule and 26 generalized
[2026-05-24 19:02:16] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3441590433884991314.kers
Total runtime 1 ms.
[2026-05-24 19:02:16] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 19:02:16] [INFO ] Invariant cache hit.
[2026-05-24 19:02:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 19:02:16] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 99/124 places, 65/78 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1521 ms. Remains : 99/124 places, 65/78 transitions.
RANDOM walk for 40000 steps (3224 resets) in 890 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33044 steps (450 resets) in 97 ms. (337 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-05-24 19:02:16] [INFO ] Flatten gal took : 26 ms
[2026-05-24 19:02:16] [INFO ] Flatten gal took : 28 ms
[2026-05-24 19:02:16] [INFO ] Input system was already deterministic with 205 transitions.
Computed a total of 56 stabilizing places and 52 stable transitions
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 243 transition count 193
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 243 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 243 transition count 188
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 238 transition count 183
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 238 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 238 transition count 180
Applied a total of 42 rules in 21 ms. Remains 238 /255 variables (removed 17) and now considering 180/205 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17189471149067864637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18321450664332344544.kers'
[2026-05-24 19:02:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17189471149067864637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18321450664332344544.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 238 cols 536 entries
Finished phase 1 with 134 SingleSign rule and 44 generalized
[2026-05-24 19:02:17] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18321450664332344544.kers
Total runtime 2 ms.
[2026-05-24 19:02:17] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-24 19:02:17] [INFO ] Invariant cache hit.
[2026-05-24 19:02:17] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-24 19:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 180/418 variables, 238/339 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/418 variables, and 349 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/418 variables, 238/349 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 179/528 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 9/537 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 547 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 238/255 places, 180/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 238/255 places, 180/205 transitions.
[2026-05-24 19:03:17] [INFO ] Flatten gal took : 23 ms
[2026-05-24 19:03:17] [INFO ] Flatten gal took : 23 ms
[2026-05-24 19:03:17] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 19:03:17] [INFO ] Flatten gal took : 23 ms
[2026-05-24 19:03:17] [INFO ] Flatten gal took : 22 ms
[2026-05-24 19:03:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15339018154305015622.gal : 24 ms
[2026-05-24 19:03:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16011235895237991182.ctl : 28 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/CTLFireability15339018154305015622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16011235895237991182.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.
Detected timeout of ITS tools.
[2026-05-24 19:03:48] [INFO ] Flatten gal took : 12 ms
[2026-05-24 19:03:48] [INFO ] Applying decomposition
[2026-05-24 19:03:48] [INFO ] Flatten gal took : 11 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/graph1211223040470525795.txt' '-o' '/tmp/graph1211223040470525795.bin' '-w' '/tmp/graph1211223040470525795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1211223040470525795.bin' '-l' '-1' '-v' '-w' '/tmp/graph1211223040470525795.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:03:48] [INFO ] Decomposing Gal with order
[2026-05-24 19:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:03:48] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-24 19:03:48] [INFO ] Flatten gal took : 96 ms
[2026-05-24 19:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2026-05-24 19:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15753149367025222393.gal : 9 ms
[2026-05-24 19:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5287626451869379476.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/CTLFireability15753149367025222393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5287626451869379476.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,3.74514e+15,0.998591,28736,2532,68,73184,1026,604,57835,81,2917,0


Converting to forward existential form...Done !
original formula: EX((!(E(EG(EF((i6.u28.p96==1))) U (A((i0.u4.p131==1) U (i7.u76.p275==1)) * A((i8.u35.p133==1) U (i8.u36.p141==1))))) + ((i12.u66.p239==1)...176
=> equivalent forward existential formula: ([(EY(Init) * !(E(EG(E(TRUE U (i6.u28.p96==1))) U (!((E(!((i7.u76.p275==1)) U (!((i0.u4.p131==1)) * !((i7.u76.p2...373
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t52, t62, t87, t132, t173, i0.u33.t79, i0.u77.t17, i1.u13.t113, i1.u15.t110, i2.t120...700
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 247 transition count 179
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 227 transition count 179
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 227 transition count 167
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 215 transition count 167
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 207 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 207 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 207 transition count 154
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 206 transition count 153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 203 transition count 150
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 203 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 203 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 96 place count 203 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 202 transition count 147
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 228 place count 137 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 135 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 134 transition count 80
Applied a total of 231 rules in 69 ms. Remains 134 /255 variables (removed 121) and now considering 80/205 (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-15134363211709318487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12710288518355552012.kers'
[2026-05-24 19:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15134363211709318487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12710288518355552012.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 80 rows 109 cols 263 entries
Finished phase 1 with 61 SingleSign rule and 16 generalized
[2026-05-24 19:04:18] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12710288518355552012.kers
Total runtime 1 ms.
[2026-05-24 19:04:18] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-24 19:04:18] [INFO ] Invariant cache hit.
[2026-05-24 19:04:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:04:19] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [10, 41, 45, 49, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 106, 129]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 465 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 113/255 places, 80/205 transitions.
Graph (complete) has 249 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 109 transition count 68
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 100 transition count 68
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 77 transition count 57
Applied a total of 53 rules in 15 ms. Remains 77 /113 variables (removed 36) and now considering 57/80 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16208701829645752852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1685413283295047480.kers'
[2026-05-24 19:04:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16208701829645752852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1685413283295047480.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 57 rows 70 cols 186 entries
Finished phase 1 with 49 SingleSign rule and 5 generalized
[2026-05-24 19:04:19] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1685413283295047480.kers
Total runtime 1 ms.
[2026-05-24 19:04:19] [INFO ] Implicit Places using invariants in 93 ms returned [46, 50, 55, 62, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 95 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 72/255 places, 57/205 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 72 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 70 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 70 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 69 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 69 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 67 transition count 51
Applied a total of 10 rules in 17 ms. Remains 67 /72 variables (removed 5) and now considering 51/57 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9747478770906875873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3807175431148533187.kers'
[2026-05-24 19:04:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9747478770906875873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3807175431148533187.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 51 rows 60 cols 159 entries
Finished phase 1 with 46 SingleSign rule and 3 generalized
[2026-05-24 19:04:19] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3807175431148533187.kers
Total runtime 0 ms.
[2026-05-24 19:04:19] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 19:04:19] [INFO ] Invariant cache hit.
[2026-05-24 19:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:04:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 67/255 places, 51/205 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 847 ms. Remains : 67/255 places, 51/205 transitions.
[2026-05-24 19:04:19] [INFO ] Flatten gal took : 9 ms
[2026-05-24 19:04:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:04:19] [INFO ] Input system was already deterministic with 51 transitions.
[2026-05-24 19:04:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:04:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:04:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2531246970903468697.gal : 1 ms
[2026-05-24 19:04:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4800636869309043958.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/CTLFireability2531246970903468697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4800636869309043958.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07637e+06,0.061801,5916,2,3076,5,9151,6,0,312,7660,0


Converting to forward existential form...Done !
original formula: (AF((p58==1)) * EF((EF(((p25==1)&&(p79==1))) + (p207==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((p58==1)))] = FALSE * [(Init * !(E(TRUE U (E(TRUE U ((p25==1)&&(p79==1))) + (p207==1)))))] = FALSE...156
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t6, t9, t12, t19, t20, t29, t36, t37, t38, t40, t44, t46, t47, t49, t50, Interse...245
Hit Full ! (commute/partial/dont) 48/0/3
(forward)formula 0,1,3.39936,111844,1,0,214,627321,135,77,2069,652929,220
FORMULA DES-PT-01b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 242 transition count 192
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 242 transition count 192
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 242 transition count 187
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 237 transition count 182
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 237 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 237 transition count 180
Applied a total of 43 rules in 12 ms. Remains 237 /255 variables (removed 18) and now considering 180/205 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12303886254996380486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16160329676165538180.kers'
[2026-05-24 19:04:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12303886254996380486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16160329676165538180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 237 cols 539 entries
Finished phase 1 with 132 SingleSign rule and 45 generalized
[2026-05-24 19:04:22] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16160329676165538180.kers
Total runtime 1 ms.
[2026-05-24 19:04:23] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-24 19:04:23] [INFO ] Invariant cache hit.
[2026-05-24 19:04:23] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-24 19:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 180/417 variables, 237/325 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 343 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 46/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/417 variables, 237/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 179/522 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 12/534 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 536 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 237/255 places, 180/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60585 ms. Remains : 237/255 places, 180/205 transitions.
[2026-05-24 19:05:23] [INFO ] Flatten gal took : 16 ms
[2026-05-24 19:05:23] [INFO ] Flatten gal took : 17 ms
[2026-05-24 19:05:23] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 19:05:23] [INFO ] Flatten gal took : 10 ms
[2026-05-24 19:05:23] [INFO ] Flatten gal took : 9 ms
[2026-05-24 19:05:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14793456509564677174.gal : 4 ms
[2026-05-24 19:05:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8105949265895348672.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/CTLFireability14793456509564677174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8105949265895348672.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.89245e+15,29.3965,668556,2,416162,5,2.57935e+06,6,0,1129,2.72439e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 19:05:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 19:05:53] [INFO ] Applying decomposition
[2026-05-24 19:05:53] [INFO ] Flatten gal took : 21 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/graph13462617258894120548.txt' '-o' '/tmp/graph13462617258894120548.bin' '-w' '/tmp/graph13462617258894120548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13462617258894120548.bin' '-l' '-1' '-v' '-w' '/tmp/graph13462617258894120548.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:05:53] [INFO ] Decomposing Gal with order
[2026-05-24 19:05:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:05:53] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-24 19:05:53] [INFO ] Flatten gal took : 58 ms
[2026-05-24 19:05:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2026-05-24 19:05:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13619569130783596546.gal : 8 ms
[2026-05-24 19:05:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3973156188474879120.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/CTLFireability13619569130783596546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3973156188474879120.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,3.89245e+15,0.467761,18720,2228,65,33152,526,693,53081,83,1544,0


Converting to forward existential form...Done !
original formula: (EX(((EF(((i4.u36.p137==1)&&(i4.u36.p139==1))) + E(AF(((i2.u29.p106==1)&&(i2.u31.p120==1))) U EX(((i7.u42.p174==1)&&(i6.i1.u57.p205==1)))...205
=> equivalent forward existential formula: [(FwdU((Init * !(EX(((E(TRUE U ((i4.u36.p137==1)&&(i4.u36.p139==1))) + E(!(EG(!(((i2.u29.p106==1)&&(i2.u31.p120=...274
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t132, t173, i0.i1.t120, i0.i1.u7.t125, i0.i1.u7.t126, i0.i1.u8.t122, i0.i1.u8.t...757
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 247 transition count 183
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 231 transition count 183
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 231 transition count 171
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 219 transition count 171
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 211 transition count 163
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 211 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 211 transition count 158
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 80 place count 210 transition count 157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 83 place count 207 transition count 154
Iterating global reduction 4 with 3 rules applied. Total rules applied 86 place count 207 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 207 transition count 152
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 206 place count 148 transition count 93
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 148 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 147 transition count 92
Applied a total of 208 rules in 64 ms. Remains 147 /255 variables (removed 108) and now considering 92/205 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16859439966044585334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13857873628609381576.kers'
[2026-05-24 19:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16859439966044585334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13857873628609381576.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 146 cols 374 entries
Finished phase 1 with 49 SingleSign rule and 40 generalized
[2026-05-24 19:06:23] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13857873628609381576.kers
Total runtime 1 ms.
[2026-05-24 19:06:24] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-24 19:06:24] [INFO ] Invariant cache hit.
[2026-05-24 19:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:06:24] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [47, 51, 53, 58, 73, 75, 77, 87, 92, 94, 96, 118]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 702 ms to find 12 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 135/255 places, 92/205 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 135 transition count 87
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 130 transition count 87
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 32 place count 116 transition count 79
Applied a total of 32 rules in 12 ms. Remains 116 /135 variables (removed 19) and now considering 79/92 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-934112815266153622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16066268626760958939.kers'
[2026-05-24 19:06:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-934112815266153622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16066268626760958939.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 116 cols 302 entries
Finished phase 1 with 52 SingleSign rule and 24 generalized
[2026-05-24 19:06:24] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16066268626760958939.kers
Total runtime 1 ms.
[2026-05-24 19:06:24] [INFO ] Implicit Places using invariants in 326 ms returned [64, 78, 87, 90, 98, 101]
[2026-05-24 19:06:24] [INFO ] Actually due to overlaps returned [64, 87, 90, 98, 101]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 331 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 111/255 places, 79/205 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 108 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 108 transition count 75
Applied a total of 6 rules in 14 ms. Remains 108 /111 variables (removed 3) and now considering 75/79 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10454563146938824108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-77246995138317305.kers'
[2026-05-24 19:06:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10454563146938824108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-77246995138317305.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 108 cols 279 entries
Finished phase 1 with 48 SingleSign rule and 25 generalized
[2026-05-24 19:06:25] [INFO ] Computed 35 invariants in 12 ms
Computed 35 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-77246995138317305.kers
Total runtime 12 ms.
[2026-05-24 19:06:25] [INFO ] Implicit Places using invariants in 151 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 107/255 places, 75/205 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 1290 ms. Remains : 107/255 places, 75/205 transitions.
[2026-05-24 19:06:25] [INFO ] Flatten gal took : 10 ms
[2026-05-24 19:06:25] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:06:25] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-24 19:06:25] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:06:25] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:06:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13272403343748553518.gal : 1 ms
[2026-05-24 19:06:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13671322578403566382.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/CTLFireability13272403343748553518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13671322578403566382.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.7932e+08,0.517779,16704,2,15762,5,49578,6,0,500,52805,0


Converting to forward existential form...Done !
original formula: E((!((!(((p198==1) + AF((p184==1)))) + ((AF(((p170==1)&&(p199==1))) * AG(((p57==1)&&(p242==1)))) * (((p68==1)||(p131==1))&&(p71==1))))) *...194
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!((!(((p198==1) + !(EG(!((p184==1)))))) + ((!(EG(!(((p170==1)&&(p199==1))))) * !(E(TRUE U !(((p...274
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t10, t13, t15, t18, t21, t23, t26, t27, t45, t46, t53, t54, t57, t63,...274
Detected timeout of ITS tools.
[2026-05-24 19:06:55] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:06:55] [INFO ] Applying decomposition
[2026-05-24 19:06:55] [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/graph11671531112153758828.txt' '-o' '/tmp/graph11671531112153758828.bin' '-w' '/tmp/graph11671531112153758828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11671531112153758828.bin' '-l' '-1' '-v' '-w' '/tmp/graph11671531112153758828.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:06:55] [INFO ] Decomposing Gal with order
[2026-05-24 19:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:06:55] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-24 19:06:55] [INFO ] Flatten gal took : 9 ms
[2026-05-24 19:06:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-24 19:06:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14507653368448409179.gal : 3 ms
[2026-05-24 19:06:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14211035800763064134.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/CTLFireability14507653368448409179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14211035800763064134.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,5.7932e+08,0.082435,6708,803,84,6648,305,350,5489,87,712,0


Converting to forward existential form...Done !
original formula: E((!((!(((i5.u26.p198==1) + AF((i6.i0.u22.p184==1)))) + ((AF(((i5.u21.p170==1)&&(i5.u26.p199==1))) * AG(((i0.u4.p57==1)&&(i7.u32.p242==1)...270
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!((!(((i5.u26.p198==1) + !(EG(!((i6.i0.u22.p184==1)))))) + ((!(EG(!(((i5.u21.p170==1)&&(i5.u26....350
Reverse transition relation is NOT exact ! Due to transitions t26, t45, t63, t64, t74, u3.t18, u3.t23, u35.t0, i0.u1.t46, i0.u2.t21, i2.t13, i2.u6.t15, i3....356
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,13.7702,436560,1,0,1.03069e+06,1082,1752,891002,412,3597,1000361
FORMULA DES-PT-01b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 247 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 229 transition count 181
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 229 transition count 168
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 216 transition count 168
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 207 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 207 transition count 159
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 87 place count 207 transition count 153
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 89 place count 206 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 89 place count 206 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 205 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 202 transition count 148
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 99 place count 202 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 201 transition count 145
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 233 place count 135 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 133 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 132 transition count 77
Applied a total of 236 rules in 42 ms. Remains 132 /255 variables (removed 123) and now considering 77/205 (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-242843559163278645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1746943066045882868.kers'
[2026-05-24 19:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-242843559163278645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1746943066045882868.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 77 rows 121 cols 296 entries
Finished phase 1 with 46 SingleSign rule and 29 generalized
[2026-05-24 19:07:09] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1746943066045882868.kers
Total runtime 1 ms.
[2026-05-24 19:07:09] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-24 19:07:09] [INFO ] Invariant cache hit.
[2026-05-24 19:07:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:09] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [10, 38, 42, 46, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 104, 127]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 435 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/255 places, 77/205 transitions.
Graph (complete) has 233 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 106 transition count 64
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 96 transition count 64
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 69 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 69 transition count 51
Applied a total of 61 rules in 7 ms. Remains 69 /110 variables (removed 41) and now considering 51/77 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2334912104690913224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4494258669340773221.kers'
[2026-05-24 19:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2334912104690913224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4494258669340773221.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 51 rows 62 cols 162 entries
Finished phase 1 with 42 SingleSign rule and 7 generalized
[2026-05-24 19:07:09] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4494258669340773221.kers
Total runtime 1 ms.
[2026-05-24 19:07:09] [INFO ] Implicit Places using invariants in 101 ms returned [47, 54, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 66/255 places, 51/205 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 64 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 64 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 63 transition count 47
Applied a total of 6 rules in 7 ms. Remains 63 /66 variables (removed 3) and now considering 47/51 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-676002149374758853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8624352803270340109.kers'
[2026-05-24 19:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-676002149374758853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8624352803270340109.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 47 rows 56 cols 144 entries
Finished phase 1 with 42 SingleSign rule and 4 generalized
[2026-05-24 19:07:09] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8624352803270340109.kers
Total runtime 1 ms.
[2026-05-24 19:07:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 19:07:09] [INFO ] Invariant cache hit.
[2026-05-24 19:07:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:10] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 63/255 places, 47/205 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 870 ms. Remains : 63/255 places, 47/205 transitions.
[2026-05-24 19:07:10] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:07:10] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:10] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-24 19:07:10] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:10] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9467020714964321882.gal : 1 ms
[2026-05-24 19:07:10] [INFO ] Time to serialize properties into /tmp/CTLFireability18399669464210184990.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/CTLFireability9467020714964321882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18399669464210184990.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.58979e+06,0.074506,5368,2,2279,5,6987,6,0,293,5806,0


Converting to forward existential form...Done !
original formula: EF(AG(!(E((p28==1) U (p209!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(E((p28==1) U (p209!=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t11, t16, t17, t26, t32, t33, t35, t40, t43, t44, t45, t46, Intersection with re...232
(forward)formula 0,0,1.09955,35856,1,0,118,198690,119,49,1835,183816,117
FORMULA DES-PT-01b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 247 transition count 179
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 227 transition count 179
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 227 transition count 167
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 215 transition count 167
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 206 transition count 158
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 206 transition count 158
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 89 place count 206 transition count 152
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 91 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 204 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 201 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 201 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 101 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 200 transition count 144
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 239 place count 132 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 130 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 129 transition count 74
Applied a total of 242 rules in 46 ms. Remains 129 /255 variables (removed 126) and now considering 74/205 (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-10837872781753791298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5615853735208861082.kers'
[2026-05-24 19:07:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10837872781753791298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5615853735208861082.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 74 rows 102 cols 242 entries
Finished phase 1 with 59 SingleSign rule and 13 generalized
[2026-05-24 19:07:11] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5615853735208861082.kers
Total runtime 1 ms.
[2026-05-24 19:07:11] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-24 19:07:11] [INFO ] Invariant cache hit.
[2026-05-24 19:07:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:11] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [9, 37, 41, 45, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 101, 124]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 602 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/255 places, 74/205 transitions.
Graph (complete) has 237 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 103 transition count 61
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 93 transition count 61
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 67 transition count 49
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 65 transition count 48
Applied a total of 62 rules in 7 ms. Remains 65 /107 variables (removed 42) and now considering 48/74 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4242173669845932350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-233971060485149679.kers'
[2026-05-24 19:07:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4242173669845932350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-233971060485149679.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 48 rows 57 cols 152 entries
Finished phase 1 with 40 SingleSign rule and 6 generalized
[2026-05-24 19:07:11] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-233971060485149679.kers
Total runtime 1 ms.
[2026-05-24 19:07:12] [INFO ] Implicit Places using invariants in 109 ms returned [50, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 110 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 63/255 places, 48/205 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 60 transition count 44
Applied a total of 6 rules in 8 ms. Remains 60 /63 variables (removed 3) and now considering 44/48 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14542046014797800320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6886845063226404345.kers'
[2026-05-24 19:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14542046014797800320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6886845063226404345.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 44 rows 52 cols 136 entries
Finished phase 1 with 39 SingleSign rule and 4 generalized
[2026-05-24 19:07:12] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6886845063226404345.kers
Total runtime 1 ms.
[2026-05-24 19:07:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-24 19:07:12] [INFO ] Invariant cache hit.
[2026-05-24 19:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:12] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 60/255 places, 44/205 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1042 ms. Remains : 60/255 places, 44/205 transitions.
[2026-05-24 19:07:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:12] [INFO ] Input system was already deterministic with 44 transitions.
RANDOM walk for 45 steps (1 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA DES-PT-01b-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 19:07:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14146800782080742083.gal : 1 ms
[2026-05-24 19:07:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13576438142191804782.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/ReachabilityCardinality14146800782080742083.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13576438142191804782.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 247 transition count 179
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 227 transition count 179
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 227 transition count 167
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 215 transition count 167
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 206 transition count 158
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 206 transition count 158
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 89 place count 206 transition count 152
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 91 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 204 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 201 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 201 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 101 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 200 transition count 144
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 233 place count 135 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 133 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 132 transition count 77
Applied a total of 236 rules in 41 ms. Remains 132 /255 variables (removed 123) and now considering 77/205 (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-11168671660055649236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8659646745789483236.kers'
[2026-05-24 19:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11168671660055649236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8659646745789483236.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 77 rows 122 cols 301 entries
Finished phase 1 with 42 SingleSign rule and 33 generalized
[2026-05-24 19:07:12] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8659646745789483236.kers
Total runtime 2 ms.
[2026-05-24 19:07:12] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-24 19:07:12] [INFO ] Invariant cache hit.
[2026-05-24 19:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:12] [INFO ] Implicit Places using invariants and state equation in 383 ms returned [9, 37, 41, 45, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 127]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 587 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/255 places, 77/205 transitions.
Graph (complete) has 245 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 107 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 98 transition count 65
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 74 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 73 transition count 54
Applied a total of 55 rules in 7 ms. Remains 73 /111 variables (removed 38) and now considering 54/77 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15495098381131174928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7777121931658438226.kers'
[2026-05-24 19:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15495098381131174928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7777121931658438226.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 54 rows 66 cols 173 entries
Finished phase 1 with 45 SingleSign rule and 7 generalized
[2026-05-24 19:07:12] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7777121931658438226.kers
Total runtime 1 ms.
[2026-05-24 19:07:13] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-24 19:07:13] [INFO ] Invariant cache hit.
[2026-05-24 19:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:13] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 265 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 72/255 places, 54/205 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 53
Applied a total of 2 rules in 5 ms. Remains 71 /72 variables (removed 1) and now considering 53/54 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7818124499406525014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2248883650261450121.kers'
[2026-05-24 19:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7818124499406525014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2248883650261450121.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 53 rows 64 cols 169 entries
Finished phase 1 with 44 SingleSign rule and 7 generalized
[2026-05-24 19:07:13] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2248883650261450121.kers
Total runtime 1 ms.
[2026-05-24 19:07:13] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-24 19:07:13] [INFO ] Invariant cache hit.
[2026-05-24 19:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:07:13] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 71/255 places, 53/205 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1230 ms. Remains : 71/255 places, 53/205 transitions.
[2026-05-24 19:07:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:13] [INFO ] Input system was already deterministic with 53 transitions.
[2026-05-24 19:07:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:07:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:07:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10930626506212671021.gal : 1 ms
[2026-05-24 19:07:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11743709915606534817.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/ReachabilityCardinality10930626506212671021.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11743709915606534817.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
RANDOM walk for 9523 steps (480 resets) in 61 ms. (153 steps per ms) remains 0/1 properties
FORMULA DES-PT-01b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality11743709915606534817.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 46
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :46 after 145
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 244 transition count 194
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 244 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 244 transition count 189
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 239 transition count 184
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 239 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 239 transition count 182
Applied a total of 39 rules in 16 ms. Remains 239 /255 variables (removed 16) and now considering 182/205 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13307393389595090090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16616493218171127325.kers'
[2026-05-24 19:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13307393389595090090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16616493218171127325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 239 cols 543 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 19:07:13] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16616493218171127325.kers
Total runtime 3 ms.
[2026-05-24 19:07:13] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-24 19:07:13] [INFO ] Invariant cache hit.
[2026-05-24 19:07:14] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-24 19:07:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 17/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 182/421 variables, 239/350 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 354 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 55/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/421 variables, 239/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 181/535 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 9/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 545 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 239/255 places, 182/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60673 ms. Remains : 239/255 places, 182/205 transitions.
[2026-05-24 19:08:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:08:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:08:14] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-24 19:08:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:08:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:08:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3199323934203122620.gal : 2 ms
[2026-05-24 19:08:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7798889757982296989.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/CTLFireability3199323934203122620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7798889757982296989.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-24 19:08:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:08:44] [INFO ] Applying decomposition
[2026-05-24 19:08:44] [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/graph16459611407419559824.txt' '-o' '/tmp/graph16459611407419559824.bin' '-w' '/tmp/graph16459611407419559824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16459611407419559824.bin' '-l' '-1' '-v' '-w' '/tmp/graph16459611407419559824.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:08:44] [INFO ] Decomposing Gal with order
[2026-05-24 19:08:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:08:44] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-24 19:08:44] [INFO ] Flatten gal took : 36 ms
[2026-05-24 19:08:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-24 19:08:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17074073406881300501.gal : 4 ms
[2026-05-24 19:08:44] [INFO ] Time to serialize properties into /tmp/CTLFireability855026712508839404.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/CTLFireability17074073406881300501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability855026712508839404.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,4.6303e+15,0.536073,14292,2215,70,22829,633,681,32187,84,1941,0


Converting to forward existential form...Done !
original formula: A(((AF(AG((i10.i0.u50.p189==1))) + (i6.u29.p113==1)) + ((i12.i0.u66.p260==1)&&(i12.i1.u72.p262==1))) U ((EG(EF((i5.u7.p26==1))) * !(AG(A(...399
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(E(TRUE U (i5.u7.p26==1))) * !(!(E(TRUE U !(!((E(!((i12.i0.u66.p246==1)) U (!((i10.i3.u59.p...1345
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t90, t102, t122, t134, t175, i0.u9.t118, i1.i0.u34.t77, i2.i1.u32.t80, i2.i3.u7...746
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 243 transition count 193
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 243 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 243 transition count 188
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 239 transition count 184
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 239 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 239 transition count 183
Applied a total of 38 rules in 8 ms. Remains 239 /255 variables (removed 16) and now considering 183/205 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-545676960139919821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7595199934648502011.kers'
[2026-05-24 19:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-545676960139919821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7595199934648502011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 239 cols 545 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 19:09:14] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7595199934648502011.kers
Total runtime 3 ms.
[2026-05-24 19:09:14] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-24 19:09:14] [INFO ] Invariant cache hit.
[2026-05-24 19:09:15] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-24 19:09:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 183/422 variables, 239/332 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 30121ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 30124ms
Starting structural reductions in LTL mode, iteration 1 : 239/255 places, 183/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30858 ms. Remains : 239/255 places, 183/205 transitions.
[2026-05-24 19:09:45] [INFO ] Flatten gal took : 9 ms
[2026-05-24 19:09:45] [INFO ] Flatten gal took : 18 ms
[2026-05-24 19:09:45] [INFO ] Input system was already deterministic with 183 transitions.
[2026-05-24 19:09:45] [INFO ] Flatten gal took : 8 ms
[2026-05-24 19:09:45] [INFO ] Flatten gal took : 8 ms
[2026-05-24 19:09:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18175378792172532272.gal : 3 ms
[2026-05-24 19:09:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3521603654228729827.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/CTLFireability18175378792172532272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3521603654228729827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.56505e+15,29.3327,668208,2,417164,5,2.58365e+06,6,0,1140,2.72892e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 19:10:15] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:10:15] [INFO ] Applying decomposition
[2026-05-24 19:10:15] [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/graph8196981946307708188.txt' '-o' '/tmp/graph8196981946307708188.bin' '-w' '/tmp/graph8196981946307708188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8196981946307708188.bin' '-l' '-1' '-v' '-w' '/tmp/graph8196981946307708188.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:10:15] [INFO ] Decomposing Gal with order
[2026-05-24 19:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:10:15] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-24 19:10:15] [INFO ] Flatten gal took : 29 ms
[2026-05-24 19:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-24 19:10:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5282812957289860403.gal : 12 ms
[2026-05-24 19:10:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8002331720462740914.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/CTLFireability5282812957289860403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8002331720462740914.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,4.56505e+15,0.544426,16692,2384,67,28813,501,649,44582,78,1326,0


Converting to forward existential form...Done !
original formula: (AX((!(E((i0.u11.p41==1) U EX(((((i2.u7.p20==1)&&(i2.u8.p27==1))&&((i0.u9.p49==1)&&(i2.u13.p51==1)))&&((i3.u15.p59==1)&&(i3.u17.p70==1)))...449
=> equivalent forward existential formula: ((([(FwdU(((EY(Init) * !(!(E((i0.u11.p41==1) U EX(((((i2.u7.p20==1)&&(i2.u8.p27==1))&&((i0.u9.p49==1)&&(i2.u13.p...989
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t56, t58, t135, i0.u12.t117, i1.i1.u34.t79, i1.i2.u77.t17, i2.t123, i2.u7.t128, i2.u...758
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 247 transition count 179
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 227 transition count 179
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 227 transition count 167
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 215 transition count 167
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 206 transition count 158
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 206 transition count 158
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 89 place count 206 transition count 152
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 91 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 204 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 201 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 201 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 101 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 200 transition count 144
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 235 place count 134 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 132 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 131 transition count 76
Applied a total of 238 rules in 33 ms. Remains 131 /255 variables (removed 124) and now considering 76/205 (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-14900875918890830245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6897969418114651094.kers'
[2026-05-24 19:10:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14900875918890830245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6897969418114651094.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 76 rows 107 cols 252 entries
Finished phase 1 with 61 SingleSign rule and 13 generalized
[2026-05-24 19:10:45] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6897969418114651094.kers
Total runtime 1 ms.
[2026-05-24 19:10:46] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 19:10:46] [INFO ] Invariant cache hit.
[2026-05-24 19:10:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:10:46] [INFO ] Implicit Places using invariants and state equation in 392 ms returned [9, 37, 41, 45, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 103, 126]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 626 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/255 places, 76/205 transitions.
Graph (complete) has 252 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 108 transition count 64
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 20 place count 98 transition count 64
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 58 place count 72 transition count 52
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 70 transition count 51
Applied a total of 61 rules in 5 ms. Remains 70 /112 variables (removed 42) and now considering 51/76 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8418482482548357592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10210915600729233203.kers'
[2026-05-24 19:10:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8418482482548357592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10210915600729233203.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 51 rows 61 cols 160 entries
Finished phase 1 with 42 SingleSign rule and 7 generalized
[2026-05-24 19:10:46] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10210915600729233203.kers
Total runtime 2 ms.
[2026-05-24 19:10:46] [INFO ] Implicit Places using invariants in 101 ms returned [45, 55, 58]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 102 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 67/255 places, 51/205 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 64 transition count 47
Applied a total of 6 rules in 3 ms. Remains 64 /67 variables (removed 3) and now considering 47/51 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14883813373792569793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8049956777361699220.kers'
[2026-05-24 19:10:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14883813373792569793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8049956777361699220.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 47 rows 56 cols 144 entries
Finished phase 1 with 42 SingleSign rule and 4 generalized
[2026-05-24 19:10:46] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8049956777361699220.kers
Total runtime 2 ms.
[2026-05-24 19:10:46] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-24 19:10:46] [INFO ] Invariant cache hit.
[2026-05-24 19:10:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:10:47] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 64/255 places, 47/205 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1222 ms. Remains : 64/255 places, 47/205 transitions.
[2026-05-24 19:10:47] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:10:47] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:10:47] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-24 19:10:47] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:10:47] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:10:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12108305525478391238.gal : 1 ms
[2026-05-24 19:10:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17757065666749810856.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/ReachabilityCardinality12108305525478391238.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17757065666749810856.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 20 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
FORMULA DES-PT-01b-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17757065666749810856.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 243 transition count 193
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 243 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 243 transition count 189
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 238 transition count 184
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 238 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 238 transition count 182
Applied a total of 40 rules in 16 ms. Remains 238 /255 variables (removed 17) and now considering 182/205 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2813774780522639450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4047129396816388070.kers'
[2026-05-24 19:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2813774780522639450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4047129396816388070.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 238 cols 543 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-24 19:10:47] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4047129396816388070.kers
Total runtime 4 ms.
[2026-05-24 19:10:47] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-24 19:10:47] [INFO ] Invariant cache hit.
[2026-05-24 19:10:47] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-24 19:10:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 182/420 variables, 238/341 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 343 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/420 variables, 238/353 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 181/534 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 9/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 543 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 238/255 places, 182/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60816 ms. Remains : 238/255 places, 182/205 transitions.
[2026-05-24 19:11:47] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:11:47] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:11:48] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-24 19:11:48] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:11:48] [INFO ] Flatten gal took : 3 ms
[2026-05-24 19:11:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8975367442978868963.gal : 2 ms
[2026-05-24 19:11:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3442609977015250409.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/CTLFireability8975367442978868963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3442609977015250409.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-24 19:12:18] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:12:18] [INFO ] Applying decomposition
[2026-05-24 19:12:18] [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/graph2935859812853941508.txt' '-o' '/tmp/graph2935859812853941508.bin' '-w' '/tmp/graph2935859812853941508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2935859812853941508.bin' '-l' '-1' '-v' '-w' '/tmp/graph2935859812853941508.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:12:18] [INFO ] Decomposing Gal with order
[2026-05-24 19:12:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:12:18] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-24 19:12:18] [INFO ] Flatten gal took : 12 ms
[2026-05-24 19:12:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-24 19:12:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17445130936904304567.gal : 4 ms
[2026-05-24 19:12:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17848377047817893032.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/CTLFireability17445130936904304567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17848377047817893032.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,5.00137e+15,0.821147,29044,5781,78,56958,581,712,90175,80,1815,0


Converting to forward existential form...Done !
original formula: EF((AG(((i2.u12.p43==1)&&(i2.u33.p126==1))) + EX(AG((i8.i1.u61.p212==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((i2.u12.p43==1)&&(i2.u33.p126==1))))))] != FALSE + [(EY(FwdU(Init,TRUE)) * !(...200
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t87, t134, t176, i0.i0.u34.t79, i1.t122, i1.u8.t127, i1.u8.t128, i1.u9.t124, i1...751
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 243 transition count 193
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 243 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 243 transition count 189
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 237 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 237 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 237 transition count 180
Applied a total of 43 rules in 8 ms. Remains 237 /255 variables (removed 18) and now considering 180/205 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8774133001026217244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3085520442666047426.kers'
[2026-05-24 19:12:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8774133001026217244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3085520442666047426.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 237 cols 539 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-24 19:12:48] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3085520442666047426.kers
Total runtime 2 ms.
[2026-05-24 19:12:48] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-24 19:12:48] [INFO ] Invariant cache hit.
[2026-05-24 19:12:48] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-24 19:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 180/417 variables, 237/340 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 12/352 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 352 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 55/115 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/417 variables, 237/352 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 179/531 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 538 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 237/255 places, 180/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 237/255 places, 180/205 transitions.
[2026-05-24 19:13:48] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:13:48] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:13:48] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 19:13:48] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:13:48] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:13:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10493010252795287651.gal : 2 ms
[2026-05-24 19:13:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16292413416314128568.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/CTLFireability10493010252795287651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16292413416314128568.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.
Detected timeout of ITS tools.
[2026-05-24 19:14:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:14:19] [INFO ] Applying decomposition
[2026-05-24 19:14:19] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4571413792491701316.txt' '-o' '/tmp/graph4571413792491701316.bin' '-w' '/tmp/graph4571413792491701316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4571413792491701316.bin' '-l' '-1' '-v' '-w' '/tmp/graph4571413792491701316.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:14:19] [INFO ] Decomposing Gal with order
[2026-05-24 19:14:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:14:19] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-24 19:14:19] [INFO ] Flatten gal took : 11 ms
[2026-05-24 19:14:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-24 19:14:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10896177102224192338.gal : 3 ms
[2026-05-24 19:14:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17630718480260790013.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/CTLFireability10896177102224192338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17630718480260790013.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,5.19023e+15,0.77476,24984,4382,73,48380,640,692,58105,89,2527,0


Converting to forward existential form...Done !
original formula: AG((AX(EF((i3.i1.u29.p121==0))) + (AX((i6.i1.u35.p140==1)) * ((i6.i1.u33.p131==1) + EG((((i8.i2.u62.p213==0)||(i2.u13.p57==0))||(i13.i0.u...172
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(!(EX(!(E(TRUE U (i3.i1.u29.p121==0)))))))) * !((i6.i1.u35.p140==1)))] = FALSE * [(((F...324
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t56, t58, t87, t132, t174, i0.t120, i0.u7.t125, i0.u7.t126, i0.u8.t122, i0.u8.t123, ...738
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Graph (complete) has 453 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 249 transition count 181
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 229 transition count 181
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 41 place count 229 transition count 169
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 217 transition count 169
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 208 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 208 transition count 160
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 89 place count 208 transition count 154
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 91 place count 207 transition count 153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 204 transition count 150
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 204 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 204 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 99 place count 204 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 203 transition count 147
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 225 place count 141 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 139 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 138 transition count 83
Applied a total of 228 rules in 33 ms. Remains 138 /255 variables (removed 117) and now considering 83/205 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8608493319660410963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13582678842430002730.kers'
[2026-05-24 19:14:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8608493319660410963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13582678842430002730.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 83 rows 128 cols 312 entries
Finished phase 1 with 48 SingleSign rule and 33 generalized
[2026-05-24 19:14:49] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13582678842430002730.kers
Total runtime 1 ms.
[2026-05-24 19:14:49] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-24 19:14:49] [INFO ] Invariant cache hit.
[2026-05-24 19:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 19:14:49] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [9, 40, 44, 48, 54, 56, 58, 60, 62, 64, 66, 68, 110, 133]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 417 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 124/255 places, 83/205 transitions.
Graph (complete) has 278 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 120 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 118 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 29 place count 106 transition count 66
Applied a total of 29 rules in 5 ms. Remains 106 /124 variables (removed 18) and now considering 66/83 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3297685460075964045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13427046101846370083.kers'
[2026-05-24 19:14:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3297685460075964045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13427046101846370083.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 66 rows 95 cols 236 entries
Finished phase 1 with 59 SingleSign rule and 5 generalized
[2026-05-24 19:14:49] [INFO ] Computed 42 invariants in 0 ms
Computed 42 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13427046101846370083.kers
Total runtime 1 ms.
[2026-05-24 19:14:49] [INFO ] Implicit Places using invariants in 154 ms returned [84, 91, 94]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 156 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/255 places, 66/205 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 100 transition count 62
Applied a total of 6 rules in 6 ms. Remains 100 /103 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13334365926636286542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4199816593485108375.kers'
[2026-05-24 19:14:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13334365926636286542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4199816593485108375.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 62 rows 89 cols 217 entries
Finished phase 1 with 57 SingleSign rule and 4 generalized
[2026-05-24 19:14:49] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4199816593485108375.kers
Total runtime 1 ms.
[2026-05-24 19:14:49] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-24 19:14:49] [INFO ] Invariant cache hit.
[2026-05-24 19:14:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 19:14:50] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 100/255 places, 62/205 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 997 ms. Remains : 100/255 places, 62/205 transitions.
[2026-05-24 19:14:50] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:14:50] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:14:50] [INFO ] Input system was already deterministic with 62 transitions.
[2026-05-24 19:14:50] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:14:50] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:14:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1732873541947008404.gal : 0 ms
[2026-05-24 19:14:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1944699643824432527.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/CTLFireability1732873541947008404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1944699643824432527.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.4723e+08,2.10867,58996,2,63227,5,204889,6,0,441,200772,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 19:15:20] [INFO ] Flatten gal took : 2 ms
[2026-05-24 19:15:20] [INFO ] Applying decomposition
[2026-05-24 19:15:20] [INFO ] Flatten gal took : 1 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/graph4810423459450821304.txt' '-o' '/tmp/graph4810423459450821304.bin' '-w' '/tmp/graph4810423459450821304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4810423459450821304.bin' '-l' '-1' '-v' '-w' '/tmp/graph4810423459450821304.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:15:20] [INFO ] Decomposing Gal with order
[2026-05-24 19:15:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:15:20] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-24 19:15:20] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:15:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2026-05-24 19:15:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5046332580801370002.gal : 1 ms
[2026-05-24 19:15:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4219784467007957160.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/CTLFireability5046332580801370002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4219784467007957160.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,2.4723e+08,0.073203,5264,486,84,2545,352,281,2369,83,741,0


Converting to forward existential form...Done !
original formula: AF(((i6.i1.u18.p152==1) * !(A(((i6.i1.u18.p178==1)||((i7.u20.p185==1)&&(i7.u25.p219==1))) U A((i10.u3.p58==1) U (i1.u7.p83==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((i6.i1.u18.p152==1) * !(!((E(!(!((E(!((i1.u7.p83==1)) U (!((i10.u3.p58==1)) * !((i1.u7.p83==1)))) ...464
Reverse transition relation is NOT exact ! Due to transitions t21, t41, t42, t58, t61, u1.t14, u0.t30, i1.t48, i1.u7.t19, i3.t37, i3.u9.t3, i3.u10.t36, i4....301
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,6.68749,217872,1,0,547071,1587,1537,668049,399,5203,552402
FORMULA DES-PT-01b-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 244 transition count 194
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 244 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 244 transition count 189
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 239 transition count 184
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 239 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 239 transition count 182
Applied a total of 39 rules in 11 ms. Remains 239 /255 variables (removed 16) and now considering 182/205 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5524471374394885046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9613324824762211025.kers'
[2026-05-24 19:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5524471374394885046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9613324824762211025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 239 cols 543 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 19:15:27] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9613324824762211025.kers
Total runtime 3 ms.
[2026-05-24 19:15:27] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-24 19:15:27] [INFO ] Invariant cache hit.
[2026-05-24 19:15:27] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-24 19:15:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 17/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 182/421 variables, 239/350 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 354 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 55/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/421 variables, 239/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 181/535 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 9/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 545 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 239/255 places, 182/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 239/255 places, 182/205 transitions.
[2026-05-24 19:16:27] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:16:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 19:16:27] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-24 19:16:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 19:16:27] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:16:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5466993309173461404.gal : 2 ms
[2026-05-24 19:16:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4303686394263715519.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/CTLFireability5466993309173461404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4303686394263715519.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-24 19:16:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 19:16:57] [INFO ] Applying decomposition
[2026-05-24 19:16: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/graph1285394347981876477.txt' '-o' '/tmp/graph1285394347981876477.bin' '-w' '/tmp/graph1285394347981876477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1285394347981876477.bin' '-l' '-1' '-v' '-w' '/tmp/graph1285394347981876477.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:16:57] [INFO ] Decomposing Gal with order
[2026-05-24 19:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:16:58] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-24 19:16:58] [INFO ] Flatten gal took : 12 ms
[2026-05-24 19:16:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 19:16:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18362272188308485545.gal : 4 ms
[2026-05-24 19:16:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6163022800383968147.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/CTLFireability18362272188308485545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6163022800383968147.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.6303e+15,0.725753,23872,2546,69,45091,542,678,85039,84,1865,0


Converting to forward existential form...Done !
original formula: (!(E(EF((i11.u67.p246!=1)) U (AG((i4.i1.u28.p119==1)) * (i4.i1.u28.p110==1)))) + ((!(E((E(((i10.i0.u44.p162==1)&&(i10.i2.u50.p187==1)) U ...668
=> equivalent forward existential formula: (([(FwdU((Init * !(!(E(E(TRUE U (i11.u67.p246!=1)) U (!(E(TRUE U !((i4.i1.u28.p119==1)))) * (i4.i1.u28.p110==1))...1067
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t90, t134, t175, i0.u11.t115, i0.u13.t112, i1.t122, i1.u6.t127, i1.u6.t128, i1.u7.t1...759
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 205/205 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 245 transition count 195
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 245 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 245 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 240 transition count 187
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 240 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 240 transition count 184
Applied a total of 36 rules in 23 ms. Remains 240 /255 variables (removed 15) and now considering 184/205 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16193868550360952533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5044167264013790344.kers'
[2026-05-24 19:17:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16193868550360952533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5044167264013790344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 240 cols 551 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-24 19:17:28] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5044167264013790344.kers
Total runtime 2 ms.
[2026-05-24 19:17:28] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-05-24 19:17:28] [INFO ] Invariant cache hit.
[2026-05-24 19:17:28] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2026-05-24 19:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 184/424 variables, 240/342 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 11/353 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 359 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 184/424 variables, 240/359 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 183/542 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 16/558 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 558 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 240/255 places, 184/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60839 ms. Remains : 240/255 places, 184/205 transitions.
[2026-05-24 19:18:28] [INFO ] Flatten gal took : 7 ms
[2026-05-24 19:18:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 19:18:28] [INFO ] Input system was already deterministic with 184 transitions.
[2026-05-24 19:18:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 19:18:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 19:18:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7788459706670990928.gal : 2 ms
[2026-05-24 19:18:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8919119656765107696.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/CTLFireability7788459706670990928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8919119656765107696.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-24 19:18:59] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:18:59] [INFO ] Applying decomposition
[2026-05-24 19:18:59] [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/graph3659913063390459353.txt' '-o' '/tmp/graph3659913063390459353.bin' '-w' '/tmp/graph3659913063390459353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3659913063390459353.bin' '-l' '-1' '-v' '-w' '/tmp/graph3659913063390459353.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:18:59] [INFO ] Decomposing Gal with order
[2026-05-24 19:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:18:59] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-24 19:18:59] [INFO ] Flatten gal took : 16 ms
[2026-05-24 19:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-24 19:18:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10712791392026753063.gal : 3 ms
[2026-05-24 19:18:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9818649794599171718.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/CTLFireability10712791392026753063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9818649794599171718.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,6.00322e+15,0.503446,19484,2304,61,37248,597,691,48963,83,1741,0


Converting to forward existential form...Done !
original formula: AF(((EX(((((i3.i0.u18.p76==1)&&(i10.i3.u59.p235==1))&&((i2.i0.u11.p48==1)&&((i7.i2.u37.p143==1)||((i11.u67.p260==1)&&(i11.u73.p262==1))))...469
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((((i3.i0.u18.p76==1)&&(i10.i3.u59.p235==1))&&((i2.i0.u11.p48==1)&&((i7.i2.u37.p143==1)||((i11...587
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t63, t88, t100, t120, t134, t156, t178, i0.i1.u32.t80, i0.i2.u14.t110, i1.u8.t123, i...740
Detected timeout of ITS tools.
[2026-05-24 19:19:29] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:19:29] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:19:29] [INFO ] Applying decomposition
[2026-05-24 19:19:29] [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/graph6413225577966578813.txt' '-o' '/tmp/graph6413225577966578813.bin' '-w' '/tmp/graph6413225577966578813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6413225577966578813.bin' '-l' '-1' '-v' '-w' '/tmp/graph6413225577966578813.weights' '-q' '0' '-e' '0.001'
[2026-05-24 19:19:29] [INFO ] Decomposing Gal with order
[2026-05-24 19:19:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:19:29] [INFO ] Removed a total of 24 redundant transitions.
[2026-05-24 19:19:29] [INFO ] Flatten gal took : 11 ms
[2026-05-24 19:19:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 21 ms.
[2026-05-24 19:19:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8293645546965078604.gal : 8 ms
[2026-05-24 19:19:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15735248798360450816.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/CTLFireability8293645546965078604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15735248798360450816.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,2.60993e+16,0.532374,17440,2778,61,31963,433,708,40286,89,1407,0


Converting to forward existential form...Done !
original formula: EX((!(E(EG(EF((i6.u28.p96==1))) U (A((i8.i1.u38.p131==1) U (i13.u84.p275==1)) * A((i8.i0.u40.p133==1) U (i8.i1.u42.p141==1))))) + ((i9.i0...190
=> equivalent forward existential formula: ([(EY(Init) * !(E(EG(E(TRUE U (i6.u28.p96==1))) U (!((E(!((i13.u84.p275==1)) U (!((i8.i1.u38.p131==1)) * !((i13....395
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t93, t134, t149, t174, i0.i0.u37.t81, i0.i1.u85.t17, i1.u6.t137, i1.u6.t139, i2...807
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 19:45:37] [INFO ] Applying decomposition
[2026-05-24 19:45:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 19:45:37] [INFO ] Decomposing Gal with order
[2026-05-24 19:45:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 19:45:37] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-24 19:45:37] [INFO ] Flatten gal took : 29 ms
[2026-05-24 19:45:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 22 ms.
[2026-05-24 19:45:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15819487729369661736.gal : 4 ms
[2026-05-24 19:45:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3209789598866794388.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/CTLFireability15819487729369661736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3209789598866794388.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,2.60993e+16,22.4318,533500,34665,248,599047,1259,637,5.16176e+06,130,4531,0


Converting to forward existential form...Done !
original formula: EX((!(E(EG(EF((i1.i0.i1.i0.i1.i0.i1.u133.p96==1))) U (A((i1.i1.u136.p131==1) U (i1.i1.i0.i1.u103.p275==1)) * A((i1.i1.i0.i0.u137.p133==1)...265
=> equivalent forward existential formula: ([(EY(Init) * !(E(EG(E(TRUE U (i1.i0.i1.i0.i1.i0.i1.u133.p96==1))) U (!((E(!((i1.i1.i0.i1.u103.p275==1)) U (!((i...508
Reverse transition relation is NOT exact ! Due to transitions t149, i0.t0, i1.i0.i0.u20.t114, i1.i0.i0.u20.t116, i1.i0.i0.i0.u19.t119, i1.i0.i0.i0.i0.u18.t...1826

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="DES-PT-01b"
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 DES-PT-01b, 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 r082-smll-177946993700322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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