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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 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 105K 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 ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780371985263

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-02 03:46:27] [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-06-02 03:46:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:46:27] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2026-06-02 03:46:27] [INFO ] Transformed 219 places.
[2026-06-02 03:46:27] [INFO ] Transformed 331 transitions.
[2026-06-02 03:46:27] [INFO ] Found NUPN structural information;
[2026-06-02 03:46:27] [INFO ] Parsed PT model containing 219 places and 331 transitions and 1585 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 79 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 331/331 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 187 transition count 299
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 187 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 177 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 177 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 175 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 175 transition count 287
Applied a total of 88 rules in 68 ms. Remains 175 /219 variables (removed 44) and now considering 287/331 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15129677376911114135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-381097256708284590.kers'
[2026-06-02 03:46:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15129677376911114135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-381097256708284590.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 175 cols 1497 entries
Finished phase 1 with 158 SingleSign rule and 3 generalized
[2026-06-02 03:46:27] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-381097256708284590.kers
Total runtime 5 ms.
[2026-06-02 03:46:28] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-06-02 03:46:28] [INFO ] Invariant cache hit.
[2026-06-02 03:46:28] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-06-02 03:46:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 287/462 variables, 175/195 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 195 constraints, problems are : Problem set: 0 solved, 286 unsolved in 29001 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 287/462 variables, 175/199 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 286/485 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 492 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 59597ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 59630ms
Starting structural reductions in LTL mode, iteration 1 : 175/219 places, 287/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60602 ms. Remains : 175/219 places, 287/331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Applied a total of 0 rules in 11 ms. Remains 175 /175 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2026-06-02 03:47:28] [INFO ] Invariant cache hit.
[2026-06-02 03:47:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-06-02 03:47:28] [INFO ] Invariant cache hit.
[2026-06-02 03:47:28] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 175/175 places, 287/287 transitions.
Support contains 79 out of 175 places after structural reductions.
[2026-06-02 03:47:29] [INFO ] Flatten gal took : 126 ms
[2026-06-02 03:47:29] [INFO ] Flatten gal took : 70 ms
[2026-06-02 03:47:29] [INFO ] Input system was already deterministic with 287 transitions.
Support contains 78 out of 175 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3508 ms. (11 steps per ms) remains 32/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
[2026-06-02 03:47:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 97/139 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 12/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/175 variables, 4/14 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 287/462 variables, 175/189 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/462 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 189 constraints, problems are : Problem set: 3 solved, 25 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 100/138 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 12/150 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 25/175 variables, 4/15 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/17 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/18 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 287/462 variables, 175/193 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 25/218 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/220 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 220 constraints, problems are : Problem set: 3 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 25/28 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6078ms problems are : Problem set: 3 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 287/287 transitions.
Graph (trivial) has 123 edges and 175 vertex of which 9 / 175 are part of one of the 4 SCC in 11 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 170 transition count 233
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 54 rules applied. Total rules applied 99 place count 126 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 124 transition count 223
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 101 place count 124 transition count 213
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 121 place count 114 transition count 213
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 129 place count 106 transition count 205
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 106 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 106 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 105 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 140 place count 105 transition count 201
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 144 place count 103 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 102 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 102 transition count 192
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 5 with 34 rules applied. Total rules applied 180 place count 85 transition count 175
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 83 transition count 165
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 83 transition count 165
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 198 place count 76 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 208 place count 76 transition count 215
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 209 place count 75 transition count 211
Iterating global reduction 6 with 1 rules applied. Total rules applied 210 place count 75 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 211 place count 75 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 214 place count 75 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 220 place count 75 transition count 201
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 226 place count 69 transition count 201
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 227 place count 69 transition count 201
Applied a total of 227 rules in 205 ms. Remains 69 /175 variables (removed 106) and now considering 201/287 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 69/175 places, 201/287 transitions.
RANDOM walk for 40000 steps (8 resets) in 1203 ms. (33 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 11/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 7/10 properties
[2026-06-02 03:47:37] [INFO ] Flow matrix only has 199 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-15762556057723346542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3765917959559952058.kers'
[2026-06-02 03:47:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15762556057723346542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3765917959559952058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 69 cols 1442 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-06-02 03:47:37] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3765917959559952058.kers
Total runtime 3 ms.
[2026-06-02 03:47:37] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 17/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 23/69 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 199/268 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 24/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 109 constraints, problems are : Problem set: 0 solved, 7 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 17/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 23/69 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 199/268 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 24/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 116 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1911ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 5 properties in 2876 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 201/201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 194
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 194
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 62 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 57 transition count 190
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 50 transition count 149
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 49 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 49 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 48 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 48 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 44 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 42 transition count 123
Ensure Unique test removed 2 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 40 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 39 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 39 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 38 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 37 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 69 place count 37 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 37 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 36 transition count 110
Applied a total of 71 rules in 30 ms. Remains 36 /69 variables (removed 33) and now considering 110/201 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 36/69 places, 110/201 transitions.
RANDOM walk for 40000 steps (8 resets) in 721 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 444 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 8048 steps, run visited all 2 properties in 56 ms. (steps per millisecond=143 )
Probabilistic random walk after 8048 steps, saw 2877 distinct states, run finished after 63 ms. (steps per millisecond=127 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-06-02 03:47:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-02 03:47:42] [INFO ] Flatten gal took : 35 ms
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-02 03:47:42] [INFO ] Flatten gal took : 33 ms
[2026-06-02 03:47:42] [INFO ] Input system was already deterministic with 287 transitions.
Support contains 71 out of 175 places (down from 74) after GAL structural reductions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 238
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 238
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 68 place count 135 transition count 223
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 135 transition count 223
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 130 transition count 197
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 128 transition count 197
Applied a total of 92 rules in 10 ms. Remains 128 /175 variables (removed 47) and now considering 197/287 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13509416323281867024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3124829030675092663.kers'
[2026-06-02 03:47:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13509416323281867024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3124829030675092663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 128 cols 825 entries
Finished phase 1 with 114 SingleSign rule and 2 generalized
[2026-06-02 03:47:43] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3124829030675092663.kers
Total runtime 3 ms.
[2026-06-02 03:47:43] [INFO ] Implicit Places using invariants in 97 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/175 places, 197/287 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 127/175 places, 197/287 transitions.
[2026-06-02 03:47:43] [INFO ] Flatten gal took : 14 ms
[2026-06-02 03:47:43] [INFO ] Flatten gal took : 14 ms
[2026-06-02 03:47:43] [INFO ] Input system was already deterministic with 197 transitions.
[2026-06-02 03:47:43] [INFO ] Flatten gal took : 14 ms
[2026-06-02 03:47:43] [INFO ] Flatten gal took : 14 ms
[2026-06-02 03:47:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3770580260608000769.gal : 9 ms
[2026-06-02 03:47:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4917036761213928119.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3770580260608000769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4917036761213928119.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.48221e+09,0.851074,26080,2,6841,5,89469,6,0,707,75465,0


Converting to forward existential form...Done !
original formula: EF((EG(AF((p63==1))) * EX((AF(((((p121==1)&&(p163==1))&&(p197==1))||((((p2==1)&&(p16==1))&&((p46==1)&&(p65==1)))&&((p105==1)&&(p201==1)))...250
=> equivalent forward existential formula: [((EY((FwdU(Init,TRUE) * EG(!(EG(!((p63==1))))))) * !(EG(!(((((p121==1)&&(p163==1))&&(p197==1))||((((p2==1)&&(p1...320
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t17, t20, t28, t69, t72, t79, t85, t89, t91, t92, t96, t100, t101, t104, t105, t107,...442
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.40355,126928,1,0,666,672295,435,310,5339,573095,833
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 231
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 231
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 76 place count 129 transition count 181
Ensure Unique test removed 1 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 93 place count 128 transition count 181
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 101 place count 120 transition count 157
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 111 place count 118 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 115 place count 114 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 114 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 112 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 112 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 124 place count 111 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 111 transition count 141
Applied a total of 125 rules in 15 ms. Remains 111 /175 variables (removed 64) and now considering 141/287 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4759261789139189994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5672369587458283470.kers'
[2026-06-02 03:47:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4759261789139189994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5672369587458283470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 111 cols 392 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-06-02 03:47:48] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5672369587458283470.kers
Total runtime 1 ms.
[2026-06-02 03:47:48] [INFO ] Implicit Places using invariants in 84 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/175 places, 141/287 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 110/175 places, 141/287 transitions.
[2026-06-02 03:47:48] [INFO ] Flatten gal took : 21 ms
[2026-06-02 03:47:48] [INFO ] Flatten gal took : 15 ms
[2026-06-02 03:47:48] [INFO ] Input system was already deterministic with 141 transitions.
[2026-06-02 03:47:48] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:47:48] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:47:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14884720245679426961.gal : 6 ms
[2026-06-02 03:47:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6408463342135973065.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/CTLFireability14884720245679426961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6408463342135973065.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EG((p69==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((p69==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t66, t76, t85, t87, t88, t89, t91, t92, t94, t95, t98, t125, t126, t127, ...255
(forward)formula 0,1,1.35182,38028,1,0,346,204625,304,165,3541,165404,455
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 149 transition count 253
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 149 transition count 253
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 139 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 139 transition count 235
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 135 transition count 206
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 135 transition count 206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 133 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 133 transition count 186
Applied a total of 84 rules in 10 ms. Remains 133 /175 variables (removed 42) and now considering 186/287 (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-16736579179580352048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2173975118145328829.kers'
[2026-06-02 03:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16736579179580352048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2173975118145328829.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 133 cols 727 entries
Finished phase 1 with 117 SingleSign rule and 2 generalized
[2026-06-02 03:47:50] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2173975118145328829.kers
Total runtime 1 ms.
[2026-06-02 03:47:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-06-02 03:47:50] [INFO ] Invariant cache hit.
[2026-06-02 03:47:50] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-06-02 03:47:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/319 variables, 133/148 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 148 constraints, problems are : Problem set: 0 solved, 185 unsolved in 13864 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/319 variables, 133/148 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 185/333 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 7/340 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 343 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43923ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 43924ms
Starting structural reductions in LTL mode, iteration 1 : 133/175 places, 186/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44166 ms. Remains : 133/175 places, 186/287 transitions.
[2026-06-02 03:48:34] [INFO ] Flatten gal took : 18 ms
[2026-06-02 03:48:34] [INFO ] Flatten gal took : 17 ms
[2026-06-02 03:48:34] [INFO ] Input system was already deterministic with 186 transitions.
[2026-06-02 03:48:34] [INFO ] Flatten gal took : 17 ms
[2026-06-02 03:48:34] [INFO ] Flatten gal took : 16 ms
[2026-06-02 03:48:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15091421722572663294.gal : 5 ms
[2026-06-02 03:48:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12277960641616717578.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/CTLFireability15091421722572663294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12277960641616717578.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,1.45115e+09,0.59419,15300,2,3361,5,42501,6,0,720,48188,0


Converting to forward existential form...Done !
original formula: E(!((AX(A(!(((((p4==1)&&(p19==1))&&((p45==1)&&(p57==1)))&&(p111==1))) U (((p129==1)&&(p174==1))&&(p189==1)))) * EG(AG((p90==1))))) U (EG(...206
=> equivalent forward existential formula: ([FwdG(FwdU(Init,!((!(EX(!(!((E(!((((p129==1)&&(p174==1))&&(p189==1))) U (!(!(((((p4==1)&&(p19==1))&&((p45==1)&&...665
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t15, t18, t26, t69, t72, t79, t82, t88, t89, t90, t93, t94, t96, t98, t99, t102, t10...342
(forward)formula 0,1,12.6921,299264,1,0,385,1.95936e+06,413,197,5618,1.26193e+06,492
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Graph (trivial) has 150 edges and 175 vertex of which 9 / 175 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 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 169 transition count 225
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 69 rules applied. Total rules applied 125 place count 114 transition count 211
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 130 place count 109 transition count 211
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 130 place count 109 transition count 200
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 153 place count 97 transition count 200
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 169 place count 81 transition count 158
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 81 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 185 place count 81 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 80 transition count 157
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 193 place count 74 transition count 121
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 201 place count 72 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 71 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 71 transition count 109
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 3 with 34 rules applied. Total rules applied 237 place count 54 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 51 transition count 88
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 244 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 49 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 49 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 254 place count 48 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 260 place count 45 transition count 70
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 263 place count 45 transition count 70
Applied a total of 263 rules in 49 ms. Remains 45 /175 variables (removed 130) and now considering 70/287 (removed 217) transitions.
[2026-06-02 03:48:47] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16681901156550041717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17895216908672574100.kers'
[2026-06-02 03:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16681901156550041717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17895216908672574100.kers]
Normalized transition count is 62 out of 63 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 45 cols 341 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-06-02 03:48:47] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17895216908672574100.kers
Total runtime 1 ms.
[2026-06-02 03:48:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-02 03:48:47] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2026-06-02 03:48:47] [INFO ] Invariant cache hit.
[2026-06-02 03:48:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 03:48:47] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2026-06-02 03:48:47] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2026-06-02 03:48:47] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2026-06-02 03:48:47] [INFO ] Invariant cache hit.
[2026-06-02 03:48:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 62/107 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 58 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 45/45 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 62/107 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 69/126 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 128 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5968 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 45/45 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8316ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 8317ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/175 places, 70/287 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8510 ms. Remains : 45/175 places, 70/287 transitions.
[2026-06-02 03:48:55] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:48:55] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:48:55] [INFO ] Input system was already deterministic with 70 transitions.
[2026-06-02 03:48:55] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:48:55] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:48:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8877255410387994127.gal : 2 ms
[2026-06-02 03:48:55] [INFO ] Time to serialize properties into /tmp/CTLFireability719239993901109694.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/CTLFireability8877255410387994127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability719239993901109694.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10822e+06,0.051693,5328,2,483,5,5459,6,0,248,5245,0


Converting to forward existential form...Done !
original formula: EG(EF(((((p2==1)&&(p20==1))&&((p39==1)&&(p58==1)))&&((p105==1)&&(p201==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((p2==1)&&(p20==1))&&((p39==1)&&(p58==1)))&&((p105==1)&&(p201==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
(forward)formula 0,1,0.922348,28572,1,0,234,123163,163,151,2337,138217,255
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Graph (trivial) has 154 edges and 175 vertex of which 11 / 175 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 168 transition count 226
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 67 rules applied. Total rules applied 121 place count 115 transition count 212
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 126 place count 110 transition count 212
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 126 place count 110 transition count 202
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 147 place count 99 transition count 202
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 161 place count 85 transition count 162
Iterating global reduction 3 with 14 rules applied. Total rules applied 175 place count 85 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 175 place count 85 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 84 transition count 161
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 184 place count 77 transition count 113
Ensure Unique test removed 2 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 193 place count 75 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 72 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 72 transition count 93
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 239 place count 52 transition count 73
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 243 place count 48 transition count 66
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 48 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 252 place count 48 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 46 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 45 transition count 58
Applied a total of 257 rules in 32 ms. Remains 45 /175 variables (removed 130) and now considering 58/287 (removed 229) transitions.
[2026-06-02 03:48:56] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14466277373177777777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13626076609089265626.kers'
[2026-06-02 03:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14466277373177777777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13626076609089265626.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 43 cols 154 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-06-02 03:48:56] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13626076609089265626.kers
Total runtime 0 ms.
[2026-06-02 03:48:56] [INFO ] Implicit Places using invariants in 63 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 44/175 places, 58/287 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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 40 transition count 52
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 0 with 2 rules applied. Total rules applied 12 place count 40 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 38 transition count 50
Applied a total of 14 rules in 7 ms. Remains 38 /44 variables (removed 6) and now considering 50/58 (removed 8) transitions.
[2026-06-02 03:48:56] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11221740343103911640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2132103927100094358.kers'
[2026-06-02 03:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11221740343103911640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2132103927100094358.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 48 rows 37 cols 139 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-06-02 03:48:56] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2132103927100094358.kers
Total runtime 0 ms.
[2026-06-02 03:48:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-06-02 03:48:57] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
[2026-06-02 03:48:57] [INFO ] Invariant cache hit.
[2026-06-02 03:48:57] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/175 places, 50/287 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 246 ms. Remains : 38/175 places, 50/287 transitions.
[2026-06-02 03:48:57] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:48:57] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:48:57] [INFO ] Input system was already deterministic with 50 transitions.
[2026-06-02 03:48:57] [INFO ] Flatten gal took : 1 ms
[2026-06-02 03:48:57] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:48:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9509869789194883574.gal : 0 ms
[2026-06-02 03:48:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16453735109262360578.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/CTLFireability9509869789194883574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16453735109262360578.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,155520,0.011703,4148,2,69,5,996,5,0,203,962,0


Converting to forward existential form...Done !
original formula: AF(((p40==0) * AG(EF((p13==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p40==0) * !(E(TRUE U !(E(TRUE U (p13==0))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.021341,4540,1,0,8,2207,19,3,984,962,8
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 153 transition count 257
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 153 transition count 257
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 143 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 143 transition count 242
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 141 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 141 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 140 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 140 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 139 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 139 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 138 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 138 transition count 226
Applied a total of 74 rules in 11 ms. Remains 138 /175 variables (removed 37) and now considering 226/287 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14920780776171004959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10193442235923191943.kers'
[2026-06-02 03:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14920780776171004959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10193442235923191943.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 138 cols 1187 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-06-02 03:48:57] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10193442235923191943.kers
Total runtime 2 ms.
[2026-06-02 03:48:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-02 03:48:57] [INFO ] Invariant cache hit.
[2026-06-02 03:48:57] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2026-06-02 03:48:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/364 variables, 138/153 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 153 constraints, problems are : Problem set: 0 solved, 225 unsolved in 19853 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/364 variables, 138/153 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 225/378 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 386 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49992ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 49993ms
Starting structural reductions in LTL mode, iteration 1 : 138/175 places, 226/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50223 ms. Remains : 138/175 places, 226/287 transitions.
[2026-06-02 03:49:47] [INFO ] Flatten gal took : 18 ms
[2026-06-02 03:49:47] [INFO ] Flatten gal took : 18 ms
[2026-06-02 03:49:47] [INFO ] Input system was already deterministic with 226 transitions.
[2026-06-02 03:49:47] [INFO ] Flatten gal took : 18 ms
[2026-06-02 03:49:47] [INFO ] Flatten gal took : 16 ms
[2026-06-02 03:49:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6278944016335948920.gal : 5 ms
[2026-06-02 03:49:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3184085953386465431.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/CTLFireability6278944016335948920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3184085953386465431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.19821e+09,0.861801,22192,2,3849,5,60830,6,0,780,79316,0


Converting to forward existential form...Done !
original formula: (EF((!(A(((((p2==1)&&(p16==1))&&((p35==1)&&(p65==1)))&&((p105==1)&&(p212==1))) U ((((p2==1)&&(p16==1))&&((p46==1)&&(p54==1)))&&((p105==1)...566
=> equivalent forward existential formula: (([FwdG(((FwdU(Init,TRUE) * !(!((E(!(((((p2==1)&&(p16==1))&&((p46==1)&&(p54==1)))&&((p105==1)&&(p201==1)))) U (!...1324
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t12, t17, t20, t28, t70, t71, t76, t81, t83, t89, t91, t95, t96, t100, t104, t105...563
Hit Full ! (commute/partial/dont) 163/178/63
(forward)formula 0,1,3.25276,70580,1,0,529,350745,488,252,6915,312838,625
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 231
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 231
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 130 transition count 185
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 130 transition count 185
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 125 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 125 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 123 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 123 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 122 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 122 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 121 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 121 transition count 164
Applied a total of 108 rules in 12 ms. Remains 121 /175 variables (removed 54) and now considering 164/287 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13744542149145343525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3870433496153409885.kers'
[2026-06-02 03:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13744542149145343525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3870433496153409885.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 121 cols 643 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-06-02 03:49:50] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3870433496153409885.kers
Total runtime 2 ms.
[2026-06-02 03:49:50] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-06-02 03:49:50] [INFO ] Invariant cache hit.
[2026-06-02 03:49:51] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-06-02 03:49:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/285 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12106 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/285 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 163/298 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 304 constraints, problems are : Problem set: 0 solved, 163 unsolved in 26138 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38267ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 38268ms
Starting structural reductions in LTL mode, iteration 1 : 121/175 places, 164/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38540 ms. Remains : 121/175 places, 164/287 transitions.
[2026-06-02 03:50:29] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:50:29] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:50:29] [INFO ] Input system was already deterministic with 164 transitions.
[2026-06-02 03:50:29] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:50:29] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:50:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14400570576979232808.gal : 2 ms
[2026-06-02 03:50:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5459107935159172198.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/CTLFireability14400570576979232808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5459107935159172198.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,5.77879e+08,0.246025,10944,2,2378,5,26868,6,0,650,28221,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(((((p4==1)&&(p15==1))&&((p38==1)&&(p53==1)))&&(p111==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((((p4==1)&&(p15==1))&&((p38==1)&&(p53==1)))&&(p111==1)))))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t66, t69, t76, t87, t88, t89, t92, t95, t96, t99, t100, t101, t102, t103,...298
(forward)formula 0,0,1.83999,38496,1,0,261,198261,350,144,4813,138955,343
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-07 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 : 175/175 places, 287/287 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 150 transition count 262
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 150 transition count 262
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 141 transition count 253
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 141 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 140 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 140 transition count 252
Applied a total of 70 rules in 13 ms. Remains 140 /175 variables (removed 35) and now considering 252/287 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5287930949853464673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9660817457707173553.kers'
[2026-06-02 03:50:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5287930949853464673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9660817457707173553.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 140 cols 1427 entries
Finished phase 1 with 123 SingleSign rule and 3 generalized
[2026-06-02 03:50:31] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9660817457707173553.kers
Total runtime 3 ms.
[2026-06-02 03:50:31] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-06-02 03:50:31] [INFO ] Invariant cache hit.
[2026-06-02 03:50:31] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-06-02 03:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/392 variables, 140/154 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 154 constraints, problems are : Problem set: 0 solved, 251 unsolved in 23173 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/392 variables, 140/154 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 251/405 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 410 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53282ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 53284ms
Starting structural reductions in LTL mode, iteration 1 : 140/175 places, 252/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53685 ms. Remains : 140/175 places, 252/287 transitions.
[2026-06-02 03:51:25] [INFO ] Flatten gal took : 23 ms
[2026-06-02 03:51:25] [INFO ] Flatten gal took : 19 ms
[2026-06-02 03:51:25] [INFO ] Input system was already deterministic with 252 transitions.
[2026-06-02 03:51:25] [INFO ] Flatten gal took : 19 ms
[2026-06-02 03:51:25] [INFO ] Flatten gal took : 18 ms
[2026-06-02 03:51:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7150520304869808182.gal : 6 ms
[2026-06-02 03:51:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12096772693784876502.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/CTLFireability7150520304869808182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12096772693784876502.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.11611e+09,0.760635,21504,2,5718,5,67264,6,0,814,65225,0


Converting to forward existential form...Done !
original formula: A(E(!((((p121==1)&&(p174==1))&&(p189==1))) U !(((!(EX((p81==1))) * (((((p4==1)&&(p26==1))&&((p38==1)&&(p57==1)))&&(((p111==1)&&(p129==1))...389
=> equivalent forward existential formula: [((Init * !(EG(!(E(EX(E(TRUE U ((p202==1)||(((p121==1)&&(p163==1))&&(p197==1))))) U (p112==1)))))) * !(E(!(E(EX(...632
Reverse transition relation is NOT exact ! Due to transitions t11, t16, t19, t27, t69, t72, t79, t83, t87, t93, t94, t98, t102, t103, t106, t107, t108, t10...432
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,25.3214,547796,1,0,917,3.27849e+06,552,529,8225,2.71936e+06,1025
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-08 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 : 175/175 places, 287/287 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 231
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 231
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 76 place count 129 transition count 181
Ensure Unique test removed 1 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 93 place count 128 transition count 181
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 101 place count 120 transition count 157
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 111 place count 118 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 115 place count 114 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 114 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 121 place count 112 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 123 place count 112 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 124 place count 111 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 111 transition count 141
Applied a total of 125 rules in 13 ms. Remains 111 /175 variables (removed 64) and now considering 141/287 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18078142231109053143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15495857259065183182.kers'
[2026-06-02 03:51:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18078142231109053143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15495857259065183182.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 111 cols 392 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-06-02 03:51:50] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15495857259065183182.kers
Total runtime 1 ms.
[2026-06-02 03:51:50] [INFO ] Implicit Places using invariants in 101 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/175 places, 141/287 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 110/175 places, 141/287 transitions.
[2026-06-02 03:51:50] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:51:50] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:51:50] [INFO ] Input system was already deterministic with 141 transitions.
[2026-06-02 03:51:50] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:51:50] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:51:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17089256058081302585.gal : 2 ms
[2026-06-02 03:51:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8847298042820984390.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/CTLFireability17089256058081302585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8847298042820984390.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(AX((((p100==0)||(p105==0))||(p167==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((((p100==0)||(p105==0))||(p167==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t66, t76, t85, t87, t88, t89, t91, t92, t94, t95, t98, t125, t126, t127, ...255
(forward)formula 0,1,3.98448,100152,1,0,244,616379,304,137,3607,427538,334
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-09 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 : 175/175 places, 287/287 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 231
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 231
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 130 transition count 185
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 130 transition count 185
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 125 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 125 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 123 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 123 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 122 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 122 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 121 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 121 transition count 164
Applied a total of 108 rules in 7 ms. Remains 121 /175 variables (removed 54) and now considering 164/287 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9565124697915328478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8521956618180439937.kers'
[2026-06-02 03:51:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9565124697915328478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8521956618180439937.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 121 cols 643 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-06-02 03:51:54] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8521956618180439937.kers
Total runtime 1 ms.
[2026-06-02 03:51:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-06-02 03:51:54] [INFO ] Invariant cache hit.
[2026-06-02 03:51:55] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-06-02 03:51:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/285 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11507 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/285 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 163/298 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 304 constraints, problems are : Problem set: 0 solved, 163 unsolved in 23298 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34823ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 34824ms
Starting structural reductions in LTL mode, iteration 1 : 121/175 places, 164/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35054 ms. Remains : 121/175 places, 164/287 transitions.
[2026-06-02 03:52:29] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:52:29] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:52:29] [INFO ] Input system was already deterministic with 164 transitions.
[2026-06-02 03:52:29] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:52:29] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability394465454125497222.gal : 1 ms
[2026-06-02 03:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8928222831880456425.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/CTLFireability394465454125497222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8928222831880456425.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.77879e+08,0.269616,10888,2,2378,5,26868,6,0,650,28221,0


Converting to forward existential form...Done !
original formula: AX(AG(((((p4==0)||(p15==0))||((p38==0)||(p53==0)))||(p111==0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((((p4==0)||(p15==0))||((p38==0)||(p53==0)))||(p111==0))))] = FALSE
(forward)formula 0,0,0.4125,11560,1,0,10,28172,10,2,1366,29933,4
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 149 transition count 240
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 149 transition count 240
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 138 transition count 223
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 75 place count 137 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 78 place count 134 transition count 202
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 132 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 132 transition count 190
Applied a total of 84 rules in 6 ms. Remains 132 /175 variables (removed 43) and now considering 190/287 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3968662993351185394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2759352769755710407.kers'
[2026-06-02 03:52:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3968662993351185394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2759352769755710407.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 132 cols 715 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-06-02 03:52:30] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2759352769755710407.kers
Total runtime 2 ms.
[2026-06-02 03:52:30] [INFO ] Implicit Places using invariants in 78 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/175 places, 190/287 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 131/175 places, 190/287 transitions.
[2026-06-02 03:52:30] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:52:30] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:52:30] [INFO ] Input system was already deterministic with 190 transitions.
[2026-06-02 03:52:30] [INFO ] Flatten gal took : 16 ms
[2026-06-02 03:52:30] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:52:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2386187404994588489.gal : 1 ms
[2026-06-02 03:52:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4968816594287955175.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/CTLFireability2386187404994588489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4968816594287955175.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.84117e+09,0.963971,29364,2,7409,5,106683,6,0,716,88621,0


Converting to forward existential form...Done !
original formula: EG((E(!((EG((((p140==1)&&(p155==1))&&(p189==1))) + EF((p47==1)))) U ((((p2==1)&&(p20==1))&&((p35==1)&&(p58==1)))&&((p105==1)&&(p201==1)))...277
=> equivalent forward existential formula: [FwdG(Init,(E(!((EG((((p140==1)&&(p155==1))&&(p189==1))) + E(TRUE U (p47==1)))) U ((((p2==1)&&(p20==1))&&((p35==...377
Reverse transition relation is NOT exact ! Due to transitions t12, t17, t20, t28, t70, t73, t80, t86, t89, t92, t93, t94, t97, t99, t100, t103, t104, t107,...388
(forward)formula 0,0,22.4746,505780,1,0,505,3.26457e+06,424,286,5245,2.22776e+06,603
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 150 transition count 236
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 150 transition count 236
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 65 place count 135 transition count 187
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 81 place count 134 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 88 place count 127 transition count 164
Ensure Unique test removed 2 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 97 place count 125 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 100 place count 122 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 103 place count 122 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 104 place count 121 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 121 transition count 154
Applied a total of 105 rules in 10 ms. Remains 121 /175 variables (removed 54) and now considering 154/287 (removed 133) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1218973856072226192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16490852314438270604.kers'
[2026-06-02 03:52:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1218973856072226192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16490852314438270604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 121 cols 434 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-06-02 03:52:53] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16490852314438270604.kers
Total runtime 1 ms.
[2026-06-02 03:52:53] [INFO ] Implicit Places using invariants in 87 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/175 places, 154/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 120/175 places, 154/287 transitions.
[2026-06-02 03:52:53] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:52:53] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:52:53] [INFO ] Input system was already deterministic with 154 transitions.
[2026-06-02 03:52:53] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:52:53] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:52:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10426239686542879528.gal : 1 ms
[2026-06-02 03:52:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16360815954850893768.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/CTLFireability10426239686542879528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16360815954850893768.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,7.34484e+08,0.349957,12744,2,2941,5,39611,6,0,636,36490,0


Converting to forward existential form...Done !
original formula: AX((AG((EF(EG((p159==1))) + EX(((p106==1)&&(p73==1))))) * !(A(EX((p161==1)) U AX((p122==1))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !(EX(((p106==1)&&(p73==1))))) * !(E(TRUE U EG((p159==1)))))] = FALSE * [((EY(Init) * !...272
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t71, t73, t75, t82, t85, t91, t92, t93, t95, t96, t97, t99, t100, t102, t...284
(forward)formula 0,0,6.21591,157032,1,0,319,963897,340,165,4245,718498,418
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 149 transition count 235
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 149 transition count 235
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 135 transition count 215
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 81 place count 134 transition count 215
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 87 place count 128 transition count 191
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 95 place count 126 transition count 191
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 99 place count 122 transition count 165
Iterating global reduction 0 with 4 rules applied. Total rules applied 103 place count 122 transition count 165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 120 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 120 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 108 place count 119 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 119 transition count 161
Applied a total of 109 rules in 7 ms. Remains 119 /175 variables (removed 56) and now considering 161/287 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-221876272045639144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8557342938084262846.kers'
[2026-06-02 03:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-221876272045639144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8557342938084262846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 119 cols 530 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-06-02 03:52:59] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8557342938084262846.kers
Total runtime 1 ms.
[2026-06-02 03:52:59] [INFO ] Implicit Places using invariants in 101 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/175 places, 161/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 118/175 places, 161/287 transitions.
[2026-06-02 03:52:59] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:52:59] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:52:59] [INFO ] Input system was already deterministic with 161 transitions.
[2026-06-02 03:52:59] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:52:59] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18130168970682004215.gal : 3 ms
[2026-06-02 03:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7043062782548761937.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/CTLFireability18130168970682004215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7043062782548761937.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.31971e+08,0.513278,14320,2,4415,5,41764,6,0,635,38462,0


Converting to forward existential form...Done !
original formula: AG(((EF((p180==1)) + EX((p215==0))) + (AF((p9==0)) + ((EF((p92==0)) * !(A((p159==1) U ((((p2==1)&&(p20==1))&&((p35==1)&&(p54==1)))&&((p10...192
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((E(TRUE U (p180==1)) + EX((p215==0))))) * !(((E(TRUE U (p92==0)) * !(!((E(!(((((p2==...429
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t32, t69, t72, t74, t78, t80, t88, t91, t92, t95, t96, t99, t100, t103, t...362
(forward)formula 0,1,10.924,261476,1,0,447,1.60918e+06,366,219,4385,1.24188e+06,569
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Graph (trivial) has 157 edges and 175 vertex of which 11 / 175 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 168 transition count 223
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 70 rules applied. Total rules applied 127 place count 112 transition count 209
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 132 place count 107 transition count 209
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 132 place count 107 transition count 200
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 150 place count 98 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 163 place count 85 transition count 174
Iterating global reduction 3 with 13 rules applied. Total rules applied 176 place count 85 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 176 place count 85 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 84 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 182 place count 80 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 80 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 78 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 78 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 77 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 77 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 232 place count 57 transition count 98
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 53 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 52 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 52 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 246 place count 52 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 51 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 50 transition count 75
Applied a total of 249 rules in 36 ms. Remains 50 /175 variables (removed 125) and now considering 75/287 (removed 212) transitions.
[2026-06-02 03:53:10] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11970271146478957714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12502898459345266792.kers'
[2026-06-02 03:53:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11970271146478957714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12502898459345266792.kers]
Normalized transition count is 70 out of 71 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 70 rows 48 cols 344 entries
Finished phase 1 with 34 SingleSign rule and 2 generalized
[2026-06-02 03:53:10] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12502898459345266792.kers
Total runtime 1 ms.
[2026-06-02 03:53:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-02 03:53:10] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2026-06-02 03:53:10] [INFO ] Invariant cache hit.
[2026-06-02 03:53:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2026-06-02 03:53:11] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2026-06-02 03:53:11] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2026-06-02 03:53:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 70/120 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/121 variables, and 64 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 70/120 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/121 variables, and 123 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3372 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5747ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5748ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/175 places, 75/287 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5950 ms. Remains : 50/175 places, 75/287 transitions.
[2026-06-02 03:53:16] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:53:16] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:53:16] [INFO ] Input system was already deterministic with 75 transitions.
[2026-06-02 03:53:16] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:53:16] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:53:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13026824427616930034.gal : 1 ms
[2026-06-02 03:53:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11179872468046939149.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13026824427616930034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11179872468046939149.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 2106 steps (62 resets) in 101 ms. (20 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 287/287 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 149 transition count 240
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 149 transition count 240
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 139 transition count 210
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 139 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 137 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 137 transition count 208
Applied a total of 76 rules in 9 ms. Remains 137 /175 variables (removed 38) and now considering 208/287 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4241690179480786676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2071830987420440702.kers'
[2026-06-02 03:53:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4241690179480786676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2071830987420440702.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 137 cols 971 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-06-02 03:53:17] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2071830987420440702.kers
Total runtime 4 ms.
[2026-06-02 03:53:17] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-06-02 03:53:17] [INFO ] Invariant cache hit.
[2026-06-02 03:53:17] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-06-02 03:53:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/345 variables, 137/151 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 151 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17534 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/345 variables, 137/151 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 207/358 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 365 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47614ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 47615ms
Starting structural reductions in LTL mode, iteration 1 : 137/175 places, 208/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48039 ms. Remains : 137/175 places, 208/287 transitions.
[2026-06-02 03:54:05] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:54:05] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:54:05] [INFO ] Input system was already deterministic with 208 transitions.
[2026-06-02 03:54:05] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:54:05] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5925717603060614510.gal : 3 ms
[2026-06-02 03:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14101341079971168457.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/CTLFireability5925717603060614510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14101341079971168457.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.5237e+09,0.777609,17452,2,3431,5,47839,6,0,758,59603,0


Converting to forward existential form...Done !
original formula: AX(E(!((EX((p47!=1)) * AG((((((p2==1)&&(p20==1))&&((p39==1)&&(p58==1)))&&((p105==1)&&(p212==1)))||(((p121==1)&&(p174==1))&&(p197==1))))))...339
=> equivalent forward existential formula: [(EY(Init) * !(E(!((EX((p47!=1)) * !(E(TRUE U !((((((p2==1)&&(p20==1))&&((p39==1)&&(p58==1)))&&((p105==1)&&(p212...612
Reverse transition relation is NOT exact ! Due to transitions t11, t16, t19, t27, t68, t71, t78, t84, t88, t91, t92, t93, t94, t97, t99, t102, t103, t106, ...387
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,19.0939,410924,1,0,463,2.6343e+06,460,248,6517,1.7521e+06,607
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-02 03:54:24] [INFO ] Flatten gal took : 15 ms
[2026-06-02 03:54:24] [INFO ] Flatten gal took : 14 ms
Total runtime 477164 ms.

BK_STOP 1780372464448

--------------------
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="ErlangenMainframeV2-PT-bP03C03"
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 ErlangenMainframeV2-PT-bP03C03, 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-178021499200226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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