fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695500370
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DiscoveryGPU-PT-14b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16196.636 3600000.00 3215159.00 277603.40 ??F???T?TT??F?TF normal

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.r098-tall-177955695500370.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 DiscoveryGPU-PT-14b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 6 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 6 16:12 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.6K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 6 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 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 104K 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 DiscoveryGPU-PT-14b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-14b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779603697256

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 06:21:38] [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 06:21:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:21:38] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-24 06:21:38] [INFO ] Transformed 408 places.
[2026-05-24 06:21:38] [INFO ] Transformed 434 transitions.
[2026-05-24 06:21:38] [INFO ] Found NUPN structural information;
[2026-05-24 06:21:38] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 57 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 380 transition count 434
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 86 place count 322 transition count 376
Iterating global reduction 1 with 58 rules applied. Total rules applied 144 place count 322 transition count 376
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 311 transition count 365
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 311 transition count 365
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 301 transition count 355
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 301 transition count 355
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 192 place count 295 transition count 349
Iterating global reduction 1 with 6 rules applied. Total rules applied 198 place count 295 transition count 349
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 292 transition count 343
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 292 transition count 343
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 290 transition count 341
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 290 transition count 341
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 210 place count 288 transition count 339
Iterating global reduction 1 with 2 rules applied. Total rules applied 212 place count 288 transition count 339
Applied a total of 212 rules in 115 ms. Remains 288 /408 variables (removed 120) and now considering 339/434 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8688986998724758392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-232141692231705778.kers'
[2026-05-24 06:21:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8688986998724758392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-232141692231705778.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 339 rows 288 cols 903 entries
Finished phase 1 with 286 SingleSign rule and 0 generalized
[2026-05-24 06:21:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-232141692231705778.kers
Total runtime 4 ms.
[2026-05-24 06:21:39] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-24 06:21:39] [INFO ] Invariant cache hit.
[2026-05-24 06:21:39] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-05-24 06:21:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 339/627 variables, 288/290 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 9/319 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/627 variables, and 319 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 339/627 variables, 288/319 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 338/657 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/627 variables, and 657 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 288/408 places, 339/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60886 ms. Remains : 288/408 places, 339/434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Applied a total of 0 rules in 6 ms. Remains 288 /288 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-24 06:22:39] [INFO ] Invariant cache hit.
[2026-05-24 06:22:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 06:22:39] [INFO ] Invariant cache hit.
[2026-05-24 06:22:39] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 288/288 places, 339/339 transitions.
Support contains 57 out of 288 places after structural reductions.
[2026-05-24 06:22:39] [INFO ] Flatten gal took : 44 ms
[2026-05-24 06:22:39] [INFO ] Flatten gal took : 18 ms
[2026-05-24 06:22:40] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 40000 steps (86 resets) in 1533 ms. (26 steps per ms) remains 2/44 properties
BEST_FIRST walk for 40002 steps (14 resets) in 144 ms. (275 steps per ms) remains 1/2 properties
BEST_FIRST walk for 25172 steps (5 resets) in 49 ms. (503 steps per ms) remains 0/1 properties
[2026-05-24 06:22:40] [INFO ] Flatten gal took : 14 ms
[2026-05-24 06:22:40] [INFO ] Flatten gal took : 15 ms
[2026-05-24 06:22:40] [INFO ] Input system was already deterministic with 339 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 268 transition count 318
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 268 transition count 318
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 259 transition count 306
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 259 transition count 306
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 251 transition count 296
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 251 transition count 296
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 244 transition count 289
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 244 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 240 transition count 283
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 240 transition count 283
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 238 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 238 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 236 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 236 transition count 279
Applied a total of 104 rules in 27 ms. Remains 236 /288 variables (removed 52) and now considering 279/339 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10174864029798160386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18352524717809127226.kers'
[2026-05-24 06:22:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10174864029798160386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18352524717809127226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 236 cols 753 entries
Finished phase 1 with 234 SingleSign rule and 0 generalized
[2026-05-24 06:22:40] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18352524717809127226.kers
Total runtime 3 ms.
[2026-05-24 06:22:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 06:22:40] [INFO ] Invariant cache hit.
[2026-05-24 06:22:40] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 06:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/515 variables, 236/238 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 252 constraints, problems are : Problem set: 0 solved, 278 unsolved in 19458 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/515 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 278/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 530 constraints, problems are : Problem set: 0 solved, 278 unsolved in 25474 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44983ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 44985ms
Starting structural reductions in LTL mode, iteration 1 : 236/288 places, 279/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45209 ms. Remains : 236/288 places, 279/339 transitions.
[2026-05-24 06:23:25] [INFO ] Flatten gal took : 14 ms
[2026-05-24 06:23:25] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:23:25] [INFO ] Input system was already deterministic with 279 transitions.
[2026-05-24 06:23:25] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:23:25] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:23:25] [INFO ] Time to serialize gal into /tmp/CTLFireability18416333047684019489.gal : 6 ms
[2026-05-24 06:23:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6537914346426738803.ctl : 8 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/CTLFireability18416333047684019489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6537914346426738803.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:23:56] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:23:56] [INFO ] Applying decomposition
[2026-05-24 06:23:56] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3310931597174035291.txt' '-o' '/tmp/graph3310931597174035291.bin' '-w' '/tmp/graph3310931597174035291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3310931597174035291.bin' '-l' '-1' '-v' '-w' '/tmp/graph3310931597174035291.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:23:56] [INFO ] Decomposing Gal with order
[2026-05-24 06:23:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:23:56] [INFO ] Removed a total of 111 redundant transitions.
[2026-05-24 06:23:56] [INFO ] Flatten gal took : 60 ms
[2026-05-24 06:23:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2026-05-24 06:23:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1224293380966888700.gal : 6 ms
[2026-05-24 06:23:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8211986371564353186.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/CTLFireability1224293380966888700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8211986371564353186.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 267 transition count 316
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 267 transition count 316
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 258 transition count 304
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 258 transition count 304
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 249 transition count 294
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 249 transition count 294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 242 transition count 286
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 242 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 238 transition count 280
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 238 transition count 280
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 235 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 235 transition count 277
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 233 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 233 transition count 275
Applied a total of 110 rules in 49 ms. Remains 233 /288 variables (removed 55) and now considering 275/339 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13310909111468921899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12622799470512086199.kers'
[2026-05-24 06:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13310909111468921899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12622799470512086199.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 233 cols 744 entries
Finished phase 1 with 231 SingleSign rule and 0 generalized
[2026-05-24 06:24:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12622799470512086199.kers
Total runtime 2 ms.
[2026-05-24 06:24:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 06:24:26] [INFO ] Invariant cache hit.
[2026-05-24 06:24:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2026-05-24 06:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/508 variables, 233/235 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 14/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/508 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 249 constraints, problems are : Problem set: 0 solved, 274 unsolved in 19157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/508 variables, 233/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 274/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 523 constraints, problems are : Problem set: 0 solved, 274 unsolved in 24221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43430ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 43435ms
Starting structural reductions in LTL mode, iteration 1 : 233/288 places, 275/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43720 ms. Remains : 233/288 places, 275/339 transitions.
[2026-05-24 06:25:10] [INFO ] Flatten gal took : 16 ms
[2026-05-24 06:25:10] [INFO ] Flatten gal took : 14 ms
[2026-05-24 06:25:10] [INFO ] Input system was already deterministic with 275 transitions.
[2026-05-24 06:25:10] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:25:10] [INFO ] Flatten gal took : 15 ms
[2026-05-24 06:25:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8109239171498012025.gal : 2 ms
[2026-05-24 06:25:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10453977799879944184.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/CTLFireability8109239171498012025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10453977799879944184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:25:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:25:40] [INFO ] Applying decomposition
[2026-05-24 06:25:40] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15398523278453953607.txt' '-o' '/tmp/graph15398523278453953607.bin' '-w' '/tmp/graph15398523278453953607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15398523278453953607.bin' '-l' '-1' '-v' '-w' '/tmp/graph15398523278453953607.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:25:40] [INFO ] Decomposing Gal with order
[2026-05-24 06:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:25:40] [INFO ] Removed a total of 111 redundant transitions.
[2026-05-24 06:25:40] [INFO ] Flatten gal took : 17 ms
[2026-05-24 06:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2026-05-24 06:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6439778593764138584.gal : 4 ms
[2026-05-24 06:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10588393335497559730.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/CTLFireability6439778593764138584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10588393335497559730.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 281 transition count 285
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 234 transition count 285
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 95 place count 234 transition count 246
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 173 place count 195 transition count 246
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 185 place count 183 transition count 232
Iterating global reduction 2 with 12 rules applied. Total rules applied 197 place count 183 transition count 232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 205 place count 175 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 213 place count 175 transition count 222
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 169 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 169 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 166 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 166 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 165 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 165 transition count 209
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 277 place count 143 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 278 place count 142 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 142 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 280 place count 141 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 141 transition count 184
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 141 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 139 transition count 182
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 206 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 141 edges and 137 vertex of which 56 / 137 are part of one of the 28 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 17 rules applied. Total rules applied 302 place count 109 transition count 167
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 344 place count 95 transition count 139
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 344 place count 95 transition count 125
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 372 place count 81 transition count 125
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 383 place count 70 transition count 103
Iterating global reduction 4 with 11 rules applied. Total rules applied 394 place count 70 transition count 103
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 405 place count 59 transition count 81
Iterating global reduction 4 with 11 rules applied. Total rules applied 416 place count 59 transition count 81
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 427 place count 48 transition count 70
Iterating global reduction 4 with 11 rules applied. Total rules applied 438 place count 48 transition count 70
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 449 place count 37 transition count 48
Iterating global reduction 4 with 11 rules applied. Total rules applied 460 place count 37 transition count 48
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 471 place count 26 transition count 37
Iterating global reduction 4 with 11 rules applied. Total rules applied 482 place count 26 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 485 place count 23 transition count 34
Applied a total of 485 rules in 102 ms. Remains 23 /288 variables (removed 265) and now considering 34/339 (removed 305) transitions.
[2026-05-24 06:26:10] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4494388343879870015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7453835017621578449.kers'
[2026-05-24 06:26:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4494388343879870015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7453835017621578449.kers]
Normalized transition count is 28 out of 29 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 28 rows 22 cols 57 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-24 06:26:10] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7453835017621578449.kers
Total runtime 0 ms.
[2026-05-24 06:26:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 06:26:10] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2026-05-24 06:26:10] [INFO ] Invariant cache hit.
[2026-05-24 06:26:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 06:26:10] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-24 06:26:10] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2026-05-24 06:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 28/48 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 3/51 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/52 variables, and 24 constraints, problems are : Problem set: 0 solved, 27 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 28/48 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 3/51 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 27 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 609ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/288 places, 34/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 760 ms. Remains : 23/288 places, 34/339 transitions.
[2026-05-24 06:26:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:26:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:26:11] [INFO ] Input system was already deterministic with 34 transitions.
[2026-05-24 06:26:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:26:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12634414877424004554.gal : 0 ms
[2026-05-24 06:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1399556388221847821.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/CTLFireability12634414877424004554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1399556388221847821.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!(EF((p341==1))) U ((p22==1)&&(p406==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p22==1)&&(p406==1)))))) * !(E(!(((p22==1)&&(p406==1))) U (!(!(E(TRUE U (p341==1)))) * !(((p22...186
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t23, t24, t25, t26, t27, t28, t30, t32, Intersection with reachable at each step ena...208
(forward)formula 0,0,1.48773,48520,1,0,767,225695,91,355,792,319728,851
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 267 transition count 317
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 267 transition count 317
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 258 transition count 306
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 258 transition count 306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 251 transition count 297
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 251 transition count 297
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 246 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 246 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 243 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 243 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 241 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 241 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 239 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 239 transition count 283
Applied a total of 98 rules in 39 ms. Remains 239 /288 variables (removed 49) and now considering 283/339 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2819411435734610608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8777728695378050709.kers'
[2026-05-24 06:26:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2819411435734610608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8777728695378050709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 239 cols 766 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-24 06:26:12] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8777728695378050709.kers
Total runtime 3 ms.
[2026-05-24 06:26:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 06:26:12] [INFO ] Invariant cache hit.
[2026-05-24 06:26:12] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-24 06:26:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 283/522 variables, 239/241 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 14/255 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/522 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 255 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/522 variables, 239/255 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 282/537 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 537 constraints, problems are : Problem set: 0 solved, 282 unsolved in 26122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46890ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 46892ms
Starting structural reductions in LTL mode, iteration 1 : 239/288 places, 283/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47104 ms. Remains : 239/288 places, 283/339 transitions.
[2026-05-24 06:26:59] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:26:59] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:26:59] [INFO ] Input system was already deterministic with 283 transitions.
[2026-05-24 06:26:59] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:26:59] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:26:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7613989704325316040.gal : 2 ms
[2026-05-24 06:26:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7837717443824750839.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/CTLFireability7613989704325316040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7837717443824750839.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 06:27:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:27:29] [INFO ] Applying decomposition
[2026-05-24 06:27:29] [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/graph351703092325753327.txt' '-o' '/tmp/graph351703092325753327.bin' '-w' '/tmp/graph351703092325753327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph351703092325753327.bin' '-l' '-1' '-v' '-w' '/tmp/graph351703092325753327.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:27:29] [INFO ] Decomposing Gal with order
[2026-05-24 06:27:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:27:29] [INFO ] Removed a total of 114 redundant transitions.
[2026-05-24 06:27:29] [INFO ] Flatten gal took : 13 ms
[2026-05-24 06:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2026-05-24 06:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6946362299066650623.gal : 3 ms
[2026-05-24 06:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16774353594229893772.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/CTLFireability6946362299066650623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16774353594229893772.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 284 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 283 transition count 286
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 235 transition count 286
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 97 place count 235 transition count 248
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 173 place count 197 transition count 248
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 181 place count 189 transition count 239
Iterating global reduction 2 with 8 rules applied. Total rules applied 189 place count 189 transition count 239
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 184 transition count 232
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 184 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 180 transition count 227
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 180 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 209 place count 178 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 178 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 177 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 177 transition count 223
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 257 place count 155 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 259 place count 153 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 261 place count 153 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 263 place count 151 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 265 place count 151 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 150 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 150 transition count 194
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 150 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 149 transition count 193
Applied a total of 269 rules in 61 ms. Remains 149 /288 variables (removed 139) and now considering 193/339 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9700717166139943977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10508256350626367763.kers'
[2026-05-24 06:28:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9700717166139943977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10508256350626367763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 149 cols 517 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-24 06:28:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10508256350626367763.kers
Total runtime 0 ms.
[2026-05-24 06:28:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 06:28:00] [INFO ] Invariant cache hit.
[2026-05-24 06:28:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 06:28:00] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-24 06:28:00] [INFO ] Redundant transitions in 9 ms returned []
Running 191 sub problems to find dead transitions.
[2026-05-24 06:28:00] [INFO ] Invariant cache hit.
[2026-05-24 06:28:00] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 193/341 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 21/171 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 1/342 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 172 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 193/341 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 21/171 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 191/362 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 363 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18721ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18721ms
Starting structural reductions in SI_CTL mode, iteration 1 : 149/288 places, 193/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18983 ms. Remains : 149/288 places, 193/339 transitions.
[2026-05-24 06:28:19] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:28:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:28:19] [INFO ] Input system was already deterministic with 193 transitions.
[2026-05-24 06:28:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:28:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:28:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2267852091150919780.gal : 1 ms
[2026-05-24 06:28:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9074011427206970254.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/CTLFireability2267852091150919780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9074011427206970254.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.78814e+15,19.3041,478980,2,77939,5,3.0408e+06,6,0,760,1.68199e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 06:28:49] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:28:49] [INFO ] Applying decomposition
[2026-05-24 06:28:49] [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/graph16569421915362305686.txt' '-o' '/tmp/graph16569421915362305686.bin' '-w' '/tmp/graph16569421915362305686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16569421915362305686.bin' '-l' '-1' '-v' '-w' '/tmp/graph16569421915362305686.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:28:49] [INFO ] Decomposing Gal with order
[2026-05-24 06:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:28:49] [INFO ] Removed a total of 95 redundant transitions.
[2026-05-24 06:28:49] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2026-05-24 06:28:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11149188235034905440.gal : 2 ms
[2026-05-24 06:28:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15941812985452185091.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/CTLFireability11149188235034905440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15941812985452185091.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 281 transition count 286
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 235 transition count 286
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 93 place count 235 transition count 248
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 169 place count 197 transition count 248
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 180 place count 186 transition count 235
Iterating global reduction 2 with 11 rules applied. Total rules applied 191 place count 186 transition count 235
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 198 place count 179 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 179 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 210 place count 174 transition count 220
Iterating global reduction 2 with 5 rules applied. Total rules applied 215 place count 174 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 218 place count 171 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 221 place count 171 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 223 place count 169 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 169 transition count 213
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 269 place count 147 transition count 191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 271 place count 145 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 145 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 275 place count 143 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 277 place count 143 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 278 place count 142 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 142 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 281 place count 140 transition count 182
Applied a total of 281 rules in 47 ms. Remains 140 /288 variables (removed 148) and now considering 182/339 (removed 157) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7283810115532500395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-210476116709816435.kers'
[2026-05-24 06:29:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7283810115532500395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-210476116709816435.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 138 cols 436 entries
Finished phase 1 with 138 SingleSign rule and 0 generalized
[2026-05-24 06:29:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-210476116709816435.kers
Total runtime 1 ms.
[2026-05-24 06:29:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 06:29:19] [INFO ] Invariant cache hit.
[2026-05-24 06:29:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2026-05-24 06:29:19] [INFO ] Redundant transitions in 12 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-24 06:29:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 2/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 182/322 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 142 constraints, problems are : Problem set: 0 solved, 180 unsolved in 5507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 2/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 182/322 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 180/322 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 322 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13527ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 13528ms
Starting structural reductions in SI_CTL mode, iteration 1 : 140/288 places, 182/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13731 ms. Remains : 140/288 places, 182/339 transitions.
[2026-05-24 06:29:33] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:29:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:29:33] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-24 06:29:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:29:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:29:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8542111383177393245.gal : 0 ms
[2026-05-24 06:29:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1613057463034954533.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/CTLFireability8542111383177393245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1613057463034954533.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,8.38119e+15,23.0136,544620,2,102131,5,3.74724e+06,6,0,717,1.88848e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 06:30:03] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:30:03] [INFO ] Applying decomposition
[2026-05-24 06:30:03] [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/graph6933368033167899216.txt' '-o' '/tmp/graph6933368033167899216.bin' '-w' '/tmp/graph6933368033167899216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6933368033167899216.bin' '-l' '-1' '-v' '-w' '/tmp/graph6933368033167899216.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:30:03] [INFO ] Decomposing Gal with order
[2026-05-24 06:30:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:30:03] [INFO ] Removed a total of 98 redundant transitions.
[2026-05-24 06:30:03] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:30:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 3 ms.
[2026-05-24 06:30:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12881453021990655990.gal : 2 ms
[2026-05-24 06:30:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14168545661431447980.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/CTLFireability12881453021990655990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14168545661431447980.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 281 transition count 285
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 234 transition count 285
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 95 place count 234 transition count 245
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 175 place count 194 transition count 245
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 186 place count 183 transition count 232
Iterating global reduction 2 with 11 rules applied. Total rules applied 197 place count 183 transition count 232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 205 place count 175 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 213 place count 175 transition count 222
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 169 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 169 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 165 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 165 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 235 place count 163 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 163 transition count 206
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 281 place count 141 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 283 place count 139 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 139 transition count 181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 287 place count 137 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 289 place count 137 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 290 place count 136 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 136 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 292 place count 136 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 134 transition count 175
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 15 rules applied. Total rules applied 309 place count 133 transition count 161
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 325 place count 119 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 118 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 326 place count 118 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 330 place count 116 transition count 157
Applied a total of 330 rules in 41 ms. Remains 116 /288 variables (removed 172) and now considering 157/339 (removed 182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17477882782714681782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5532762609511625572.kers'
[2026-05-24 06:30:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17477882782714681782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5532762609511625572.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 157 rows 115 cols 326 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 06:30:33] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5532762609511625572.kers
Total runtime 2 ms.
[2026-05-24 06:30:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 06:30:33] [INFO ] Invariant cache hit.
[2026-05-24 06:30:33] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-24 06:30:33] [INFO ] Redundant transitions in 2 ms returned []
Running 143 sub problems to find dead transitions.
[2026-05-24 06:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 157/259 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 14/273 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 118 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 157/259 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 143/247 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 14/273 variables, 14/261 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 261 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10579ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 10579ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/288 places, 157/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10782 ms. Remains : 116/288 places, 157/339 transitions.
[2026-05-24 06:30:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:30:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:30:44] [INFO ] Input system was already deterministic with 157 transitions.
RANDOM walk for 418 steps (2 resets) in 6 ms. (59 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 06:30:44] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:30:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:30:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17503183021426557335.gal : 1 ms
[2026-05-24 06:30:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9448058729483525028.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/ReachabilityCardinality17503183021426557335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9448058729483525028.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 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 281 transition count 284
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 233 transition count 284
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 97 place count 233 transition count 246
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 173 place count 195 transition count 246
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 185 place count 183 transition count 232
Iterating global reduction 2 with 12 rules applied. Total rules applied 197 place count 183 transition count 232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 205 place count 175 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 213 place count 175 transition count 222
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 169 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 169 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 165 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 165 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 235 place count 163 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 163 transition count 206
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 281 place count 141 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 283 place count 139 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 139 transition count 181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 287 place count 137 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 289 place count 137 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 290 place count 136 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 136 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 293 place count 134 transition count 175
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 309 place count 133 transition count 160
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 326 place count 118 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 117 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 327 place count 117 transition count 157
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 329 place count 116 transition count 157
Applied a total of 329 rules in 30 ms. Remains 116 /288 variables (removed 172) and now considering 157/339 (removed 182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2010005015315619461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14077504791936001344.kers'
[2026-05-24 06:30:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2010005015315619461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14077504791936001344.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 157 rows 115 cols 369 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 06:30:44] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14077504791936001344.kers
Total runtime 2 ms.
[2026-05-24 06:30:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 06:30:44] [INFO ] Invariant cache hit.
[2026-05-24 06:30:44] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2026-05-24 06:30:44] [INFO ] Redundant transitions in 1 ms returned []
Running 156 sub problems to find dead transitions.
[2026-05-24 06:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/273 variables, 116/117 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 0/273 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 117 constraints, problems are : Problem set: 0 solved, 156 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/273 variables, 116/117 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 156/273 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 273 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5723 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9666ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 9668ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/288 places, 157/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9835 ms. Remains : 116/288 places, 157/339 transitions.
[2026-05-24 06:30:53] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:30:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:30:53] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-24 06:30:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:30:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:30:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12111079646769627854.gal : 1 ms
[2026-05-24 06:30:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4930874622750654807.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/CTLFireability12111079646769627854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4930874622750654807.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29353e+14,6.41839,186960,2,59549,5,1.2787e+06,6,0,596,624192,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 06:31:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:31:24] [INFO ] Applying decomposition
[2026-05-24 06:31:24] [INFO ] Flatten gal took : 2 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/graph6677731695745042053.txt' '-o' '/tmp/graph6677731695745042053.bin' '-w' '/tmp/graph6677731695745042053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6677731695745042053.bin' '-l' '-1' '-v' '-w' '/tmp/graph6677731695745042053.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:31:24] [INFO ] Decomposing Gal with order
[2026-05-24 06:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:31:24] [INFO ] Removed a total of 82 redundant transitions.
[2026-05-24 06:31:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 1 ms.
[2026-05-24 06:31:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5827717010912692858.gal : 1 ms
[2026-05-24 06:31:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5265239350355072940.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/CTLFireability5827717010912692858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5265239350355072940.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 281 transition count 284
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 233 transition count 284
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 97 place count 233 transition count 244
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 177 place count 193 transition count 244
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 189 place count 181 transition count 230
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 181 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 209 place count 173 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 217 place count 173 transition count 220
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 167 transition count 212
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 167 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 233 place count 163 transition count 206
Iterating global reduction 2 with 4 rules applied. Total rules applied 237 place count 163 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 239 place count 161 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 241 place count 161 transition count 204
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 283 place count 140 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 138 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 138 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 289 place count 136 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 291 place count 136 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 292 place count 135 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 293 place count 135 transition count 176
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 133 transition count 174
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 159 edges and 131 vertex of which 127 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 139 edges and 127 vertex of which 56 / 127 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 46 rules applied. Total rules applied 341 place count 99 transition count 127
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 411 place count 57 transition count 99
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 424 place count 44 transition count 73
Iterating global reduction 4 with 13 rules applied. Total rules applied 437 place count 44 transition count 73
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 450 place count 31 transition count 47
Iterating global reduction 4 with 13 rules applied. Total rules applied 463 place count 31 transition count 47
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 476 place count 18 transition count 21
Iterating global reduction 4 with 13 rules applied. Total rules applied 489 place count 18 transition count 21
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 501 place count 6 transition count 9
Iterating global reduction 4 with 12 rules applied. Total rules applied 513 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 514 place count 6 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 515 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 516 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 517 place count 4 transition count 6
Applied a total of 517 rules in 27 ms. Remains 4 /288 variables (removed 284) and now considering 6/339 (removed 333) transitions.
[2026-05-24 06:31:54] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16275583122452095918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15066469512115543172.kers'
[2026-05-24 06:31:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16275583122452095918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15066469512115543172.kers]
Normalized transition count is 4 out of 5 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 4 cols 7 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 06:31:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15066469512115543172.kers
Total runtime 0 ms.
[2026-05-24 06:31:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 06:31:54] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2026-05-24 06:31:54] [INFO ] Invariant cache hit.
[2026-05-24 06:31:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2026-05-24 06:31:54] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-24 06:31:54] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2026-05-24 06:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/288 places, 6/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 167 ms. Remains : 4/288 places, 6/339 transitions.
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:31:54] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 06:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4512258938078910800.gal : 0 ms
[2026-05-24 06:31:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13100736279476883681.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/ReachabilityCardinality4512258938078910800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13100736279476883681.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 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 281 transition count 286
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 235 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 234 transition count 285
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 95 place count 234 transition count 245
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 175 place count 194 transition count 245
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 187 place count 182 transition count 231
Iterating global reduction 3 with 12 rules applied. Total rules applied 199 place count 182 transition count 231
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 207 place count 174 transition count 221
Iterating global reduction 3 with 8 rules applied. Total rules applied 215 place count 174 transition count 221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 221 place count 168 transition count 213
Iterating global reduction 3 with 6 rules applied. Total rules applied 227 place count 168 transition count 213
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 230 place count 165 transition count 209
Iterating global reduction 3 with 3 rules applied. Total rules applied 233 place count 165 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 234 place count 164 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 164 transition count 208
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 142 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 281 place count 140 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 283 place count 140 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 285 place count 138 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 138 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 288 place count 137 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 137 transition count 179
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 137 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 135 transition count 177
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 162 edges and 133 vertex of which 129 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 140 edges and 129 vertex of which 54 / 129 are part of one of the 27 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 46 rules applied. Total rules applied 338 place count 102 transition count 130
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 408 place count 60 transition count 102
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 420 place count 48 transition count 78
Iterating global reduction 5 with 12 rules applied. Total rules applied 432 place count 48 transition count 78
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 444 place count 36 transition count 54
Iterating global reduction 5 with 12 rules applied. Total rules applied 456 place count 36 transition count 54
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 468 place count 24 transition count 30
Iterating global reduction 5 with 12 rules applied. Total rules applied 480 place count 24 transition count 30
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 492 place count 12 transition count 18
Iterating global reduction 5 with 12 rules applied. Total rules applied 504 place count 12 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 505 place count 12 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 506 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 507 place count 11 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 509 place count 9 transition count 14
Applied a total of 509 rules in 29 ms. Remains 9 /288 variables (removed 279) and now considering 14/339 (removed 325) transitions.
[2026-05-24 06:31:54] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10301639876607865086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16973694943922913738.kers'
[2026-05-24 06:31:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10301639876607865086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16973694943922913738.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 19 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 06:31:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16973694943922913738.kers
Total runtime 0 ms.
[2026-05-24 06:31:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 06:31:54] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
[2026-05-24 06:31:54] [INFO ] Invariant cache hit.
[2026-05-24 06:31:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2026-05-24 06:31:54] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 06:31:54] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
[2026-05-24 06:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 10 unsolved in 66 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/288 places, 14/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 254 ms. Remains : 9/288 places, 14/339 transitions.
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:31:54] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:31:54] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:31:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9708227611410873139.gal : 0 ms
[2026-05-24 06:31:54] [INFO ] Time to serialize properties into /tmp/CTLFireability559187948891730310.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/CTLFireability9708227611410873139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability559187948891730310.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 -...282
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,840,0.003592,3816,2,29,5,198,6,0,45,190,0


Converting to forward existential form...Done !
original formula: EF(((p77==1) * EG((p70==0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p77==1)),(p70==0))] != FALSE
Hit Full ! (commute/partial/dont) 12/0/2
(forward)formula 0,1,0.005411,4088,1,0,10,332,20,5,227,340,9
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 264 transition count 313
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 264 transition count 313
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 253 transition count 299
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 253 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 243 transition count 287
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 243 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 235 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 235 transition count 278
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 230 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 227 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 225 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 225 transition count 266
Applied a total of 126 rules in 20 ms. Remains 225 /288 variables (removed 63) and now considering 266/339 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10623432051457680674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17121606881292287220.kers'
[2026-05-24 06:31:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10623432051457680674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17121606881292287220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 225 cols 720 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-24 06:31:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17121606881292287220.kers
Total runtime 1 ms.
[2026-05-24 06:31:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-24 06:31:54] [INFO ] Invariant cache hit.
[2026-05-24 06:31:54] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-24 06:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/491 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 14/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/491 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 241 constraints, problems are : Problem set: 0 solved, 265 unsolved in 18295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/491 variables, 225/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 265/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 506 constraints, problems are : Problem set: 0 solved, 265 unsolved in 20959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39289ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 39290ms
Starting structural reductions in LTL mode, iteration 1 : 225/288 places, 266/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39558 ms. Remains : 225/288 places, 266/339 transitions.
[2026-05-24 06:32:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:32:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:32:34] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-24 06:32:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:32:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:32:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2783303794401046567.gal : 1 ms
[2026-05-24 06:32:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8898126090156369414.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/CTLFireability2783303794401046567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8898126090156369414.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 06:33:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:33:04] [INFO ] Applying decomposition
[2026-05-24 06:33:04] [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/graph10378228494972662936.txt' '-o' '/tmp/graph10378228494972662936.bin' '-w' '/tmp/graph10378228494972662936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10378228494972662936.bin' '-l' '-1' '-v' '-w' '/tmp/graph10378228494972662936.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:33:04] [INFO ] Decomposing Gal with order
[2026-05-24 06:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:33:04] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-24 06:33:04] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 2 ms.
[2026-05-24 06:33:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5338455367565017384.gal : 2 ms
[2026-05-24 06:33:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7784105165877298419.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/CTLFireability5338455367565017384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7784105165877298419.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 265 transition count 314
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 265 transition count 314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 255 transition count 302
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 255 transition count 302
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 246 transition count 291
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 246 transition count 291
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 239 transition count 283
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 239 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 234 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 234 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 231 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 231 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 229 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 229 transition count 271
Applied a total of 118 rules in 29 ms. Remains 229 /288 variables (removed 59) and now considering 271/339 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8537365163994063603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12076832244706434335.kers'
[2026-05-24 06:33:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8537365163994063603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12076832244706434335.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 229 cols 734 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-24 06:33:34] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12076832244706434335.kers
Total runtime 4 ms.
[2026-05-24 06:33:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 06:33:34] [INFO ] Invariant cache hit.
[2026-05-24 06:33:34] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2026-05-24 06:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/500 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 14/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 245 constraints, problems are : Problem set: 0 solved, 270 unsolved in 18942 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/500 variables, 229/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 270/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 515 constraints, problems are : Problem set: 0 solved, 270 unsolved in 23586 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42558ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 42559ms
Starting structural reductions in LTL mode, iteration 1 : 229/288 places, 271/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42804 ms. Remains : 229/288 places, 271/339 transitions.
[2026-05-24 06:34:17] [INFO ] Flatten gal took : 6 ms
[2026-05-24 06:34:17] [INFO ] Flatten gal took : 5 ms
[2026-05-24 06:34:17] [INFO ] Input system was already deterministic with 271 transitions.
[2026-05-24 06:34:17] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:34:17] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:34:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17458841146463227673.gal : 1 ms
[2026-05-24 06:34:17] [INFO ] Time to serialize properties into /tmp/CTLFireability26766461204602102.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/CTLFireability17458841146463227673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability26766461204602102.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:34:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:34:47] [INFO ] Applying decomposition
[2026-05-24 06:34:47] [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/graph10957311088293524864.txt' '-o' '/tmp/graph10957311088293524864.bin' '-w' '/tmp/graph10957311088293524864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10957311088293524864.bin' '-l' '-1' '-v' '-w' '/tmp/graph10957311088293524864.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:34:47] [INFO ] Decomposing Gal with order
[2026-05-24 06:34:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:34:47] [INFO ] Removed a total of 111 redundant transitions.
[2026-05-24 06:34:47] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:34:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2026-05-24 06:34:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7418780415288844989.gal : 2 ms
[2026-05-24 06:34:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9827585951398867886.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/CTLFireability7418780415288844989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9827585951398867886.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 282 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 281 transition count 290
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 239 transition count 286
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 235 transition count 286
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 93 place count 235 transition count 246
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 173 place count 195 transition count 246
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 185 place count 183 transition count 232
Iterating global reduction 3 with 12 rules applied. Total rules applied 197 place count 183 transition count 232
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 205 place count 175 transition count 222
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 175 transition count 222
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 219 place count 169 transition count 214
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 169 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 228 place count 166 transition count 210
Iterating global reduction 3 with 3 rules applied. Total rules applied 231 place count 166 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 165 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 165 transition count 209
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 277 place count 143 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 279 place count 141 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 281 place count 141 transition count 184
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 139 transition count 181
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 139 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 286 place count 138 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 138 transition count 180
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 138 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 136 transition count 178
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 163 edges and 134 vertex of which 130 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 133 edges and 130 vertex of which 52 / 130 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 3 with 41 rules applied. Total rules applied 332 place count 104 transition count 136
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 66 rules applied. Total rules applied 398 place count 67 transition count 107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 401 place count 64 transition count 107
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 413 place count 52 transition count 83
Iterating global reduction 6 with 12 rules applied. Total rules applied 425 place count 52 transition count 83
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 435 place count 42 transition count 63
Iterating global reduction 6 with 10 rules applied. Total rules applied 445 place count 42 transition count 63
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 454 place count 33 transition count 45
Iterating global reduction 6 with 9 rules applied. Total rules applied 463 place count 33 transition count 45
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 472 place count 24 transition count 36
Iterating global reduction 6 with 9 rules applied. Total rules applied 481 place count 24 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 483 place count 24 transition count 34
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 6 with 2 rules applied. Total rules applied 485 place count 23 transition count 33
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 490 place count 18 transition count 28
Applied a total of 490 rules in 30 ms. Remains 18 /288 variables (removed 270) and now considering 28/339 (removed 311) transitions.
[2026-05-24 06:35:17] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8261262000722028772.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12797060749587117049.kers'
[2026-05-24 06:35:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8261262000722028772.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12797060749587117049.kers]
Normalized transition count is 23 out of 24 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 23 rows 18 cols 41 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-24 06:35:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12797060749587117049.kers
Total runtime 0 ms.
[2026-05-24 06:35:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 06:35:17] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2026-05-24 06:35:17] [INFO ] Invariant cache hit.
[2026-05-24 06:35:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-24 06:35:17] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 06:35:17] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2026-05-24 06:35:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/41 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/42 variables, and 18 constraints, problems are : Problem set: 0 solved, 19 unsolved in 172 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/41 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 37 constraints, problems are : Problem set: 0 solved, 19 unsolved in 160 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 341ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/288 places, 28/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 428 ms. Remains : 18/288 places, 28/339 transitions.
[2026-05-24 06:35:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:35:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:35:17] [INFO ] Input system was already deterministic with 28 transitions.
[2026-05-24 06:35:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:35:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:35:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6087225819438992536.gal : 0 ms
[2026-05-24 06:35:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15103710467409456050.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/CTLFireability6087225819438992536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15103710467409456050.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,35816,0.006504,4000,2,75,5,682,6,0,89,828,0


Converting to forward existential form...Done !
original formula: EF((AG(A((p233==1) U (p165==1))) * EF(!(A((p87==1) U ((p242==1)&&(p118==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!((p165==1)) U (!((p233==1)) * !((p165==1)))) + EG(!((p165==1)...416
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t22, t23, t24, t25, t27, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,0,0.071758,7360,1,0,279,16683,100,145,527,26701,309
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 264 transition count 313
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 264 transition count 313
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 253 transition count 299
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 253 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 243 transition count 287
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 243 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 235 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 235 transition count 278
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 230 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 227 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 225 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 225 transition count 266
Applied a total of 126 rules in 28 ms. Remains 225 /288 variables (removed 63) and now considering 266/339 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17301489965730836483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16321091047942675561.kers'
[2026-05-24 06:35:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17301489965730836483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16321091047942675561.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 225 cols 720 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-24 06:35:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16321091047942675561.kers
Total runtime 1 ms.
[2026-05-24 06:35:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 06:35:18] [INFO ] Invariant cache hit.
[2026-05-24 06:35:18] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-24 06:35:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/491 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 14/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/491 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 241 constraints, problems are : Problem set: 0 solved, 265 unsolved in 18359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/491 variables, 225/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 265/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 506 constraints, problems are : Problem set: 0 solved, 265 unsolved in 20753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39150ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 39150ms
Starting structural reductions in LTL mode, iteration 1 : 225/288 places, 266/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39381 ms. Remains : 225/288 places, 266/339 transitions.
[2026-05-24 06:35:57] [INFO ] Flatten gal took : 7 ms
[2026-05-24 06:35:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:35:57] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-24 06:35:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:35:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 06:35:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3019790604336543237.gal : 1 ms
[2026-05-24 06:35:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16837595962904450310.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/CTLFireability3019790604336543237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16837595962904450310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 06:36:27] [INFO ] Flatten gal took : 8 ms
[2026-05-24 06:36:27] [INFO ] Applying decomposition
[2026-05-24 06:36:27] [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/graph8583696995475898156.txt' '-o' '/tmp/graph8583696995475898156.bin' '-w' '/tmp/graph8583696995475898156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8583696995475898156.bin' '-l' '-1' '-v' '-w' '/tmp/graph8583696995475898156.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:36:27] [INFO ] Decomposing Gal with order
[2026-05-24 06:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:36:27] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-24 06:36:27] [INFO ] Flatten gal took : 17 ms
[2026-05-24 06:36:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2026-05-24 06:36:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11629680854351437676.gal : 2 ms
[2026-05-24 06:36:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7025461512015944975.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/CTLFireability11629680854351437676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7025461512015944975.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 283 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 282 transition count 287
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 236 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 234 transition count 285
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 97 place count 234 transition count 246
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 175 place count 195 transition count 246
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 186 place count 184 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 197 place count 184 transition count 233
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 204 place count 177 transition count 224
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 177 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 216 place count 172 transition count 218
Iterating global reduction 3 with 5 rules applied. Total rules applied 221 place count 172 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 224 place count 169 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 227 place count 169 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 229 place count 167 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 167 transition count 211
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 275 place count 145 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 276 place count 144 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 144 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 278 place count 143 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 143 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 143 transition count 186
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 141 transition count 184
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 208 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 137 edges and 139 vertex of which 52 / 139 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 17 rules applied. Total rules applied 299 place count 113 transition count 169
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 339 place count 99 transition count 143
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 339 place count 99 transition count 129
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 367 place count 85 transition count 129
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 378 place count 74 transition count 107
Iterating global reduction 5 with 11 rules applied. Total rules applied 389 place count 74 transition count 107
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 400 place count 63 transition count 85
Iterating global reduction 5 with 11 rules applied. Total rules applied 411 place count 63 transition count 85
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 422 place count 52 transition count 74
Iterating global reduction 5 with 11 rules applied. Total rules applied 433 place count 52 transition count 74
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 442 place count 43 transition count 56
Iterating global reduction 5 with 9 rules applied. Total rules applied 451 place count 43 transition count 56
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 460 place count 34 transition count 47
Iterating global reduction 5 with 9 rules applied. Total rules applied 469 place count 34 transition count 47
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 474 place count 29 transition count 42
Applied a total of 474 rules in 32 ms. Remains 29 /288 variables (removed 259) and now considering 42/339 (removed 297) transitions.
[2026-05-24 06:36:57] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9654092429327000730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1601108056742030340.kers'
[2026-05-24 06:36:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9654092429327000730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1601108056742030340.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 36 rows 28 cols 73 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-24 06:36:57] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1601108056742030340.kers
Total runtime 1 ms.
[2026-05-24 06:36:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 06:36:57] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2026-05-24 06:36:57] [INFO ] Invariant cache hit.
[2026-05-24 06:36:57] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2026-05-24 06:36:57] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-24 06:36:57] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2026-05-24 06:36:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 36/60 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 5/65 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 30 constraints, problems are : Problem set: 0 solved, 33 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 36/60 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 29/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 5/65 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 63 constraints, problems are : Problem set: 0 solved, 33 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 923ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/288 places, 42/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1067 ms. Remains : 29/288 places, 42/339 transitions.
[2026-05-24 06:36:58] [INFO ] Flatten gal took : 2 ms
[2026-05-24 06:36:58] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:36:58] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-24 06:36:58] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:36:58] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:36:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6583819325352931884.gal : 1 ms
[2026-05-24 06:36:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3323876651931042364.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/CTLFireability6583819325352931884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3323876651931042364.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.08742e+07,0.01833,4492,2,280,5,3605,6,0,147,3184,0


Converting to forward existential form...Done !
original formula: E(((p130==1)&&(p406==1)) U (AF(EG(!(((p19==1)||(p361==1))))) + (p91==1)))
=> equivalent forward existential formula: ([(FwdU(Init,((p130==1)&&(p406==1))) * !(EG(!(EG(!(((p19==1)||(p361==1))))))))] != FALSE + [(FwdU(Init,((p130==1...192
Reverse transition relation is NOT exact ! Due to transitions t19, t20, t21, t30, t33, t34, t35, t36, t38, t40, Intersection with reachable at each step e...210
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 30/11/12
(forward)formula 0,1,1.9075,64084,1,0,1147,323298,114,586,1007,464557,1249
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 339/339 transitions.
Graph (complete) has 565 edges and 288 vertex of which 283 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 282 transition count 285
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 234 transition count 285
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 97 place count 234 transition count 245
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 177 place count 194 transition count 245
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 189 place count 182 transition count 231
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 182 transition count 231
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 208 place count 175 transition count 222
Iterating global reduction 2 with 7 rules applied. Total rules applied 215 place count 175 transition count 222
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 170 transition count 215
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 170 transition count 215
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 167 transition count 211
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 167 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 166 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 166 transition count 210
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 273 place count 146 transition count 190
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 275 place count 144 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 277 place count 144 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 279 place count 142 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 281 place count 142 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 282 place count 141 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 141 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 place count 141 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 139 transition count 181
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 176 edges and 137 vertex of which 133 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 143 edges and 133 vertex of which 56 / 133 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 46 rules applied. Total rules applied 332 place count 105 transition count 134
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 402 place count 63 transition count 106
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 414 place count 51 transition count 82
Iterating global reduction 4 with 12 rules applied. Total rules applied 426 place count 51 transition count 82
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 437 place count 40 transition count 60
Iterating global reduction 4 with 11 rules applied. Total rules applied 448 place count 40 transition count 60
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 459 place count 29 transition count 38
Iterating global reduction 4 with 11 rules applied. Total rules applied 470 place count 29 transition count 38
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 481 place count 18 transition count 27
Iterating global reduction 4 with 11 rules applied. Total rules applied 492 place count 18 transition count 27
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 4 with 4 rules applied. Total rules applied 496 place count 16 transition count 25
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 4 with 2 rules applied. Total rules applied 498 place count 15 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 499 place count 15 transition count 23
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 15 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 501 place count 14 transition count 22
Applied a total of 501 rules in 39 ms. Remains 14 /288 variables (removed 274) and now considering 22/339 (removed 317) transitions.
[2026-05-24 06:37:00] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4502374634729337275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14888918643024463145.kers'
[2026-05-24 06:37:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4502374634729337275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14888918643024463145.kers]
Normalized transition count is 17 out of 18 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 14 cols 32 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 06:37:00] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14888918643024463145.kers
Total runtime 1 ms.
[2026-05-24 06:37:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 06:37:00] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2026-05-24 06:37:00] [INFO ] Invariant cache hit.
[2026-05-24 06:37:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-24 06:37:00] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 06:37:00] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2026-05-24 06:37:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/31 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 19 unsolved in 152 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 2/31 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 33 constraints, problems are : Problem set: 0 solved, 19 unsolved in 152 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/288 places, 22/339 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 405 ms. Remains : 14/288 places, 22/339 transitions.
[2026-05-24 06:37:00] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:37:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:37:00] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-24 06:37:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 06:37:00] [INFO ] Flatten gal took : 0 ms
[2026-05-24 06:37:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9953454316293948857.gal : 0 ms
[2026-05-24 06:37:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12331140553427867241.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/CTLFireability9953454316293948857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12331140553427867241.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,3301,0.011598,4076,2,98,5,894,6,0,71,1178,0


Converting to forward existential form...Done !
original formula: AG(EF((AF((p5==1)) + ((p113==1) * EG((p75==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EG(!((p5==1)))) + ((p113==1) * EG((p75==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t10, t11, t19, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,0,0.061786,6584,1,0,248,13554,73,140,427,19393,301
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 06:37:01] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:37:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 06:37:01] [INFO ] Applying decomposition
[2026-05-24 06:37:01] [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/graph6604797946947800778.txt' '-o' '/tmp/graph6604797946947800778.bin' '-w' '/tmp/graph6604797946947800778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6604797946947800778.bin' '-l' '-1' '-v' '-w' '/tmp/graph6604797946947800778.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:37:01] [INFO ] Decomposing Gal with order
[2026-05-24 06:37:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:37:01] [INFO ] Removed a total of 123 redundant transitions.
[2026-05-24 06:37:01] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 2 ms.
[2026-05-24 06:37:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11415259372268586669.gal : 3 ms
[2026-05-24 06:37:01] [INFO ] Time to serialize properties into /tmp/CTLFireability18294913960677394441.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/CTLFireability11415259372268586669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18294913960677394441.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 9 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 07:02:11] [INFO ] Applying decomposition
[2026-05-24 07:02:11] [INFO ] Flatten gal took : 93 ms
[2026-05-24 07:02:11] [INFO ] Decomposing Gal with order
[2026-05-24 07:02:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 07:02:11] [INFO ] Removed a total of 128 redundant transitions.
[2026-05-24 07:02:11] [INFO ] Flatten gal took : 70 ms
[2026-05-24 07:02:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 879 labels/synchronizations in 237 ms.
[2026-05-24 07:02:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13807218717186358694.gal : 21 ms
[2026-05-24 07:02:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10146851363835888154.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13807218717186358694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10146851363835888154.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 9 CTL formulae.

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="DiscoveryGPU-PT-14b"
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 DiscoveryGPU-PT-14b, 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 r098-tall-177955695500370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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