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.r338-smll-178021499100058.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 ErlangenMainframeV1-PT-bP02C02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 27 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 27 08:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 27 08:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 27 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 27 08:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 27 08:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 64K May 26 18:17 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 ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780260454107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 20:47:36] [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-31 20:47:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:47:36] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2026-05-31 20:47:36] [INFO ] Transformed 193 places.
[2026-05-31 20:47:36] [INFO ] Transformed 255 transitions.
[2026-05-31 20:47:36] [INFO ] Found NUPN structural information;
[2026-05-31 20:47:36] [INFO ] Parsed PT model containing 193 places and 255 transitions and 805 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Support contains 106 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 255/255 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 177 transition count 239
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 177 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 176 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 176 transition count 238
Applied a total of 34 rules in 74 ms. Remains 176 /193 variables (removed 17) and now considering 238/255 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10945537910919955069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7422393314171700670.kers'
[2026-05-31 20:47:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10945537910919955069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7422393314171700670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 176 cols 771 entries
Finished phase 1 with 163 SingleSign rule and 3 generalized
[2026-05-31 20:47:37] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7422393314171700670.kers
Total runtime 4 ms.
[2026-05-31 20:47:37] [INFO ] Implicit Places using invariants in 516 ms returned []
[2026-05-31 20:47:37] [INFO ] Invariant cache hit.
[2026-05-31 20:47:38] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2026-05-31 20:47:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 238/414 variables, 176/194 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 202 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 238/414 variables, 176/205 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 237/442 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 450 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LTL mode, iteration 1 : 176/193 places, 238/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61460 ms. Remains : 176/193 places, 238/255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2026-05-31 20:48:38] [INFO ] Invariant cache hit.
[2026-05-31 20:48:38] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-31 20:48:38] [INFO ] Invariant cache hit.
[2026-05-31 20:48:38] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 176/176 places, 238/238 transitions.
Support contains 106 out of 176 places after structural reductions.
[2026-05-31 20:48:39] [INFO ] Flatten gal took : 94 ms
[2026-05-31 20:48:39] [INFO ] Flatten gal took : 46 ms
[2026-05-31 20:48:39] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 105 out of 176 places (down from 106) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 98 to 97
RANDOM walk for 40000 steps (8 resets) in 3109 ms. (12 steps per ms) remains 26/97 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
[2026-05-31 20:48:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (OVERLAPS) 138/173 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/176 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 238/414 variables, 176/186 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 186 constraints, problems are : Problem set: 2 solved, 16 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 142/173 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 3/176 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 238/414 variables, 176/189 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 16/205 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 2/207 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 1/208 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 1/209 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/414 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 209 constraints, problems are : Problem set: 2 solved, 16 unsolved in 4703 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 16/18 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6041ms problems are : Problem set: 2 solved, 16 unsolved
Parikh walk visited 11 properties in 9689 ms.
Support contains 16 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 238/238 transitions.
Graph (trivial) has 149 edges and 176 vertex of which 10 / 176 are part of one of the 4 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 170 transition count 172
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 115 transition count 163
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 113 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 111 transition count 161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 126 place count 111 transition count 152
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 144 place count 102 transition count 152
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 164 place count 82 transition count 132
Iterating global reduction 4 with 20 rules applied. Total rules applied 184 place count 82 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 188 place count 82 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 190 place count 80 transition count 128
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 190 place count 80 transition count 124
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 198 place count 76 transition count 124
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 201 place count 73 transition count 110
Iterating global reduction 6 with 3 rules applied. Total rules applied 204 place count 73 transition count 110
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 238 place count 56 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 250 place count 50 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 257 place count 50 transition count 116
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 261 place count 50 transition count 112
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 265 place count 46 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 45 transition count 111
Applied a total of 266 rules in 93 ms. Remains 45 /176 variables (removed 131) and now considering 111/238 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 45/176 places, 111/238 transitions.
RANDOM walk for 40000 steps (8 resets) in 534 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 372 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 119899 steps, run visited all 5 properties in 367 ms. (steps per millisecond=326 )
Probabilistic random walk after 119899 steps, saw 34691 distinct states, run finished after 375 ms. (steps per millisecond=319 ) properties seen :5
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-31 20:48:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-31 20:48:57] [INFO ] Flatten gal took : 32 ms
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:48:57] [INFO ] Flatten gal took : 30 ms
[2026-05-31 20:48:57] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 98 out of 176 places (down from 103) after GAL structural reductions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 144 transition count 206
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 144 transition count 206
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 131 transition count 191
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 131 transition count 191
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 126 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 126 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 122 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 122 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 119 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 119 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 118 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 118 transition count 155
Applied a total of 116 rules in 48 ms. Remains 118 /176 variables (removed 58) and now considering 155/238 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7771420311257479817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3768427275673878683.kers'
[2026-05-31 20:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7771420311257479817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3768427275673878683.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 118 cols 465 entries
Finished phase 1 with 106 SingleSign rule and 2 generalized
[2026-05-31 20:48:57] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3768427275673878683.kers
Total runtime 3 ms.
[2026-05-31 20:48:58] [INFO ] Implicit Places using invariants in 94 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/176 places, 155/238 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 117/176 places, 155/238 transitions.
[2026-05-31 20:48:58] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:48:58] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:48:58] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-31 20:48:58] [INFO ] Flatten gal took : 11 ms
[2026-05-31 20:48:58] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:48:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15494914827440659689.gal : 6 ms
[2026-05-31 20:48:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4604909048876548300.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15494914827440659689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4604909048876548300.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((!(E((AG((p105==1)) + EX((p142==1))) U (p96==1))) + !(A(((p138==1)||(!(((p13==1)&&(p28==1))&&((p79==1)&&(p186==1))))) U (E((p87==1) U...198
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((!(E((!(E(TRUE U !((p105==1)))) + EX((p142==1))) U (p96==1))) + !(!((E(!((E((p87==1)...373
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t14, t17, t25, t68, t70, t74, t79, t81, t87, t89, t93, t94, t97, t99, t101, t102, t1...313
Detected timeout of ITS tools.
[2026-05-31 20:49:28] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:49:28] [INFO ] Applying decomposition
[2026-05-31 20:49:28] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18073135053549815298.txt' '-o' '/tmp/graph18073135053549815298.bin' '-w' '/tmp/graph18073135053549815298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18073135053549815298.bin' '-l' '-1' '-v' '-w' '/tmp/graph18073135053549815298.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:49:28] [INFO ] Decomposing Gal with order
[2026-05-31 20:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:49:28] [INFO ] Removed a total of 126 redundant transitions.
[2026-05-31 20:49:28] [INFO ] Flatten gal took : 98 ms
[2026-05-31 20:49:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2026-05-31 20:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2147793074068447851.gal : 9 ms
[2026-05-31 20:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8712434176831399822.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/CTLFireability2147793074068447851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8712434176831399822.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52359e+08,0.045715,5184,227,42,1920,254,348,2688,73,586,0


Converting to forward existential form...Done !
original formula: AG(((!(E((AG((i6.i1.u21.p105==1)) + EX((i8.u30.p142==1))) U (i5.u19.p96==1))) + !(A(((i8.u29.p138==1)||(!(((i1.u4.p13==1)&&(i2.i1.u6.p28=...291
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((!(E((!(E(TRUE U !((i6.i1.u21.p105==1)))) + EX((i8.u30.p142==1))) U (i5.u19.p96==1))...512
Reverse transition relation is NOT exact ! Due to transitions t14, t25, t68, t89, t104, t106, t131, i1.t124, i1.t123, i1.t97, i1.u3.t94, i1.u16.t70, i2.i0....357
Using 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 4
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
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
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
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,3.00356,83224,1,0,146371,1023,2539,243717,376,3241,148790
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 139 transition count 201
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 139 transition count 201
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 126 transition count 186
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 126 transition count 186
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 122 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 122 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 121 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 121 transition count 172
Applied a total of 110 rules in 12 ms. Remains 121 /176 variables (removed 55) and now considering 172/238 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14814452064718869181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4337727344783605071.kers'
[2026-05-31 20:49:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14814452064718869181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4337727344783605071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 121 cols 559 entries
Finished phase 1 with 109 SingleSign rule and 2 generalized
[2026-05-31 20:49:31] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4337727344783605071.kers
Total runtime 2 ms.
[2026-05-31 20:49:31] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-31 20:49:31] [INFO ] Invariant cache hit.
[2026-05-31 20:49:31] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2026-05-31 20:49:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/293 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 132 constraints, problems are : Problem set: 0 solved, 171 unsolved in 13994 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/293 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 171/303 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 306 constraints, problems are : Problem set: 0 solved, 171 unsolved in 23075 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37110ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 37112ms
Starting structural reductions in LTL mode, iteration 1 : 121/176 places, 172/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37391 ms. Remains : 121/176 places, 172/238 transitions.
[2026-05-31 20:50:08] [INFO ] Flatten gal took : 17 ms
[2026-05-31 20:50:09] [INFO ] Flatten gal took : 15 ms
[2026-05-31 20:50:09] [INFO ] Input system was already deterministic with 172 transitions.
[2026-05-31 20:50:09] [INFO ] Flatten gal took : 14 ms
[2026-05-31 20:50:09] [INFO ] Flatten gal took : 14 ms
[2026-05-31 20:50:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12664059770715128095.gal : 7 ms
[2026-05-31 20:50:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3949093056875609069.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/CTLFireability12664059770715128095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3949093056875609069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EX((AG((((p114==0)||(p129==0))||(p171==0))) * (EF(((p187==1)||(p135==1))) + (((p12==1)&&(p31==1))&&((p85==1)&&(p134==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(E(TRUE U !((((p114==0)||(p129==0))||(p171==0))))) * (E(TRUE U ((p187==1)||(p135==1))...218
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t17, t25, t70, t73, t80, t86, t89, t92, t93, t96, t118, t119, t120, t121, t126, t127...269
(forward)formula 0,0,8.38967,204964,1,0,313,1.39393e+06,368,183,4357,820789,438
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 139 transition count 201
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 139 transition count 201
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 126 transition count 184
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 126 transition count 184
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 121 transition count 169
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 111 place count 120 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 114 place count 117 transition count 163
Iterating global reduction 0 with 3 rules applied. Total rules applied 117 place count 117 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 116 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 116 transition count 161
Applied a total of 119 rules in 24 ms. Remains 116 /176 variables (removed 60) and now considering 161/238 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6608333364868709704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12101876813008413312.kers'
[2026-05-31 20:50:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6608333364868709704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12101876813008413312.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 116 cols 486 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-31 20:50:17] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12101876813008413312.kers
Total runtime 2 ms.
[2026-05-31 20:50:17] [INFO ] Implicit Places using invariants in 135 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/176 places, 161/238 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 115/176 places, 161/238 transitions.
[2026-05-31 20:50:17] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:50:17] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:50:17] [INFO ] Input system was already deterministic with 161 transitions.
[2026-05-31 20:50:17] [INFO ] Flatten gal took : 17 ms
[2026-05-31 20:50:17] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:50:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1571627563041702173.gal : 3 ms
[2026-05-31 20:50:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2563211388472327346.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/CTLFireability1571627563041702173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2563211388472327346.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.56667e+07,0.26347,8860,2,1941,5,21713,6,0,623,19926,0


Converting to forward existential form...Done !
original formula: E(AX(EF(AX((p135!=1)))) U !(((AG((p181!=1)) + !(((EF((p122==1)) * E((p159==1) U (((p103==1)&&(p137==1))&&(p163==1)))) * EG((p98==1))))) +...180
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,!(EX(!(E(TRUE U !(EX(!((p135!=1))))))))) * !(((p181==1)||(p56==1)))) * !(!(((E(TRUE U (p122==...263
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t15, t23, t27, t34, t41, t52, t57, t60, t71, t81, t84, t91, t93, t94, t96, t112, t113...263
(forward)formula 0,0,4.17311,92772,1,0,309,566574,357,158,4140,397115,415
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Graph (trivial) has 135 edges and 176 vertex of which 6 / 176 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 172 transition count 188
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 99 place count 126 transition count 182
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 124 transition count 178
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 112 place count 120 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 119 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 113 place count 119 transition count 163
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 137 place count 107 transition count 163
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 164 place count 80 transition count 136
Iterating global reduction 5 with 27 rules applied. Total rules applied 191 place count 80 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 80 transition count 133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 194 place count 80 transition count 130
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 200 place count 77 transition count 130
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 207 place count 70 transition count 103
Ensure Unique test removed 2 places
Iterating global reduction 6 with 9 rules applied. Total rules applied 216 place count 68 transition count 103
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 220 place count 64 transition count 87
Iterating global reduction 6 with 4 rules applied. Total rules applied 224 place count 64 transition count 87
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 226 place count 62 transition count 83
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 62 transition count 83
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 252 place count 50 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 255 place count 50 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 49 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 258 place count 48 transition count 66
Applied a total of 258 rules in 68 ms. Remains 48 /176 variables (removed 128) and now considering 66/238 (removed 172) transitions.
[2026-05-31 20:50:22] [INFO ] Flow matrix only has 64 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-13022902320684982531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7300335512256368411.kers'
[2026-05-31 20:50:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13022902320684982531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7300335512256368411.kers]
Normalized transition count is 63 out of 64 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 63 rows 48 cols 205 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-31 20:50:22] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7300335512256368411.kers
Total runtime 1 ms.
[2026-05-31 20:50:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-31 20:50:22] [INFO ] Flow matrix only has 64 transitions (discarded 2 similar events)
[2026-05-31 20:50:22] [INFO ] Invariant cache hit.
[2026-05-31 20:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 20:50:22] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-31 20:50:22] [INFO ] Redundant transitions in 2 ms returned []
Running 56 sub problems to find dead transitions.
[2026-05-31 20:50:22] [INFO ] Flow matrix only has 64 transitions (discarded 2 similar events)
[2026-05-31 20:50:22] [INFO ] Invariant cache hit.
[2026-05-31 20:50:22] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 5/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 63/111 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 59 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 5/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 63/111 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 56/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/112 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 115 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2831 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5283ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 5284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/176 places, 66/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5518 ms. Remains : 48/176 places, 66/238 transitions.
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:50:27] [INFO ] Input system was already deterministic with 66 transitions.
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:50:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16572104205755475046.gal : 0 ms
[2026-05-31 20:50:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2749502560058342725.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/CTLFireability16572104205755475046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2749502560058342725.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,366480,0.020494,4336,2,262,5,1850,6,0,256,1413,0


Converting to forward existential form...Done !
original formula: AG(((A(((p166==1)&&(p132==1)) U (((p24==1)&&(p59==1))&&((p67==1)&&(p79==1)))) + AG((p153==1))) + A((p61==1) U !((((p103==1)&&(p148==1))&&...169
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!((E(!(!((((p103==1)&&(p148==1))&&(p182==1)))) U (!((p61==1)) * !(!((((p103==1)&&(p...458
Reverse transition relation is NOT exact ! Due to transitions t17, t44, t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,0.108561,7372,1,0,113,17799,168,64,1780,13224,167
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 139 transition count 201
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 139 transition count 201
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 88 place count 125 transition count 183
Iterating global reduction 0 with 14 rules applied. Total rules applied 102 place count 125 transition count 183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 119 transition count 172
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 115 place count 118 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 119 place count 114 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 123 place count 114 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 126 place count 111 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 129 place count 111 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 132 place count 108 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 135 place count 108 transition count 143
Applied a total of 135 rules in 21 ms. Remains 108 /176 variables (removed 68) and now considering 143/238 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17742512998345353195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8613067108920678901.kers'
[2026-05-31 20:50:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17742512998345353195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8613067108920678901.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 108 cols 404 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-05-31 20:50:27] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8613067108920678901.kers
Total runtime 1 ms.
[2026-05-31 20:50:27] [INFO ] Implicit Places using invariants in 91 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/176 places, 143/238 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 107/176 places, 143/238 transitions.
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:50:27] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:50:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:50:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16267160737194185951.gal : 2 ms
[2026-05-31 20:50:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2685689215915896462.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/CTLFireability16267160737194185951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2685689215915896462.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(E(AX(AX(!((((p20==1)&&(p39==1))&&((p79==1)&&(p186==1)))))) U EF(EG(A((p127==1) U (p153==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(EY(Init),!(EX(!(!(EX(!(!((((p20==1)&&(p39==1))&&((p79==1)&&(p186==1))))))))))),TRUE),!((E(!((p15...226
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t16, t24, t66, t69, t76, t82, t86, t88, t90, t92, t94, t95, t96, t98, t99, t100, t11...282
(forward)formula 0,1,6.1535,156428,1,0,493,693042,323,317,3698,1.03772e+06,620
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-04 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 : 176/176 places, 238/238 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 140 transition count 202
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 140 transition count 202
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 86 place count 126 transition count 184
Iterating global reduction 0 with 14 rules applied. Total rules applied 100 place count 126 transition count 184
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 120 transition count 168
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 120 transition count 168
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 115 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 115 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 112 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 112 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 109 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 109 transition count 139
Applied a total of 134 rules in 12 ms. Remains 109 /176 variables (removed 67) and now considering 139/238 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17416870863795183654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12283008179351881889.kers'
[2026-05-31 20:50:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17416870863795183654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12283008179351881889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 109 cols 385 entries
Finished phase 1 with 97 SingleSign rule and 2 generalized
[2026-05-31 20:50:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12283008179351881889.kers
Total runtime 1 ms.
[2026-05-31 20:50:34] [INFO ] Implicit Places using invariants in 93 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/176 places, 139/238 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 108/176 places, 139/238 transitions.
[2026-05-31 20:50:34] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:50:34] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:50:34] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-31 20:50:34] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:50:34] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:50:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8397123179878960721.gal : 1 ms
[2026-05-31 20:50:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17123468884828284144.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/CTLFireability8397123179878960721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17123468884828284144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((EX(AG((((((p57==1)&&(p79==1))&&(p118==1))||(p64==1)) * EG((p80==1))))) * (AG((EF((p98==1)) * AX((p17==1)))) + AF((p45==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EX(!(E(TRUE U !((((((p57==1)&&(p79==1))&&(p118==1))||(p64==1)) * EG((p80==1)))))))) * !(E(...359
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t25, t65, t67, t69, t76, t85, t87, t89, t90, t92, t110, t111, t112, t117, Int...251
(forward)formula 0,0,1.5857,37600,1,0,505,189742,315,230,3550,206987,664
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 144 transition count 206
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 144 transition count 206
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 133 transition count 193
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 133 transition count 193
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 130 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 130 transition count 189
Applied a total of 92 rules in 8 ms. Remains 130 /176 variables (removed 46) and now considering 189/238 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2663588268724520774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2108678018283711102.kers'
[2026-05-31 20:50:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2663588268724520774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2108678018283711102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 130 cols 653 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-05-31 20:50:35] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2108678018283711102.kers
Total runtime 1 ms.
[2026-05-31 20:50:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-31 20:50:35] [INFO ] Invariant cache hit.
[2026-05-31 20:50:36] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-31 20:50:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 189/319 variables, 130/143 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 143 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16553 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 189/319 variables, 130/145 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 188/333 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 340 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46621ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 46622ms
Starting structural reductions in LTL mode, iteration 1 : 130/176 places, 189/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46900 ms. Remains : 130/176 places, 189/238 transitions.
[2026-05-31 20:51:22] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:51:22] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:51:22] [INFO ] Input system was already deterministic with 189 transitions.
[2026-05-31 20:51:22] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:51:22] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:51:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15804750207808725891.gal : 3 ms
[2026-05-31 20:51:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1332667555416808734.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/CTLFireability15804750207808725891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1332667555416808734.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.31198e+08,0.571297,14244,2,3680,5,42366,6,0,711,42872,0


Converting to forward existential form...Done !
original formula: AX((EG(((AG((p173==1)) + EF((p16==1))) + ((p92==1) + (AG((p111==1)) * (((((p114==1)&&(p148==1))&&(p182==1))||(p77==1))||((p155==1)&&(p10=...334
=> equivalent forward existential formula: (((([(FwdU((FwdU((EY(Init) * !(EG(((!(E(TRUE U !((p173==1)))) + E(TRUE U (p16==1))) + ((p92==1) + (!(E(TRUE U !(...1635
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t16, t19, t27, t73, t78, t83, t85, t92, t94, t98, t101, t103, t106, t107, t108, t109...311
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.8621,365968,1,0,384,2.50735e+06,438,204,5249,1.53413e+06,500
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-06 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 : 176/176 places, 238/238 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 141 transition count 203
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 141 transition count 203
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 84 place count 127 transition count 185
Iterating global reduction 0 with 14 rules applied. Total rules applied 98 place count 127 transition count 185
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 120 transition count 168
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 113 place count 119 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 117 place count 115 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 121 place count 115 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 113 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 113 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 126 place count 112 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 127 place count 112 transition count 146
Applied a total of 127 rules in 6 ms. Remains 112 /176 variables (removed 64) and now considering 146/238 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15561131484925010954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7929140037347066999.kers'
[2026-05-31 20:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15561131484925010954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7929140037347066999.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 112 cols 396 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-31 20:51:38] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7929140037347066999.kers
Total runtime 2 ms.
[2026-05-31 20:51:38] [INFO ] Implicit Places using invariants in 70 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/176 places, 146/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 111/176 places, 146/238 transitions.
[2026-05-31 20:51:38] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:51:38] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:51:38] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-31 20:51:38] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:51:38] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:51:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10446843632691285131.gal : 1 ms
[2026-05-31 20:51:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1164700036628430444.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/CTLFireability10446843632691285131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1164700036628430444.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((EG((p151==1)) + EX(EG((p34==1)))) + (EX((EF((p44==1)) * AG((p16==1)))) + ((p159==1) * E((((p95==1)&&(p129==1))&&((p171==1)&&(p35==1)...221
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),(p151==1))] != FALSE + [FwdG(EY(FwdU(Init,TRUE)),(p34==1))] != FALSE) + ([((EY(FwdU(Init...381
Hit Full ! (commute/partial/dont) 144/0/2
(forward)formula 0,1,0.55802,14268,1,0,37,52853,19,1,2771,32252,38
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 143 transition count 205
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 143 transition count 205
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 81 place count 128 transition count 186
Iterating global reduction 0 with 15 rules applied. Total rules applied 96 place count 128 transition count 186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 121 transition count 169
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 111 place count 120 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 113 place count 118 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 118 transition count 165
Applied a total of 115 rules in 9 ms. Remains 118 /176 variables (removed 58) and now considering 165/238 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14245567167118035748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2743628563973139373.kers'
[2026-05-31 20:51:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14245567167118035748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2743628563973139373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 118 cols 494 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-31 20:51:39] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2743628563973139373.kers
Total runtime 2 ms.
[2026-05-31 20:51:39] [INFO ] Implicit Places using invariants in 104 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/176 places, 165/238 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 117/176 places, 165/238 transitions.
[2026-05-31 20:51:39] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:51:39] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:51:39] [INFO ] Input system was already deterministic with 165 transitions.
[2026-05-31 20:51:39] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:51:39] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13332416507255086683.gal : 2 ms
[2026-05-31 20:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7210309734953745589.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/CTLFireability13332416507255086683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7210309734953745589.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EF((EG(((((p51==1)||(p183==1))&&(p149==1))&&(p68==1))) + (p15==1))) U !((((((p114==1)&&(p148==1))&&(p163==1)) + !((A((p174==1) U (((p11...261
=> equivalent forward existential formula: [(EY((FwdU(Init,E(TRUE U (EG(((((p51==1)||(p183==1))&&(p149==1))&&(p68==1))) + (p15==1)))) * !(((((p114==1)&&(p1...415
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t17, t19, t27, t51, t56, t70, t73, t81, t87, t89, t90, t91, t93, t94, t95, t97, t113...281
(forward)formula 0,1,18.7909,468668,1,0,703,2.71623e+06,379,435,4155,2.63836e+06,859
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 141 transition count 203
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 141 transition count 203
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 130 transition count 192
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 130 transition count 192
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 126 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 126 transition count 186
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 122 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 122 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 119 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 119 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 117 place count 116 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 120 place count 116 transition count 155
Applied a total of 120 rules in 7 ms. Remains 116 /176 variables (removed 60) and now considering 155/238 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17743184792832899327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11496385563574862176.kers'
[2026-05-31 20:51:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17743184792832899327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11496385563574862176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 116 cols 481 entries
Finished phase 1 with 103 SingleSign rule and 3 generalized
[2026-05-31 20:51:58] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11496385563574862176.kers
Total runtime 2 ms.
[2026-05-31 20:51:58] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-31 20:51:58] [INFO ] Invariant cache hit.
[2026-05-31 20:51:58] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2026-05-31 20:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 155/271 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 129 constraints, problems are : Problem set: 0 solved, 154 unsolved in 13298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 155/271 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 154/283 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 286 constraints, problems are : Problem set: 0 solved, 154 unsolved in 21533 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 34855ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 34856ms
Starting structural reductions in LTL mode, iteration 1 : 116/176 places, 155/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35177 ms. Remains : 116/176 places, 155/238 transitions.
[2026-05-31 20:52:33] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:33] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:33] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-31 20:52:33] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:33] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1441682607778196996.gal : 1 ms
[2026-05-31 20:52:33] [INFO ] Time to serialize properties into /tmp/CTLFireability3732275336300707121.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/CTLFireability1441682607778196996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3732275336300707121.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.0656e+08,0.425267,14256,2,2814,5,43366,6,0,621,46523,0


Converting to forward existential form...Done !
original formula: (EF((AG(((((p8==0)||(p27==0))||(p85==0)) * !(E((p16==1) U (((p8==1)&&(p27==1))&&(p85==1)))))) * (AF((((p188==1)&&(p73==1))||((p119==1)&&(...196
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U (!(E(TRUE U !(((((p8==0)||(p27==0))||(p85==0)) * !(E((p16==1) U (((p8==1)&&(p27==1))&&(p...270
Reverse transition relation is NOT exact ! Due to transitions t2, t11, t12, t15, t18, t26, t30, t34, t48, t52, t66, t69, t71, t77, t83, t85, t87, t90, t92,...303
(forward)formula 0,0,7.71794,174036,1,0,328,1.10216e+06,347,166,4202,787305,415
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 139 transition count 201
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 139 transition count 201
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 126 transition count 184
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 126 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 122 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 122 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 121 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 121 transition count 173
Applied a total of 110 rules in 7 ms. Remains 121 /176 variables (removed 55) and now considering 173/238 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10681495150297084252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15076884335551885602.kers'
[2026-05-31 20:52:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10681495150297084252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15076884335551885602.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 121 cols 577 entries
Finished phase 1 with 109 SingleSign rule and 2 generalized
[2026-05-31 20:52:41] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15076884335551885602.kers
Total runtime 1 ms.
[2026-05-31 20:52:41] [INFO ] Implicit Places using invariants in 79 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/176 places, 173/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 120/176 places, 173/238 transitions.
[2026-05-31 20:52:41] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:41] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:41] [INFO ] Input system was already deterministic with 173 transitions.
[2026-05-31 20:52:41] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:41] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2999105039391228986.gal : 1 ms
[2026-05-31 20:52:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7464551764410694492.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/CTLFireability2999105039391228986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7464551764410694492.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.27917e+08,0.227277,10704,2,2780,5,29135,6,0,655,26802,0


Converting to forward existential form...Done !
original formula: EG((EF(AG(((((p102==0)||(p13==0))||((p28==0)||(p79==0)))||(p186==0)))) * (((AX(AF((p153==0))) + EX((p24==0))) + (!(A((p56==1) U (p79==1))...213
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(E(TRUE U !(((((p102==0)||(p13==0))||((p28==0)||(p79==0)))||(p186==0)))))) * (((!(EX(!(!(E...331
Reverse transition relation is NOT exact ! Due to transitions t10, t15, t18, t26, t69, t72, t79, t82, t91, t94, t96, t98, t100, t101, t104, t106, t107, t12...270
(forward)formula 0,1,17.6244,413664,1,0,490,2.8725e+06,395,253,4734,1.77982e+06,670
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 138 transition count 200
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 138 transition count 200
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 90 place count 124 transition count 182
Iterating global reduction 0 with 14 rules applied. Total rules applied 104 place count 124 transition count 182
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 118 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 118 transition count 166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 113 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 113 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 110 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 110 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 107 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 107 transition count 137
Applied a total of 138 rules in 13 ms. Remains 107 /176 variables (removed 69) and now considering 137/238 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10850259980271099222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9888710688048466745.kers'
[2026-05-31 20:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10850259980271099222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9888710688048466745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 107 cols 381 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-31 20:52:59] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9888710688048466745.kers
Total runtime 1 ms.
[2026-05-31 20:52:59] [INFO ] Implicit Places using invariants in 73 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/176 places, 137/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 106/176 places, 137/238 transitions.
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:52:59] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability581866673385077734.gal : 2 ms
[2026-05-31 20:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16227179609613417873.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/CTLFireability581866673385077734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16227179609613417873.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AG((p11==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p11==0)))] = FALSE
(forward)formula 0,0,0.093705,5688,1,0,10,6590,10,2,1069,6919,4
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Graph (trivial) has 141 edges and 176 vertex of which 6 / 176 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 172 transition count 184
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 63 rules applied. Total rules applied 114 place count 122 transition count 171
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 121 place count 117 transition count 169
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 124 place count 115 transition count 168
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 124 place count 115 transition count 155
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 150 place count 102 transition count 155
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 172 place count 80 transition count 133
Iterating global reduction 4 with 22 rules applied. Total rules applied 194 place count 80 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 194 place count 80 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 78 transition count 131
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 206 place count 70 transition count 99
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 215 place count 69 transition count 99
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 218 place count 66 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 221 place count 66 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 64 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 64 transition count 81
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 249 place count 52 transition count 69
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 252 place count 52 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 51 transition count 65
Applied a total of 253 rules in 28 ms. Remains 51 /176 variables (removed 125) and now considering 65/238 (removed 173) transitions.
[2026-05-31 20:52:59] [INFO ] Flow matrix only has 63 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-17402404113951609780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13615093905236850228.kers'
[2026-05-31 20:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17402404113951609780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13615093905236850228.kers]
Normalized transition count is 62 out of 63 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 51 cols 197 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-31 20:52:59] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13615093905236850228.kers
Total runtime 0 ms.
[2026-05-31 20:52:59] [INFO ] Implicit Places using invariants in 62 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/176 places, 65/238 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 63
Applied a total of 4 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 63/65 (removed 2) transitions.
[2026-05-31 20:52:59] [INFO ] Flow matrix only has 61 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-5309856885999532880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17591123982767489477.kers'
[2026-05-31 20:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5309856885999532880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17591123982767489477.kers]
Normalized transition count is 60 out of 61 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 48 cols 191 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-31 20:52:59] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17591123982767489477.kers
Total runtime 2 ms.
[2026-05-31 20:52:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-31 20:52:59] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
[2026-05-31 20:52:59] [INFO ] Invariant cache hit.
[2026-05-31 20:52:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:52:59] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/176 places, 63/238 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 255 ms. Remains : 48/176 places, 63/238 transitions.
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:52:59] [INFO ] Input system was already deterministic with 63 transitions.
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:52:59] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17736831889896746581.gal : 0 ms
[2026-05-31 20:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2231567142154357007.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/CTLFireability17736831889896746581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2231567142154357007.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,556380,0.028384,4300,2,117,5,1526,6,0,253,1551,0


Converting to forward existential form...Done !
original formula: (EF((p187==1)) * !(E((!(AG((p61==1))) + EG((p177==1))) U (((AG(!(((p168==1)||(p6==1)))) * (p24==1)) * ((p59==1)&&(p67==1))) * (p79==1))))...156
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p187==1))))] = FALSE * [((((FwdU(Init,(!(!(E(TRUE U !((p61==1))))) + EG((p177==1)))) * (p7...250
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t38, t50, t54, Intersection with reachable at each step enabled. (destroyed/revers...184
(forward)formula 0,1,0.439832,12336,1,0,128,41044,158,71,1732,47400,185
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Graph (trivial) has 124 edges and 176 vertex of which 4 / 176 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 173 transition count 195
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 93 place count 133 transition count 183
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 104 place count 129 transition count 176
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 112 place count 122 transition count 175
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 112 place count 122 transition count 159
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 144 place count 106 transition count 159
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 162 place count 88 transition count 141
Iterating global reduction 4 with 18 rules applied. Total rules applied 180 place count 88 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 185 place count 83 transition count 124
Ensure Unique test removed 2 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 81 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 196 place count 77 transition count 108
Iterating global reduction 4 with 4 rules applied. Total rules applied 200 place count 77 transition count 108
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 234 place count 60 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 236 place count 58 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 58 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 243 place count 58 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 57 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 56 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 247 place count 55 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 55 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 55 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 54 transition count 72
Applied a total of 250 rules in 40 ms. Remains 54 /176 variables (removed 122) and now considering 72/238 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-838194259231154832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1052415275571442240.kers'
[2026-05-31 20:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-838194259231154832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1052415275571442240.kers]
Normalized transition count is 71 out of 72 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 54 cols 202 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-31 20:53:00] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1052415275571442240.kers
Total runtime 1 ms.
[2026-05-31 20:53:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-31 20:53:00] [INFO ] Invariant cache hit.
[2026-05-31 20:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:53:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2026-05-31 20:53:00] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-31 20:53:00] [INFO ] Invariant cache hit.
[2026-05-31 20:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 5/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 71/125 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 62 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2772 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 5/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 71/125 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 65/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2629 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5409ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5410ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/176 places, 72/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5627 ms. Remains : 54/176 places, 72/238 transitions.
[2026-05-31 20:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:53:06] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-31 20:53:06] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10546036038150350980.gal : 1 ms
[2026-05-31 20:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10063064056409001828.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/CTLFireability10546036038150350980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10063064056409001828.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,588800,0.038042,4496,2,322,5,2535,5,0,287,1903,0


Converting to forward existential form...Done !
original formula: AG((((p121==1) + EF((p140==1))) + (AG((AG((p94==1)) + (p61==1))) + ((EG((p134==0)) + (AG(((p179==1)||(p121==1))) * ((p121==0)||(p35==1)))...263
=> equivalent forward existential formula: (([(FwdU((((FwdU(Init,TRUE) * !(((p121==1) + E(TRUE U (p140==1))))) * !(!(E(TRUE U !((!(E(TRUE U !((p94==1)))) +...670
Reverse transition relation is NOT exact ! Due to transitions t0, t14, t60, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,0,0.458555,13068,1,0,146,57855,186,85,1890,38133,197
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 238/238 transitions.
Graph (trivial) has 123 edges and 176 vertex of which 8 / 176 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 171 transition count 194
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 86 place count 132 transition count 187
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 130 transition count 181
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 100 place count 124 transition count 181
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 100 place count 124 transition count 171
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 120 place count 114 transition count 171
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 140 place count 94 transition count 151
Iterating global reduction 4 with 20 rules applied. Total rules applied 160 place count 94 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 94 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 161 place count 94 transition count 149
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 93 transition count 149
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 189 place count 80 transition count 136
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 79 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 79 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 79 transition count 126
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 79 transition count 126
Applied a total of 194 rules in 42 ms. Remains 79 /176 variables (removed 97) and now considering 126/238 (removed 112) transitions.
[2026-05-31 20:53:06] [INFO ] Flow matrix only has 123 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2997209301659006083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15445506561383774174.kers'
[2026-05-31 20:53:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2997209301659006083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15445506561383774174.kers]
Normalized transition count is 122 out of 123 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 79 cols 507 entries
Finished phase 1 with 66 SingleSign rule and 3 generalized
[2026-05-31 20:53:06] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15445506561383774174.kers
Total runtime 1 ms.
[2026-05-31 20:53:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-31 20:53:06] [INFO ] Flow matrix only has 123 transitions (discarded 3 similar events)
[2026-05-31 20:53:06] [INFO ] Invariant cache hit.
[2026-05-31 20:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:53:06] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-31 20:53:06] [INFO ] Redundant transitions in 6 ms returned []
Running 125 sub problems to find dead transitions.
[2026-05-31 20:53:06] [INFO ] Flow matrix only has 123 transitions (discarded 3 similar events)
[2026-05-31 20:53:06] [INFO ] Invariant cache hit.
[2026-05-31 20:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 122/201 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 1/202 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 91 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9463 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 122/201 variables, 79/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 125/215 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 1/202 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 219 constraints, problems are : Problem set: 0 solved, 125 unsolved in 24602 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 34088ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 34089ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/176 places, 126/238 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34354 ms. Remains : 79/176 places, 126/238 transitions.
[2026-05-31 20:53:40] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:53:40] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:53:40] [INFO ] Input system was already deterministic with 126 transitions.
[2026-05-31 20:53:40] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:53:40] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5430359872586918104.gal : 1 ms
[2026-05-31 20:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15790300850583586653.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/CTLFireability5430359872586918104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15790300850583586653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(((((EG((((p103==1)&&(p129==1))&&(p171==1))) * (p157==0)) * ((((p8==0)||(p27==0))||(p85==0))&&(p99==0))) + (p53==0)) + ((((EF((p130==0...583
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !((((EG((((p103==1)&&(p129==1))&&(p171==1))) * (p157==0)) * ((((p8==0)||(p27==0))||(...729
Reverse transition relation is NOT exact ! Due to transitions t32, t37, t69, t70, t73, t81, t82, t86, t92, Intersection with reachable at each step enable...206
(forward)formula 0,1,1.2282,32924,1,0,328,168935,312,195,3546,140435,449
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-31 20:53:42] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:53:42] [INFO ] Flatten gal took : 6 ms
Total runtime 365799 ms.

BK_STOP 1780260822250

--------------------
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="ErlangenMainframeV1-PT-bP02C02"
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 ErlangenMainframeV1-PT-bP02C02, 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 r338-smll-178021499100058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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