Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000282.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyB-PT-B01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 231K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-00
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-01
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-02
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-03
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-04
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-05
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-06
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-07
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-08
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-09
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-10
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-11
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-12
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-13
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-14
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779704381705

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 10:19:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:19:43] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-25 10:19:43] [INFO ] Transformed 925 places.
[2026-05-25 10:19:43] [INFO ] Transformed 1037 transitions.
[2026-05-25 10:19:43] [INFO ] Found NUPN structural information;
[2026-05-25 10:19:43] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 99 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 859 transition count 971
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 859 transition count 971
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 168 place count 823 transition count 935
Iterating global reduction 0 with 36 rules applied. Total rules applied 204 place count 823 transition count 935
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 220 place count 807 transition count 919
Iterating global reduction 0 with 16 rules applied. Total rules applied 236 place count 807 transition count 919
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 248 place count 795 transition count 907
Iterating global reduction 0 with 12 rules applied. Total rules applied 260 place count 795 transition count 907
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 270 place count 785 transition count 897
Iterating global reduction 0 with 10 rules applied. Total rules applied 280 place count 785 transition count 897
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 288 place count 777 transition count 889
Iterating global reduction 0 with 8 rules applied. Total rules applied 296 place count 777 transition count 889
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 303 place count 770 transition count 882
Iterating global reduction 0 with 7 rules applied. Total rules applied 310 place count 770 transition count 882
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 317 place count 763 transition count 875
Iterating global reduction 0 with 7 rules applied. Total rules applied 324 place count 763 transition count 875
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 329 place count 758 transition count 870
Iterating global reduction 0 with 5 rules applied. Total rules applied 334 place count 758 transition count 870
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 337 place count 755 transition count 867
Iterating global reduction 0 with 3 rules applied. Total rules applied 340 place count 755 transition count 867
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 342 place count 753 transition count 865
Iterating global reduction 0 with 2 rules applied. Total rules applied 344 place count 753 transition count 865
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 345 place count 752 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 346 place count 752 transition count 864
Applied a total of 346 rules in 625 ms. Remains 752 /925 variables (removed 173) and now considering 864/1037 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5846997923335541337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7433565143850406530.kers'
[2026-05-25 10:19:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5846997923335541337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7433565143850406530.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 864 rows 752 cols 2083 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 10:19:44] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7433565143850406530.kers
Total runtime 10 ms.
[2026-05-25 10:19:44] [INFO ] Implicit Places using invariants in 692 ms returned []
[2026-05-25 10:19:44] [INFO ] Invariant cache hit.
[2026-05-25 10:19:45] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 863 sub problems to find dead transitions.
[2026-05-25 10:19:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 863 unsolved
SMT process timed out in 30257ms, After SMT, problems are : Problem set: 0 solved, 863 unsolved
Search for dead transitions found 0 dead transitions in 30272ms
Starting structural reductions in LTL mode, iteration 1 : 752/925 places, 864/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32502 ms. Remains : 752/925 places, 864/1037 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Applied a total of 0 rules in 15 ms. Remains 752 /752 variables (removed 0) and now considering 864/864 (removed 0) transitions.
[2026-05-25 10:20:16] [INFO ] Invariant cache hit.
[2026-05-25 10:20:16] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-25 10:20:16] [INFO ] Invariant cache hit.
[2026-05-25 10:20:17] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1114 ms. Remains : 752/752 places, 864/864 transitions.
Support contains 99 out of 752 places after structural reductions.
[2026-05-25 10:20:17] [INFO ] Flatten gal took : 71 ms
[2026-05-25 10:20:17] [INFO ] Flatten gal took : 35 ms
[2026-05-25 10:20:17] [INFO ] Input system was already deterministic with 864 transitions.
RANDOM walk for 40000 steps (657 resets) in 2097 ms. (19 steps per ms) remains 43/69 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4002 steps (14 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (14 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (13 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (14 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (13 resets) in 46 ms. (85 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (15 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (17 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (14 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (15 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (14 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (15 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (12 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (14 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
[2026-05-25 10:20:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 693/752 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/752 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/1616 variables, and 10 constraints, problems are : Problem set: 1 solved, 38 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/752 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 697/752 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/752 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/752 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/1616 variables, and 15 constraints, problems are : Problem set: 1 solved, 38 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/752 constraints, PredecessorRefiner: 0/39 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10061ms problems are : Problem set: 1 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 864/864 transitions.
Graph (trivial) has 628 edges and 752 vertex of which 34 / 752 are part of one of the 7 SCC in 18 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 1024 edges and 725 vertex of which 722 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 446 rules applied. Total rules applied 448 place count 722 transition count 380
Reduce places removed 444 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 452 rules applied. Total rules applied 900 place count 278 transition count 372
Reduce places removed 4 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 46 rules applied. Total rules applied 946 place count 274 transition count 330
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 988 place count 232 transition count 330
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 988 place count 232 transition count 288
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1072 place count 190 transition count 288
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1074 place count 188 transition count 286
Iterating global reduction 4 with 2 rules applied. Total rules applied 1076 place count 188 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1077 place count 187 transition count 285
Iterating global reduction 4 with 1 rules applied. Total rules applied 1078 place count 187 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1079 place count 186 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 1080 place count 186 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1081 place count 185 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 1082 place count 185 transition count 283
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 1126 place count 163 transition count 261
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1130 place count 163 transition count 257
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1134 place count 159 transition count 248
Iterating global reduction 5 with 4 rules applied. Total rules applied 1138 place count 159 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1139 place count 159 transition count 247
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1142 place count 156 transition count 244
Iterating global reduction 6 with 3 rules applied. Total rules applied 1145 place count 156 transition count 244
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1147 place count 154 transition count 242
Iterating global reduction 6 with 2 rules applied. Total rules applied 1149 place count 154 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1150 place count 154 transition count 241
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1160 place count 149 transition count 236
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1164 place count 147 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1165 place count 147 transition count 250
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1171 place count 147 transition count 244
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1177 place count 141 transition count 244
Applied a total of 1177 rules in 154 ms. Remains 141 /752 variables (removed 611) and now considering 244/864 (removed 620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 141/752 places, 244/864 transitions.
RANDOM walk for 40000 steps (3208 resets) in 395 ms. (101 steps per ms) remains 18/38 properties
BEST_FIRST walk for 4002 steps (63 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (73 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (75 resets) in 15 ms. (250 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (65 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (65 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (69 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (74 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (78 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (65 resets) in 11 ms. (333 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (70 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (64 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (69 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (74 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (70 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (67 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (76 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (79 resets) in 10 ms. (364 steps per ms) remains 12/16 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14144988362906896066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2645993536865597354.kers'
[2026-05-25 10:20:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14144988362906896066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2645993536865597354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 141 cols 847 entries
Finished phase 1 with 138 SingleSign rule and 0 generalized
[2026-05-25 10:20:29] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2645993536865597354.kers
Total runtime 1 ms.
[2026-05-25 10:20:29] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 206/297 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 61/358 variables, 33/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 19/377 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 5/382 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 3/385 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/385 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 176 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 206/297 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 61/358 variables, 33/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 19/377 variables, 12/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 5/382 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 3/385 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/385 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 189 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3448ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 656 steps, including 33 resets, run visited all 1 properties in 2 ms. (steps per millisecond=328 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 351 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 10:20:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 10:20:32] [INFO ] Flatten gal took : 25 ms
FORMULA MedleyB-PT-B01-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:20:32] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:20:33] [INFO ] Input system was already deterministic with 864 transitions.
Support contains 89 out of 752 places (down from 94) after GAL structural reductions.
Computed a total of 138 stabilizing places and 144 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 729 transition count 841
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 64 place count 711 transition count 823
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 711 transition count 823
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 97 place count 696 transition count 808
Iterating global reduction 0 with 15 rules applied. Total rules applied 112 place count 696 transition count 808
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 125 place count 683 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 138 place count 683 transition count 795
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 150 place count 671 transition count 783
Iterating global reduction 0 with 12 rules applied. Total rules applied 162 place count 671 transition count 783
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 173 place count 660 transition count 772
Iterating global reduction 0 with 11 rules applied. Total rules applied 184 place count 660 transition count 772
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 195 place count 649 transition count 761
Iterating global reduction 0 with 11 rules applied. Total rules applied 206 place count 649 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 207 place count 649 transition count 760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 216 place count 640 transition count 751
Iterating global reduction 1 with 9 rules applied. Total rules applied 225 place count 640 transition count 751
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 232 place count 633 transition count 744
Iterating global reduction 1 with 7 rules applied. Total rules applied 239 place count 633 transition count 744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 240 place count 633 transition count 743
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 245 place count 628 transition count 738
Iterating global reduction 2 with 5 rules applied. Total rules applied 250 place count 628 transition count 738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 628 transition count 737
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 255 place count 624 transition count 733
Iterating global reduction 3 with 4 rules applied. Total rules applied 259 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 262 place count 621 transition count 730
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 267 place count 619 transition count 728
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 271 place count 617 transition count 726
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 275 place count 615 transition count 724
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 615 transition count 724
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 279 place count 613 transition count 722
Iterating global reduction 3 with 2 rules applied. Total rules applied 281 place count 613 transition count 722
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 611 transition count 720
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 611 transition count 720
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 287 place count 609 transition count 718
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 609 transition count 718
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 291 place count 607 transition count 716
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 607 transition count 716
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 295 place count 605 transition count 714
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 605 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 298 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 299 place count 604 transition count 712
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 301 place count 603 transition count 711
Iterating global reduction 4 with 1 rules applied. Total rules applied 302 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 603 transition count 710
Applied a total of 303 rules in 374 ms. Remains 603 /752 variables (removed 149) and now considering 710/864 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2395530199620303630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10007942174773820368.kers'
[2026-05-25 10:20:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2395530199620303630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10007942174773820368.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 710 rows 603 cols 1759 entries
Finished phase 1 with 599 SingleSign rule and 0 generalized
[2026-05-25 10:20:33] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10007942174773820368.kers
Total runtime 5 ms.
[2026-05-25 10:20:33] [INFO ] Implicit Places using invariants in 291 ms returned []
[2026-05-25 10:20:33] [INFO ] Invariant cache hit.
[2026-05-25 10:20:34] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Running 709 sub problems to find dead transitions.
[2026-05-25 10:20:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 30168ms
Starting structural reductions in LTL mode, iteration 1 : 603/752 places, 710/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31474 ms. Remains : 603/752 places, 710/864 transitions.
[2026-05-25 10:21:04] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:21:04] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:21:04] [INFO ] Input system was already deterministic with 710 transitions.
[2026-05-25 10:21:04] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:21:04] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:21:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9974265128091973888.gal : 18 ms
[2026-05-25 10:21:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9987498305796967180.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/CTLFireability9974265128091973888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9987498305796967180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AF(((p529==1)&&(p923==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((p529==1)&&(p923==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t148, t149, t150, t203, t206, t240, t250, t265, t274, t327, t328, t329, t...392
Detected timeout of ITS tools.
[2026-05-25 10:21:34] [INFO ] Flatten gal took : 62 ms
[2026-05-25 10:21:34] [INFO ] Applying decomposition
[2026-05-25 10:21:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14944588319660249892.txt' '-o' '/tmp/graph14944588319660249892.bin' '-w' '/tmp/graph14944588319660249892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14944588319660249892.bin' '-l' '-1' '-v' '-w' '/tmp/graph14944588319660249892.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:21:35] [INFO ] Decomposing Gal with order
[2026-05-25 10:21:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:21:35] [INFO ] Removed a total of 388 redundant transitions.
[2026-05-25 10:21:35] [INFO ] Flatten gal took : 137 ms
[2026-05-25 10:21:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 25 ms.
[2026-05-25 10:21:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3887921838763560692.gal : 17 ms
[2026-05-25 10:21:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7117348346867509430.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/CTLFireability3887921838763560692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7117348346867509430.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.75351e+07,0.199408,12368,1045,20,15238,507,838,19203,63,891,0


Converting to forward existential form...Done !
original formula: EX(AF(((i28.u140.p529==1)&&(i28.u234.p923==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((i28.u140.p529==1)&&(i28.u234.p923==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t150, t274, t382, t385, t418, t572, t573, t576, t579, t584, t587, t590, t591, t594, t597, t60...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,8.39351,297092,1,0,572198,523,7254,1.05517e+06,301,1595,1119580
FORMULA MedleyB-PT-B01-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 732 transition count 844
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 732 transition count 844
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 716 transition count 828
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 716 transition count 828
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 703 transition count 815
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 703 transition count 815
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 692 transition count 804
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 692 transition count 804
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 130 place count 682 transition count 794
Iterating global reduction 0 with 10 rules applied. Total rules applied 140 place count 682 transition count 794
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 150 place count 672 transition count 784
Iterating global reduction 0 with 10 rules applied. Total rules applied 160 place count 672 transition count 784
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 170 place count 662 transition count 774
Iterating global reduction 0 with 10 rules applied. Total rules applied 180 place count 662 transition count 774
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 181 place count 662 transition count 773
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 190 place count 653 transition count 764
Iterating global reduction 1 with 9 rules applied. Total rules applied 199 place count 653 transition count 764
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 206 place count 646 transition count 757
Iterating global reduction 1 with 7 rules applied. Total rules applied 213 place count 646 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 214 place count 646 transition count 756
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 641 transition count 751
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 641 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 641 transition count 750
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 229 place count 637 transition count 746
Iterating global reduction 3 with 4 rules applied. Total rules applied 233 place count 637 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 637 transition count 745
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 237 place count 634 transition count 742
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 634 transition count 742
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 242 place count 632 transition count 740
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 632 transition count 740
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 246 place count 630 transition count 738
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 630 transition count 738
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 250 place count 628 transition count 736
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 628 transition count 736
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 626 transition count 734
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 626 transition count 734
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 624 transition count 732
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 624 transition count 732
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 262 place count 622 transition count 730
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 622 transition count 730
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 266 place count 620 transition count 728
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 620 transition count 728
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 270 place count 618 transition count 726
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 618 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 618 transition count 725
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 274 place count 617 transition count 724
Iterating global reduction 5 with 1 rules applied. Total rules applied 275 place count 617 transition count 724
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 276 place count 616 transition count 723
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 616 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 278 place count 616 transition count 722
Applied a total of 278 rules in 375 ms. Remains 616 /752 variables (removed 136) and now considering 722/864 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2922039097928653089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16304630520528388241.kers'
[2026-05-25 10:21:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2922039097928653089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16304630520528388241.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 722 rows 616 cols 1781 entries
Finished phase 1 with 612 SingleSign rule and 0 generalized
[2026-05-25 10:21:44] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16304630520528388241.kers
Total runtime 5 ms.
[2026-05-25 10:21:44] [INFO ] Implicit Places using invariants in 383 ms returned []
[2026-05-25 10:21:44] [INFO ] Invariant cache hit.
[2026-05-25 10:21:45] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2026-05-25 10:21:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (OVERLAPS) 1/616 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1338 variables, and 4 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (OVERLAPS) 1/616 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1338 variables, and 7 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 0/721 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 616/752 places, 722/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61449 ms. Remains : 616/752 places, 722/864 transitions.
[2026-05-25 10:22:45] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:22:45] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:22:45] [INFO ] Input system was already deterministic with 722 transitions.
[2026-05-25 10:22:45] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:22:45] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:22:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16310339743291174985.gal : 3 ms
[2026-05-25 10:22:45] [INFO ] Time to serialize properties into /tmp/CTLFireability68420560468080116.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/CTLFireability16310339743291174985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability68420560468080116.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,6.95633e+07,5.40009,114248,2,10647,5,332706,6,0,3188,515469,0


Converting to forward existential form...Done !
original formula: EX((EG(((AG((p575==0)) + ((p403==0)&&(p643==0))) + (p658==1))) + E((p745==1) U ((E((p773==1) U (p850==1)) * EG((p770==1))) + (p879==1))))...156
=> equivalent forward existential formula: ([FwdG(EY(Init),((!(E(TRUE U !((p575==0)))) + ((p403==0)&&(p643==0))) + (p658==1)))] != FALSE + ([FwdG((FwdU(EY(...274
Reverse transition relation is NOT exact ! Due to transitions t24, t72, t104, t106, t160, t161, t162, t215, t218, t246, t258, t285, t338, t339, t340, t393,...358
Detected timeout of ITS tools.
[2026-05-25 10:23:15] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:23:15] [INFO ] Applying decomposition
[2026-05-25 10:23:15] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1717293517152921195.txt' '-o' '/tmp/graph1717293517152921195.bin' '-w' '/tmp/graph1717293517152921195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1717293517152921195.bin' '-l' '-1' '-v' '-w' '/tmp/graph1717293517152921195.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:23:15] [INFO ] Decomposing Gal with order
[2026-05-25 10:23:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:23:15] [INFO ] Removed a total of 389 redundant transitions.
[2026-05-25 10:23:15] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:23:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2026-05-25 10:23:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12035887373631922042.gal : 7 ms
[2026-05-25 10:23:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13141164705097909909.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/CTLFireability12035887373631922042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13141164705097909909.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.95633e+07,0.804912,41152,1402,18,75553,385,974,156756,55,710,0


Converting to forward existential form...Done !
original formula: EX((EG(((AG((i8.u148.p575==0)) + ((i11.i0.i1.u111.p403==0)&&(i18.u172.p643==0))) + (i19.u178.p658==1))) + E((i22.u210.p745==1) U ((E((i23...248
=> equivalent forward existential formula: ([FwdG(EY(Init),((!(E(TRUE U !((i8.u148.p575==0)))) + ((i11.i0.i1.u111.p403==0)&&(i18.u172.p643==0))) + (i19.u17...375
Reverse transition relation is NOT exact ! Due to transitions t24, t72, t104, t162, t258, t396, t511, t567, t588, t596, t599, t602, t603, t609, i0.t564, i0...464
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,18.4292,749508,1,0,1.01185e+06,385,8227,5.98786e+06,255,1188,1676628
FORMULA MedleyB-PT-B01-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 729 transition count 841
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 710 transition count 822
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 710 transition count 822
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 100 place count 694 transition count 806
Iterating global reduction 0 with 16 rules applied. Total rules applied 116 place count 694 transition count 806
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 130 place count 680 transition count 792
Iterating global reduction 0 with 14 rules applied. Total rules applied 144 place count 680 transition count 792
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 667 transition count 779
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 667 transition count 779
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 182 place count 655 transition count 767
Iterating global reduction 0 with 12 rules applied. Total rules applied 194 place count 655 transition count 767
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 206 place count 643 transition count 755
Iterating global reduction 0 with 12 rules applied. Total rules applied 218 place count 643 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 219 place count 643 transition count 754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 229 place count 633 transition count 744
Iterating global reduction 1 with 10 rules applied. Total rules applied 239 place count 633 transition count 744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 247 place count 625 transition count 736
Iterating global reduction 1 with 8 rules applied. Total rules applied 255 place count 625 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 256 place count 625 transition count 735
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 619 transition count 729
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 619 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 619 transition count 728
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 274 place count 614 transition count 723
Iterating global reduction 3 with 5 rules applied. Total rules applied 279 place count 614 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 614 transition count 722
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 611 transition count 719
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 609 transition count 717
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 607 transition count 715
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 296 place count 605 transition count 713
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 300 place count 603 transition count 711
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 304 place count 601 transition count 709
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 308 place count 599 transition count 707
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 312 place count 597 transition count 705
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 597 transition count 705
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 316 place count 595 transition count 703
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 595 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 320 place count 594 transition count 701
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 322 place count 593 transition count 700
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 324 place count 593 transition count 699
Applied a total of 324 rules in 464 ms. Remains 593 /752 variables (removed 159) and now considering 699/864 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16804602576505229629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18151830244216207918.kers'
[2026-05-25 10:23:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16804602576505229629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18151830244216207918.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 593 cols 1733 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-25 10:23:34] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18151830244216207918.kers
Total runtime 4 ms.
[2026-05-25 10:23:34] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-25 10:23:34] [INFO ] Invariant cache hit.
[2026-05-25 10:23:35] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 10:23:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1292 variables, and 4 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1292 variables, and 7 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 593/752 places, 699/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61334 ms. Remains : 593/752 places, 699/864 transitions.
[2026-05-25 10:24:35] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:24:35] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:24:35] [INFO ] Input system was already deterministic with 699 transitions.
[2026-05-25 10:24:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:24:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:24:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7080616984031428469.gal : 3 ms
[2026-05-25 10:24:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8689335656279298395.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/CTLFireability7080616984031428469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8689335656279298395.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:25:05] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:25:05] [INFO ] Applying decomposition
[2026-05-25 10:25:05] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7240904418138458751.txt' '-o' '/tmp/graph7240904418138458751.bin' '-w' '/tmp/graph7240904418138458751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7240904418138458751.bin' '-l' '-1' '-v' '-w' '/tmp/graph7240904418138458751.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:25:05] [INFO ] Decomposing Gal with order
[2026-05-25 10:25:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:25:05] [INFO ] Removed a total of 370 redundant transitions.
[2026-05-25 10:25:05] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:25:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2026-05-25 10:25:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13494900303406189113.gal : 5 ms
[2026-05-25 10:25:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8385729495747578799.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/CTLFireability13494900303406189113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8385729495747578799.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52054e+07,0.181609,11132,949,22,12580,725,909,15118,72,1500,0


Converting to forward existential form...Done !
original formula: AG(AX(AX(EF((i24.u209.p864==0)))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * !(E(TRUE U (i24.u209.p864==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t150, t240, t411, t565, t566, t569, t572, t577, t580, t583, t584, t587, t590, t593, t594, i0....543
(forward)formula 0,1,0.716138,38940,1,0,65429,725,7002,92442,328,1500,332391
FORMULA MedleyB-PT-B01-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 732 transition count 844
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 732 transition count 844
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 56 place count 716 transition count 828
Iterating global reduction 0 with 16 rules applied. Total rules applied 72 place count 716 transition count 828
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 84 place count 704 transition count 816
Iterating global reduction 0 with 12 rules applied. Total rules applied 96 place count 704 transition count 816
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 107 place count 693 transition count 805
Iterating global reduction 0 with 11 rules applied. Total rules applied 118 place count 693 transition count 805
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 128 place count 683 transition count 795
Iterating global reduction 0 with 10 rules applied. Total rules applied 138 place count 683 transition count 795
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 148 place count 673 transition count 785
Iterating global reduction 0 with 10 rules applied. Total rules applied 158 place count 673 transition count 785
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 168 place count 663 transition count 775
Iterating global reduction 0 with 10 rules applied. Total rules applied 178 place count 663 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 179 place count 663 transition count 774
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 187 place count 655 transition count 766
Iterating global reduction 1 with 8 rules applied. Total rules applied 195 place count 655 transition count 766
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 201 place count 649 transition count 760
Iterating global reduction 1 with 6 rules applied. Total rules applied 207 place count 649 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 208 place count 649 transition count 759
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 212 place count 645 transition count 755
Iterating global reduction 2 with 4 rules applied. Total rules applied 216 place count 645 transition count 755
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 641 transition count 751
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 641 transition count 751
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 227 place count 638 transition count 748
Iterating global reduction 2 with 3 rules applied. Total rules applied 230 place count 638 transition count 748
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 232 place count 636 transition count 746
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 636 transition count 746
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 236 place count 634 transition count 744
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 634 transition count 744
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 240 place count 632 transition count 742
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 632 transition count 742
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 630 transition count 740
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 630 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 248 place count 628 transition count 738
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 628 transition count 738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 252 place count 626 transition count 736
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 626 transition count 736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 256 place count 624 transition count 734
Iterating global reduction 2 with 2 rules applied. Total rules applied 258 place count 624 transition count 734
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 260 place count 622 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 622 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 263 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 621 transition count 730
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 621 transition count 730
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 620 transition count 729
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 620 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 620 transition count 728
Applied a total of 268 rules in 403 ms. Remains 620 /752 variables (removed 132) and now considering 728/864 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-284778963093572150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1776547809561072851.kers'
[2026-05-25 10:25:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-284778963093572150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1776547809561072851.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 728 rows 620 cols 1795 entries
Finished phase 1 with 616 SingleSign rule and 0 generalized
[2026-05-25 10:25:07] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1776547809561072851.kers
Total runtime 12 ms.
[2026-05-25 10:25:07] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-05-25 10:25:07] [INFO ] Invariant cache hit.
[2026-05-25 10:25:07] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2026-05-25 10:25:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Starting structural reductions in LTL mode, iteration 1 : 620/752 places, 728/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31490 ms. Remains : 620/752 places, 728/864 transitions.
[2026-05-25 10:25:38] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:25:38] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:25:38] [INFO ] Input system was already deterministic with 728 transitions.
[2026-05-25 10:25:38] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:25:38] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6744004444788157692.gal : 5 ms
[2026-05-25 10:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17482208775297093194.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/CTLFireability6744004444788157692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17482208775297093194.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.1097e+07,5.47786,109952,2,12775,5,345530,6,0,3210,481847,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:26:08] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:26:08] [INFO ] Applying decomposition
[2026-05-25 10:26:08] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17772333339612402420.txt' '-o' '/tmp/graph17772333339612402420.bin' '-w' '/tmp/graph17772333339612402420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17772333339612402420.bin' '-l' '-1' '-v' '-w' '/tmp/graph17772333339612402420.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:26:08] [INFO ] Decomposing Gal with order
[2026-05-25 10:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:26:08] [INFO ] Removed a total of 380 redundant transitions.
[2026-05-25 10:26:08] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-25 10:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14963102014151807135.gal : 7 ms
[2026-05-25 10:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14766320162675486727.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/CTLFireability14963102014151807135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14766320162675486727.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.1097e+07,0.244392,12284,989,25,15224,594,956,18788,65,1235,0


Converting to forward existential form...Done !
original formula: E(AX(AX(AX(((i5.u50.p151==1)||(i14.u126.p496==1))))) U (!(E((i24.u220.p882==1) U AF(((i3.u33.p103==1)||(i15.u132.p507==1))))) * AX(!(A(((...231
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!(!(EX(!(!(EX(!(((i5.u50.p151==1)||(i14.u126.p496==1)))))))))))) * !(E((i24.u220.p882==1) U !(...384
Reverse transition relation is NOT exact ! Due to transitions t73, t100, t245, t263, t288, t460, t568, t571, t591, t599, t602, t605, t609, t612, t617, t618...540
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,17.8745,416320,1,0,832769,594,8328,1.49551e+06,321,2033,1414948
FORMULA MedleyB-PT-B01-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 733 transition count 845
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 733 transition count 845
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 716 transition count 828
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 716 transition count 828
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 87 place count 701 transition count 813
Iterating global reduction 0 with 15 rules applied. Total rules applied 102 place count 701 transition count 813
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 114 place count 689 transition count 801
Iterating global reduction 0 with 12 rules applied. Total rules applied 126 place count 689 transition count 801
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 137 place count 678 transition count 790
Iterating global reduction 0 with 11 rules applied. Total rules applied 148 place count 678 transition count 790
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 158 place count 668 transition count 780
Iterating global reduction 0 with 10 rules applied. Total rules applied 168 place count 668 transition count 780
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 178 place count 658 transition count 770
Iterating global reduction 0 with 10 rules applied. Total rules applied 188 place count 658 transition count 770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 189 place count 658 transition count 769
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 197 place count 650 transition count 761
Iterating global reduction 1 with 8 rules applied. Total rules applied 205 place count 650 transition count 761
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 213 place count 642 transition count 753
Iterating global reduction 1 with 8 rules applied. Total rules applied 221 place count 642 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 222 place count 642 transition count 752
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 228 place count 636 transition count 746
Iterating global reduction 2 with 6 rules applied. Total rules applied 234 place count 636 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 636 transition count 745
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 240 place count 631 transition count 740
Iterating global reduction 3 with 5 rules applied. Total rules applied 245 place count 631 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 631 transition count 739
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 628 transition count 736
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 628 transition count 736
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 626 transition count 734
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 626 transition count 734
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 624 transition count 732
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 624 transition count 732
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 262 place count 622 transition count 730
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 622 transition count 730
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 266 place count 620 transition count 728
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 620 transition count 728
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 270 place count 618 transition count 726
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 618 transition count 726
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 274 place count 616 transition count 724
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 616 transition count 724
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 278 place count 614 transition count 722
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 614 transition count 722
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 612 transition count 720
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 612 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 612 transition count 719
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 286 place count 611 transition count 718
Iterating global reduction 5 with 1 rules applied. Total rules applied 287 place count 611 transition count 718
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 288 place count 610 transition count 717
Iterating global reduction 5 with 1 rules applied. Total rules applied 289 place count 610 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 290 place count 610 transition count 716
Applied a total of 290 rules in 431 ms. Remains 610 /752 variables (removed 142) and now considering 716/864 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-881772979108383517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10186458187260175509.kers'
[2026-05-25 10:26:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-881772979108383517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10186458187260175509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 716 rows 610 cols 1767 entries
Finished phase 1 with 606 SingleSign rule and 0 generalized
[2026-05-25 10:26:26] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-10186458187260175509.kers
Total runtime 29 ms.
[2026-05-25 10:26:27] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-25 10:26:27] [INFO ] Invariant cache hit.
[2026-05-25 10:26:27] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2026-05-25 10:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 30157ms
Starting structural reductions in LTL mode, iteration 1 : 610/752 places, 716/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31466 ms. Remains : 610/752 places, 716/864 transitions.
[2026-05-25 10:26:57] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:26:57] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:26:57] [INFO ] Input system was already deterministic with 716 transitions.
[2026-05-25 10:26:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:26:58] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability959184954102443552.gal : 3 ms
[2026-05-25 10:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10257280512966707374.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/CTLFireability959184954102443552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10257280512966707374.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:27:28] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:27:28] [INFO ] Applying decomposition
[2026-05-25 10:27:28] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9293100006223675604.txt' '-o' '/tmp/graph9293100006223675604.bin' '-w' '/tmp/graph9293100006223675604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9293100006223675604.bin' '-l' '-1' '-v' '-w' '/tmp/graph9293100006223675604.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:27:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:27:28] [INFO ] Removed a total of 378 redundant transitions.
[2026-05-25 10:27:28] [INFO ] Flatten gal took : 57 ms
[2026-05-25 10:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2026-05-25 10:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7216111451860283338.gal : 17 ms
[2026-05-25 10:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11478486137840738102.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/CTLFireability7216111451860283338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11478486137840738102.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.90296e+07,1.00773,41300,1209,20,79495,548,918,142591,66,1142,0


Converting to forward existential form...Done !
original formula: ((AX(AX(EG((i23.u187.p690==0)))) * !(A(AF((EX((i19.u149.p569==1)) * AG((i20.u160.p610==1)))) U AG(((EF((i0.u27.p87==1)) + AX((i3.u183.p67...414
=> equivalent forward existential formula: (([(EY(EY(Init)) * !(EG((i23.u187.p690==0))))] = FALSE * [((Init * !(EG(!(!(E(TRUE U !(((E(TRUE U (i0.u27.p87==1...1488
Reverse transition relation is NOT exact ! Due to transitions t8, t70, t158, t159, t213, t215, t249, t271, t281, t336, t452, t507, t580, t583, t586, t591, ...456
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
(forward)formula 0,1,27.3045,718752,1,0,1.03492e+06,589,8491,4.83396e+06,342,1588,2284660
FORMULA MedleyB-PT-B01-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Graph (trivial) has 745 edges and 752 vertex of which 47 / 752 are part of one of the 9 SCC in 4 ms
Free SCC test removed 38 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 545 rules applied. Total rules applied 546 place count 713 transition count 275
Reduce places removed 545 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 553 rules applied. Total rules applied 1099 place count 168 transition count 267
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1103 place count 164 transition count 267
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 1103 place count 164 transition count 231
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1175 place count 128 transition count 231
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1189 place count 114 transition count 217
Iterating global reduction 3 with 14 rules applied. Total rules applied 1203 place count 114 transition count 217
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1203 place count 114 transition count 215
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 1207 place count 112 transition count 215
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1213 place count 106 transition count 201
Iterating global reduction 3 with 6 rules applied. Total rules applied 1219 place count 106 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1220 place count 106 transition count 200
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1223 place count 103 transition count 197
Iterating global reduction 4 with 3 rules applied. Total rules applied 1226 place count 103 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1227 place count 103 transition count 196
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1229 place count 101 transition count 194
Iterating global reduction 5 with 2 rules applied. Total rules applied 1231 place count 101 transition count 194
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1259 place count 87 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1264 place count 87 transition count 175
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1280 place count 71 transition count 133
Iterating global reduction 6 with 16 rules applied. Total rules applied 1296 place count 71 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1304 place count 71 transition count 125
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1312 place count 63 transition count 115
Iterating global reduction 7 with 8 rules applied. Total rules applied 1320 place count 63 transition count 115
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1328 place count 55 transition count 105
Iterating global reduction 7 with 8 rules applied. Total rules applied 1336 place count 55 transition count 105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1341 place count 55 transition count 100
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 8 with 2 rules applied. Total rules applied 1343 place count 54 transition count 99
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1344 place count 53 transition count 95
Iterating global reduction 8 with 1 rules applied. Total rules applied 1345 place count 53 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1346 place count 53 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1350 place count 53 transition count 90
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 9 with 8 rules applied. Total rules applied 1358 place count 49 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1359 place count 48 transition count 85
Applied a total of 1359 rules in 90 ms. Remains 48 /752 variables (removed 704) and now considering 85/864 (removed 779) transitions.
[2026-05-25 10:27:55] [INFO ] Flow matrix only has 80 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-2103833135782959553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8407875812122429705.kers'
[2026-05-25 10:27:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2103833135782959553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8407875812122429705.kers]
Normalized transition count is 79 out of 80 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 79 rows 47 cols 235 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 10:27:55] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8407875812122429705.kers
Total runtime 0 ms.
[2026-05-25 10:27:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 10:27:55] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
[2026-05-25 10:27:55] [INFO ] Invariant cache hit.
[2026-05-25 10:27:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:27:56] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2026-05-25 10:27:56] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-25 10:27:56] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
[2026-05-25 10:27:56] [INFO ] Invariant cache hit.
[2026-05-25 10:27:56] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/127 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 67 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/127 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 78/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7910ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7911ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/752 places, 85/864 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8173 ms. Remains : 48/752 places, 85/864 transitions.
[2026-05-25 10:28:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:28:03] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:28:03] [INFO ] Input system was already deterministic with 85 transitions.
[2026-05-25 10:28:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:28:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:28:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15077194213078823105.gal : 1 ms
[2026-05-25 10:28:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8861101490506573114.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/CTLFireability15077194213078823105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8861101490506573114.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,4974,0.039741,5376,2,803,5,5088,6,0,270,5213,0


Converting to forward existential form...Done !
original formula: EG(EF((p617==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p617==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t10, t16, t17, t18, t33, t34, t35, t36, t51, t52, t65, t66, t67, t68, t69...280
(forward)formula 0,1,0.264833,14772,1,0,183,50264,189,76,2009,43195,191
FORMULA MedleyB-PT-B01-CTLFireability-2024-05 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 : 752/752 places, 864/864 transitions.
Graph (trivial) has 730 edges and 752 vertex of which 48 / 752 are part of one of the 9 SCC in 2 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 0 with 526 rules applied. Total rules applied 527 place count 712 transition count 292
Reduce places removed 526 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 534 rules applied. Total rules applied 1061 place count 186 transition count 284
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 1069 place count 182 transition count 280
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1073 place count 178 transition count 280
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1073 place count 178 transition count 243
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1147 place count 141 transition count 243
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1159 place count 129 transition count 231
Iterating global reduction 4 with 12 rules applied. Total rules applied 1171 place count 129 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1175 place count 125 transition count 227
Iterating global reduction 4 with 4 rules applied. Total rules applied 1179 place count 125 transition count 227
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1182 place count 122 transition count 224
Iterating global reduction 4 with 3 rules applied. Total rules applied 1185 place count 122 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1186 place count 122 transition count 223
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1188 place count 120 transition count 221
Iterating global reduction 5 with 2 rules applied. Total rules applied 1190 place count 120 transition count 221
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1222 place count 104 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1226 place count 104 transition count 201
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1240 place count 90 transition count 171
Iterating global reduction 6 with 14 rules applied. Total rules applied 1254 place count 90 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1258 place count 90 transition count 167
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1266 place count 82 transition count 156
Iterating global reduction 7 with 8 rules applied. Total rules applied 1274 place count 82 transition count 156
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1282 place count 74 transition count 145
Iterating global reduction 7 with 8 rules applied. Total rules applied 1290 place count 74 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1294 place count 74 transition count 141
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 8 with 2 rules applied. Total rules applied 1296 place count 73 transition count 140
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1297 place count 72 transition count 137
Iterating global reduction 8 with 1 rules applied. Total rules applied 1298 place count 72 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1299 place count 72 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1302 place count 72 transition count 133
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 9 with 6 rules applied. Total rules applied 1308 place count 69 transition count 130
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1311 place count 69 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1312 place count 68 transition count 129
Applied a total of 1312 rules in 75 ms. Remains 68 /752 variables (removed 684) and now considering 129/864 (removed 735) transitions.
[2026-05-25 10:28:04] [INFO ] Flow matrix only has 125 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-17290524776956622614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12216856147215830597.kers'
[2026-05-25 10:28:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17290524776956622614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12216856147215830597.kers]
Normalized transition count is 124 out of 125 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 124 rows 67 cols 416 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 10:28:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12216856147215830597.kers
Total runtime 1 ms.
[2026-05-25 10:28:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 10:28:04] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
[2026-05-25 10:28:04] [INFO ] Invariant cache hit.
[2026-05-25 10:28:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:28:04] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2026-05-25 10:28:04] [INFO ] Redundant transitions in 2 ms returned []
Running 122 sub problems to find dead transitions.
[2026-05-25 10:28:04] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
[2026-05-25 10:28:04] [INFO ] Invariant cache hit.
[2026-05-25 10:28:04] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 124/192 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 1/193 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 85 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 124/192 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 122/206 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/193 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 207 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16050ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 16050ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/752 places, 129/864 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16402 ms. Remains : 68/752 places, 129/864 transitions.
[2026-05-25 10:28:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:28:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:28:20] [INFO ] Input system was already deterministic with 129 transitions.
[2026-05-25 10:28:20] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:28:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:28:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3050629195558781550.gal : 2 ms
[2026-05-25 10:28:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10104640751493889398.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/CTLFireability3050629195558781550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10104640751493889398.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,15544,0.077845,7172,2,1203,5,10295,6,0,395,10987,0


Converting to forward existential form...Done !
original formula: AG((AG((((p48==0)||(p349==0))||(p673==0))) * (!(E((p66==1) U (p738!=1))) + (!(E((p108==1) U (p845==1))) * (EF((p849==0)) + ((p184==0)&&(p...168
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((((p48==0)||(p349==0))||(p673==0))))] = FALSE * ([(FwdU((FwdU(Init,TRUE) * !(!...336
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t15, t16, t17, t26, t28, t31, t32, t42, t55, t56, t57, t63, t65, t66, t77, t80, t81, ...308
Hit Full ! (commute/partial/dont) 127/0/2
(forward)formula 0,0,0.535227,24948,1,0,227,98209,287,119,2939,73287,281
FORMULA MedleyB-PT-B01-CTLFireability-2024-06 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 : 752/752 places, 864/864 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 731 transition count 843
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 731 transition count 843
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 714 transition count 826
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 714 transition count 826
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 91 place count 699 transition count 811
Iterating global reduction 0 with 15 rules applied. Total rules applied 106 place count 699 transition count 811
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 119 place count 686 transition count 798
Iterating global reduction 0 with 13 rules applied. Total rules applied 132 place count 686 transition count 798
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 144 place count 674 transition count 786
Iterating global reduction 0 with 12 rules applied. Total rules applied 156 place count 674 transition count 786
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 167 place count 663 transition count 775
Iterating global reduction 0 with 11 rules applied. Total rules applied 178 place count 663 transition count 775
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 188 place count 653 transition count 765
Iterating global reduction 0 with 10 rules applied. Total rules applied 198 place count 653 transition count 765
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 206 place count 645 transition count 757
Iterating global reduction 0 with 8 rules applied. Total rules applied 214 place count 645 transition count 757
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 221 place count 638 transition count 750
Iterating global reduction 0 with 7 rules applied. Total rules applied 228 place count 638 transition count 750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 229 place count 638 transition count 749
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 235 place count 632 transition count 743
Iterating global reduction 1 with 6 rules applied. Total rules applied 241 place count 632 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 242 place count 632 transition count 742
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 627 transition count 737
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 627 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 627 transition count 736
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 256 place count 624 transition count 733
Iterating global reduction 3 with 3 rules applied. Total rules applied 259 place count 624 transition count 733
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 622 transition count 731
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 622 transition count 731
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 265 place count 620 transition count 729
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 620 transition count 729
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 618 transition count 727
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 618 transition count 727
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 273 place count 616 transition count 725
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 277 place count 614 transition count 723
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 614 transition count 723
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 281 place count 612 transition count 721
Iterating global reduction 3 with 2 rules applied. Total rules applied 283 place count 612 transition count 721
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 285 place count 610 transition count 719
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 610 transition count 719
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 289 place count 608 transition count 717
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 608 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 293 place count 607 transition count 715
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 606 transition count 714
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 606 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 297 place count 606 transition count 713
Applied a total of 297 rules in 435 ms. Remains 606 /752 variables (removed 146) and now considering 713/864 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4176568969369965709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5793303726880098218.kers'
[2026-05-25 10:28:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4176568969369965709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5793303726880098218.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 713 rows 606 cols 1761 entries
Finished phase 1 with 602 SingleSign rule and 0 generalized
[2026-05-25 10:28:21] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5793303726880098218.kers
Total runtime 11 ms.
[2026-05-25 10:28:22] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-25 10:28:22] [INFO ] Invariant cache hit.
[2026-05-25 10:28:22] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2026-05-25 10:28:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
Starting structural reductions in LTL mode, iteration 1 : 606/752 places, 713/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31567 ms. Remains : 606/752 places, 713/864 transitions.
[2026-05-25 10:28:52] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:28:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:28:52] [INFO ] Input system was already deterministic with 713 transitions.
[2026-05-25 10:28:52] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:28:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:28:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14521269356212275092.gal : 5 ms
[2026-05-25 10:28:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13396052990763744526.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/CTLFireability14521269356212275092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13396052990763744526.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,6.82738e+07,4.11032,112216,2,13034,5,352006,6,0,3139,495633,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:29:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:29:23] [INFO ] Applying decomposition
[2026-05-25 10:29:23] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8521946887455534743.txt' '-o' '/tmp/graph8521946887455534743.bin' '-w' '/tmp/graph8521946887455534743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8521946887455534743.bin' '-l' '-1' '-v' '-w' '/tmp/graph8521946887455534743.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:29:23] [INFO ] Decomposing Gal with order
[2026-05-25 10:29:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:29:23] [INFO ] Removed a total of 378 redundant transitions.
[2026-05-25 10:29:23] [INFO ] Flatten gal took : 56 ms
[2026-05-25 10:29:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2026-05-25 10:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1435017967725418557.gal : 4 ms
[2026-05-25 10:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14039802993153530762.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/CTLFireability1435017967725418557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14039802993153530762.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.82738e+07,0.743299,32708,1329,20,59263,539,962,109672,70,1133,0


Converting to forward existential form...Done !
original formula: EX((AX(AX(AX((i21.u179.p663==0)))) * ((EG((i10.u81.p300==1)) + EF(((i19.u152.p568==0) * AX((i6.u54.p158==1))))) + AG((((i5.u53.p248==1)||...245
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(EX(!(!(EX(!(!(EX(!((i21.u179.p663==0))))))))))),(i10.u81.p300==1))] != FALSE + [((FwdU((EY...485
Reverse transition relation is NOT exact ! Due to transitions t8, t207, t241, t324, t380, t413, t504, t560, t576, t577, t580, t583, t588, t591, t594, t595,...522
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,2.31116,83860,1,0,156855,539,7821,298844,311,1254,622191
FORMULA MedleyB-PT-B01-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 731 transition count 843
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 731 transition count 843
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 714 transition count 826
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 714 transition count 826
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 90 place count 700 transition count 812
Iterating global reduction 0 with 14 rules applied. Total rules applied 104 place count 700 transition count 812
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 117 place count 687 transition count 799
Iterating global reduction 0 with 13 rules applied. Total rules applied 130 place count 687 transition count 799
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 142 place count 675 transition count 787
Iterating global reduction 0 with 12 rules applied. Total rules applied 154 place count 675 transition count 787
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 165 place count 664 transition count 776
Iterating global reduction 0 with 11 rules applied. Total rules applied 176 place count 664 transition count 776
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 186 place count 654 transition count 766
Iterating global reduction 0 with 10 rules applied. Total rules applied 196 place count 654 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 197 place count 654 transition count 765
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 205 place count 646 transition count 757
Iterating global reduction 1 with 8 rules applied. Total rules applied 213 place count 646 transition count 757
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 219 place count 640 transition count 751
Iterating global reduction 1 with 6 rules applied. Total rules applied 225 place count 640 transition count 751
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 230 place count 635 transition count 746
Iterating global reduction 1 with 5 rules applied. Total rules applied 235 place count 635 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 236 place count 635 transition count 745
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 240 place count 631 transition count 741
Iterating global reduction 2 with 4 rules applied. Total rules applied 244 place count 631 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 629 transition count 738
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 629 transition count 738
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 628 transition count 737
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 628 transition count 737
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 627 transition count 736
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 627 transition count 736
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 626 transition count 735
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 626 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 256 place count 625 transition count 734
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 625 transition count 734
Applied a total of 257 rules in 292 ms. Remains 625 /752 variables (removed 127) and now considering 734/864 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2005509886167265674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2856094720973891117.kers'
[2026-05-25 10:29:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2005509886167265674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2856094720973891117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 734 rows 625 cols 1809 entries
Finished phase 1 with 621 SingleSign rule and 0 generalized
[2026-05-25 10:29:25] [INFO ] Computed 4 invariants in 16 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-2856094720973891117.kers
Total runtime 17 ms.
[2026-05-25 10:29:26] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-25 10:29:26] [INFO ] Invariant cache hit.
[2026-05-25 10:29:26] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 733 sub problems to find dead transitions.
[2026-05-25 10:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1359 variables, and 4 constraints, problems are : Problem set: 0 solved, 733 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 733/733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1359 variables, and 5 constraints, problems are : Problem set: 0 solved, 733 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 0/733 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 733 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 625/752 places, 734/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61216 ms. Remains : 625/752 places, 734/864 transitions.
[2026-05-25 10:30:26] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:30:26] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:30:26] [INFO ] Input system was already deterministic with 734 transitions.
[2026-05-25 10:30:26] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:30:26] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:30:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14664907652053186096.gal : 2 ms
[2026-05-25 10:30:26] [INFO ] Time to serialize properties into /tmp/CTLFireability843125132398982408.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/CTLFireability14664907652053186096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability843125132398982408.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,7.26262e+07,3.86675,114696,2,12997,5,353637,6,0,3236,502428,0


Converting to forward existential form...Done !
original formula: A(AF((p826!=1)) U ((EX(AF((((p138==1)&&(p439==1))&&(p740==1)))) * !(A(!(E((p200==1) U ((p152==1)&&(p923==1)))) U AX((p841==1))))) * E((p7...205
=> equivalent forward existential formula: [((Init * !(EG(!(((EX(!(EG(!((((p138==1)&&(p439==1))&&(p740==1)))))) * !(!((E(!(!(EX(!((p841==1))))) U (!(!(E((p...861
Reverse transition relation is NOT exact ! Due to transitions t24, t69, t87, t88, t103, t112, t165, t166, t167, t220, t223, t257, t260, t275, t284, t337, t...404
Detected timeout of ITS tools.
[2026-05-25 10:30:56] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:30:56] [INFO ] Applying decomposition
[2026-05-25 10:30:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1130319775998227342.txt' '-o' '/tmp/graph1130319775998227342.bin' '-w' '/tmp/graph1130319775998227342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1130319775998227342.bin' '-l' '-1' '-v' '-w' '/tmp/graph1130319775998227342.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:30:57] [INFO ] Decomposing Gal with order
[2026-05-25 10:30:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:30:57] [INFO ] Removed a total of 382 redundant transitions.
[2026-05-25 10:30:57] [INFO ] Flatten gal took : 40 ms
[2026-05-25 10:30:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 19 ms.
[2026-05-25 10:30:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6987085643015659961.gal : 5 ms
[2026-05-25 10:30:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4518321549724055592.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/CTLFireability6987085643015659961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4518321549724055592.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.26262e+07,0.386039,17540,1201,24,25140,575,1025,42536,71,1345,0


Converting to forward existential form...Done !
original formula: A(AF((i25.u207.p826!=1)) U ((EX(AF((((i3.u49.p138==1)&&(i3.u128.p439==1))&&(i3.u204.p740==1)))) * !(A(!(E((i7.u60.p200==1) U ((i7.u53.p15...313
=> equivalent forward existential formula: [((Init * !(EG(!(((EX(!(EG(!((((i3.u49.p138==1)&&(i3.u128.p439==1))&&(i3.u204.p740==1)))))) * !(!((E(!(!(EX(!((i...1221
Reverse transition relation is NOT exact ! Due to transitions t24, t167, t223, t257, t339, t518, t519, t573, t575, t591, t592, t598, t601, t606, t609, t612...520
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,28.2249,608552,1,0,846645,685,8399,4.12173e+06,343,2701,1645820
FORMULA MedleyB-PT-B01-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 731 transition count 843
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 731 transition count 843
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 59 place count 714 transition count 826
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 714 transition count 826
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 90 place count 700 transition count 812
Iterating global reduction 0 with 14 rules applied. Total rules applied 104 place count 700 transition count 812
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 116 place count 688 transition count 800
Iterating global reduction 0 with 12 rules applied. Total rules applied 128 place count 688 transition count 800
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 140 place count 676 transition count 788
Iterating global reduction 0 with 12 rules applied. Total rules applied 152 place count 676 transition count 788
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 162 place count 666 transition count 778
Iterating global reduction 0 with 10 rules applied. Total rules applied 172 place count 666 transition count 778
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 182 place count 656 transition count 768
Iterating global reduction 0 with 10 rules applied. Total rules applied 192 place count 656 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 193 place count 656 transition count 767
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 201 place count 648 transition count 759
Iterating global reduction 1 with 8 rules applied. Total rules applied 209 place count 648 transition count 759
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 216 place count 641 transition count 752
Iterating global reduction 1 with 7 rules applied. Total rules applied 223 place count 641 transition count 752
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 224 place count 641 transition count 751
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 636 transition count 746
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 636 transition count 746
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 238 place count 632 transition count 742
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 632 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 632 transition count 741
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 630 transition count 739
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 630 transition count 739
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 248 place count 629 transition count 738
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 629 transition count 738
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 628 transition count 737
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 628 transition count 737
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 252 place count 627 transition count 736
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 627 transition count 736
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 626 transition count 735
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 626 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 256 place count 625 transition count 734
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 625 transition count 734
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 624 transition count 733
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 624 transition count 733
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 260 place count 623 transition count 732
Iterating global reduction 3 with 1 rules applied. Total rules applied 261 place count 623 transition count 732
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 622 transition count 731
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 621 transition count 730
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 621 transition count 730
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 620 transition count 729
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 620 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 620 transition count 728
Applied a total of 268 rules in 366 ms. Remains 620 /752 variables (removed 132) and now considering 728/864 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10562323404942591579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15000284346993912790.kers'
[2026-05-25 10:31:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10562323404942591579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15000284346993912790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 728 rows 620 cols 1797 entries
Finished phase 1 with 616 SingleSign rule and 0 generalized
[2026-05-25 10:31:25] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-15000284346993912790.kers
Total runtime 12 ms.
[2026-05-25 10:31:26] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-25 10:31:26] [INFO ] Invariant cache hit.
[2026-05-25 10:31:26] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2026-05-25 10:31:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
SMT process timed out in 30086ms, After SMT, problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 30099ms
Starting structural reductions in LTL mode, iteration 1 : 620/752 places, 728/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31338 ms. Remains : 620/752 places, 728/864 transitions.
[2026-05-25 10:31:56] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:31:56] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:31:56] [INFO ] Input system was already deterministic with 728 transitions.
[2026-05-25 10:31:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:31:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:31:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9095186533778378685.gal : 3 ms
[2026-05-25 10:31:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13442841094181210561.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/CTLFireability9095186533778378685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13442841094181210561.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.17485e+07,5.41679,109452,2,12634,5,338346,6,0,3210,476375,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:32:27] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:32:27] [INFO ] Applying decomposition
[2026-05-25 10:32:27] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9341903127183069201.txt' '-o' '/tmp/graph9341903127183069201.bin' '-w' '/tmp/graph9341903127183069201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9341903127183069201.bin' '-l' '-1' '-v' '-w' '/tmp/graph9341903127183069201.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:32:27] [INFO ] Decomposing Gal with order
[2026-05-25 10:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:32:27] [INFO ] Removed a total of 387 redundant transitions.
[2026-05-25 10:32:27] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-25 10:32:27] [INFO ] Time to serialize gal into /tmp/CTLFireability130524252774369774.gal : 5 ms
[2026-05-25 10:32:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5566259182172788916.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/CTLFireability130524252774369774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5566259182172788916.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17485e+07,0.463205,20284,1183,22,31861,415,968,54336,73,791,0


Converting to forward existential form...Done !
original formula: EF((((AX((i7.u143.p571==0)) * EF((i7.u214.p820==0))) * ((i22.u193.p724==1)&&(i15.u127.p545==1))) * ((i15.u123.p450==1)||(i1.i1.i1.u14.p46...162
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * ((i15.u123.p450==1)||(i1.i1.i1.u14.p46==0))) * ((i22.u193.p724==1)&&(i15.u127.p545==...227
Reverse transition relation is NOT exact ! Due to transitions t68, t164, t220, t287, t342, t398, t458, t569, t585, t586, t592, t595, t600, t603, t606, t607...536
(forward)formula 0,1,1.59594,58684,1,0,102738,415,7591,193148,307,791,466140
FORMULA MedleyB-PT-B01-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 729 transition count 841
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 710 transition count 822
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 710 transition count 822
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 100 place count 694 transition count 806
Iterating global reduction 0 with 16 rules applied. Total rules applied 116 place count 694 transition count 806
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 130 place count 680 transition count 792
Iterating global reduction 0 with 14 rules applied. Total rules applied 144 place count 680 transition count 792
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 667 transition count 779
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 667 transition count 779
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 182 place count 655 transition count 767
Iterating global reduction 0 with 12 rules applied. Total rules applied 194 place count 655 transition count 767
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 206 place count 643 transition count 755
Iterating global reduction 0 with 12 rules applied. Total rules applied 218 place count 643 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 219 place count 643 transition count 754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 229 place count 633 transition count 744
Iterating global reduction 1 with 10 rules applied. Total rules applied 239 place count 633 transition count 744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 247 place count 625 transition count 736
Iterating global reduction 1 with 8 rules applied. Total rules applied 255 place count 625 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 256 place count 625 transition count 735
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 619 transition count 729
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 619 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 619 transition count 728
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 274 place count 614 transition count 723
Iterating global reduction 3 with 5 rules applied. Total rules applied 279 place count 614 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 614 transition count 722
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 611 transition count 719
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 609 transition count 717
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 607 transition count 715
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 296 place count 605 transition count 713
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 300 place count 603 transition count 711
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 304 place count 601 transition count 709
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 308 place count 599 transition count 707
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 312 place count 597 transition count 705
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 597 transition count 705
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 316 place count 595 transition count 703
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 595 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 320 place count 594 transition count 701
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 322 place count 593 transition count 700
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 324 place count 593 transition count 699
Applied a total of 324 rules in 403 ms. Remains 593 /752 variables (removed 159) and now considering 699/864 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7022831264280014685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17324305111255027550.kers'
[2026-05-25 10:32:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7022831264280014685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17324305111255027550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 593 cols 1733 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-25 10:32:29] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17324305111255027550.kers
Total runtime 13 ms.
[2026-05-25 10:32:29] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-25 10:32:29] [INFO ] Invariant cache hit.
[2026-05-25 10:32:30] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 10:32:30] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 30126ms
Starting structural reductions in LTL mode, iteration 1 : 593/752 places, 699/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31352 ms. Remains : 593/752 places, 699/864 transitions.
[2026-05-25 10:33:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:33:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:33:00] [INFO ] Input system was already deterministic with 699 transitions.
[2026-05-25 10:33:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:33:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:33:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9444309174286692835.gal : 2 ms
[2026-05-25 10:33:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12503196441687663516.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/CTLFireability9444309174286692835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12503196441687663516.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((p632==1) * EX(EF((p107==1)))))
=> equivalent forward existential formula: [(FwdU(EY((FwdU(Init,TRUE) * (p632==1))),TRUE) * (p107==1))] != FALSE
(forward)formula 0,1,5.92511,109396,1,0,11,340835,10,2,6031,477839,5
FORMULA MedleyB-PT-B01-CTLFireability-2024-11 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 : 752/752 places, 864/864 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 730 transition count 842
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 730 transition count 842
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 62 place count 712 transition count 824
Iterating global reduction 0 with 18 rules applied. Total rules applied 80 place count 712 transition count 824
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 95 place count 697 transition count 809
Iterating global reduction 0 with 15 rules applied. Total rules applied 110 place count 697 transition count 809
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 123 place count 684 transition count 796
Iterating global reduction 0 with 13 rules applied. Total rules applied 136 place count 684 transition count 796
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 148 place count 672 transition count 784
Iterating global reduction 0 with 12 rules applied. Total rules applied 160 place count 672 transition count 784
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 171 place count 661 transition count 773
Iterating global reduction 0 with 11 rules applied. Total rules applied 182 place count 661 transition count 773
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 193 place count 650 transition count 762
Iterating global reduction 0 with 11 rules applied. Total rules applied 204 place count 650 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 205 place count 650 transition count 761
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 213 place count 642 transition count 753
Iterating global reduction 1 with 8 rules applied. Total rules applied 221 place count 642 transition count 753
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 227 place count 636 transition count 747
Iterating global reduction 1 with 6 rules applied. Total rules applied 233 place count 636 transition count 747
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 238 place count 631 transition count 742
Iterating global reduction 1 with 5 rules applied. Total rules applied 243 place count 631 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 244 place count 631 transition count 741
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 248 place count 627 transition count 737
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 627 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 627 transition count 736
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 625 transition count 734
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 623 transition count 732
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 621 transition count 730
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 267 place count 619 transition count 728
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 271 place count 617 transition count 726
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 275 place count 615 transition count 724
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 615 transition count 724
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 279 place count 613 transition count 722
Iterating global reduction 3 with 2 rules applied. Total rules applied 281 place count 613 transition count 722
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 611 transition count 720
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 611 transition count 720
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 287 place count 609 transition count 718
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 609 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 291 place count 608 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 293 place count 607 transition count 715
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 607 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 607 transition count 714
Applied a total of 295 rules in 337 ms. Remains 607 /752 variables (removed 145) and now considering 714/864 (removed 150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3549453983294980783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9176200844211386923.kers'
[2026-05-25 10:33:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3549453983294980783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9176200844211386923.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 714 rows 607 cols 1765 entries
Finished phase 1 with 603 SingleSign rule and 0 generalized
[2026-05-25 10:33:06] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9176200844211386923.kers
Total runtime 10 ms.
[2026-05-25 10:33:06] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-25 10:33:06] [INFO ] Invariant cache hit.
[2026-05-25 10:33:07] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2026-05-25 10:33:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1321 variables, and 11 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/607 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 713 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/607 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/607 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/1321 variables, and 20 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/607 constraints, PredecessorRefiner: 0/713 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 713 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 607/752 places, 714/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61429 ms. Remains : 607/752 places, 714/864 transitions.
[2026-05-25 10:34:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:34:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:34:07] [INFO ] Input system was already deterministic with 714 transitions.
[2026-05-25 10:34:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:34:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:34:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6459476283792802214.gal : 2 ms
[2026-05-25 10:34:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11768964492337846461.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/CTLFireability6459476283792802214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11768964492337846461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:34:37] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:34:37] [INFO ] Applying decomposition
[2026-05-25 10:34:37] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3020914463672655297.txt' '-o' '/tmp/graph3020914463672655297.bin' '-w' '/tmp/graph3020914463672655297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3020914463672655297.bin' '-l' '-1' '-v' '-w' '/tmp/graph3020914463672655297.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:34:37] [INFO ] Decomposing Gal with order
[2026-05-25 10:34:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:34:37] [INFO ] Removed a total of 388 redundant transitions.
[2026-05-25 10:34:37] [INFO ] Flatten gal took : 40 ms
[2026-05-25 10:34:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-25 10:34:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12257671970651062450.gal : 4 ms
[2026-05-25 10:34:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14551491917883393358.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/CTLFireability12257671970651062450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14551491917883393358.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.85104e+07,1.47014,59444,1336,20,107784,487,913,256977,62,962,0


Converting to forward existential form...Done !
original formula: E(AF((i13.u116.p413!=1)) U AF(((EX((i16.u141.p559==1)) * !((EF((i6.u56.p170==1)) + (i13.u115.p410==1)))) * ((!((i28.u231.p909==1)||(i24.u...193
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((i13.u116.p413!=1))))) * !(EG(!(((EX((i16.u141.p559==1)) * !((E(TRUE U (i6.u56.p170==1)) + (i...257
Reverse transition relation is NOT exact ! Due to transitions t154, t326, t382, t415, t437, t561, t577, t578, t581, t584, t589, t592, t593, t597, t600, t60...516
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,22.9076,744740,1,0,1.06174e+06,613,7947,5.02754e+06,303,1988,2351100
FORMULA MedleyB-PT-B01-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 729 transition count 841
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 710 transition count 822
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 710 transition count 822
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 100 place count 694 transition count 806
Iterating global reduction 0 with 16 rules applied. Total rules applied 116 place count 694 transition count 806
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 130 place count 680 transition count 792
Iterating global reduction 0 with 14 rules applied. Total rules applied 144 place count 680 transition count 792
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 667 transition count 779
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 667 transition count 779
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 182 place count 655 transition count 767
Iterating global reduction 0 with 12 rules applied. Total rules applied 194 place count 655 transition count 767
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 206 place count 643 transition count 755
Iterating global reduction 0 with 12 rules applied. Total rules applied 218 place count 643 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 219 place count 643 transition count 754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 229 place count 633 transition count 744
Iterating global reduction 1 with 10 rules applied. Total rules applied 239 place count 633 transition count 744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 247 place count 625 transition count 736
Iterating global reduction 1 with 8 rules applied. Total rules applied 255 place count 625 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 256 place count 625 transition count 735
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 619 transition count 729
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 619 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 619 transition count 728
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 274 place count 614 transition count 723
Iterating global reduction 3 with 5 rules applied. Total rules applied 279 place count 614 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 614 transition count 722
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 611 transition count 719
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 609 transition count 717
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 607 transition count 715
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 296 place count 605 transition count 713
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 300 place count 603 transition count 711
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 304 place count 601 transition count 709
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 308 place count 599 transition count 707
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 312 place count 597 transition count 705
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 597 transition count 705
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 316 place count 595 transition count 703
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 595 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 320 place count 594 transition count 701
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 322 place count 593 transition count 700
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 324 place count 593 transition count 699
Applied a total of 324 rules in 348 ms. Remains 593 /752 variables (removed 159) and now considering 699/864 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5325753274353153058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3867133737171692905.kers'
[2026-05-25 10:35:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5325753274353153058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3867133737171692905.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 699 rows 593 cols 1733 entries
Finished phase 1 with 589 SingleSign rule and 0 generalized
[2026-05-25 10:35:01] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3867133737171692905.kers
Total runtime 12 ms.
[2026-05-25 10:35:01] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-25 10:35:01] [INFO ] Invariant cache hit.
[2026-05-25 10:35:02] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-25 10:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1292 variables, and 4 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1292 variables, and 16 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 593/752 places, 699/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61253 ms. Remains : 593/752 places, 699/864 transitions.
[2026-05-25 10:36:02] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:36:02] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:36:02] [INFO ] Input system was already deterministic with 699 transitions.
[2026-05-25 10:36:02] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:36:02] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8155218094858772985.gal : 2 ms
[2026-05-25 10:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3412966469084371318.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/CTLFireability8155218094858772985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3412966469084371318.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AG(EF(EX((p726==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U EX((p726==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t148, t149, t150, t203, t206, t240, t243, t258, t267, t320, t321, t322, t...392
Detected timeout of ITS tools.
[2026-05-25 10:36:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:36:32] [INFO ] Applying decomposition
[2026-05-25 10:36:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2817948628496225814.txt' '-o' '/tmp/graph2817948628496225814.bin' '-w' '/tmp/graph2817948628496225814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2817948628496225814.bin' '-l' '-1' '-v' '-w' '/tmp/graph2817948628496225814.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:36:32] [INFO ] Decomposing Gal with order
[2026-05-25 10:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:36:32] [INFO ] Removed a total of 385 redundant transitions.
[2026-05-25 10:36:32] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-25 10:36:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5689985107982498435.gal : 3 ms
[2026-05-25 10:36:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9727605491822017893.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/CTLFireability5689985107982498435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9727605491822017893.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52054e+07,0.253459,13548,1113,22,17706,394,923,25901,65,741,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(EX((i22.i1.i0.u194.p726==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U EX((i22.i1.i0.u194.p726==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t206, t378, t493, t565, t566, t569, t572, t577, t580, t583, t584, t587, t590, t593, t594...483
(forward)formula 0,0,1.59059,59792,1,0,102216,417,8603,202540,302,964,461222
FORMULA MedleyB-PT-B01-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 729 transition count 841
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 710 transition count 822
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 710 transition count 822
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 100 place count 694 transition count 806
Iterating global reduction 0 with 16 rules applied. Total rules applied 116 place count 694 transition count 806
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 130 place count 680 transition count 792
Iterating global reduction 0 with 14 rules applied. Total rules applied 144 place count 680 transition count 792
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 667 transition count 779
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 667 transition count 779
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 182 place count 655 transition count 767
Iterating global reduction 0 with 12 rules applied. Total rules applied 194 place count 655 transition count 767
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 206 place count 643 transition count 755
Iterating global reduction 0 with 12 rules applied. Total rules applied 218 place count 643 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 219 place count 643 transition count 754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 229 place count 633 transition count 744
Iterating global reduction 1 with 10 rules applied. Total rules applied 239 place count 633 transition count 744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 247 place count 625 transition count 736
Iterating global reduction 1 with 8 rules applied. Total rules applied 255 place count 625 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 256 place count 625 transition count 735
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 262 place count 619 transition count 729
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 619 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 619 transition count 728
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 274 place count 614 transition count 723
Iterating global reduction 3 with 5 rules applied. Total rules applied 279 place count 614 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 614 transition count 722
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 611 transition count 719
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 609 transition count 717
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 607 transition count 715
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 296 place count 605 transition count 713
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 300 place count 603 transition count 711
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 304 place count 601 transition count 709
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 308 place count 599 transition count 707
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 312 place count 597 transition count 705
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 597 transition count 705
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 316 place count 595 transition count 703
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 595 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 595 transition count 702
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 320 place count 594 transition count 701
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 322 place count 593 transition count 700
Iterating global reduction 5 with 1 rules applied. Total rules applied 323 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 324 place count 593 transition count 699
Applied a total of 324 rules in 496 ms. Remains 593 /752 variables (removed 159) and now considering 699/864 (removed 165) transitions.
[2026-05-25 10:36:34] [INFO ] Invariant cache hit.
[2026-05-25 10:36:34] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-25 10:36:34] [INFO ] Invariant cache hit.
[2026-05-25 10:36:35] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 593/752 places, 699/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1456 ms. Remains : 593/752 places, 699/864 transitions.
[2026-05-25 10:36:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:36:35] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:36:35] [INFO ] Input system was already deterministic with 699 transitions.
[2026-05-25 10:36:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:36:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:36:35] [INFO ] Time to serialize gal into /tmp/CTLFireability5108930024733294677.gal : 2 ms
[2026-05-25 10:36:35] [INFO ] Time to serialize properties into /tmp/CTLFireability75735025983069548.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/CTLFireability5108930024733294677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability75735025983069548.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52054e+07,3.64895,109500,2,12651,5,340835,6,0,3073,477839,0


Converting to forward existential form...Done !
original formula: (AF(AX(((p281==1)&&(p923==1)))) * A(!(((EX(((p557==1)&&(p923==1))) + (p869==1)) + ((p35==1)&&(p651==1)))) U AF(AG(!(((p549==1)||((p883==1...174
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(((p281==1)&&(p923==1)))))))] = FALSE * ([FwdG((FwdU(Init,!(!(EG(!(!(E(TRUE U !(!(((p549==1)...426
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t148, t149, t150, t203, t206, t240, t243, t258, t267, t320, t321, t322, t...392
Detected timeout of ITS tools.
[2026-05-25 10:37:05] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:37:05] [INFO ] Applying decomposition
[2026-05-25 10:37:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17546252165986063694.txt' '-o' '/tmp/graph17546252165986063694.bin' '-w' '/tmp/graph17546252165986063694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17546252165986063694.bin' '-l' '-1' '-v' '-w' '/tmp/graph17546252165986063694.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:37:05] [INFO ] Decomposing Gal with order
[2026-05-25 10:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:37:05] [INFO ] Removed a total of 387 redundant transitions.
[2026-05-25 10:37:05] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 10:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6229853811096709935.gal : 3 ms
[2026-05-25 10:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8980070547205081392.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/CTLFireability6229853811096709935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8980070547205081392.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52054e+07,0.305687,16928,991,24,24000,467,965,41184,66,790,0


Converting to forward existential form...Done !
original formula: (AF(AX(((i9.u68.p281==1)&&(i28.u231.p923==1)))) * A(!(((EX(((i17.u139.p557==1)&&(i28.u231.p923==1))) + (i5.u217.p869==1)) + ((i1.u10.p35=...258
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(((i9.u68.p281==1)&&(i28.u231.p923==1)))))))] = FALSE * ([FwdG((FwdU(Init,!(!(EG(!(!(E(TRUE ...564
Reverse transition relation is NOT exact ! Due to transitions t206, t240, t267, t321, t322, t375, t378, t411, t549, t565, t566, t569, t572, t577, t580, t58...475
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,24.0683,733624,1,0,1.00398e+06,682,8418,5.09594e+06,362,2604,1940620
FORMULA MedleyB-PT-B01-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 864/864 transitions.
Graph (trivial) has 741 edges and 752 vertex of which 48 / 752 are part of one of the 9 SCC in 3 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 540 transitions
Trivial Post-agglo rules discarded 540 transitions
Performed 540 trivial Post agglomeration. Transition count delta: 540
Iterating post reduction 0 with 540 rules applied. Total rules applied 541 place count 712 transition count 278
Reduce places removed 540 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 548 rules applied. Total rules applied 1089 place count 172 transition count 270
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1095 place count 168 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1097 place count 166 transition count 268
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1097 place count 166 transition count 231
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1171 place count 129 transition count 231
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1184 place count 116 transition count 218
Iterating global reduction 4 with 13 rules applied. Total rules applied 1197 place count 116 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1197 place count 116 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1199 place count 115 transition count 217
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1205 place count 109 transition count 203
Iterating global reduction 4 with 6 rules applied. Total rules applied 1211 place count 109 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1212 place count 109 transition count 202
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1215 place count 106 transition count 199
Iterating global reduction 5 with 3 rules applied. Total rules applied 1218 place count 106 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1219 place count 106 transition count 198
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1221 place count 104 transition count 196
Iterating global reduction 6 with 2 rules applied. Total rules applied 1223 place count 104 transition count 196
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 1253 place count 89 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1258 place count 89 transition count 176
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1274 place count 73 transition count 133
Iterating global reduction 7 with 16 rules applied. Total rules applied 1290 place count 73 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1297 place count 73 transition count 126
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1306 place count 64 transition count 114
Iterating global reduction 8 with 9 rules applied. Total rules applied 1315 place count 64 transition count 114
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1324 place count 55 transition count 102
Iterating global reduction 8 with 9 rules applied. Total rules applied 1333 place count 55 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1338 place count 55 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1340 place count 54 transition count 96
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1341 place count 53 transition count 93
Iterating global reduction 9 with 1 rules applied. Total rules applied 1342 place count 53 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1343 place count 53 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1346 place count 53 transition count 89
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 10 with 6 rules applied. Total rules applied 1352 place count 50 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1353 place count 49 transition count 85
Applied a total of 1353 rules in 72 ms. Remains 49 /752 variables (removed 703) and now considering 85/864 (removed 779) transitions.
[2026-05-25 10:37:30] [INFO ] Flow matrix only has 81 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-10580727643584069657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5652454322676602619.kers'
[2026-05-25 10:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10580727643584069657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5652454322676602619.kers]
Normalized transition count is 80 out of 81 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 48 cols 236 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 10:37:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5652454322676602619.kers
Total runtime 0 ms.
[2026-05-25 10:37:30] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 10:37:30] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2026-05-25 10:37:30] [INFO ] Invariant cache hit.
[2026-05-25 10:37:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 10:37:30] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-25 10:37:30] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-25 10:37:30] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2026-05-25 10:37:30] [INFO ] Invariant cache hit.
[2026-05-25 10:37:30] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/129 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 67 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 79/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7096ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 7096ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/752 places, 85/864 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7383 ms. Remains : 49/752 places, 85/864 transitions.
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:37:37] [INFO ] Input system was already deterministic with 85 transitions.
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:37:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2052093028452551363.gal : 1 ms
[2026-05-25 10:37:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4297126180072197036.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/CTLFireability2052093028452551363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4297126180072197036.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,5654,0.030335,5316,2,755,5,5038,6,0,275,5484,0


Converting to forward existential form...Done !
original formula: EG(((p746==0)||(p598==1)))
=> equivalent forward existential formula: [FwdG(Init,((p746==0)||(p598==1)))] != FALSE
Hit Full ! (commute/partial/dont) 80/0/5
(forward)formula 0,1,0.120842,9664,1,0,22,25395,19,4,1480,22777,21
FORMULA MedleyB-PT-B01-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 10:37:37] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:37:37] [INFO ] Flatten gal took : 8 ms
Total runtime 1074369 ms.

BK_STOP 1779705457659

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r178-oct2-177969020000282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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