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.r146-tall-177961074200498.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 GPUForwardProgress-PT-32b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.9K Mar 7 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 7 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 11:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 11:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 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 160K 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 GPUForwardProgress-PT-32b-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779730886849

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 17:41:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:41:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:41:28] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-25 17:41:28] [INFO ] Transformed 644 places.
[2026-05-25 17:41:28] [INFO ] Transformed 677 transitions.
[2026-05-25 17:41:28] [INFO ] Found NUPN structural information;
[2026-05-25 17:41:28] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 129 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 46 place count 598 transition count 632
Iterating global reduction 1 with 45 rules applied. Total rules applied 91 place count 598 transition count 632
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 103 place count 586 transition count 620
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 586 transition count 620
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 125 place count 586 transition count 610
Applied a total of 125 rules in 139 ms. Remains 586 /644 variables (removed 58) and now considering 610/677 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3715396626599604855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3466738989175075428.kers'
[2026-05-25 17:41:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3715396626599604855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3466738989175075428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 610 rows 586 cols 1541 entries
Finished phase 1 with 552 SingleSign rule and 1 generalized
[2026-05-25 17:41:28] [INFO ] Computed 33 invariants in 4 ms
Computed 33 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3466738989175075428.kers
Total runtime 5 ms.
[2026-05-25 17:41:28] [INFO ] Implicit Places using invariants in 373 ms returned []
[2026-05-25 17:41:28] [INFO ] Invariant cache hit.
[2026-05-25 17:41:29] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 609 sub problems to find dead transitions.
[2026-05-25 17:41:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/585 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (OVERLAPS) 610/1195 variables, 585/618 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1195/1196 variables, and 618 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 585/586 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/585 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (OVERLAPS) 610/1195 variables, 585/618 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1195 variables, 609/1227 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/1196 variables, and 1227 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 585/586 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 609 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Starting structural reductions in LTL mode, iteration 1 : 586/644 places, 610/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61282 ms. Remains : 586/644 places, 610/677 transitions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Applied a total of 0 rules in 9 ms. Remains 586 /586 variables (removed 0) and now considering 610/610 (removed 0) transitions.
[2026-05-25 17:42:29] [INFO ] Invariant cache hit.
[2026-05-25 17:42:29] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-25 17:42:29] [INFO ] Invariant cache hit.
[2026-05-25 17:42:30] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 586/586 places, 610/610 transitions.
Support contains 129 out of 586 places after structural reductions.
[2026-05-25 17:42:30] [INFO ] Flatten gal took : 60 ms
[2026-05-25 17:42:30] [INFO ] Flatten gal took : 30 ms
[2026-05-25 17:42:30] [INFO ] Input system was already deterministic with 610 transitions.
Support contains 128 out of 586 places (down from 129) after GAL structural reductions.
RANDOM walk for 40000 steps (144 resets) in 1570 ms. (25 steps per ms) remains 19/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
[2026-05-25 17:42:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 549/585 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 610/1195 variables, 585/618 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1195 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/1196 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1196 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/1196 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 619 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1497 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 586/586 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 549/585 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 610/1195 variables, 585/618 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1195 variables, 19/637 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1195 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/1196 variables, 1/638 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1196 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/1196 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1196/1196 variables, and 638 constraints, problems are : Problem set: 1 solved, 18 unsolved in 4971 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6481ms problems are : Problem set: 1 solved, 18 unsolved
Finished Parikh walk after 288 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=144 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 5104 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 17:42:42] [INFO ] Flatten gal took : 23 ms
[2026-05-25 17:42:42] [INFO ] Flatten gal took : 23 ms
[2026-05-25 17:42:42] [INFO ] Input system was already deterministic with 610 transitions.
Computed a total of 109 stabilizing places and 109 stable transitions
Graph (complete) has 907 edges and 586 vertex of which 550 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.19 ms
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 557 transition count 581
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 557 transition count 581
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 557 transition count 575
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 542 transition count 560
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 542 transition count 560
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 108 place count 542 transition count 546
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 541 transition count 545
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 541 transition count 545
Applied a total of 110 rules in 75 ms. Remains 541 /586 variables (removed 45) and now considering 545/610 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15778755919034160157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12694363567711835220.kers'
[2026-05-25 17:42:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15778755919034160157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12694363567711835220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 545 rows 541 cols 1411 entries
Finished phase 1 with 507 SingleSign rule and 1 generalized
[2026-05-25 17:42:42] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12694363567711835220.kers
Total runtime 5 ms.
[2026-05-25 17:42:43] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 17:42:43] [INFO ] Invariant cache hit.
[2026-05-25 17:42:43] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2026-05-25 17:42:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1085 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1086 variables, and 573 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1085 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 544/1117 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (OVERLAPS) 1/1086 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1086/1086 variables, and 1118 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 541/586 places, 545/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60689 ms. Remains : 541/586 places, 545/610 transitions.
[2026-05-25 17:43:43] [INFO ] Flatten gal took : 35 ms
[2026-05-25 17:43:43] [INFO ] Flatten gal took : 26 ms
[2026-05-25 17:43:43] [INFO ] Input system was already deterministic with 545 transitions.
[2026-05-25 17:43:43] [INFO ] Flatten gal took : 14 ms
[2026-05-25 17:43:43] [INFO ] Flatten gal took : 13 ms
[2026-05-25 17:43:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3465243370215152929.gal : 12 ms
[2026-05-25 17:43:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17891056096697446591.ctl : 9 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/CTLFireability3465243370215152929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17891056096697446591.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:44:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 17:44:13] [INFO ] Applying decomposition
[2026-05-25 17:44:13] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4903834224644277330.txt' '-o' '/tmp/graph4903834224644277330.bin' '-w' '/tmp/graph4903834224644277330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4903834224644277330.bin' '-l' '-1' '-v' '-w' '/tmp/graph4903834224644277330.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:44:13] [INFO ] Decomposing Gal with order
[2026-05-25 17:44:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:44:14] [INFO ] Removed a total of 160 redundant transitions.
[2026-05-25 17:44:14] [INFO ] Flatten gal took : 80 ms
[2026-05-25 17:44:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-25 17:44:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9676198606563384950.gal : 9 ms
[2026-05-25 17:44:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7356541760373156669.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/CTLFireability9676198606563384950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7356541760373156669.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00613e+39,0.750251,31056,1857,29,56166,308,761,66771,36,531,0


Converting to forward existential form...Done !
original formula: A((E((i10.u69.p190==1) U (((E(A((i26.u178.p499==1) U (((i10.u68.p188==1)&&(i33.u221.p625==1))&&(i33.u223.p640==1))) U ((i0.i0.i1.u6.p16==...458
=> equivalent forward existential formula: [((Init * !(EG(!(((i22.u150.p418==1) + (!(E(TRUE U !((EX((i22.u147.p428==1)) + EX((i2.u14.p39==1)))))) * (i27.u1...920
Reverse transition relation is NOT exact ! Due to transitions t479, i1.t316, i1.t309, i2.t474, i2.u19.t467, i3.t461, i3.u25.t454, i4.t447, i4.u26.t440, i5....936
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Graph (trivial) has 500 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 544 transition count 306
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 321 rules applied. Total rules applied 617 place count 250 transition count 279
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 624 place count 244 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 625 place count 243 transition count 278
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 625 place count 243 transition count 212
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 757 place count 177 transition count 212
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 789 place count 145 transition count 180
Iterating global reduction 4 with 32 rules applied. Total rules applied 821 place count 145 transition count 180
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 947 place count 82 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 948 place count 82 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 949 place count 81 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 950 place count 81 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 952 place count 80 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 953 place count 80 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 954 place count 79 transition count 113
Applied a total of 954 rules in 153 ms. Remains 79 /586 variables (removed 507) and now considering 113/610 (removed 497) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2007266793557123589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9922656880830501390.kers'
[2026-05-25 17:44:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2007266793557123589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9922656880830501390.kers]
Normalized transition count is 112 out of 113 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 79 cols 365 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-25 17:44:44] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9922656880830501390.kers
Total runtime 1 ms.
[2026-05-25 17:44:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 17:44:44] [INFO ] Invariant cache hit.
[2026-05-25 17:44:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:44:44] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2026-05-25 17:44:44] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 17:44:44] [INFO ] Invariant cache hit.
[2026-05-25 17:44:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 112/188 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 3/191 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/192 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 80 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3541 ms.
Refiners :[State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 112/188 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 3/191 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 103/189 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/192 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 190 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4050 ms.
Refiners :[State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7610ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7611ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/586 places, 113/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7909 ms. Remains : 79/586 places, 113/610 transitions.
[2026-05-25 17:44:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:44:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:44:52] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-25 17:44:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:44:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18267685348585250710.gal : 1 ms
[2026-05-25 17:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6006334846604971362.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/CTLFireability18267685348585250710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6006334846604971362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:45:22] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:45:22] [INFO ] Applying decomposition
[2026-05-25 17:45:22] [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/graph5570745220419121678.txt' '-o' '/tmp/graph5570745220419121678.bin' '-w' '/tmp/graph5570745220419121678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5570745220419121678.bin' '-l' '-1' '-v' '-w' '/tmp/graph5570745220419121678.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:45:22] [INFO ] Decomposing Gal with order
[2026-05-25 17:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:45:22] [INFO ] Removed a total of 93 redundant transitions.
[2026-05-25 17:45:22] [INFO ] Flatten gal took : 21 ms
[2026-05-25 17:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 17:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7729812391460771933.gal : 1 ms
[2026-05-25 17:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9648269931031248540.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/CTLFireability7729812391460771933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9648269931031248540.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63849e+18,11.3763,246752,1081,279,239274,2781,274,2.39181e+06,39,27337,0


Converting to forward existential form...Done !
original formula: EF((((i10.u14.p273==1)||(u7.p159==1)) + (AG((((i7.u8.p182==0)||(i24.u34.p625==0))||(i24.u35.p640==0))) * (i15.u23.p419==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((i10.u14.p273==1)||(u7.p159==1)))] != FALSE + [((FwdU(Init,TRUE) * (i15.u23.p419==0)) * !(...238
(forward)formula 0,1,11.4117,246752,1,0,239274,2781,281,2.39181e+06,44,27337,1067
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Graph (trivial) has 499 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 544 transition count 307
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 320 rules applied. Total rules applied 615 place count 251 transition count 280
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 623 place count 245 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 625 place count 243 transition count 278
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 625 place count 243 transition count 212
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 757 place count 177 transition count 212
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 789 place count 145 transition count 180
Iterating global reduction 4 with 32 rules applied. Total rules applied 821 place count 145 transition count 180
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 947 place count 82 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 949 place count 80 transition count 115
Applied a total of 949 rules in 41 ms. Remains 80 /586 variables (removed 506) and now considering 115/610 (removed 495) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15896280942822394126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18053890160589625852.kers'
[2026-05-25 17:45:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15896280942822394126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18053890160589625852.kers]
Normalized transition count is 114 out of 115 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 80 cols 364 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 17:45:33] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18053890160589625852.kers
Total runtime 0 ms.
[2026-05-25 17:45:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 17:45:33] [INFO ] Invariant cache hit.
[2026-05-25 17:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:45:34] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2026-05-25 17:45:34] [INFO ] Redundant transitions in 7 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-25 17:45:34] [INFO ] Invariant cache hit.
[2026-05-25 17:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 114/190 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 4/194 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 1/195 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 81 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3711 ms.
Refiners :[State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 114/190 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 69/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 4/194 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 192 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4286 ms.
Refiners :[State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8009ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 8011ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/586 places, 115/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8445 ms. Remains : 80/586 places, 115/610 transitions.
[2026-05-25 17:45:42] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:45:42] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:45:42] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-25 17:45:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:45:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8795298791673072834.gal : 1 ms
[2026-05-25 17:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10125303410798089079.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/CTLFireability8795298791673072834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10125303410798089079.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:46:12] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:46:12] [INFO ] Applying decomposition
[2026-05-25 17:46:12] [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/graph3774678700268671467.txt' '-o' '/tmp/graph3774678700268671467.bin' '-w' '/tmp/graph3774678700268671467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3774678700268671467.bin' '-l' '-1' '-v' '-w' '/tmp/graph3774678700268671467.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:46:12] [INFO ] Decomposing Gal with order
[2026-05-25 17:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:46:12] [INFO ] Removed a total of 61 redundant transitions.
[2026-05-25 17:46:12] [INFO ] Flatten gal took : 13 ms
[2026-05-25 17:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2026-05-25 17:46:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17472084192567019595.gal : 4 ms
[2026-05-25 17:46:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1857911862379493020.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/CTLFireability17472084192567019595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1857911862379493020.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60359e+18,5.59475,153484,630,250,133939,5199,242,1.48686e+06,57,60271,0


Converting to forward existential form...Done !
original formula: EG(AF(((A((((u16.p296==1)&&(u34.p625==1))&&(u34.p640==1)) U AG((i2.u2.p52==1))) + !(A((i0.u0.p27==1) U (u34.p635==1)))) + (u21.p382==1)))...156
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(!(E(TRUE U !((i2.u2.p52==1))))) U (!((((u16.p296==1)&&(u34.p625==1))&&(u34.p640==1)))...361
Reverse transition relation is NOT exact ! Due to transitions t6, t14, t15, t19, t25, t28, t31, t34, t46, t49, t52, t55, t67, t75, t78, t81, t84, t87, t90,...414
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 554 transition count 578
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 554 transition count 578
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 70 place count 554 transition count 572
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 87 place count 537 transition count 555
Iterating global reduction 1 with 17 rules applied. Total rules applied 104 place count 537 transition count 555
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 120 place count 537 transition count 539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 536 transition count 538
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 536 transition count 538
Applied a total of 122 rules in 43 ms. Remains 536 /586 variables (removed 50) and now considering 538/610 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16526520933894704796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3209144456825691870.kers'
[2026-05-25 17:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16526520933894704796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3209144456825691870.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 538 rows 536 cols 1397 entries
Finished phase 1 with 502 SingleSign rule and 1 generalized
[2026-05-25 17:46:42] [INFO ] Computed 33 invariants in 5 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3209144456825691870.kers
Total runtime 7 ms.
[2026-05-25 17:46:42] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 17:46:42] [INFO ] Invariant cache hit.
[2026-05-25 17:46:42] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2026-05-25 17:46:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 536/586 places, 538/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 536/586 places, 538/610 transitions.
[2026-05-25 17:47:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:47:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:47:43] [INFO ] Input system was already deterministic with 538 transitions.
[2026-05-25 17:47:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:47:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:47:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7608456722528712624.gal : 3 ms
[2026-05-25 17:47:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5019631754660303260.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/CTLFireability7608456722528712624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5019631754660303260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:48:13] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:48:13] [INFO ] Applying decomposition
[2026-05-25 17:48:13] [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/graph9602067308803755432.txt' '-o' '/tmp/graph9602067308803755432.bin' '-w' '/tmp/graph9602067308803755432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9602067308803755432.bin' '-l' '-1' '-v' '-w' '/tmp/graph9602067308803755432.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:48:13] [INFO ] Decomposing Gal with order
[2026-05-25 17:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:48:13] [INFO ] Removed a total of 161 redundant transitions.
[2026-05-25 17:48:13] [INFO ] Flatten gal took : 19 ms
[2026-05-25 17:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 17:48:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13975293662352756321.gal : 4 ms
[2026-05-25 17:48:13] [INFO ] Time to serialize properties into /tmp/CTLFireability822333200458610434.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/CTLFireability13975293662352756321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability822333200458610434.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91522e+39,0.262647,14880,1453,23,20695,303,785,29790,35,574,0


Converting to forward existential form...Done !
original formula: EX(AF((i12.u83.p238==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((i12.u83.p238==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t472, i0.i1.t132, i0.i1.i1.u165.t125, i1.t467, i1.u14.t460, i2.t440, i2.u31.t433, i3.t426, i3...973
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Graph (complete) has 907 edges and 586 vertex of which 550 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 281 place count 549 transition count 326
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 306 rules applied. Total rules applied 587 place count 269 transition count 300
Reduce places removed 6 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 15 rules applied. Total rules applied 602 place count 263 transition count 291
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 614 place count 254 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 615 place count 253 transition count 288
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 67 Pre rules applied. Total rules applied 615 place count 253 transition count 221
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 749 place count 186 transition count 221
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 782 place count 153 transition count 188
Iterating global reduction 5 with 33 rules applied. Total rules applied 815 place count 153 transition count 188
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 933 place count 94 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 934 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 935 place count 93 transition count 127
Iterating global reduction 6 with 1 rules applied. Total rules applied 936 place count 93 transition count 127
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 938 place count 92 transition count 126
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 940 place count 92 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 941 place count 91 transition count 125
Applied a total of 941 rules in 39 ms. Remains 91 /586 variables (removed 495) and now considering 125/610 (removed 485) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18055586240427549773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16071558487250184336.kers'
[2026-05-25 17:48:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18055586240427549773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16071558487250184336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 91 cols 416 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 17:48:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16071558487250184336.kers
Total runtime 1 ms.
[2026-05-25 17:48:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 17:48:43] [INFO ] Invariant cache hit.
[2026-05-25 17:48:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2026-05-25 17:48:43] [INFO ] Redundant transitions in 2 ms returned []
Running 122 sub problems to find dead transitions.
[2026-05-25 17:48:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 125/213 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 3/216 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/216 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 91 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3314 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 125/213 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 3/216 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 103/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 213 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4559 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7892ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 7892ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/586 places, 125/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8049 ms. Remains : 91/586 places, 125/610 transitions.
[2026-05-25 17:48:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:48:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:48:51] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-25 17:48:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:48:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14685097649017747369.gal : 0 ms
[2026-05-25 17:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6662963671597458163.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/CTLFireability14685097649017747369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6662963671597458163.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.49828e+19,12.1395,316876,2,3327,5,1.57527e+06,6,0,489,1.57818e+06,0


Converting to forward existential form...Done !
original formula: EF((AG((p139==1)) * (((p614==1) + !(A(((p5==1)||(p231==1)) U (((p314==1)&&(p625==1))&&((p640==1)&&(p443==1)))))) + (((E((p421==1) U (p621...233
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(E(TRUE U !((p139==1))))) * (p614==1))] != FALSE + ([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U...727
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t8, t11, t14, t15, t19, t21, t24, t25, t27, t29, t31, t34, t36, t38, t41, t43, t4...373
(forward)formula 0,0,13.353,316880,1,0,366,1.57527e+06,306,166,3653,1.57818e+06,341
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Graph (trivial) has 502 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 544 transition count 307
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 318 rules applied. Total rules applied 613 place count 251 transition count 282
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 622 place count 245 transition count 279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 626 place count 242 transition count 278
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 626 place count 242 transition count 215
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 752 place count 179 transition count 215
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 784 place count 147 transition count 183
Iterating global reduction 4 with 32 rules applied. Total rules applied 816 place count 147 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 816 place count 147 transition count 182
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 818 place count 146 transition count 182
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 946 place count 82 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 947 place count 82 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 948 place count 81 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 949 place count 81 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 951 place count 80 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 952 place count 80 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 953 place count 79 transition count 114
Applied a total of 953 rules in 40 ms. Remains 79 /586 variables (removed 507) and now considering 114/610 (removed 496) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12812223398843860936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5757353315839496087.kers'
[2026-05-25 17:49:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12812223398843860936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5757353315839496087.kers]
Normalized transition count is 113 out of 114 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 79 cols 318 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-25 17:49:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5757353315839496087.kers
Total runtime 1 ms.
[2026-05-25 17:49:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 17:49:04] [INFO ] Invariant cache hit.
[2026-05-25 17:49:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 17:49:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2026-05-25 17:49:04] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 17:49:04] [INFO ] Invariant cache hit.
[2026-05-25 17:49:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 113/189 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 3/192 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/193 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 81 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3530 ms.
Refiners :[State Equation: 79/79 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 113/189 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 106/183 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 3/192 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/193 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 191 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6180 ms.
Refiners :[State Equation: 79/79 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9724ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 9724ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/586 places, 114/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9870 ms. Remains : 79/586 places, 114/610 transitions.
[2026-05-25 17:49:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:49:14] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:49:14] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-25 17:49:14] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:49:14] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:49:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12381322658695205184.gal : 2 ms
[2026-05-25 17:49:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16567566396596164726.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/CTLFireability12381322658695205184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16567566396596164726.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:49:44] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:49:44] [INFO ] Applying decomposition
[2026-05-25 17:49:44] [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/graph12920051673754384013.txt' '-o' '/tmp/graph12920051673754384013.bin' '-w' '/tmp/graph12920051673754384013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12920051673754384013.bin' '-l' '-1' '-v' '-w' '/tmp/graph12920051673754384013.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:49:44] [INFO ] Decomposing Gal with order
[2026-05-25 17:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:49:44] [INFO ] Removed a total of 60 redundant transitions.
[2026-05-25 17:49:44] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:49:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-25 17:49:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14471337193183265926.gal : 1 ms
[2026-05-25 17:49:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18416905074786912323.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/CTLFireability14471337193183265926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18416905074786912323.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29281e+18,27.3625,593232,1195,308,694771,4055,268,5.4155e+06,42,42871,0


Converting to forward existential form...Done !
original formula: !(E(A(!(EG((i11.u14.p268==1))) U AG((i2.u2.p70==1))) U E((u6.p133==1) U EG(A((u31.p555==1) U (i14.u18.p327==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,!((E(!(!(E(TRUE U !((i2.u2.p70==1))))) U (!(!(EG((i11.u14.p268==1)))) * !(!(E(TRUE U !((i2....338
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t12, t19, t21, t23, t25, t27, t32, t33, t35, t39, t41, t43, t46, t52, t56, t58, t60, ...399
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 556 transition count 580
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 556 transition count 580
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 556 transition count 575
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 80 place count 541 transition count 560
Iterating global reduction 1 with 15 rules applied. Total rules applied 95 place count 541 transition count 560
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 109 place count 541 transition count 546
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 540 transition count 545
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 540 transition count 545
Applied a total of 111 rules in 41 ms. Remains 540 /586 variables (removed 46) and now considering 545/610 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1677316094455912929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1089191652431555502.kers'
[2026-05-25 17:50:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1677316094455912929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1089191652431555502.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 545 rows 540 cols 1411 entries
Finished phase 1 with 506 SingleSign rule and 1 generalized
[2026-05-25 17:50:14] [INFO ] Computed 33 invariants in 7 ms
Computed 33 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1089191652431555502.kers
Total runtime 9 ms.
[2026-05-25 17:50:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-25 17:50:15] [INFO ] Invariant cache hit.
[2026-05-25 17:50:15] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2026-05-25 17:50:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1084 variables, 539/572 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1085 variables, and 572 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/540 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1084 variables, 539/572 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1084 variables, 544/1116 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1084 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (OVERLAPS) 1/1085 variables, 1/1117 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1085 variables, and 1117 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/540 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 540/586 places, 545/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60612 ms. Remains : 540/586 places, 545/610 transitions.
[2026-05-25 17:51:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:51:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:51:15] [INFO ] Input system was already deterministic with 545 transitions.
[2026-05-25 17:51:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 17:51:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:51:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5784236238264955711.gal : 2 ms
[2026-05-25 17:51:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4507581512418370547.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/CTLFireability5784236238264955711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4507581512418370547.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:51:45] [INFO ] Flatten gal took : 8 ms
[2026-05-25 17:51:45] [INFO ] Applying decomposition
[2026-05-25 17:51:45] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8943904619074566576.txt' '-o' '/tmp/graph8943904619074566576.bin' '-w' '/tmp/graph8943904619074566576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8943904619074566576.bin' '-l' '-1' '-v' '-w' '/tmp/graph8943904619074566576.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:51:45] [INFO ] Decomposing Gal with order
[2026-05-25 17:51:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:51:45] [INFO ] Removed a total of 72 redundant transitions.
[2026-05-25 17:51:45] [INFO ] Flatten gal took : 19 ms
[2026-05-25 17:51:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 17:51:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13411986544620585610.gal : 5 ms
[2026-05-25 17:51:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16373440973691488806.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/CTLFireability13411986544620585610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16373440973691488806.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 LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 558 transition count 582
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 558 transition count 582
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 558 transition count 577
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 74 place count 545 transition count 564
Iterating global reduction 1 with 13 rules applied. Total rules applied 87 place count 545 transition count 564
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 100 place count 545 transition count 551
Applied a total of 100 rules in 44 ms. Remains 545 /586 variables (removed 41) and now considering 551/610 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5152458300313286953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18279734660160054459.kers'
[2026-05-25 17:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5152458300313286953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18279734660160054459.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 551 rows 545 cols 1423 entries
Finished phase 1 with 511 SingleSign rule and 1 generalized
[2026-05-25 17:52:15] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18279734660160054459.kers
Total runtime 7 ms.
[2026-05-25 17:52:15] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-25 17:52:15] [INFO ] Invariant cache hit.
[2026-05-25 17:52:16] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2026-05-25 17:52:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (OVERLAPS) 551/1095 variables, 544/577 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/1096 variables, and 577 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 544/545 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (OVERLAPS) 551/1095 variables, 544/577 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1095 variables, 550/1127 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1096 variables, and 1127 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 544/545 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 545/586 places, 551/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 545/586 places, 551/610 transitions.
[2026-05-25 17:53:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:53:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:53:16] [INFO ] Input system was already deterministic with 551 transitions.
[2026-05-25 17:53:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:53:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:53:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6765901221605916063.gal : 2 ms
[2026-05-25 17:53:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2361395838572936521.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/CTLFireability6765901221605916063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2361395838572936521.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:53:46] [INFO ] Flatten gal took : 9 ms
[2026-05-25 17:53:46] [INFO ] Applying decomposition
[2026-05-25 17:53:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph73555660493589562.txt' '-o' '/tmp/graph73555660493589562.bin' '-w' '/tmp/graph73555660493589562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph73555660493589562.bin' '-l' '-1' '-v' '-w' '/tmp/graph73555660493589562.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:53:46] [INFO ] Decomposing Gal with order
[2026-05-25 17:53:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:53:46] [INFO ] Removed a total of 170 redundant transitions.
[2026-05-25 17:53:46] [INFO ] Flatten gal took : 18 ms
[2026-05-25 17:53:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 17:53:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6899801290058902409.gal : 4 ms
[2026-05-25 17:53:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5338312296941101088.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/CTLFireability6899801290058902409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5338312296941101088.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.64859e+39,0.489284,24396,1793,29,41040,344,790,49720,36,686,0


Converting to forward existential form...Done !
original formula: !(A((((E((((i21.u148.p405==1)||(i26.u176.p485==1)) * EX((i27.u182.p501==1))) U (i22.u150.p420!=1)) * AG(!(((i31.u214.p581==1)||(i4.u26.p7...537
=> equivalent forward existential formula: ((([(FwdU((((FwdU(Init,!((((!((E(!(((i26.u180.p495==1)||(i32.u222.p604==1))) U (!(((i33.u225.p612==1)||(i33.u226...3967
Reverse transition relation is NOT exact ! Due to transitions t485, i1.i1.t355, i1.i1.i1.u77.t348, i2.t480, i2.u19.t473, i3.t467, i3.u25.t460, i4.t453, i4....943
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Graph (trivial) has 505 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 544 transition count 305
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 321 rules applied. Total rules applied 618 place count 249 transition count 279
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 626 place count 243 transition count 277
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 629 place count 241 transition count 276
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 629 place count 241 transition count 212
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 757 place count 177 transition count 212
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 789 place count 145 transition count 180
Iterating global reduction 4 with 32 rules applied. Total rules applied 821 place count 145 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 821 place count 145 transition count 179
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 823 place count 144 transition count 179
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 955 place count 78 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 956 place count 78 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 957 place count 77 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 958 place count 77 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 960 place count 76 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 961 place count 75 transition count 109
Applied a total of 961 rules in 27 ms. Remains 75 /586 variables (removed 511) and now considering 109/610 (removed 501) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17338369206147278091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14256949689312519796.kers'
[2026-05-25 17:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17338369206147278091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14256949689312519796.kers]
Normalized transition count is 108 out of 109 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 75 cols 279 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-25 17:54:16] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14256949689312519796.kers
Total runtime 1 ms.
[2026-05-25 17:54:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 17:54:16] [INFO ] Invariant cache hit.
[2026-05-25 17:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:54:16] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-25 17:54:16] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-25 17:54:16] [INFO ] Invariant cache hit.
[2026-05-25 17:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 108/151 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 32/183 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2172 ms.
Refiners :[State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 108/151 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 32/183 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 64/151 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/184 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 152 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2443 ms.
Refiners :[State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4624ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4624ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/586 places, 109/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4818 ms. Remains : 75/586 places, 109/610 transitions.
[2026-05-25 17:54:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:54:21] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:54:21] [INFO ] Input system was already deterministic with 109 transitions.
[2026-05-25 17:54:21] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:54:21] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:54:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12129987321924938583.gal : 1 ms
[2026-05-25 17:54:21] [INFO ] Time to serialize properties into /tmp/CTLFireability1769232533966346220.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/CTLFireability12129987321924938583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1769232533966346220.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.17536e+17,9.42976,236716,2,1978,5,1.87571e+06,6,0,409,873780,0


Converting to forward existential form...Done !
original formula: !(A(EG((AG((p277==1)) + EF((p329==1)))) U AG((p297==1))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !((p297==1)))))) * !(EG((!(E(TRUE U !((p277==1)))) + E(TRUE U (p329==1)))))),TRU...237
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t13, t14, t16, t18, t20, t22, t24, t26, t28, t30, t32, t35, t36, t38, t41, t43, t...338
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.4124,336592,1,0,415,2.72303e+06,251,232,2942,1.4113e+06,437
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-08 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 : 586/586 places, 610/610 transitions.
Graph (trivial) has 507 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 544 transition count 303
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 325 rules applied. Total rules applied 624 place count 247 transition count 275
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 631 place count 241 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 632 place count 240 transition count 274
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 632 place count 240 transition count 208
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 764 place count 174 transition count 208
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 796 place count 142 transition count 176
Iterating global reduction 4 with 32 rules applied. Total rules applied 828 place count 142 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 828 place count 142 transition count 175
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 830 place count 141 transition count 175
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 952 place count 80 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 953 place count 80 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 954 place count 79 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 955 place count 79 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 957 place count 78 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 958 place count 77 transition count 110
Applied a total of 958 rules in 28 ms. Remains 77 /586 variables (removed 509) and now considering 110/610 (removed 500) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6605003636095938923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13823527121926948328.kers'
[2026-05-25 17:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6605003636095938923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13823527121926948328.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 77 cols 309 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 17:54:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13823527121926948328.kers
Total runtime 1 ms.
[2026-05-25 17:54:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 17:54:39] [INFO ] Invariant cache hit.
[2026-05-25 17:54:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:54:39] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2026-05-25 17:54:39] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-25 17:54:39] [INFO ] Invariant cache hit.
[2026-05-25 17:54:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 109/182 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 4/186 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 78 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3169 ms.
Refiners :[State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 109/182 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 99/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 4/186 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/187 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 183 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4865 ms.
Refiners :[State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8046ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 8046ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/586 places, 110/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8185 ms. Remains : 77/586 places, 110/610 transitions.
[2026-05-25 17:54:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:54:47] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:54:47] [INFO ] Input system was already deterministic with 110 transitions.
[2026-05-25 17:54:47] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:54:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 17:54:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11133894607334766277.gal : 1 ms
[2026-05-25 17:54:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18276898877273156121.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/CTLFireability11133894607334766277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18276898877273156121.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.90164e+17,18.674,435068,2,3289,5,2.14088e+06,6,0,417,1.98445e+06,0


Converting to forward existential form...Done !
original formula: EF(EG((AF((p301==1)) * ((p14==0)||((p407==1)&&(p6==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!((p301==1)))) * ((p14==0)||((p407==1)&&(p6==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t36, t38, t40...361
(forward)formula 0,1,25.756,437156,1,0,784,2.44488e+06,247,360,2903,2.15461e+06,847
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 556 transition count 580
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 556 transition count 580
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 556 transition count 575
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 82 place count 539 transition count 558
Iterating global reduction 1 with 17 rules applied. Total rules applied 99 place count 539 transition count 558
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 115 place count 539 transition count 542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 538 transition count 541
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 538 transition count 541
Applied a total of 117 rules in 47 ms. Remains 538 /586 variables (removed 48) and now considering 541/610 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1874946381747865468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8163074471424350828.kers'
[2026-05-25 17:55:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1874946381747865468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8163074471424350828.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 541 rows 538 cols 1403 entries
Finished phase 1 with 504 SingleSign rule and 1 generalized
[2026-05-25 17:55:13] [INFO ] Computed 33 invariants in 4 ms
Computed 33 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8163074471424350828.kers
Total runtime 6 ms.
[2026-05-25 17:55:13] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 17:55:13] [INFO ] Invariant cache hit.
[2026-05-25 17:55:13] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2026-05-25 17:55:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1078/1079 variables, and 570 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 538/586 places, 541/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60738 ms. Remains : 538/586 places, 541/610 transitions.
[2026-05-25 17:56:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:56:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:56:13] [INFO ] Input system was already deterministic with 541 transitions.
[2026-05-25 17:56:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:56:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6558268663073071829.gal : 3 ms
[2026-05-25 17:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6839451877097246476.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/CTLFireability6558268663073071829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6839451877097246476.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:56:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:56:43] [INFO ] Applying decomposition
[2026-05-25 17:56:43] [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/graph6675845030367108546.txt' '-o' '/tmp/graph6675845030367108546.bin' '-w' '/tmp/graph6675845030367108546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6675845030367108546.bin' '-l' '-1' '-v' '-w' '/tmp/graph6675845030367108546.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:56:44] [INFO ] Decomposing Gal with order
[2026-05-25 17:56:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:56:44] [INFO ] Removed a total of 76 redundant transitions.
[2026-05-25 17:56:44] [INFO ] Flatten gal took : 18 ms
[2026-05-25 17:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5873165940600778532.gal : 4 ms
[2026-05-25 17:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability414425275916667839.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/CTLFireability5873165940600778532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability414425275916667839.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 555 transition count 579
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 555 transition count 579
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 68 place count 555 transition count 573
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 84 place count 539 transition count 557
Iterating global reduction 1 with 16 rules applied. Total rules applied 100 place count 539 transition count 557
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 115 place count 539 transition count 542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 538 transition count 541
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 538 transition count 541
Applied a total of 117 rules in 36 ms. Remains 538 /586 variables (removed 48) and now considering 541/610 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16152098048836327838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9239318478681611406.kers'
[2026-05-25 17:57:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16152098048836327838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9239318478681611406.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 541 rows 538 cols 1403 entries
Finished phase 1 with 504 SingleSign rule and 1 generalized
[2026-05-25 17:57:14] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9239318478681611406.kers
Total runtime 5 ms.
[2026-05-25 17:57:14] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 17:57:14] [INFO ] Invariant cache hit.
[2026-05-25 17:57:14] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 538/586 places, 541/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 538/586 places, 541/610 transitions.
[2026-05-25 17:57:14] [INFO ] Flatten gal took : 11 ms
[2026-05-25 17:57:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:57:14] [INFO ] Input system was already deterministic with 541 transitions.
[2026-05-25 17:57:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:57:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14351621127148283659.gal : 2 ms
[2026-05-25 17:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3541018476916145367.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/CTLFireability14351621127148283659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3541018476916145367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:57:44] [INFO ] Flatten gal took : 10 ms
[2026-05-25 17:57:44] [INFO ] Applying decomposition
[2026-05-25 17:57:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15027422045720136890.txt' '-o' '/tmp/graph15027422045720136890.bin' '-w' '/tmp/graph15027422045720136890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15027422045720136890.bin' '-l' '-1' '-v' '-w' '/tmp/graph15027422045720136890.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:57:44] [INFO ] Decomposing Gal with order
[2026-05-25 17:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:57:45] [INFO ] Removed a total of 170 redundant transitions.
[2026-05-25 17:57:45] [INFO ] Flatten gal took : 19 ms
[2026-05-25 17:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 17:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12100832259600680497.gal : 5 ms
[2026-05-25 17:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9074103306368617880.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/CTLFireability12100832259600680497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9074103306368617880.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.30278e+39,0.444043,22232,1293,27,37409,302,784,45118,35,577,0


Converting to forward existential form...Done !
original formula: A(!(EG(((AX((i32.i0.u218.p597==1)) + EG((i32.i0.u219.p599==1))) + EG(EF((i30.i0.u204.p565==1)))))) U AG(A(!(EG((i23.i0.u158.p439==1))) U ...187
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(EX(E(TRUE U (i26.i1.u182.p483==1)))) U (!(!(EG((i23.i0.u158.p439==1)))) * !...761
Reverse transition relation is NOT exact ! Due to transitions t475, i1.t470, i1.i0.t463, i2.t457, i2.i1.u22.t450, i3.t443, i3.i1.t436, i4.t429, i4.i1.u40.t...1021
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 557 transition count 581
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 557 transition count 581
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 557 transition count 576
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 78 place count 542 transition count 561
Iterating global reduction 1 with 15 rules applied. Total rules applied 93 place count 542 transition count 561
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 107 place count 542 transition count 547
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 541 transition count 546
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 541 transition count 546
Applied a total of 109 rules in 31 ms. Remains 541 /586 variables (removed 45) and now considering 546/610 (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-11208995472582065220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-342962604491655780.kers'
[2026-05-25 17:58:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11208995472582065220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-342962604491655780.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 546 rows 541 cols 1413 entries
Finished phase 1 with 507 SingleSign rule and 1 generalized
[2026-05-25 17:58:15] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-342962604491655780.kers
Total runtime 2 ms.
[2026-05-25 17:58:15] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-25 17:58:15] [INFO ] Invariant cache hit.
[2026-05-25 17:58:15] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 545 sub problems to find dead transitions.
[2026-05-25 17:58:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 546/1086 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1086/1087 variables, and 573 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 546/1086 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1086 variables, 545/1118 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1086 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (OVERLAPS) 1/1087 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1087/1087 variables, and 1119 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 541/586 places, 546/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 541/586 places, 546/610 transitions.
[2026-05-25 17:59:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:59:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:59:15] [INFO ] Input system was already deterministic with 546 transitions.
[2026-05-25 17:59:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:59:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:59:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9332161133879936011.gal : 2 ms
[2026-05-25 17:59:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3948042062891607499.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/CTLFireability9332161133879936011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3948042062891607499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 17:59:46] [INFO ] Flatten gal took : 12 ms
[2026-05-25 17:59:46] [INFO ] Applying decomposition
[2026-05-25 17:59:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8264890277820267371.txt' '-o' '/tmp/graph8264890277820267371.bin' '-w' '/tmp/graph8264890277820267371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8264890277820267371.bin' '-l' '-1' '-v' '-w' '/tmp/graph8264890277820267371.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:59:46] [INFO ] Decomposing Gal with order
[2026-05-25 17:59:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:59:46] [INFO ] Removed a total of 73 redundant transitions.
[2026-05-25 17:59:46] [INFO ] Flatten gal took : 27 ms
[2026-05-25 17:59:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:59:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6889975049129588837.gal : 4 ms
[2026-05-25 17:59:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15206578492221977203.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/CTLFireability6889975049129588837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15206578492221977203.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 : 586/586 places, 610/610 transitions.
Graph (trivial) has 505 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 300 place count 544 transition count 302
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 326 rules applied. Total rules applied 626 place count 246 transition count 274
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 632 place count 240 transition count 274
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 632 place count 240 transition count 207
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 766 place count 173 transition count 207
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 798 place count 141 transition count 175
Iterating global reduction 3 with 32 rules applied. Total rules applied 830 place count 141 transition count 175
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 960 place count 76 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 961 place count 76 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 962 place count 75 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 963 place count 75 transition count 108
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 965 place count 74 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 966 place count 73 transition count 106
Applied a total of 966 rules in 26 ms. Remains 73 /586 variables (removed 513) and now considering 106/610 (removed 504) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5709997425504616264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11636416235035636168.kers'
[2026-05-25 18:00:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5709997425504616264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11636416235035636168.kers]
Normalized transition count is 105 out of 106 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 73 cols 342 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-25 18:00:16] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11636416235035636168.kers
Total runtime 1 ms.
[2026-05-25 18:00:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 18:00:16] [INFO ] Invariant cache hit.
[2026-05-25 18:00:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:00:16] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-25 18:00:16] [INFO ] Redundant transitions in 1 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-25 18:00:16] [INFO ] Invariant cache hit.
[2026-05-25 18:00:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 105/176 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 2/178 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 74 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3271 ms.
Refiners :[State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 105/176 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 2/178 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 103/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/179 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 178 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5018 ms.
Refiners :[State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8299ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 8299ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/586 places, 106/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8429 ms. Remains : 73/586 places, 106/610 transitions.
[2026-05-25 18:00:24] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:00:24] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:00:24] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-25 18:00:24] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:00:24] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:00:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8211605439621925805.gal : 1 ms
[2026-05-25 18:00:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12613030442044003549.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/ReachabilityCardinality8211605439621925805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12613030442044003549.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 1325 steps (54 resets) in 25 ms. (50 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Graph (trivial) has 477 edges and 586 vertex of which 6 / 586 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 901 edges and 581 vertex of which 545 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 544 transition count 328
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 296 rules applied. Total rules applied 570 place count 272 transition count 304
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 580 place count 266 transition count 300
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 584 place count 262 transition count 300
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 584 place count 262 transition count 237
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 710 place count 199 transition count 237
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 742 place count 167 transition count 205
Iterating global reduction 4 with 32 rules applied. Total rules applied 774 place count 167 transition count 205
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 894 place count 107 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 895 place count 107 transition count 144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 896 place count 106 transition count 143
Iterating global reduction 5 with 1 rules applied. Total rules applied 897 place count 106 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 899 place count 105 transition count 142
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 900 place count 105 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 901 place count 104 transition count 141
Applied a total of 901 rules in 24 ms. Remains 104 /586 variables (removed 482) and now considering 141/610 (removed 469) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11107193732964445758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16773055548852080001.kers'
[2026-05-25 18:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11107193732964445758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16773055548852080001.kers]
Normalized transition count is 140 out of 141 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 104 cols 445 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-25 18:00:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16773055548852080001.kers
Total runtime 2 ms.
[2026-05-25 18:00:24] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 18:00:24] [INFO ] Invariant cache hit.
[2026-05-25 18:00:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:00:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2026-05-25 18:00:24] [INFO ] Redundant transitions in 0 ms returned []
Running 137 sub problems to find dead transitions.
[2026-05-25 18:00:24] [INFO ] Invariant cache hit.
[2026-05-25 18:00:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 140/240 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 4/244 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 1/245 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 105 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5513 ms.
Refiners :[State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 140/240 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 35/135 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 4/244 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 102/241 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 242 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7036 ms.
Refiners :[State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12563ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12564ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/586 places, 141/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12727 ms. Remains : 104/586 places, 141/610 transitions.
[2026-05-25 18:00:37] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:00:37] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:00:37] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-25 18:00:37] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:00:37] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6373681381623570458.gal : 0 ms
[2026-05-25 18:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3428529006146999238.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/CTLFireability6373681381623570458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3428529006146999238.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,3.91485e+20,19.4831,414720,2,6003,5,2.31393e+06,6,0,555,2.04538e+06,0


Converting to forward existential form...Done !
original formula: (AG(((((!(A((p264==1) U (p509==1))) * (p369==1)) * (p334==1)) + (p288==0)) + AG((p5==0)))) * (!(A((((p247==1)||(p214!=1))||((((p256==1)||...301
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((((!(!((E(!((p509==1)) U (!((p264==1)) * !((p509==1)))) + EG(!((p509==1)))))) * (p3...507
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t9, t13, t20, t27, t30, t32, t38, t39, t41, t44, t48, t50, t52, t54, t56, t58, t6...373
Detected timeout of ITS tools.
[2026-05-25 18:01:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:01:07] [INFO ] Applying decomposition
[2026-05-25 18:01:07] [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/graph8555280722046610251.txt' '-o' '/tmp/graph8555280722046610251.bin' '-w' '/tmp/graph8555280722046610251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8555280722046610251.bin' '-l' '-1' '-v' '-w' '/tmp/graph8555280722046610251.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:01:07] [INFO ] Decomposing Gal with order
[2026-05-25 18:01:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:01:07] [INFO ] Removed a total of 96 redundant transitions.
[2026-05-25 18:01:07] [INFO ] Flatten gal took : 15 ms
[2026-05-25 18:01:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2026-05-25 18:01:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4421177847249947808.gal : 1 ms
[2026-05-25 18:01:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8905844895815065047.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/CTLFireability4421177847249947808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8905844895815065047.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.91485e+20,18.8234,451228,660,223,361834,15203,322,4.57012e+06,35,110296,0


Converting to forward existential form...Done !
original formula: (AG(((((!(A((i8.u19.p264==1) U (i17.u38.p509==1))) * (i12.u28.p369==1)) * (i11.u25.p334==1)) + (u21.p288==0)) + AG((i0.u0.p5==0)))) * (!(...447
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((((!(!((E(!((i17.u38.p509==1)) U (!((i8.u19.p264==1)) * !((i17.u38.p509==1)))) + EG...683
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t20, t32, t38, t39, t41, t52, t56, t58, t63, t66, t72, t77, t80, t83, t84, t93, t97,...474
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 610/610 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 559 transition count 583
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 559 transition count 583
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 559 transition count 578
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 73 place count 545 transition count 564
Iterating global reduction 1 with 14 rules applied. Total rules applied 87 place count 545 transition count 564
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 100 place count 545 transition count 551
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 544 transition count 550
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 544 transition count 550
Applied a total of 102 rules in 43 ms. Remains 544 /586 variables (removed 42) and now considering 550/610 (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-17454787632034962787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16123801352563620510.kers'
[2026-05-25 18:01:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17454787632034962787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16123801352563620510.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 550 rows 544 cols 1421 entries
Finished phase 1 with 510 SingleSign rule and 1 generalized
[2026-05-25 18:01:37] [INFO ] Computed 33 invariants in 5 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16123801352563620510.kers
Total runtime 7 ms.
[2026-05-25 18:01:37] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-25 18:01:37] [INFO ] Invariant cache hit.
[2026-05-25 18:01:38] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2026-05-25 18:01:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 550/1093 variables, 543/576 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1094 variables, and 576 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 543/544 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 550/1093 variables, 543/576 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 549/1125 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 549 unsolved
SMT process timed out in 60088ms, After SMT, problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 544/586 places, 550/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60614 ms. Remains : 544/586 places, 550/610 transitions.
[2026-05-25 18:02:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:02:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:02:38] [INFO ] Input system was already deterministic with 550 transitions.
[2026-05-25 18:02:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:02:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:02:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9653859584474791619.gal : 2 ms
[2026-05-25 18:02:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13331964150022239345.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/CTLFireability9653859584474791619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13331964150022239345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 18:03:08] [INFO ] Flatten gal took : 10 ms
[2026-05-25 18:03:08] [INFO ] Applying decomposition
[2026-05-25 18:03:08] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15791438605595830537.txt' '-o' '/tmp/graph15791438605595830537.bin' '-w' '/tmp/graph15791438605595830537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15791438605595830537.bin' '-l' '-1' '-v' '-w' '/tmp/graph15791438605595830537.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:03:08] [INFO ] Decomposing Gal with order
[2026-05-25 18:03:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:03:08] [INFO ] Removed a total of 71 redundant transitions.
[2026-05-25 18:03:08] [INFO ] Flatten gal took : 18 ms
[2026-05-25 18:03:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 18:03:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16757172749502731606.gal : 5 ms
[2026-05-25 18:03:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12481526836533860753.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/CTLFireability16757172749502731606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12481526836533860753.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.
[2026-05-25 18:03:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:03:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:03:38] [INFO ] Applying decomposition
[2026-05-25 18:03:38] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16516869249711512347.txt' '-o' '/tmp/graph16516869249711512347.bin' '-w' '/tmp/graph16516869249711512347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16516869249711512347.bin' '-l' '-1' '-v' '-w' '/tmp/graph16516869249711512347.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:03:38] [INFO ] Decomposing Gal with order
[2026-05-25 18:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:03:38] [INFO ] Removed a total of 164 redundant transitions.
[2026-05-25 18:03:38] [INFO ] Flatten gal took : 16 ms
[2026-05-25 18:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 18:03:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17874365265363095267.gal : 4 ms
[2026-05-25 18:03:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16094287620832532037.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/CTLFireability17874365265363095267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16094287620832532037.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.94932e+40,0.507204,25404,1699,29,41795,353,830,57483,39,709,0


Converting to forward existential form...Done !
original formula: A((E((i9.u74.p190==1) U (((E(A((i26.u183.p499==1) U (((i9.u73.p188==1)&&(i33.u235.p625==1))&&(i33.u232.p640==1))) U ((i0.i1.i2.u7.p16==1)...455
=> equivalent forward existential formula: [((Init * !(EG(!(((i22.u160.p418==1) + (!(E(TRUE U !((EX((i22.u158.p428==1)) + EX((i1.u17.p39==1)))))) * (i27.u1...915
Reverse transition relation is NOT exact ! Due to transitions t544, i1.t539, i1.u15.t530, i2.t524, i2.t514, i3.t507, i3.t497, i4.t490, i4.t483, i5.t476, i5...962
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
(forward)formula 0,0,150.773,2197448,1,0,3.49014e+06,353,3470,4.88494e+06,127,709,1765283
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AF(((A((((i15.u113.p296==1)&&(i33.u235.p625==1))&&(i33.u232.p640==1)) U AG((i2.u21.p52==1))) + !(A((i0.i0.i2.u12.p27==1) U (i33.u239.p...189
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(!(E(TRUE U !((i2.u21.p52==1))))) U (!((((i15.u113.p296==1)&&(i33.u235.p625==1))&&(i33...406
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
(forward)formula 1,1,264.389,2420348,1,0,4.74472e+06,353,1882,4.96329e+06,77,709,1658020
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AF((i12.u93.p238==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((i12.u93.p238==1)))))] != FALSE
(forward)formula 2,0,282.056,2420348,1,0,4.74472e+06,353,3318,4.96329e+06,104,709,2433288
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(E(A(!(EG((i14.u105.p268==1))) U AG((i3.u32.p70==1))) U E((i6.u50.p133==1) U EG(A((i30.u214.p555==1) U (i17.u125.p327==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,!((E(!(!(E(TRUE U !((i3.u32.p70==1))))) U (!(!(EG((i14.u105.p268==1)))) * !(!(E(TRUE U !((i...354
(forward)formula 3,1,319.043,2423036,1,0,4.74472e+06,353,3656,4.96329e+06,117,709,3589291
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF((i1.u19.p45==0)) * ((A((!(EG(((i8.u66.p168==1)&&(i0.i0.i2.u12.p28==1)))) * (i6.u50.p125!=1)) U EX((AF((i24.u173.p453==1)) + EF((i21.u...340
=> equivalent forward existential formula: ([FwdG(Init,!((i1.u19.p45==0)))] = FALSE * ([(EY((Init * !((!((E(!(EX((!(EG(!((i24.u173.p453==1)))) + E(TRUE U (...1522
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
(forward)formula 4,1,419.982,2663480,1,0,5.17056e+06,353,3574,6.0515e+06,138,709,2186935
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(A((((E((((i21.u155.p405==1)||(i26.u184.p485==1)) * EX((i27.u190.p501==1))) U (i22.u161.p420!=1)) * AG(!(((i31.u217.p581==1)||(i3.u32.p7...538
=> equivalent forward existential formula: ((([(FwdU((((FwdU(Init,!((((!((E(!(((i26.u188.p495==1)||(i32.u228.p604==1))) U (!(((i33.u231.p612==1)||(i33.u234...3970
Fast SCC detection found a local SCC at level 33
(forward)formula 5,1,529.439,2930328,1,0,5.39016e+06,353,1884,6.61291e+06,78,709,962277
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(((!(A((i7.u57.p157!=1) U AX((i9.u74.p190==1)))) * AF((i28.u197.p528==1))) * AX((i20.u150.p390==0))))
=> equivalent forward existential formula: [((EY(Init) * (!(!((E(!(!(EX(!((i9.u74.p190==1))))) U (!((i7.u57.p157!=1)) * !(!(EX(!((i9.u74.p190==1))))))) + E...265
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
(forward)formula 6,0,549.393,2930328,1,0,5.39016e+06,353,3774,6.61291e+06,130,709,2082890
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(!(EG(((AX((i32.u225.p597==1)) + EG((i32.u226.p599==1))) + EG(EF((i30.u209.p565==1)))))) U AG(A(!(EG((i23.u166.p439==1))) U EX(EF((i26.u...172
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(EX(E(TRUE U (i26.u183.p483==1)))) U (!(!(EG((i23.u166.p439==1)))) * !(EX(E(...716
Fast SCC detection found a local SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
(forward)formula 7,0,577.041,2930328,1,0,5.39016e+06,353,3850,6.61291e+06,130,709,3278216
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((EF(((i15.u110.p286==1)||(i1.u18.p35==0))) * A((E((i10.u83.p211==1) U (i16.u119.p312==1)) + (i2.u27.p66!=1)) U AX((i30.u212.p568==1)))...157
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((i15.u110.p286==1)||(i1.u18.p35==0)))))] = FALSE * ([(EY((FwdU(FwdU(Init,TRUE),...358
(forward)formula 8,0,577.793,2930328,1,0,5.39016e+06,353,3857,6.61291e+06,130,709,3418187
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(((((!(A((i13.u102.p264==1) U (i27.u193.p509==1))) * (i19.u141.p369==1)) * (i17.u128.p334==1)) + (i15.u115.p288==0)) + AG((i0.i1.i1.u2...477
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((((!(!((E(!((i27.u193.p509==1)) U (!((i13.u102.p264==1)) * !((i27.u193.p509==1)))) ...719
Fast SCC detection found a local SCC at level 33
(forward)formula 9,1,625.628,2930328,1,0,5.52361e+06,353,5186,6.61291e+06,155,872,5194786
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(!(((A(((A((i22.u163.p426==1) U (i12.u91.p233==1)) * (i28.u199.p525==1)) * ((i5.u44.p122==1)&&(((i33.u238.p633==1)||(i12.u92.p246==1))||...589
=> equivalent forward existential formula: [((Init * !(EG(!(((i3.u29.p86==1) + (((i18.u132.p346==1) * !((E(!((i2.u28.p51==1)) U (!((((i6.u55.p138!=1)||(i19...1653
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 33
(forward)formula 10,0,849.579,3546644,1,0,6.34143e+06,353,2370,8.8655e+06,101,874,1991648
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1779733069663

--------------------
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="GPUForwardProgress-PT-32b"
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 GPUForwardProgress-PT-32b, 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 r146-tall-177961074200498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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