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.r114-smll-177955740600410.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 ErlangenMainframeV0-PT-0404, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.1K Mar 7 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Mar 7 04:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 04:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 04:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 04:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 187K 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 ErlangenMainframeV0-PT-0404-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779850619432

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0404
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-27 02:57:02] [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-27 02:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 02:57:02] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2026-05-27 02:57:02] [INFO ] Transformed 183 places.
[2026-05-27 02:57:02] [INFO ] Transformed 445 transitions.
[2026-05-27 02:57:02] [INFO ] Found NUPN structural information;
[2026-05-27 02:57:02] [INFO ] Parsed PT model containing 183 places and 445 transitions and 3331 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 69 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 445/445 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 150 transition count 412
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 150 transition count 412
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 80 place count 136 transition count 398
Iterating global reduction 0 with 14 rules applied. Total rules applied 94 place count 136 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 135 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 135 transition count 397
Applied a total of 96 rules in 122 ms. Remains 135 /183 variables (removed 48) and now considering 397/445 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5786557201425558359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1078413477517804379.kers'
[2026-05-27 02:57:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5786557201425558359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1078413477517804379.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 397 rows 135 cols 3235 entries
Finished phase 1 with 118 SingleSign rule and 3 generalized
[2026-05-27 02:57:03] [INFO ] Computed 14 invariants in 5 ms
Computed 14 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1078413477517804379.kers
Total runtime 8 ms.
[2026-05-27 02:57:03] [INFO ] Implicit Places using invariants in 450 ms returned []
[2026-05-27 02:57:03] [INFO ] Invariant cache hit.
[2026-05-27 02:57:03] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2026-05-27 02:57:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/532 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 155 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/532 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 396/551 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 564 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61614ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 61654ms
Starting structural reductions in LTL mode, iteration 1 : 135/183 places, 397/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63198 ms. Remains : 135/183 places, 397/445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Applied a total of 0 rules in 8 ms. Remains 135 /135 variables (removed 0) and now considering 397/397 (removed 0) transitions.
[2026-05-27 02:58:05] [INFO ] Invariant cache hit.
[2026-05-27 02:58:05] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-27 02:58:05] [INFO ] Invariant cache hit.
[2026-05-27 02:58:06] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 135/135 places, 397/397 transitions.
Support contains 69 out of 135 places after structural reductions.
[2026-05-27 02:58:06] [INFO ] Flatten gal took : 188 ms
[2026-05-27 02:58:07] [INFO ] Flatten gal took : 98 ms
[2026-05-27 02:58:07] [INFO ] Input system was already deterministic with 397 transitions.
Support contains 66 out of 135 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2964 ms. (13 steps per ms) remains 29/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
[2026-05-27 02:58:08] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 73/110 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 3 (OVERLAPS) 25/135 variables, 4/14 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 397/532 variables, 135/149 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/149 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/532 variables, 0/149 constraints. Problems are: Problem set: 4 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 149 constraints, problems are : Problem set: 4 solved, 24 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 28/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 73/108 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 24 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/12 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/135 variables, 4/16 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 397/532 variables, 135/151 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 21/172 constraints. Problems are: Problem set: 5 solved, 23 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 172 constraints, problems are : Problem set: 5 solved, 23 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6514ms problems are : Problem set: 5 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 77 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 133 transition count 370
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 110 transition count 370
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 47 place count 110 transition count 361
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 101 transition count 361
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 75 place count 91 transition count 351
Iterating global reduction 2 with 10 rules applied. Total rules applied 85 place count 91 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 85 place count 91 transition count 350
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 90 transition count 350
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 131 place count 68 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 67 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 67 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 67 transition count 317
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 67 transition count 311
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 147 place count 61 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 61 transition count 309
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 61 transition count 308
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 156 place count 60 transition count 302
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 60 transition count 302
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 166 place count 60 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 60 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 59 transition count 298
Applied a total of 170 rules in 351 ms. Remains 59 /135 variables (removed 76) and now considering 298/397 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 59/135 places, 298/397 transitions.
RANDOM walk for 40000 steps (8 resets) in 1570 ms. (25 steps per ms) remains 16/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2026-05-27 02:58:16] [INFO ] Flow matrix only has 296 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10443363099542052792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16180794729793244743.kers'
[2026-05-27 02:58:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10443363099542052792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16180794729793244743.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 296 rows 58 cols 2912 entries
Finished phase 1 with 42 SingleSign rule and 3 generalized
[2026-05-27 02:58:16] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16180794729793244743.kers
Total runtime 3 ms.
[2026-05-27 02:58:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 25/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2/54 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 292/346 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 9/355 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/355 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 74 constraints, problems are : Problem set: 0 solved, 16 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 25/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2/54 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 292/346 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 9/355 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/355 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 90 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4931ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 6 properties in 15599 ms.
Support contains 21 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 298/298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 59 transition count 295
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 56 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 55 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 55 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 52 transition count 265
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 2 with 2 rules applied. Total rules applied 16 place count 51 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 51 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 51 transition count 261
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 49 transition count 261
Free-agglomeration rule applied 5 times with reduction of 3 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 49 transition count 253
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 40 place count 41 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 41 transition count 244
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 41 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 41 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 41 transition count 242
Applied a total of 47 rules in 62 ms. Remains 41 /59 variables (removed 18) and now considering 242/298 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 41/59 places, 242/298 transitions.
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4103935025129556280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5967432718454531537.kers'
[2026-05-27 02:58:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4103935025129556280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5967432718454531537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 41 cols 2552 entries
Finished phase 1 with 28 SingleSign rule and 3 generalized
[2026-05-27 02:58:37] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5967432718454531537.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/38 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 242/283 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 51 constraints, problems are : Problem set: 0 solved, 4 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/38 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 242/283 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 55 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1558ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 528 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 242/242 transitions.
Graph (trivial) has 18 edges and 41 vertex of which 5 / 41 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 38 transition count 228
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 30 transition count 228
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 22 place count 25 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 27 place count 25 transition count 135
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 81 place count 25 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 24 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 24 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 22 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 22 transition count 60
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 22 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 20 transition count 58
Applied a total of 92 rules in 38 ms. Remains 20 /41 variables (removed 21) and now considering 58/242 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 20/41 places, 58/242 transitions.
RANDOM walk for 310 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2026-05-27 02:58:39] [INFO ] Flatten gal took : 77 ms
[2026-05-27 02:58:39] [INFO ] Flatten gal took : 65 ms
[2026-05-27 02:58:39] [INFO ] Input system was already deterministic with 397 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 80 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 132 transition count 373
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 111 transition count 373
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 111 transition count 364
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 102 transition count 364
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 88 transition count 296
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 88 transition count 296
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 89 place count 88 transition count 294
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 86 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 85 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 85 transition count 286
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 137 place count 64 transition count 265
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 64 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 63 transition count 264
Applied a total of 142 rules in 97 ms. Remains 63 /135 variables (removed 72) and now considering 264/397 (removed 133) transitions.
[2026-05-27 02:58:39] [INFO ] Flow matrix only has 262 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10272153276805778722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15201097052768688218.kers'
[2026-05-27 02:58:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10272153276805778722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15201097052768688218.kers]
Normalized transition count is 261 out of 262 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 63 cols 2442 entries
Finished phase 1 with 47 SingleSign rule and 2 generalized
[2026-05-27 02:58:39] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15201097052768688218.kers
Total runtime 4 ms.
[2026-05-27 02:58:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-27 02:58:39] [INFO ] Flow matrix only has 262 transitions (discarded 2 similar events)
[2026-05-27 02:58:39] [INFO ] Invariant cache hit.
[2026-05-27 02:58:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 02:58:40] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2026-05-27 02:58:40] [INFO ] Redundant transitions in 23 ms returned []
Running 243 sub problems to find dead transitions.
[2026-05-27 02:58:40] [INFO ] Flow matrix only has 262 transitions (discarded 2 similar events)
[2026-05-27 02:58:40] [INFO ] Invariant cache hit.
[2026-05-27 02:58:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 7/63 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 261/324 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/325 variables, and 80 constraints, problems are : Problem set: 0 solved, 243 unsolved in 19606 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 7/63 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 261/324 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 243/323 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/325 variables, and 323 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50405ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 50408ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/135 places, 264/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50845 ms. Remains : 63/135 places, 264/397 transitions.
[2026-05-27 02:59:30] [INFO ] Flatten gal took : 36 ms
[2026-05-27 02:59:30] [INFO ] Flatten gal took : 32 ms
[2026-05-27 02:59:30] [INFO ] Input system was already deterministic with 264 transitions.
[2026-05-27 02:59:30] [INFO ] Flatten gal took : 36 ms
[2026-05-27 02:59:30] [INFO ] Flatten gal took : 25 ms
[2026-05-27 02:59:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9245084056825748139.gal : 23 ms
[2026-05-27 02:59:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7342502957633630758.ctl : 3 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/CTLFireability9245084056825748139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7342502957633630758.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,1.09186e+07,0.434212,12528,2,1498,5,22959,6,0,517,24478,0


Converting to forward existential form...Done !
original formula: E(((!(A(EF((p147==1)) U !((((p131==1)&&(p151==1))&&(p166==1))))) + !((((p62==1)&&(p89==1))&&(p118==1)))) + ((((p14==1)&&(p29==1))&&((p52=...371
=> equivalent forward existential formula: [((((FwdU(Init,((!(!((E(!(!((((p131==1)&&(p151==1))&&(p166==1)))) U (!(E(TRUE U (p147==1))) * !(!((((p131==1)&&(...540
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t63, t144, t189, t191, t209, t210, t212, t213, t214, t215, t216, t217, t218, t219, t...302
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.02869,165716,1,0,472,465535,572,357,8998,689285,709
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 105 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 131 transition count 364
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 102 transition count 364
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 59 place count 102 transition count 357
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 73 place count 95 transition count 357
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 88 place count 80 transition count 272
Ensure Unique test removed 2 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 105 place count 78 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 105 place count 78 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 75 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 68 transition count 115
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 126 place count 67 transition count 115
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 131 place count 62 transition count 101
Iterating global reduction 2 with 5 rules applied. Total rules applied 136 place count 62 transition count 101
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 182 place count 39 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 34 transition count 52
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 193 place count 33 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 196 place count 33 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 32 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 32 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 200 place count 31 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 31 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 212 place count 27 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 26 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 25 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 25 transition count 36
Applied a total of 216 rules in 47 ms. Remains 25 /135 variables (removed 110) and now considering 36/397 (removed 361) transitions.
[2026-05-27 02:59:37] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1350607864745012557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15958986847959912368.kers'
[2026-05-27 02:59:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1350607864745012557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15958986847959912368.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 29 rows 21 cols 90 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-27 02:59:37] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15958986847959912368.kers
Total runtime 1 ms.
[2026-05-27 02:59:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-27 02:59:38] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2026-05-27 02:59:38] [INFO ] Invariant cache hit.
[2026-05-27 02:59:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-27 02:59:38] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-27 02:59:38] [INFO ] Redundant transitions in 2 ms returned []
Running 20 sub problems to find dead transitions.
[2026-05-27 02:59:38] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2026-05-27 02:59:38] [INFO ] Invariant cache hit.
[2026-05-27 02:59:38] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/55 variables, and 37 constraints, problems are : Problem set: 0 solved, 20 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 25/25 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/55 variables, and 57 constraints, problems are : Problem set: 0 solved, 20 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 25/25 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1216ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/135 places, 36/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1368 ms. Remains : 25/135 places, 36/397 transitions.
[2026-05-27 02:59:39] [INFO ] Flatten gal took : 3 ms
[2026-05-27 02:59:39] [INFO ] Flatten gal took : 2 ms
[2026-05-27 02:59:39] [INFO ] Input system was already deterministic with 36 transitions.
RANDOM walk for 222 steps (0 resets) in 10 ms. (20 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 02:59:39] [INFO ] Flatten gal took : 13 ms
[2026-05-27 02:59:39] [INFO ] Flatten gal took : 3 ms
[2026-05-27 02:59:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10346086050467796725.gal : 2 ms
[2026-05-27 02:59:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3496187965847587625.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10346086050467796725.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3496187965847587625.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 114 transition count 306
Ensure Unique test removed 2 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 44 place count 112 transition count 306
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 103 transition count 209
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 103 transition count 209
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 98 transition count 202
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 96 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 94 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 94 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 93 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 93 transition count 160
Applied a total of 80 rules in 35 ms. Remains 93 /135 variables (removed 42) and now considering 160/397 (removed 237) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11401248045063944252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5012848853236868589.kers'
[2026-05-27 02:59:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11401248045063944252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5012848853236868589.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 93 cols 689 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-27 02:59:39] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5012848853236868589.kers
Total runtime 2 ms.
[2026-05-27 02:59:39] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-27 02:59:39] [INFO ] Invariant cache hit.
[2026-05-27 02:59:39] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2026-05-27 02:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/253 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 106 constraints, problems are : Problem set: 0 solved, 159 unsolved in 11413 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/253 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 159/266 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/253 variables, and 278 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 41484ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 41485ms
Starting structural reductions in LTL mode, iteration 1 : 93/135 places, 160/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41826 ms. Remains : 93/135 places, 160/397 transitions.
[2026-05-27 03:00:21] [INFO ] Flatten gal took : 10 ms
[2026-05-27 03:00:21] [INFO ] Flatten gal took : 9 ms
[2026-05-27 03:00:21] [INFO ] Input system was already deterministic with 160 transitions.
[2026-05-27 03:00:21] [INFO ] Flatten gal took : 9 ms
[2026-05-27 03:00:21] [INFO ] Flatten gal took : 8 ms
[2026-05-27 03:00:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17301980047456523383.gal : 3 ms
[2026-05-27 03:00:21] [INFO ] Time to serialize properties into /tmp/CTLFireability1900129624837163820.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/CTLFireability17301980047456523383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1900129624837163820.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91005e+08,1.2793,32732,2,9729,5,125291,6,0,534,87193,0


Converting to forward existential form...Done !
original formula: E(!((AG(!(E(((((p15==1)&&(p34==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p171==1))) U (p158==1)))) * !((AX(EG((p104==1))) + AG((((p99==1)&...208
=> equivalent forward existential formula: [(FwdU(Init,!((!(E(TRUE U !(!(E(((((p15==1)&&(p34==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p171==1))) U (p158==...284
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t20, t29, t31, t40, t43, t45, t47, t49, t53, t56, t57, t62, t66, t67, t68, ...477
(forward)formula 0,1,7.1019,163520,1,0,388,730738,356,183,4574,641689,435
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 100 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 131 transition count 366
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 104 transition count 366
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 55 place count 104 transition count 359
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 97 transition count 359
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 86 place count 80 transition count 272
Ensure Unique test removed 2 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 105 place count 78 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 105 place count 78 transition count 269
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 75 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 68 transition count 115
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 126 place count 67 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 130 place count 63 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 63 transition count 103
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 178 place count 41 transition count 81
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 182 place count 37 transition count 60
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 36 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 189 place count 36 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 35 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 35 transition count 57
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 3 with 2 rules applied. Total rules applied 193 place count 34 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 34 transition count 52
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 205 place count 30 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 30 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 29 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 28 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 28 transition count 45
Applied a total of 210 rules in 41 ms. Remains 28 /135 variables (removed 107) and now considering 45/397 (removed 352) transitions.
[2026-05-27 03:00:28] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9429313003877783532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15129681099894650665.kers'
[2026-05-27 03:00:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9429313003877783532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15129681099894650665.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 39 rows 25 cols 138 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-27 03:00:28] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15129681099894650665.kers
Total runtime 0 ms.
[2026-05-27 03:00:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-27 03:00:28] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2026-05-27 03:00:28] [INFO ] Invariant cache hit.
[2026-05-27 03:00:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-27 03:00:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-05-27 03:00:28] [INFO ] Redundant transitions in 23 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-27 03:00:28] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2026-05-27 03:00:28] [INFO ] Invariant cache hit.
[2026-05-27 03:00:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 39/67 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/68 variables, and 40 constraints, problems are : Problem set: 0 solved, 28 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 39/67 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/68 variables, and 68 constraints, problems are : Problem set: 0 solved, 28 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1875ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1876ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/135 places, 45/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2055 ms. Remains : 28/135 places, 45/397 transitions.
[2026-05-27 03:00:30] [INFO ] Flatten gal took : 3 ms
[2026-05-27 03:00:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 03:00:30] [INFO ] Input system was already deterministic with 45 transitions.
[2026-05-27 03:00:30] [INFO ] Flatten gal took : 3 ms
[2026-05-27 03:00:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 03:00:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17448417827669104817.gal : 1 ms
[2026-05-27 03:00:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11087005156449993624.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/CTLFireability17448417827669104817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11087005156449993624.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,17280,0.018309,4160,2,104,5,667,5,0,158,550,0


Converting to forward existential form...Done !
original formula: EG(AG((EF((((p126==0)||(p157==0))||(p166==0))) * (p16==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((E(TRUE U (((p126==0)||(p157==0))||(p166==0))) * (p16==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.048394,4624,1,0,8,3562,19,2,839,2201,10
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 102 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 131 transition count 365
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 103 transition count 365
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 57 place count 103 transition count 358
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 96 transition count 358
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 82 transition count 301
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 82 transition count 301
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 99 place count 82 transition count 298
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 79 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 76 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 76 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 74 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 74 transition count 170
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 159 place count 52 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 49 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 49 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 167 place count 49 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 48 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 48 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 48 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 45 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 44 transition count 98
Applied a total of 179 rules in 72 ms. Remains 44 /135 variables (removed 91) and now considering 98/397 (removed 299) transitions.
[2026-05-27 03:00:30] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15053795304261298395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17108260769497291564.kers'
[2026-05-27 03:00:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15053795304261298395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17108260769497291564.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 93 rows 43 cols 620 entries
Finished phase 1 with 28 SingleSign rule and 2 generalized
[2026-05-27 03:00:30] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17108260769497291564.kers
Total runtime 3 ms.
[2026-05-27 03:00:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-27 03:00:30] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2026-05-27 03:00:30] [INFO ] Invariant cache hit.
[2026-05-27 03:00:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-27 03:00:30] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-27 03:00:30] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-27 03:00:30] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2026-05-27 03:00:30] [INFO ] Invariant cache hit.
[2026-05-27 03:00:30] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 93/137 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/138 variables, and 76 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3453 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 93/137 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 79/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/138 variables, and 155 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8560ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 8561ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/135 places, 98/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8883 ms. Remains : 44/135 places, 98/397 transitions.
[2026-05-27 03:00:39] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:00:39] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:00:39] [INFO ] Input system was already deterministic with 98 transitions.
[2026-05-27 03:00:39] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:00:39] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:00:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2876469479014027376.gal : 2 ms
[2026-05-27 03:00:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10268285338232886494.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/CTLFireability2876469479014027376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10268285338232886494.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,146880,0.082484,5240,2,467,5,3275,6,0,274,3056,0


Converting to forward existential form...Done !
original formula: EF(((AF(((((p10==1)&&(p33==1))&&((p52==1)&&(p71==1)))&&(p116==1))) * (p126==1)) * ((p146==1)&&(p171==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p146==1)&&(p171==1))) * (p126==1)) * !(EG(!(((((p10==1)&&(p33==1))&&((p52==1)&&(p71==1))...182
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.216623,6956,1,0,11,10265,21,4,2263,4055,8
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-04 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 : 135/135 places, 397/397 transitions.
Graph (trivial) has 98 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 132 transition count 366
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 104 transition count 366
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 57 place count 104 transition count 359
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 97 transition count 359
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 84 place count 84 transition count 303
Iterating global reduction 2 with 13 rules applied. Total rules applied 97 place count 84 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 97 place count 84 transition count 300
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 81 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 79 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 79 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 77 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 77 transition count 196
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 153 place count 56 transition count 175
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 53 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 53 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 161 place count 53 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 53 transition count 147
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 3 with 2 rules applied. Total rules applied 164 place count 52 transition count 146
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 52 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 51 transition count 145
Applied a total of 166 rules in 71 ms. Remains 51 /135 variables (removed 84) and now considering 145/397 (removed 252) transitions.
[2026-05-27 03:00:39] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7338759867146304131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5996432041489414697.kers'
[2026-05-27 03:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7338759867146304131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5996432041489414697.kers]
Normalized transition count is 143 out of 144 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 51 cols 1158 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-27 03:00:39] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5996432041489414697.kers
Total runtime 3 ms.
[2026-05-27 03:00:40] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-27 03:00:40] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
[2026-05-27 03:00:40] [INFO ] Invariant cache hit.
[2026-05-27 03:00:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-27 03:00:40] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2026-05-27 03:00:40] [INFO ] Redundant transitions in 3 ms returned []
Running 132 sub problems to find dead transitions.
[2026-05-27 03:00:40] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
[2026-05-27 03:00:40] [INFO ] Invariant cache hit.
[2026-05-27 03:00:40] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 4/51 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 143/194 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 38/103 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/195 variables, and 103 constraints, problems are : Problem set: 0 solved, 132 unsolved in 7746 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 4/51 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 143/194 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 38/103 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 132/235 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/195 variables, and 236 constraints, problems are : Problem set: 0 solved, 132 unsolved in 15919 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23846ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 23846ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/135 places, 145/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24249 ms. Remains : 51/135 places, 145/397 transitions.
[2026-05-27 03:01:04] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:01:04] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:01:04] [INFO ] Input system was already deterministic with 145 transitions.
[2026-05-27 03:01:04] [INFO ] Flatten gal took : 8 ms
[2026-05-27 03:01:04] [INFO ] Flatten gal took : 14 ms
[2026-05-27 03:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12994703459467950403.gal : 2 ms
[2026-05-27 03:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10234824249888286980.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/CTLFireability12994703459467950403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10234824249888286980.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,714240,0.10957,6216,2,613,5,5560,6,0,349,5537,0


Converting to forward existential form...Done !
original formula: AF((EF(((((p10==1)&&(p39==1))&&((p52==1)&&(p77==1)))&&(p116==1))) + AG((AF((p36==1)) * (((((p11==1)&&(p34==1))&&((p53==1)&&(p68==1)))&&((...192
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((((p10==1)&&(p39==1))&&((p52==1)&&(p77==1)))&&(p116==1))) + !(E(TRUE U !((!(EG(!((p36==1...261
Reverse transition relation is NOT exact ! Due to transitions t1, t73, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91,...256
(forward)formula 0,1,0.596302,14164,1,0,243,39396,322,144,4766,29817,323
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 112 transition count 304
Ensure Unique test removed 2 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 48 place count 110 transition count 304
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 99 transition count 182
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 99 transition count 182
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 93 transition count 173
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 91 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 90 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 90 transition count 157
Applied a total of 86 rules in 12 ms. Remains 90 /135 variables (removed 45) and now considering 157/397 (removed 240) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1321356647662563176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5761299170388923737.kers'
[2026-05-27 03:01:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1321356647662563176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5761299170388923737.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 90 cols 683 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-27 03:01:04] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5761299170388923737.kers
Total runtime 1 ms.
[2026-05-27 03:01:04] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-27 03:01:04] [INFO ] Invariant cache hit.
[2026-05-27 03:01:05] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-27 03:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/247 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 102 constraints, problems are : Problem set: 0 solved, 156 unsolved in 10760 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 157/247 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 156/259 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 269 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 40813ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 40814ms
Starting structural reductions in LTL mode, iteration 1 : 90/135 places, 157/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41103 ms. Remains : 90/135 places, 157/397 transitions.
[2026-05-27 03:01:45] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:01:45] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:01:45] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-27 03:01:45] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:01:45] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:01:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10569097055045432015.gal : 2 ms
[2026-05-27 03:01:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2590521502603204600.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/CTLFireability10569097055045432015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2590521502603204600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07436e+08,0.605889,20764,2,7407,5,75607,6,0,519,47494,0


Converting to forward existential form...Done !
original formula: AF((((p99==0) * EX(EX((p17==0)))) * !(E(!(EX(((((p21==1)&&(p30==1))&&((p53==1)&&(p72==1)))&&((p118==1)&&(p171==1))))) U (((p24==1)&&(p89=...175
=> equivalent forward existential formula: [FwdG(Init,!((((p99==0) * EX(EX((p17==0)))) * !(E(!(EX(((((p21==1)&&(p30==1))&&((p53==1)&&(p72==1)))&&((p118==1)...220
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t55, t60, t61, t66, t70, t72, t75, t76, t77, t78, ...440
Detected timeout of ITS tools.
[2026-05-27 03:02:15] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:02:15] [INFO ] Applying decomposition
[2026-05-27 03:02:15] [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/graph15297019688688824470.txt' '-o' '/tmp/graph15297019688688824470.bin' '-w' '/tmp/graph15297019688688824470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15297019688688824470.bin' '-l' '-1' '-v' '-w' '/tmp/graph15297019688688824470.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:02:16] [INFO ] Decomposing Gal with order
[2026-05-27 03:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:02:16] [INFO ] Removed a total of 230 redundant transitions.
[2026-05-27 03:02:16] [INFO ] Flatten gal took : 91 ms
[2026-05-27 03:02:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 14 ms.
[2026-05-27 03:02:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14765644725001218991.gal : 4 ms
[2026-05-27 03:02:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15882127852008100279.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/CTLFireability14765644725001218991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15882127852008100279.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07436e+08,0.267299,10132,320,162,11799,2163,372,19773,128,12513,0


Converting to forward existential form...Done !
original formula: AF((((u9.p99==0) * EX(EX((u3.p17==0)))) * !(E(!(EX(((((i5.u11.p21==1)&&(i5.u11.p30==1))&&((i5.u11.p53==1)&&(i5.u11.p72==1)))&&((i4.u10.p1...239
=> equivalent forward existential formula: [FwdG(Init,!((((u9.p99==0) * EX(EX((u3.p17==0)))) * !(E(!(EX(((((i5.u11.p21==1)&&(i5.u11.p30==1))&&((i5.u11.p53=...284
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t75, t76, t80, t81, t83, t84, t87, t90, t91, t92, t95, t96, t99, t102, t103, t106, t...453
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,11.8685,283952,1,0,415882,6961,1884,874238,604,34194,478734
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 98 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 132 transition count 366
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 104 transition count 366
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 57 place count 104 transition count 359
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 97 transition count 359
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 88 place count 80 transition count 272
Ensure Unique test removed 2 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 107 place count 78 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 107 place count 78 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 75 transition count 269
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 71 transition count 175
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 70 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 69 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 69 transition count 151
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 168 place count 47 transition count 129
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 171 place count 44 transition count 111
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 43 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 177 place count 43 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 42 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 42 transition count 93
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 3 with 2 rules applied. Total rules applied 181 place count 41 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 41 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 37 transition count 84
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 37 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 36 transition count 83
Applied a total of 198 rules in 26 ms. Remains 36 /135 variables (removed 99) and now considering 83/397 (removed 314) transitions.
[2026-05-27 03:02:28] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8210447717550086499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13485662348101983672.kers'
[2026-05-27 03:02:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8210447717550086499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13485662348101983672.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 35 cols 474 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-27 03:02:28] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13485662348101983672.kers
Total runtime 1 ms.
[2026-05-27 03:02:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-27 03:02:28] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2026-05-27 03:02:28] [INFO ] Invariant cache hit.
[2026-05-27 03:02:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-27 03:02:28] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2026-05-27 03:02:28] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-27 03:02:28] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2026-05-27 03:02:28] [INFO ] Invariant cache hit.
[2026-05-27 03:02:28] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 6/36 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 75/111 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 64 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2644 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 36/36 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 6/36 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 75/111 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 64/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 128 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3960 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 36/36 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6642ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6643ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/135 places, 83/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6907 ms. Remains : 36/135 places, 83/397 transitions.
[2026-05-27 03:02:35] [INFO ] Flatten gal took : 6 ms
[2026-05-27 03:02:35] [INFO ] Flatten gal took : 7 ms
[2026-05-27 03:02:35] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-27 03:02:35] [INFO ] Flatten gal took : 10 ms
[2026-05-27 03:02:35] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:02:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16841441524560765540.gal : 1 ms
[2026-05-27 03:02:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11719698966621032339.prop : 5 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/ReachabilityCardinality16841441524560765540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11719698966621032339.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11719698966621032339.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 92
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :92 after 208
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :208 after 960
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,276480,0.073806,5096,2,200,10,2605,7,0,236,2026,0
Total reachable state count : 276480

Verifying 1 reachability properties.
Invariant property ErlangenMainframeV0-PT-0404-CTLFireability-2024-07 does not hold.
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV0-PT-0404-CTLFireability-2024-07,1,0.07542,5344,2,37,10,2605,7,0,247,2026,0
RANDOM walk for 40000 steps (8 resets) in 748 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1357229 steps, run visited all 1 properties in 1773 ms. (steps per millisecond=765 )
Probabilistic random walk after 1357229 steps, saw 179534 distinct states, run finished after 1780 ms. (steps per millisecond=762 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 117 transition count 336
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 117 transition count 336
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 111 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 111 transition count 330
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 108 transition count 309
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 108 transition count 309
Applied a total of 54 rules in 6 ms. Remains 108 /135 variables (removed 27) and now considering 309/397 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8108932669494798320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17026057832200605220.kers'
[2026-05-27 03:02:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8108932669494798320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17026057832200605220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 108 cols 2539 entries
Finished phase 1 with 92 SingleSign rule and 2 generalized
[2026-05-27 03:02:37] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17026057832200605220.kers
Total runtime 3 ms.
[2026-05-27 03:02:37] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-27 03:02:37] [INFO ] Invariant cache hit.
[2026-05-27 03:02:37] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-27 03:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 309/417 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/417 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 124 constraints, problems are : Problem set: 0 solved, 308 unsolved in 29615 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 309/417 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 308/433 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 439 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 108/135 places, 309/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60559 ms. Remains : 108/135 places, 309/397 transitions.
[2026-05-27 03:03:37] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:03:37] [INFO ] Flatten gal took : 15 ms
[2026-05-27 03:03:37] [INFO ] Input system was already deterministic with 309 transitions.
[2026-05-27 03:03:37] [INFO ] Flatten gal took : 20 ms
[2026-05-27 03:03:37] [INFO ] Flatten gal took : 20 ms
[2026-05-27 03:03:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17889120981626743220.gal : 9 ms
[2026-05-27 03:03:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18339347876879658082.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/CTLFireability17889120981626743220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18339347876879658082.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG(((p26==1) * ((((!(E(!(((((p11==1)&&(p30==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p177==1)))) U AX(((((p14==1)&&(p39==1))&&((p58==1)&...568
=> equivalent forward existential formula: ([FwdG(Init,((p26==1) * ((((!(E(!(((((p11==1)&&(p30==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p177==1)))) U !(EX...647
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t12, t14, t15, t16, t19, t33, t35, t44, t47, t52, t56, t59, t65, t71, t76, t84, t86, ...663
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-27 03:04:08] [INFO ] Flatten gal took : 14 ms
[2026-05-27 03:04:08] [INFO ] Applying decomposition
[2026-05-27 03:04:08] [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/graph8486364710419681638.txt' '-o' '/tmp/graph8486364710419681638.bin' '-w' '/tmp/graph8486364710419681638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8486364710419681638.bin' '-l' '-1' '-v' '-w' '/tmp/graph8486364710419681638.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:04:08] [INFO ] Decomposing Gal with order
[2026-05-27 03:04:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:04:08] [INFO ] Removed a total of 1159 redundant transitions.
[2026-05-27 03:04:08] [INFO ] Flatten gal took : 45 ms
[2026-05-27 03:04:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2026-05-27 03:04:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16649468587596732390.gal : 4 ms
[2026-05-27 03:04:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13625695252346715804.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/CTLFireability16649468587596732390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13625695252346715804.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.73259e+08,2.03532,54964,1528,74,80284,951,404,343955,80,3058,0


Converting to forward existential form...Done !
original formula: (EG(((u6.p26==1) * ((((!(E(!(((((i5.u3.p11==1)&&(i5.u17.p30==1))&&((i5.u17.p49==1)&&(i5.u12.p72==1)))&&((i5.u16.p118==1)&&(i5.u32.p177==1...840
=> equivalent forward existential formula: ([FwdG(Init,((u6.p26==1) * ((((!(E(!(((((i5.u3.p11==1)&&(i5.u17.p30==1))&&((i5.u17.p49==1)&&(i5.u12.p72==1)))&&(...919
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t266, t268, t270, t272, u8.t65, u8.t250, u8.t251, u6.t0, u6.t71, u6.t254, u6.t255, u...493
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 95 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 132 transition count 366
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 104 transition count 366
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 57 place count 104 transition count 360
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 98 transition count 360
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 86 place count 81 transition count 273
Ensure Unique test removed 2 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 105 place count 79 transition count 273
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 105 place count 79 transition count 270
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 76 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 73 transition count 212
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 72 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 71 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 71 transition count 176
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 164 place count 49 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 46 transition count 136
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 45 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 173 place count 45 transition count 134
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 3 with 2 rules applied. Total rules applied 175 place count 44 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 42 transition count 129
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 187 place count 42 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 41 transition count 128
Applied a total of 188 rules in 36 ms. Remains 41 /135 variables (removed 94) and now considering 128/397 (removed 269) transitions.
[2026-05-27 03:04:38] [INFO ] Flow matrix only has 121 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11849952952960649167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9369395890102297526.kers'
[2026-05-27 03:04:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11849952952960649167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9369395890102297526.kers]
Normalized transition count is 120 out of 121 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 120 rows 40 cols 966 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-27 03:04:38] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9369395890102297526.kers
Total runtime 1 ms.
[2026-05-27 03:04:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-27 03:04:38] [INFO ] Flow matrix only has 121 transitions (discarded 7 similar events)
[2026-05-27 03:04:38] [INFO ] Invariant cache hit.
[2026-05-27 03:04:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 03:04:38] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-27 03:04:38] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-27 03:04:38] [INFO ] Flow matrix only has 121 transitions (discarded 7 similar events)
[2026-05-27 03:04:38] [INFO ] Invariant cache hit.
[2026-05-27 03:04:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 6/41 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 120/161 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/162 variables, and 53 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4789 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 6/41 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 120/161 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 109/162 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/162 variables, and 162 constraints, problems are : Problem set: 0 solved, 109 unsolved in 10096 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14965ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 14965ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/135 places, 128/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15231 ms. Remains : 41/135 places, 128/397 transitions.
[2026-05-27 03:04:53] [INFO ] Flatten gal took : 6 ms
[2026-05-27 03:04:53] [INFO ] Flatten gal took : 5 ms
[2026-05-27 03:04:53] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-27 03:04:53] [INFO ] Flatten gal took : 6 ms
[2026-05-27 03:04:53] [INFO ] Flatten gal took : 5 ms
[2026-05-27 03:04:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6127894902818451353.gal : 2 ms
[2026-05-27 03:04:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1581643184606414561.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/CTLFireability6127894902818451353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1581643184606414561.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,746496,0.085237,5960,2,274,5,4774,6,0,293,4408,0


Converting to forward existential form...Done !
original formula: EF((EF(((((p15==1)&&(p34==1))&&((p53==1)&&(p72==1)))&&((p118==1)&&(p171==1)))) * ((((p15==0)||(p40==0))||((p53==0)||(p78==0)))||((p118==0...171
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * ((((p15==0)||(p40==0))||((p53==0)||(p78==0)))||((p118==0)||(p177==0)))),TRUE) * ((((p1...230
(forward)formula 0,1,0.100036,6224,1,0,8,4774,10,2,1025,4408,4
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 93 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 132 transition count 368
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 106 transition count 368
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 53 place count 106 transition count 362
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 65 place count 100 transition count 362
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 84 place count 81 transition count 273
Ensure Unique test removed 2 places
Iterating global reduction 2 with 21 rules applied. Total rules applied 105 place count 79 transition count 273
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 105 place count 79 transition count 270
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 76 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 71 transition count 152
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 70 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 67 transition count 132
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 67 transition count 132
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 168 place count 47 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 45 transition count 109
Ensure Unique test removed 1 places
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 44 transition count 109
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 2 with 2 rules applied. Total rules applied 175 place count 43 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 43 transition count 107
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 2 with 2 rules applied. Total rules applied 178 place count 42 transition count 106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 42 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 41 transition count 105
Applied a total of 180 rules in 35 ms. Remains 41 /135 variables (removed 94) and now considering 105/397 (removed 292) transitions.
[2026-05-27 03:04:53] [INFO ] Flow matrix only has 104 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17783728614763578682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2078720579728965655.kers'
[2026-05-27 03:04:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17783728614763578682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2078720579728965655.kers]
Normalized transition count is 103 out of 104 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 103 rows 40 cols 639 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-27 03:04:53] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2078720579728965655.kers
Total runtime 1 ms.
[2026-05-27 03:04:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-27 03:04:53] [INFO ] Flow matrix only has 104 transitions (discarded 1 similar events)
[2026-05-27 03:04:53] [INFO ] Invariant cache hit.
[2026-05-27 03:04:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 03:04:53] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-27 03:04:53] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2026-05-27 03:04:53] [INFO ] Flow matrix only has 104 transitions (discarded 1 similar events)
[2026-05-27 03:04:53] [INFO ] Invariant cache hit.
[2026-05-27 03:04:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 6/41 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 103/144 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/145 variables, and 53 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 6/41 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 103/144 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 84/137 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/145 variables, and 137 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5210 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8643ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8644ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/135 places, 105/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8857 ms. Remains : 41/135 places, 105/397 transitions.
[2026-05-27 03:05:02] [INFO ] Flatten gal took : 5 ms
[2026-05-27 03:05:02] [INFO ] Flatten gal took : 5 ms
[2026-05-27 03:05:02] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-27 03:05:02] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:05:02] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:05:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3125481031290046312.gal : 2 ms
[2026-05-27 03:05:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16562230489587295774.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/CTLFireability3125481031290046312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16562230489587295774.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,921600,0.061674,5180,2,254,5,2348,6,0,270,1710,0


Converting to forward existential form...Done !
original formula: E(EF((((p137==1)&&(p151==1))&&(p177==1))) U ((((p21==1)&&(p30==1))&&((p49==1)&&(p68==1)))&&((p118==1)&&(p171==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((p137==1)&&(p151==1))&&(p177==1)))) * ((((p21==1)&&(p30==1))&&((p49==1)&&(p68==1)))&&((p1...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.164887,6560,1,0,8,12939,16,1,2193,6087,8
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 104 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 131 transition count 365
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 103 transition count 365
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 57 place count 103 transition count 358
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 96 transition count 358
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 86 place count 81 transition count 273
Ensure Unique test removed 2 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 103 place count 79 transition count 273
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 103 place count 79 transition count 270
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 76 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 70 transition count 118
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 70 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 66 transition count 108
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 66 transition count 108
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 175 place count 43 transition count 85
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 39 transition count 58
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 184 place count 38 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 187 place count 38 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 188 place count 37 transition count 53
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 37 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 37 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 201 place count 33 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 32 transition count 44
Applied a total of 202 rules in 38 ms. Remains 32 /135 variables (removed 103) and now considering 44/397 (removed 353) transitions.
[2026-05-27 03:05:02] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5829027953497666567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17553351630806767189.kers'
[2026-05-27 03:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5829027953497666567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17553351630806767189.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 36 rows 31 cols 124 entries
Finished phase 1 with 19 SingleSign rule and 2 generalized
[2026-05-27 03:05:02] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17553351630806767189.kers
Total runtime 0 ms.
[2026-05-27 03:05:02] [INFO ] Implicit Places using invariants in 134 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/135 places, 44/397 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 28 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 40
Applied a total of 7 rules in 3 ms. Remains 28 /31 variables (removed 3) and now considering 40/44 (removed 4) transitions.
[2026-05-27 03:05:02] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4083761832533010135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8651361992311225267.kers'
[2026-05-27 03:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4083761832533010135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8651361992311225267.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 34 rows 25 cols 107 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-27 03:05:02] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8651361992311225267.kers
Total runtime 0 ms.
[2026-05-27 03:05:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-27 03:05:02] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2026-05-27 03:05:03] [INFO ] Invariant cache hit.
[2026-05-27 03:05:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-27 03:05:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/135 places, 40/397 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 323 ms. Remains : 28/135 places, 40/397 transitions.
[2026-05-27 03:05:03] [INFO ] Flatten gal took : 2 ms
[2026-05-27 03:05:03] [INFO ] Flatten gal took : 2 ms
[2026-05-27 03:05:03] [INFO ] Input system was already deterministic with 40 transitions.
[2026-05-27 03:05:03] [INFO ] Flatten gal took : 1 ms
[2026-05-27 03:05:03] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 499 steps (0 resets) in 7 ms. (62 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 03:05:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16805954277992561159.gal : 0 ms
[2026-05-27 03:05:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16197988637570381536.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16805954277992561159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16197988637570381536.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16197988637570381536.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Graph (trivial) has 91 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 132 transition count 368
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 106 transition count 368
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 53 place count 106 transition count 359
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 71 place count 97 transition count 359
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 88 place count 80 transition count 272
Ensure Unique test removed 2 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 107 place count 78 transition count 272
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 107 place count 78 transition count 270
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 76 transition count 270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 72 transition count 176
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 71 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 69 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 69 transition count 150
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 166 place count 48 transition count 129
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 45 transition count 116
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 44 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 44 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 43 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 43 transition count 99
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 3 with 2 rules applied. Total rules applied 178 place count 42 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 42 transition count 97
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 3 with 2 rules applied. Total rules applied 181 place count 41 transition count 96
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 41 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 40 transition count 95
Applied a total of 184 rules in 63 ms. Remains 40 /135 variables (removed 95) and now considering 95/397 (removed 302) transitions.
[2026-05-27 03:05:03] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2556118314306310252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5486187929339229376.kers'
[2026-05-27 03:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2556118314306310252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5486187929339229376.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 93 rows 39 cols 555 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 03:05:03] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5486187929339229376.kers
Total runtime 1 ms.
[2026-05-27 03:05:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-27 03:05:03] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
[2026-05-27 03:05:03] [INFO ] Invariant cache hit.
[2026-05-27 03:05:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-27 03:05:03] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-27 03:05:03] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2026-05-27 03:05:03] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
[2026-05-27 03:05:03] [INFO ] Invariant cache hit.
[2026-05-27 03:05:03] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 93/133 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/134 variables, and 68 constraints, problems are : Problem set: 0 solved, 75 unsolved in 3173 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 93/133 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 75/143 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/134 variables, and 143 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4779 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7995ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 7996ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/135 places, 95/397 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8230 ms. Remains : 40/135 places, 95/397 transitions.
[2026-05-27 03:05:11] [INFO ] Flatten gal took : 6 ms
[2026-05-27 03:05:11] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:05:11] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-27 03:05:11] [INFO ] Flatten gal took : 4 ms
[2026-05-27 03:05:11] [INFO ] Flatten gal took : 13 ms
[2026-05-27 03:05:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5275116796284386357.gal : 3 ms
[2026-05-27 03:05:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4969207111809713349.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/CTLFireability5275116796284386357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4969207111809713349.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,691200,0.077001,5064,2,214,5,3383,6,0,256,3105,0


Converting to forward existential form...Done !
original formula: EF(EG((AF(((((p15==1)&&(p34==1))&&((p49==1)&&(p68==1)))&&((p118==1)&&(p171==1)))) * ((((p43==0)||(p94==0))||((p102==0)||(p118==0)))||(p13...164
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(((((p15==1)&&(p34==1))&&((p49==1)&&(p68==1)))&&((p118==1)&&(p171==1)))))) * ((((p4...220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.179852,5948,1,0,9,9659,24,4,1961,4589,11
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 119 transition count 381
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 119 transition count 381
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 113 transition count 375
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 113 transition count 375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 111 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 111 transition count 373
Applied a total of 48 rules in 9 ms. Remains 111 /135 variables (removed 24) and now considering 373/397 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14932919493048900713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2325737131022058501.kers'
[2026-05-27 03:05:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14932919493048900713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2325737131022058501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 111 cols 3187 entries
Finished phase 1 with 94 SingleSign rule and 3 generalized
[2026-05-27 03:05:11] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2325737131022058501.kers
Total runtime 5 ms.
[2026-05-27 03:05:11] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-27 03:05:11] [INFO ] Invariant cache hit.
[2026-05-27 03:05:11] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2026-05-27 03:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/484 variables, 111/127 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 127 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 373/484 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 372/500 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 506 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61085ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 61088ms
Starting structural reductions in LTL mode, iteration 1 : 111/135 places, 373/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61497 ms. Remains : 111/135 places, 373/397 transitions.
[2026-05-27 03:06:13] [INFO ] Flatten gal took : 21 ms
[2026-05-27 03:06:13] [INFO ] Flatten gal took : 23 ms
[2026-05-27 03:06:13] [INFO ] Input system was already deterministic with 373 transitions.
[2026-05-27 03:06:13] [INFO ] Flatten gal took : 22 ms
[2026-05-27 03:06:13] [INFO ] Flatten gal took : 22 ms
[2026-05-27 03:06:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8022603136323102306.gal : 6 ms
[2026-05-27 03:06:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6294681941103547521.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/CTLFireability8022603136323102306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6294681941103547521.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.43511e+08,1.32767,28568,2,7731,5,76337,6,0,819,91574,0


Converting to forward existential form...Done !
original formula: EF((((E(EF(((((p20==1)&&(p33==1))&&((p48==1)&&(p67==1)))&&(p116==1))) U ((((p11==1)&&(p34==1))&&((p49==1)&&(p68==1)))&&(((p118==1)&&(p177...635
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((E(E(TRUE U ((((p20==1)&&(p33==1))&&((p48==1)&&(p67==1)))&&(p116==1))) U ((((p11==1)&...1197
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t12, t15, t40, t43, t46, t50, t54, t57, t63, t69, t74, t75, t249, t250, t251, t252, ...760
Detected timeout of ITS tools.
[2026-05-27 03:06:43] [INFO ] Flatten gal took : 13 ms
[2026-05-27 03:06:43] [INFO ] Applying decomposition
[2026-05-27 03:06:43] [INFO ] Flatten gal took : 13 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/graph15399547882616293459.txt' '-o' '/tmp/graph15399547882616293459.bin' '-w' '/tmp/graph15399547882616293459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15399547882616293459.bin' '-l' '-1' '-v' '-w' '/tmp/graph15399547882616293459.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:06:43] [INFO ] Decomposing Gal with order
[2026-05-27 03:06:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:06:43] [INFO ] Removed a total of 384 redundant transitions.
[2026-05-27 03:06:43] [INFO ] Flatten gal took : 80 ms
[2026-05-27 03:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 9 ms.
[2026-05-27 03:06:43] [INFO ] Time to serialize gal into /tmp/CTLFireability850199128328573965.gal : 7 ms
[2026-05-27 03:06:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9478192228426464896.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/CTLFireability850199128328573965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9478192228426464896.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.43511e+08,6.96003,193084,1268,3365,97053,117320,367,1.18376e+06,340,1.02529e+06,0


Converting to forward existential form...Done !
original formula: EF((((E(EF(((((i6.u11.p20==1)&&(i6.u11.p33==1))&&((i6.u11.p48==1)&&(i6.u11.p67==1)))&&(i6.u11.p116==1))) U ((((i6.u11.p11==1)&&(i6.u11.p3...957
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((E(E(TRUE U ((((i6.u11.p20==1)&&(i6.u11.p33==1))&&((i6.u11.p48==1)&&(i6.u11.p67==1)))...1734
Reverse transition relation is NOT exact ! Due to transitions t8, t40, t57, t63, t69, t75, u4.t74, u4.t253, u4.t254, u5.t249, u5.t250, u6.t255, u6.t256, i0...1384
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 114 transition count 322
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 114 transition count 322
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 106 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 106 transition count 314
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 103 transition count 304
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 103 transition count 304
Applied a total of 64 rules in 21 ms. Remains 103 /135 variables (removed 32) and now considering 304/397 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17118599999718583114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6974774751017158778.kers'
[2026-05-27 03:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17118599999718583114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6974774751017158778.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 103 cols 2529 entries
Finished phase 1 with 87 SingleSign rule and 2 generalized
[2026-05-27 03:07:13] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6974774751017158778.kers
Total runtime 2 ms.
[2026-05-27 03:07:13] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-27 03:07:13] [INFO ] Invariant cache hit.
[2026-05-27 03:07:13] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-27 03:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 304/407 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 122 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 304/407 variables, 103/123 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 303/426 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 429 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60667ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60669ms
Starting structural reductions in LTL mode, iteration 1 : 103/135 places, 304/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60991 ms. Remains : 103/135 places, 304/397 transitions.
[2026-05-27 03:08:14] [INFO ] Flatten gal took : 10 ms
[2026-05-27 03:08:14] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:08:14] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-27 03:08:14] [INFO ] Flatten gal took : 12 ms
[2026-05-27 03:08:14] [INFO ] Flatten gal took : 19 ms
[2026-05-27 03:08:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3571458080523325756.gal : 3 ms
[2026-05-27 03:08:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11889070052692244344.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/CTLFireability3571458080523325756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11889070052692244344.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.80172e+08,0.658492,14596,2,4277,5,33802,6,0,718,34055,0


Converting to forward existential form...Done !
original formula: (AX(((AX(AG(((((p11==0)||(p30==0))||((p49==0)||(p68==0)))||((p118==0)||(p177==0))))) * EG((((((p14==0)||(p29==0))||((p48==0)||(p67==0)))|...371
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(((!(EX(!(!(E(TRUE U !(((((p11==0)||(p30==0))||((p49==0)||(p68==0)))||((p118==0)||(p177==0)...457
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t60, t66, t71, t79, t81, t85, t87, t88, t90, t91, ...834
(forward)formula 0,1,3.6546,74992,1,0,550,284822,629,300,8845,227024,626
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 397/397 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 116 transition count 352
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 116 transition count 352
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 107 transition count 290
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 107 transition count 290
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 104 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 104 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 103 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 103 transition count 234
Applied a total of 64 rules in 10 ms. Remains 103 /135 variables (removed 32) and now considering 234/397 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10313448069080213274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4123041194474328864.kers'
[2026-05-27 03:08:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10313448069080213274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4123041194474328864.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 103 cols 1649 entries
Finished phase 1 with 86 SingleSign rule and 3 generalized
[2026-05-27 03:08:18] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4123041194474328864.kers
Total runtime 4 ms.
[2026-05-27 03:08:18] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-27 03:08:18] [INFO ] Invariant cache hit.
[2026-05-27 03:08:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-27 03:08:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 234/337 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 121 constraints, problems are : Problem set: 0 solved, 233 unsolved in 22180 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 234/337 variables, 103/121 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 233/354 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 362 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52415ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 52416ms
Starting structural reductions in LTL mode, iteration 1 : 103/135 places, 234/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52867 ms. Remains : 103/135 places, 234/397 transitions.
[2026-05-27 03:09:11] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:09:11] [INFO ] Flatten gal took : 12 ms
[2026-05-27 03:09:11] [INFO ] Input system was already deterministic with 234 transitions.
[2026-05-27 03:09:11] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:09:11] [INFO ] Flatten gal took : 12 ms
[2026-05-27 03:09:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5485085087918477609.gal : 4 ms
[2026-05-27 03:09:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5294995019287841899.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/CTLFireability5485085087918477609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5294995019287841899.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.03042e+08,0.550588,13684,2,4415,5,34728,6,0,648,32136,0


Converting to forward existential form...Done !
original formula: EF((((AG(AX(((((p20==1)&&(p39==1))&&((p58==1)&&(p71==1)))&&(p116==1)))) * (p20==1)) * ((p33==1)&&(p58==1))) * ((p77==1)&&(p116==1))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((p77==1)&&(p116==1))) * ((p33==1)&&(p58==1))) * (p20==1)) * !(E(TRUE U !(!(EX(!(((((p20=...221
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t60, t62, t66, t71, t73, t155, t156, t157, t158, t...494
(forward)formula 0,0,3.16907,73188,1,0,437,277125,490,226,7944,233128,481
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-27 03:09:14] [INFO ] Flatten gal took : 23 ms
[2026-05-27 03:09:14] [INFO ] Flatten gal took : 14 ms
[2026-05-27 03:09:14] [INFO ] Applying decomposition
[2026-05-27 03:09:14] [INFO ] Flatten gal took : 13 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/graph2519429366613366737.txt' '-o' '/tmp/graph2519429366613366737.bin' '-w' '/tmp/graph2519429366613366737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2519429366613366737.bin' '-l' '-1' '-v' '-w' '/tmp/graph2519429366613366737.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:09:14] [INFO ] Decomposing Gal with order
[2026-05-27 03:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:09:14] [INFO ] Removed a total of 374 redundant transitions.
[2026-05-27 03:09:14] [INFO ] Flatten gal took : 89 ms
[2026-05-27 03:09:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 12 ms.
[2026-05-27 03:09:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4962154217243884831.gal : 6 ms
[2026-05-27 03:09:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11030511359474695904.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/CTLFireability4962154217243884831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11030511359474695904.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 2 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.11185e+09,98.8601,2074468,3506,6424,643036,583709,505,1.63221e+07,353,1.38225e+07,0


Converting to forward existential form...Done !
original formula: (EG(((i2.i1.u6.p26==1) * ((((!(E(!(((((i6.u15.p11==1)&&(i6.u15.p30==1))&&((i6.u15.p49==1)&&(i6.u15.p72==1)))&&((i6.u15.p118==1)&&(i6.u32....869
=> equivalent forward existential formula: ([FwdG(Init,((i2.i1.u6.p26==1) * ((((!(E(!(((((i6.u15.p11==1)&&(i6.u15.p30==1))&&((i6.u15.p49==1)&&(i6.u15.p72==...948
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t18, t55, t74, u9.t279, u9.t280, i0.t84, i0.u7.t80, i0.u7.t274, i0.u8.t81, i0.u8.t83...1658
Using 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 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
[2026-05-27 03:33:19] [INFO ] Applying decomposition
[2026-05-27 03:33:19] [INFO ] Flatten gal took : 15 ms
[2026-05-27 03:33:19] [INFO ] Decomposing Gal with order
[2026-05-27 03:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:33:19] [INFO ] Removed a total of 1443 redundant transitions.
[2026-05-27 03:33:19] [INFO ] Flatten gal took : 42 ms
[2026-05-27 03:33:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 12 ms.
[2026-05-27 03:33:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17997446141127441003.gal : 3 ms
[2026-05-27 03:33:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16771282369693486621.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/CTLFireability17997446141127441003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16771282369693486621.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 2 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.11185e+09,0.347514,12468,669,623,12808,2664,252,47964,193,19580,0


Converting to forward existential form...Done !
original formula: (EG(((i0.i0.i0.i0.u6.p26==1) * ((((!(E(!(((((i0.i0.i0.i0.u5.p11==1)&&(i0.i0.i0.i0.u6.p30==1))&&((i0.i0.i0.u7.p49==1)&&(i0.i0.u8.p72==1)))...1025
=> equivalent forward existential formula: ([FwdG(Init,((i0.i0.i0.i0.u6.p26==1) * ((((!(E(!(((((i0.i0.i0.i0.u5.p11==1)&&(i0.i0.i0.i0.u6.p30==1))&&((i0.i0.i...1104
Reverse transition relation is NOT exact ! Due to transitions i0.t361, i0.i0.u8.t74, i0.i0.u8.t279, i0.i0.u8.t280, i0.i0.i0.u7.t80, i0.i0.i0.u7.t81, i0.i0....816
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,83.9583,1339304,1,0,1.8241e+06,44990,2591,1.01962e+07,1214,379036,322073
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((E(EF(((((i0.i0.i0.i0.u5.p20==1)&&(i0.i0.i0.i0.u6.p33==1))&&((i0.i0.i0.u7.p48==1)&&(i0.i0.u8.p67==1)))&&(i0.i1.u13.p116==1))) U ((((...1182
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((E(E(TRUE U ((((i0.i0.i0.i0.u5.p20==1)&&(i0.i0.i0.i0.u6.p33==1))&&((i0.i0.i0.u7.p48==...2101
(forward)formula 1,1,102.07,1675936,1,0,2.28431e+06,49054,2838,1.27478e+07,1227,435182,494569
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 2279695 ms.

BK_STOP 1779852901764

--------------------
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="ErlangenMainframeV0-PT-0404"
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 ErlangenMainframeV0-PT-0404, 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 r114-smll-177955740600410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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