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-177969020000290.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-B02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K 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 359K 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-B02-CTLFireability-2024-00
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-01
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-02
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-03
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-04
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-05
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-06
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-07
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-08
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-09
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-10
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-11
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-12
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-13
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-14
FORMULA_NAME MedleyB-PT-B02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779704972036

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-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 10:29:33] [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:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:29:33] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2026-05-25 10:29:33] [INFO ] Transformed 1227 places.
[2026-05-25 10:29:33] [INFO ] Transformed 1472 transitions.
[2026-05-25 10:29:33] [INFO ] Found NUPN structural information;
[2026-05-25 10:29:33] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 124 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 1136 transition count 1381
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 1136 transition count 1381
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 235 place count 1083 transition count 1328
Iterating global reduction 0 with 53 rules applied. Total rules applied 288 place count 1083 transition count 1328
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 317 place count 1054 transition count 1299
Iterating global reduction 0 with 29 rules applied. Total rules applied 346 place count 1054 transition count 1299
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 370 place count 1030 transition count 1275
Iterating global reduction 0 with 24 rules applied. Total rules applied 394 place count 1030 transition count 1275
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 413 place count 1011 transition count 1256
Iterating global reduction 0 with 19 rules applied. Total rules applied 432 place count 1011 transition count 1256
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 449 place count 994 transition count 1239
Iterating global reduction 0 with 17 rules applied. Total rules applied 466 place count 994 transition count 1239
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 481 place count 979 transition count 1224
Iterating global reduction 0 with 15 rules applied. Total rules applied 496 place count 979 transition count 1224
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 510 place count 965 transition count 1210
Iterating global reduction 0 with 14 rules applied. Total rules applied 524 place count 965 transition count 1210
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 535 place count 954 transition count 1199
Iterating global reduction 0 with 11 rules applied. Total rules applied 546 place count 954 transition count 1199
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 553 place count 947 transition count 1192
Iterating global reduction 0 with 7 rules applied. Total rules applied 560 place count 947 transition count 1192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 561 place count 947 transition count 1191
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 564 place count 944 transition count 1188
Iterating global reduction 1 with 3 rules applied. Total rules applied 567 place count 944 transition count 1188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 568 place count 943 transition count 1187
Iterating global reduction 1 with 1 rules applied. Total rules applied 569 place count 943 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 570 place count 942 transition count 1186
Iterating global reduction 1 with 1 rules applied. Total rules applied 571 place count 942 transition count 1186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 572 place count 941 transition count 1185
Iterating global reduction 1 with 1 rules applied. Total rules applied 573 place count 941 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 574 place count 940 transition count 1184
Iterating global reduction 1 with 1 rules applied. Total rules applied 575 place count 940 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 576 place count 939 transition count 1183
Iterating global reduction 1 with 1 rules applied. Total rules applied 577 place count 939 transition count 1183
Applied a total of 577 rules in 1179 ms. Remains 939 /1227 variables (removed 288) and now considering 1183/1472 (removed 289) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16074006246440204036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16108553949461203508.kers'
[2026-05-25 10:29:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16074006246440204036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16108553949461203508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1183 rows 939 cols 3572 entries
Finished phase 1 with 934 SingleSign rule and 0 generalized
[2026-05-25 10:29:35] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16108553949461203508.kers
Total runtime 6 ms.
[2026-05-25 10:29:36] [INFO ] Implicit Places using invariants in 691 ms returned []
[2026-05-25 10:29:36] [INFO ] Invariant cache hit.
[2026-05-25 10:29:37] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
Running 1182 sub problems to find dead transitions.
[2026-05-25 10:29:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 938/2122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/939 constraints, PredecessorRefiner: 1182/1182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 938/2122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/939 constraints, PredecessorRefiner: 0/1182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Starting structural reductions in LTL mode, iteration 1 : 939/1227 places, 1183/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63656 ms. Remains : 939/1227 places, 1183/1472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Applied a total of 0 rules in 27 ms. Remains 939 /939 variables (removed 0) and now considering 1183/1183 (removed 0) transitions.
[2026-05-25 10:30:37] [INFO ] Invariant cache hit.
[2026-05-25 10:30:38] [INFO ] Implicit Places using invariants in 361 ms returned []
[2026-05-25 10:30:38] [INFO ] Invariant cache hit.
[2026-05-25 10:30:39] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1393 ms. Remains : 939/939 places, 1183/1183 transitions.
Support contains 124 out of 939 places after structural reductions.
[2026-05-25 10:30:39] [INFO ] Flatten gal took : 114 ms
[2026-05-25 10:30:39] [INFO ] Flatten gal took : 43 ms
[2026-05-25 10:30:39] [INFO ] Input system was already deterministic with 1183 transitions.
RANDOM walk for 40000 steps (510 resets) in 1895 ms. (21 steps per ms) remains 59/85 properties
BEST_FIRST walk for 4004 steps (11 resets) in 55 ms. (71 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 66 ms. (59 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (9 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (9 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (12 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (10 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (11 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
[2026-05-25 10:30:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 847/939 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
SMT process timed out in 5357ms, After SMT, problems are : Problem set: 0 solved, 59 unsolved
Fused 59 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 92 out of 939 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Graph (trivial) has 773 edges and 939 vertex of which 53 / 939 are part of one of the 10 SCC in 16 ms
Free SCC test removed 43 places
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 1376 edges and 896 vertex of which 893 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 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 530 transitions
Trivial Post-agglo rules discarded 530 transitions
Performed 530 trivial Post agglomeration. Transition count delta: 530
Iterating post reduction 0 with 532 rules applied. Total rules applied 534 place count 893 transition count 593
Reduce places removed 530 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 545 rules applied. Total rules applied 1079 place count 363 transition count 578
Reduce places removed 8 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 46 rules applied. Total rules applied 1125 place count 355 transition count 540
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1163 place count 317 transition count 540
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1163 place count 317 transition count 492
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1259 place count 269 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1260 place count 268 transition count 491
Iterating global reduction 4 with 1 rules applied. Total rules applied 1261 place count 268 transition count 491
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1319 place count 239 transition count 462
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1322 place count 239 transition count 459
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1329 place count 232 transition count 452
Iterating global reduction 5 with 7 rules applied. Total rules applied 1336 place count 232 transition count 452
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1337 place count 231 transition count 451
Iterating global reduction 5 with 1 rules applied. Total rules applied 1338 place count 231 transition count 451
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1339 place count 230 transition count 450
Iterating global reduction 5 with 1 rules applied. Total rules applied 1340 place count 230 transition count 450
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1344 place count 228 transition count 448
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1356 place count 222 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1359 place count 222 transition count 462
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1380 place count 222 transition count 441
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1401 place count 201 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1406 place count 201 transition count 436
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1412 place count 201 transition count 436
Applied a total of 1412 rules in 186 ms. Remains 201 /939 variables (removed 738) and now considering 436/1183 (removed 747) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 201/939 places, 436/1183 transitions.
RANDOM walk for 40000 steps (2963 resets) in 565 ms. (70 steps per ms) remains 42/59 properties
BEST_FIRST walk for 4004 steps (43 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (46 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (46 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (41 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (41 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (42 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (40 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (41 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (43 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (42 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 6 ms. (571 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (44 resets) in 6 ms. (571 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (41 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (43 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (41 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17960625767142170343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7793016258670786385.kers'
[2026-05-25 10:30:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17960625767142170343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7793016258670786385.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 436 rows 201 cols 2159 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-25 10:30:46] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7793016258670786385.kers
Total runtime 2 ms.
[2026-05-25 10:30:46] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 101/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 418/588 variables, 170/174 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 46/634 variables, 28/210 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 3/637 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/637 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 0/637 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 0/637 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 221 constraints, problems are : Problem set: 0 solved, 41 unsolved in 9147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/170 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 418/588 variables, 170/178 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 8/186 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 21/207 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 46/634 variables, 28/235 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 19/254 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 2/256 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/634 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 3/637 variables, 3/259 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 2/261 constraints. Problems are: Problem set: 1 solved, 40 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 6/267 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/637 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 16 (OVERLAPS) 0/637 variables, 2/269 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/637 variables, 1/270 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/270 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 19 (OVERLAPS) 0/637 variables, 0/270 constraints. Problems are: Problem set: 2 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 637/637 variables, and 270 constraints, problems are : Problem set: 2 solved, 39 unsolved in 18848 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 40/41 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28025ms problems are : Problem set: 2 solved, 39 unsolved
Parikh walk visited 13 properties in 1999 ms.
Support contains 41 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 436/436 transitions.
Graph (trivial) has 97 edges and 201 vertex of which 4 / 201 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 565 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 198 transition count 400
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 168 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 165 transition count 397
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 69 place count 165 transition count 388
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 87 place count 156 transition count 388
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 95 place count 148 transition count 319
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 148 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 148 transition count 316
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 124 place count 139 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 139 transition count 305
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 131 place count 134 transition count 300
Iterating global reduction 5 with 5 rules applied. Total rules applied 136 place count 134 transition count 300
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 140 place count 130 transition count 296
Iterating global reduction 5 with 4 rules applied. Total rules applied 144 place count 130 transition count 296
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 127 transition count 293
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 127 transition count 293
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 166 place count 127 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 127 transition count 276
Free-agglomeration rule applied 27 times.
Iterating global reduction 6 with 27 rules applied. Total rules applied 194 place count 127 transition count 249
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 222 place count 100 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 237 place count 100 transition count 233
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 100 transition count 233
Applied a total of 239 rules in 72 ms. Remains 100 /201 variables (removed 101) and now considering 233/436 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 100/201 places, 233/436 transitions.
RANDOM walk for 40000 steps (3240 resets) in 882 ms. (45 steps per ms) remains 20/26 properties
BEST_FIRST walk for 4004 steps (60 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (56 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (64 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (64 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (62 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (65 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (65 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (64 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (65 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (63 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (63 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (65 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (64 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (68 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (62 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (64 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (60 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (64 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (64 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11490970197201691527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6627314580275480266.kers'
[2026-05-25 10:31:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11490970197201691527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6627314580275480266.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 100 cols 1008 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-25 10:31:17] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6627314580275480266.kers
Total runtime 1 ms.
[2026-05-25 10:31:17] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 73/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 233/333 variables, 100/109 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 80/189 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 189 constraints, problems are : Problem set: 1 solved, 18 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 77/100 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 233/333 variables, 100/109 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 80/189 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 18/207 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 2/209 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 209 constraints, problems are : Problem set: 1 solved, 18 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3165ms problems are : Problem set: 1 solved, 18 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 224 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-25 10:31:20] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:31:20] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:31:20] [INFO ] Input system was already deterministic with 1183 transitions.
Computed a total of 196 stabilizing places and 204 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 914 transition count 1158
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 914 transition count 1158
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 69 place count 895 transition count 1139
Iterating global reduction 0 with 19 rules applied. Total rules applied 88 place count 895 transition count 1139
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 102 place count 881 transition count 1125
Iterating global reduction 0 with 14 rules applied. Total rules applied 116 place count 881 transition count 1125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 117 place count 881 transition count 1124
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 129 place count 869 transition count 1112
Iterating global reduction 1 with 12 rules applied. Total rules applied 141 place count 869 transition count 1112
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 153 place count 857 transition count 1100
Iterating global reduction 1 with 12 rules applied. Total rules applied 165 place count 857 transition count 1100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 166 place count 857 transition count 1099
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 177 place count 846 transition count 1088
Iterating global reduction 2 with 11 rules applied. Total rules applied 188 place count 846 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 846 transition count 1087
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 197 place count 838 transition count 1079
Iterating global reduction 3 with 8 rules applied. Total rules applied 205 place count 838 transition count 1079
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 212 place count 831 transition count 1072
Iterating global reduction 3 with 7 rules applied. Total rules applied 219 place count 831 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 831 transition count 1071
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 224 place count 827 transition count 1067
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 827 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 231 place count 824 transition count 1064
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 824 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 236 place count 822 transition count 1062
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 822 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 240 place count 820 transition count 1060
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 820 transition count 1060
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 244 place count 818 transition count 1058
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 818 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 248 place count 816 transition count 1056
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 252 place count 814 transition count 1054
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 814 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 256 place count 812 transition count 1052
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 812 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 260 place count 810 transition count 1050
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 810 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 264 place count 808 transition count 1048
Iterating global reduction 4 with 2 rules applied. Total rules applied 266 place count 808 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 268 place count 807 transition count 1046
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 270 place count 806 transition count 1045
Iterating global reduction 5 with 1 rules applied. Total rules applied 271 place count 806 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 272 place count 806 transition count 1044
Applied a total of 272 rules in 597 ms. Remains 806 /939 variables (removed 133) and now considering 1044/1183 (removed 139) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14510159372515630274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2262973517539793326.kers'
[2026-05-25 10:31:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14510159372515630274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2262973517539793326.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1044 rows 806 cols 3278 entries
Finished phase 1 with 801 SingleSign rule and 0 generalized
[2026-05-25 10:31:21] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2262973517539793326.kers
Total runtime 5 ms.
[2026-05-25 10:31:21] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-25 10:31:21] [INFO ] Invariant cache hit.
[2026-05-25 10:31:22] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2026-05-25 10:31:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
SMT process timed out in 30294ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Starting structural reductions in LTL mode, iteration 1 : 806/939 places, 1044/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32575 ms. Remains : 806/939 places, 1044/1183 transitions.
[2026-05-25 10:31:53] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:31:53] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:31:53] [INFO ] Input system was already deterministic with 1044 transitions.
[2026-05-25 10:31:53] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:31:53] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:31:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13206460897327221892.gal : 39 ms
[2026-05-25 10:31:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17323208072408846214.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13206460897327221892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17323208072408846214.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,9.96647e+09,22.939,556272,2,32215,5,1.75664e+06,6,0,4270,2.41539e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:32:23] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:32:23] [INFO ] Applying decomposition
[2026-05-25 10:32:23] [INFO ] Flatten gal took : 19 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/graph55944044544472026.txt' '-o' '/tmp/graph55944044544472026.bin' '-w' '/tmp/graph55944044544472026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph55944044544472026.bin' '-l' '-1' '-v' '-w' '/tmp/graph55944044544472026.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:32:23] [INFO ] Decomposing Gal with order
[2026-05-25 10:32:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:32:23] [INFO ] Removed a total of 859 redundant transitions.
[2026-05-25 10:32:24] [INFO ] Flatten gal took : 112 ms
[2026-05-25 10:32:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2026-05-25 10:32:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9275204543649300139.gal : 15 ms
[2026-05-25 10:32:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17829567144460284386.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/CTLFireability9275204543649300139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17829567144460284386.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,9.96647e+09,5.64421,222044,2551,15,388759,1009,1254,1.16784e+06,44,2866,0


Converting to forward existential form...Done !
original formula: AF((EX(E(!(E((i3.u30.p78==1) U (i9.u68.p252==1))) U AX((i4.u35.p95==1)))) * (((i26.u243.p900==0) + EF((((i9.u34.p94==0)||(i9.u113.p395==0...269
=> equivalent forward existential formula: [FwdG(Init,!((EX(E(!(E((i3.u30.p78==1) U (i9.u68.p252==1))) U !(EX(!((i4.u35.p95==1)))))) * (((i26.u243.p900==0)...326
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t386, t420, t459, t514, t603, t687, t688, t742, t744, t764, t765, t768...604
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 913 transition count 1157
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 913 transition count 1157
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 894 transition count 1138
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 894 transition count 1138
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 880 transition count 1124
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 880 transition count 1124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 880 transition count 1123
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 131 place count 868 transition count 1111
Iterating global reduction 1 with 12 rules applied. Total rules applied 143 place count 868 transition count 1111
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 155 place count 856 transition count 1099
Iterating global reduction 1 with 12 rules applied. Total rules applied 167 place count 856 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 856 transition count 1098
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 846 transition count 1088
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 846 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 846 transition count 1087
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 839 transition count 1080
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 839 transition count 1080
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 208 place count 834 transition count 1075
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 834 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 834 transition count 1074
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 832 transition count 1072
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 832 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 830 transition count 1070
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 830 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 224 place count 828 transition count 1068
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 828 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 228 place count 826 transition count 1066
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 826 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 232 place count 824 transition count 1064
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 824 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 236 place count 822 transition count 1062
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 822 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 240 place count 820 transition count 1060
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 820 transition count 1060
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 244 place count 818 transition count 1058
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 818 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 248 place count 816 transition count 1056
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 252 place count 814 transition count 1054
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 814 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 814 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 813 transition count 1052
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 813 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 813 transition count 1051
Applied a total of 258 rules in 569 ms. Remains 813 /939 variables (removed 126) and now considering 1051/1183 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16744500857665596031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8299028885341947375.kers'
[2026-05-25 10:32:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16744500857665596031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8299028885341947375.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1051 rows 813 cols 3292 entries
Finished phase 1 with 808 SingleSign rule and 0 generalized
[2026-05-25 10:32:54] [INFO ] Computed 5 invariants in 14 ms
Computed 5 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8299028885341947375.kers
Total runtime 15 ms.
[2026-05-25 10:32:55] [INFO ] Implicit Places using invariants in 479 ms returned []
[2026-05-25 10:32:55] [INFO ] Invariant cache hit.
[2026-05-25 10:32:56] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Running 1050 sub problems to find dead transitions.
[2026-05-25 10:32:56] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/1864 variables, and 0 constraints, problems are : Problem set: 0 solved, 1050 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/813 constraints, PredecessorRefiner: 1050/1050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1050 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/1864 variables, and 0 constraints, problems are : Problem set: 0 solved, 1050 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/813 constraints, PredecessorRefiner: 0/1050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 1050 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 813/939 places, 1051/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62291 ms. Remains : 813/939 places, 1051/1183 transitions.
[2026-05-25 10:33:56] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:33:56] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:33:56] [INFO ] Input system was already deterministic with 1051 transitions.
[2026-05-25 10:33:56] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:33:56] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:33:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3506774851680211916.gal : 5 ms
[2026-05-25 10:33:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2504186698861285529.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/CTLFireability3506774851680211916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2504186698861285529.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01055e+10,19.0362,496988,2,32423,5,1.60828e+06,6,0,4305,2.12418e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01055e+10,10.1603,322520,2358,15,502164,859,1291,1.99844e+06,44,2915,0


Converting to forward existential form...Done !
original formula: EG(((A((E((((i12.u10.p27==1)&&(i12.u110.p373==1))&&((i12.u165.p651==1)&&(i12.u270.p975==1))) U (i34.u310.p1122==1)) * (i7.u72.p271==1)) U...472
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(((!(!((E(!((i5.u53.p250==1)) U (!((i0.i1.i0.u31.p84==1)) * !((i5.u53.p250==1)))) + EG(!((i5....1117
Reverse transition relation is NOT exact ! Due to transitions t76, t171, t172, t228, t262, t344, t434, t516, t609, t692, t748, t768, t769, t775, t778, t781...619
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 912 transition count 1156
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 912 transition count 1156
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 892 transition count 1136
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 892 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 108 place count 878 transition count 1122
Iterating global reduction 0 with 14 rules applied. Total rules applied 122 place count 878 transition count 1122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 878 transition count 1121
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 135 place count 866 transition count 1109
Iterating global reduction 1 with 12 rules applied. Total rules applied 147 place count 866 transition count 1109
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 159 place count 854 transition count 1097
Iterating global reduction 1 with 12 rules applied. Total rules applied 171 place count 854 transition count 1097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 172 place count 854 transition count 1096
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 183 place count 843 transition count 1085
Iterating global reduction 2 with 11 rules applied. Total rules applied 194 place count 843 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 843 transition count 1084
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 203 place count 835 transition count 1076
Iterating global reduction 3 with 8 rules applied. Total rules applied 211 place count 835 transition count 1076
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 216 place count 830 transition count 1071
Iterating global reduction 3 with 5 rules applied. Total rules applied 221 place count 830 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 830 transition count 1070
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 225 place count 827 transition count 1067
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 827 transition count 1067
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 231 place count 824 transition count 1064
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 824 transition count 1064
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 237 place count 821 transition count 1061
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 821 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 243 place count 818 transition count 1058
Iterating global reduction 4 with 3 rules applied. Total rules applied 246 place count 818 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 815 transition count 1055
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 815 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 255 place count 812 transition count 1052
Iterating global reduction 4 with 3 rules applied. Total rules applied 258 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 261 place count 809 transition count 1049
Iterating global reduction 4 with 3 rules applied. Total rules applied 264 place count 809 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 806 transition count 1046
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 273 place count 803 transition count 1043
Iterating global reduction 4 with 3 rules applied. Total rules applied 276 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 279 place count 800 transition count 1040
Iterating global reduction 4 with 3 rules applied. Total rules applied 282 place count 800 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 283 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 285 place count 798 transition count 1037
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 288 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 289 place count 797 transition count 1035
Iterating global reduction 6 with 1 rules applied. Total rules applied 290 place count 797 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 291 place count 797 transition count 1034
Applied a total of 291 rules in 608 ms. Remains 797 /939 variables (removed 142) and now considering 1034/1183 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9916823018340573451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-610713052102403549.kers'
[2026-05-25 10:34:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9916823018340573451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-610713052102403549.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 1034 rows 797 cols 3252 entries
Finished phase 1 with 792 SingleSign rule and 0 generalized
[2026-05-25 10:34:57] [INFO ] Computed 5 invariants in 14 ms
Computed 5 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-610713052102403549.kers
Total runtime 42 ms.
[2026-05-25 10:34:58] [INFO ] Implicit Places using invariants in 540 ms returned []
[2026-05-25 10:34:58] [INFO ] Invariant cache hit.
[2026-05-25 10:34:59] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 1033 sub problems to find dead transitions.
[2026-05-25 10:34:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
SMT process timed out in 30250ms, After SMT, problems are : Problem set: 0 solved, 1033 unsolved
Search for dead transitions found 0 dead transitions in 30255ms
Starting structural reductions in LTL mode, iteration 1 : 797/939 places, 1034/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32274 ms. Remains : 797/939 places, 1034/1183 transitions.
[2026-05-25 10:35:29] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:35:29] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:35:29] [INFO ] Input system was already deterministic with 1034 transitions.
[2026-05-25 10:35:29] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:35:29] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:35:29] [INFO ] Time to serialize gal into /tmp/CTLFireability799384869808129414.gal : 5 ms
[2026-05-25 10:35:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4305267137640925724.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/CTLFireability799384869808129414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4305267137640925724.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,9.5567e+09,17.9693,437824,2,26118,5,1.32587e+06,6,0,4224,1.90147e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:35:59] [INFO ] Flatten gal took : 90 ms
[2026-05-25 10:35:59] [INFO ] Applying decomposition
[2026-05-25 10:35:59] [INFO ] Flatten gal took : 15 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/graph17078762355433114125.txt' '-o' '/tmp/graph17078762355433114125.bin' '-w' '/tmp/graph17078762355433114125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17078762355433114125.bin' '-l' '-1' '-v' '-w' '/tmp/graph17078762355433114125.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:35:59] [INFO ] Decomposing Gal with order
[2026-05-25 10:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:35:59] [INFO ] Removed a total of 850 redundant transitions.
[2026-05-25 10:35:59] [INFO ] Flatten gal took : 98 ms
[2026-05-25 10:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2026-05-25 10:35:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11958516980926308683.gal : 8 ms
[2026-05-25 10:35:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13492193988600054415.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/CTLFireability11958516980926308683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13492193988600054415.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,9.5567e+09,4.82397,139252,2097,13,253666,913,1224,656102,44,2846,0


Converting to forward existential form...Done !
original formula: EF(!(E(!(AX((i8.i1.i1.u54.p279==1))) U E((i25.u233.p876!=1) U (i10.u112.p392==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(EX(!((i8.i1.i1.u54.p279==1))))) U E((i25.u233.p876!=1) U (i10.u112.p392==1)))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t254, t336, t390, t426, t564, t600, t624, t682, t758, t759, t762, t765, t768...563
(forward)formula 0,1,25.5213,694720,1,0,802931,913,9694,5.57649e+06,203,3907,2812637
FORMULA MedleyB-PT-B02-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 912 transition count 1156
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 912 transition count 1156
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 75 place count 891 transition count 1135
Iterating global reduction 0 with 21 rules applied. Total rules applied 96 place count 891 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 110 place count 877 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 124 place count 877 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 877 transition count 1120
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 137 place count 865 transition count 1108
Iterating global reduction 1 with 12 rules applied. Total rules applied 149 place count 865 transition count 1108
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 161 place count 853 transition count 1096
Iterating global reduction 1 with 12 rules applied. Total rules applied 173 place count 853 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 174 place count 853 transition count 1095
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 842 transition count 1084
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 842 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 197 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 205 place count 834 transition count 1075
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 834 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 219 place count 828 transition count 1069
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 828 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 828 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 230 place count 824 transition count 1064
Iterating global reduction 4 with 4 rules applied. Total rules applied 234 place count 824 transition count 1064
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 238 place count 820 transition count 1060
Iterating global reduction 4 with 4 rules applied. Total rules applied 242 place count 820 transition count 1060
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 245 place count 817 transition count 1057
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 817 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 251 place count 814 transition count 1054
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 814 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 257 place count 811 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 260 place count 811 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 263 place count 808 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 805 transition count 1045
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 802 transition count 1042
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 802 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 281 place count 799 transition count 1039
Iterating global reduction 4 with 3 rules applied. Total rules applied 284 place count 799 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 287 place count 796 transition count 1036
Iterating global reduction 4 with 3 rules applied. Total rules applied 290 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 291 place count 796 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 794 transition count 1033
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 794 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 297 place count 793 transition count 1031
Iterating global reduction 6 with 1 rules applied. Total rules applied 298 place count 793 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 299 place count 793 transition count 1030
Applied a total of 299 rules in 593 ms. Remains 793 /939 variables (removed 146) and now considering 1030/1183 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2162549229541990329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18203757985105470422.kers'
[2026-05-25 10:36:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2162549229541990329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18203757985105470422.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1030 rows 793 cols 3244 entries
Finished phase 1 with 788 SingleSign rule and 0 generalized
[2026-05-25 10:36:26] [INFO ] Computed 5 invariants in 10 ms
Computed 5 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-18203757985105470422.kers
Total runtime 16 ms.
[2026-05-25 10:36:26] [INFO ] Implicit Places using invariants in 542 ms returned []
[2026-05-25 10:36:26] [INFO ] Invariant cache hit.
[2026-05-25 10:36:27] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 1029 sub problems to find dead transitions.
[2026-05-25 10:36:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/792 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
SMT process timed out in 30250ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 30252ms
Starting structural reductions in LTL mode, iteration 1 : 793/939 places, 1030/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32522 ms. Remains : 793/939 places, 1030/1183 transitions.
[2026-05-25 10:36:58] [INFO ] Flatten gal took : 31 ms
[2026-05-25 10:36:58] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:36:58] [INFO ] Input system was already deterministic with 1030 transitions.
[2026-05-25 10:36:58] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:36:58] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:36:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4136227863084224432.gal : 4 ms
[2026-05-25 10:36:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2662113982904776944.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/CTLFireability4136227863084224432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2662113982904776944.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,9.51597e+09,24.3715,447304,2,24649,5,1.34689e+06,6,0,4204,1.95281e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:37:28] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:37:28] [INFO ] Applying decomposition
[2026-05-25 10:37: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/graph7766114814171224078.txt' '-o' '/tmp/graph7766114814171224078.bin' '-w' '/tmp/graph7766114814171224078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7766114814171224078.bin' '-l' '-1' '-v' '-w' '/tmp/graph7766114814171224078.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:37:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:37:28] [INFO ] Removed a total of 852 redundant transitions.
[2026-05-25 10:37:28] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2026-05-25 10:37:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2807603394031979671.gal : 8 ms
[2026-05-25 10:37:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6130518535577585062.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/CTLFireability2807603394031979671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6130518535577585062.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,9.51597e+09,4.42013,153968,2054,13,283822,896,1291,754050,47,2683,0


Converting to forward existential form...Done !
original formula: AF(E(!((EF((i19.i1.i1.u235.p878==1)) * !(((i0.u165.p855==1)&&(i31.i1.i1.u296.p1032==1))))) U (EX(!(AG((i9.i0.i1.u77.p291==1)))) * (i6.u62...167
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(TRUE U (i19.i1.i1.u235.p878==1)) * !(((i0.u165.p855==1)&&(i31.i1.i1.u296.p1032==1))))) U (EX...230
Reverse transition relation is NOT exact ! Due to transitions t76, t214, t253, t335, t391, t425, t452, t563, t596, t679, t735, t755, t756, t759, t762, t765...580
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 912 transition count 1156
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 912 transition count 1156
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 892 transition count 1136
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 892 transition count 1136
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 109 place count 877 transition count 1121
Iterating global reduction 0 with 15 rules applied. Total rules applied 124 place count 877 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 877 transition count 1120
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 138 place count 864 transition count 1107
Iterating global reduction 1 with 13 rules applied. Total rules applied 151 place count 864 transition count 1107
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 164 place count 851 transition count 1094
Iterating global reduction 1 with 13 rules applied. Total rules applied 177 place count 851 transition count 1094
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 178 place count 851 transition count 1093
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 190 place count 839 transition count 1081
Iterating global reduction 2 with 12 rules applied. Total rules applied 202 place count 839 transition count 1081
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 839 transition count 1080
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 212 place count 830 transition count 1071
Iterating global reduction 3 with 9 rules applied. Total rules applied 221 place count 830 transition count 1071
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 228 place count 823 transition count 1064
Iterating global reduction 3 with 7 rules applied. Total rules applied 235 place count 823 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 236 place count 823 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 240 place count 819 transition count 1059
Iterating global reduction 4 with 4 rules applied. Total rules applied 244 place count 819 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 248 place count 815 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 815 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 255 place count 812 transition count 1052
Iterating global reduction 4 with 3 rules applied. Total rules applied 258 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 261 place count 809 transition count 1049
Iterating global reduction 4 with 3 rules applied. Total rules applied 264 place count 809 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 806 transition count 1046
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 273 place count 803 transition count 1043
Iterating global reduction 4 with 3 rules applied. Total rules applied 276 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 279 place count 800 transition count 1040
Iterating global reduction 4 with 3 rules applied. Total rules applied 282 place count 800 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 284 place count 798 transition count 1038
Iterating global reduction 4 with 2 rules applied. Total rules applied 286 place count 798 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 796 transition count 1036
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 796 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 794 transition count 1034
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 794 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 296 place count 792 transition count 1032
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 792 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 792 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 300 place count 791 transition count 1030
Iterating global reduction 5 with 1 rules applied. Total rules applied 301 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 302 place count 791 transition count 1029
Applied a total of 302 rules in 591 ms. Remains 791 /939 variables (removed 148) and now considering 1029/1183 (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-706048966626679131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8362659025394266565.kers'
[2026-05-25 10:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-706048966626679131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8362659025394266565.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1029 rows 791 cols 3242 entries
Finished phase 1 with 786 SingleSign rule and 0 generalized
[2026-05-25 10:37:59] [INFO ] Computed 5 invariants in 11 ms
Computed 5 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-8362659025394266565.kers
Total runtime 26 ms.
[2026-05-25 10:37:59] [INFO ] Implicit Places using invariants in 599 ms returned []
[2026-05-25 10:37:59] [INFO ] Invariant cache hit.
[2026-05-25 10:38:00] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2026-05-25 10:38:00] [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/790 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 30282ms
Starting structural reductions in LTL mode, iteration 1 : 791/939 places, 1029/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32507 ms. Remains : 791/939 places, 1029/1183 transitions.
[2026-05-25 10:38:31] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:38:31] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:38:31] [INFO ] Input system was already deterministic with 1029 transitions.
[2026-05-25 10:38:31] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:38:31] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:38:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16081320701956976477.gal : 4 ms
[2026-05-25 10:38:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18004298604791029742.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/CTLFireability16081320701956976477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18004298604791029742.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,9.52221e+09,26.1087,486820,2,31002,5,1.56371e+06,6,0,4195,2.1129e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:39:01] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:39:01] [INFO ] Applying decomposition
[2026-05-25 10:39:01] [INFO ] Flatten gal took : 14 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/graph285971618925957344.txt' '-o' '/tmp/graph285971618925957344.bin' '-w' '/tmp/graph285971618925957344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph285971618925957344.bin' '-l' '-1' '-v' '-w' '/tmp/graph285971618925957344.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:39:01] [INFO ] Decomposing Gal with order
[2026-05-25 10:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:39:01] [INFO ] Removed a total of 863 redundant transitions.
[2026-05-25 10:39:01] [INFO ] Flatten gal took : 53 ms
[2026-05-25 10:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 22 ms.
[2026-05-25 10:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2146610210526571155.gal : 12 ms
[2026-05-25 10:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16286821229205412172.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/CTLFireability2146610210526571155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16286821229205412172.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,9.52221e+09,9.83208,324132,2358,17,530638,859,1218,1.86672e+06,50,2611,0


Converting to forward existential form...Done !
original formula: AF(EG(((i24.u224.p838==1) * A(EX((i0.u6.p14==1)) U (i2.u162.p855==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((i24.u224.p838==1) * !((E(!((i2.u162.p855==1)) U (!(EX((i0.u6.p14==1))) * !((i2.u162.p855==1)))...198
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t334, t424, t506, t562, t595, t677, t734, t754, t755, t758, t761, t764...594
Using 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 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
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Graph (trivial) has 890 edges and 939 vertex of which 68 / 939 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 624 place count 882 transition count 495
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 638 rules applied. Total rules applied 1262 place count 259 transition count 480
Reduce places removed 7 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 30 rules applied. Total rules applied 1292 place count 252 transition count 457
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1315 place count 229 transition count 457
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1315 place count 229 transition count 410
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1409 place count 182 transition count 410
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1424 place count 167 transition count 395
Iterating global reduction 4 with 15 rules applied. Total rules applied 1439 place count 167 transition count 395
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1445 place count 161 transition count 389
Iterating global reduction 4 with 6 rules applied. Total rules applied 1451 place count 161 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1452 place count 161 transition count 388
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1454 place count 159 transition count 386
Iterating global reduction 5 with 2 rules applied. Total rules applied 1456 place count 159 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1458 place count 157 transition count 384
Iterating global reduction 5 with 2 rules applied. Total rules applied 1460 place count 157 transition count 384
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1508 place count 133 transition count 360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1512 place count 133 transition count 356
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1529 place count 116 transition count 309
Iterating global reduction 6 with 17 rules applied. Total rules applied 1546 place count 116 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1550 place count 116 transition count 305
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1563 place count 103 transition count 288
Iterating global reduction 7 with 13 rules applied. Total rules applied 1576 place count 103 transition count 288
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1588 place count 91 transition count 272
Iterating global reduction 7 with 12 rules applied. Total rules applied 1600 place count 91 transition count 272
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1605 place count 91 transition count 267
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 1607 place count 90 transition count 266
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1608 place count 89 transition count 262
Iterating global reduction 8 with 1 rules applied. Total rules applied 1609 place count 89 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1610 place count 89 transition count 261
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 1614 place count 89 transition count 257
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 1622 place count 85 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1623 place count 84 transition count 252
Applied a total of 1623 rules in 80 ms. Remains 84 /939 variables (removed 855) and now considering 252/1183 (removed 931) transitions.
[2026-05-25 10:39:31] [INFO ] Flow matrix only has 248 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-2593343783868441876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5361304594145994660.kers'
[2026-05-25 10:39:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2593343783868441876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5361304594145994660.kers]
Normalized transition count is 247 out of 248 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 83 cols 1371 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-25 10:39:31] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5361304594145994660.kers
Total runtime 2 ms.
[2026-05-25 10:39:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 10:39:31] [INFO ] Flow matrix only has 248 transitions (discarded 4 similar events)
[2026-05-25 10:39:31] [INFO ] Invariant cache hit.
[2026-05-25 10:39:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 10:39:32] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2026-05-25 10:39:32] [INFO ] Redundant transitions in 8 ms returned []
Running 242 sub problems to find dead transitions.
[2026-05-25 10:39:32] [INFO ] Flow matrix only has 248 transitions (discarded 4 similar events)
[2026-05-25 10:39:32] [INFO ] Invariant cache hit.
[2026-05-25 10:39:32] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 4/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 247/331 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (OVERLAPS) 0/332 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 114 constraints, problems are : Problem set: 0 solved, 242 unsolved in 27767 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 4/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 247/331 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 242/355 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 1/332 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 357 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57896ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 57897ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/939 places, 252/1183 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58196 ms. Remains : 84/939 places, 252/1183 transitions.
[2026-05-25 10:40:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:40:29] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:40:29] [INFO ] Input system was already deterministic with 252 transitions.
[2026-05-25 10:40:29] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:40:29] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:40:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15834507231905343137.gal : 2 ms
[2026-05-25 10:40:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9197286910717127346.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/CTLFireability15834507231905343137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9197286910717127346.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,264768,0.471118,19892,2,3972,5,50841,6,0,580,47077,0


Converting to forward existential form...Done !
original formula: EG((EF((p554==1)) * ((p368==1) + A(((EF((p597==1)) + (p1029!=1)) + ((((p49==1)&&(p350==1))&&((p651==1)&&(p975==1)))&&(p1152==1))) U (E(((...275
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p554==1)) * ((p368==1) + !((E(!((E((((p116==1)&&(p417==1))&&((p696==1)&&(p1042==1))) U (p8...601
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t9, t10, t18, t22, t23, t24, t31, t32, t33, t79, t80, t82, t83, t84, t85, t86, t88, t...344
Using saturation style SCC detection
(forward)formula 0,1,18.3682,402244,1,0,505,1.84028e+06,543,304,7023,1.67083e+06,645
FORMULA MedleyB-PT-B02-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 912 transition count 1156
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 912 transition count 1156
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 75 place count 891 transition count 1135
Iterating global reduction 0 with 21 rules applied. Total rules applied 96 place count 891 transition count 1135
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 111 place count 876 transition count 1120
Iterating global reduction 0 with 15 rules applied. Total rules applied 126 place count 876 transition count 1120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 876 transition count 1119
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 140 place count 863 transition count 1106
Iterating global reduction 1 with 13 rules applied. Total rules applied 153 place count 863 transition count 1106
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 166 place count 850 transition count 1093
Iterating global reduction 1 with 13 rules applied. Total rules applied 179 place count 850 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 850 transition count 1092
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 192 place count 838 transition count 1080
Iterating global reduction 2 with 12 rules applied. Total rules applied 204 place count 838 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 838 transition count 1079
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 214 place count 829 transition count 1070
Iterating global reduction 3 with 9 rules applied. Total rules applied 223 place count 829 transition count 1070
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 822 transition count 1063
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 822 transition count 1063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 822 transition count 1062
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 242 place count 818 transition count 1058
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 818 transition count 1058
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 250 place count 814 transition count 1054
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 814 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 257 place count 811 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 260 place count 811 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 263 place count 808 transition count 1048
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 805 transition count 1045
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 802 transition count 1042
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 802 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 281 place count 799 transition count 1039
Iterating global reduction 4 with 3 rules applied. Total rules applied 284 place count 799 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 287 place count 796 transition count 1036
Iterating global reduction 4 with 3 rules applied. Total rules applied 290 place count 796 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 293 place count 793 transition count 1033
Iterating global reduction 4 with 3 rules applied. Total rules applied 296 place count 793 transition count 1033
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 299 place count 790 transition count 1030
Iterating global reduction 4 with 3 rules applied. Total rules applied 302 place count 790 transition count 1030
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 790 transition count 1029
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 305 place count 788 transition count 1027
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 788 transition count 1027
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 308 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 309 place count 787 transition count 1025
Iterating global reduction 6 with 1 rules applied. Total rules applied 310 place count 787 transition count 1025
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 311 place count 787 transition count 1024
Applied a total of 311 rules in 608 ms. Remains 787 /939 variables (removed 152) and now considering 1024/1183 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14925543267016847721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9390841223847368456.kers'
[2026-05-25 10:40:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14925543267016847721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9390841223847368456.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1024 rows 787 cols 3232 entries
Finished phase 1 with 782 SingleSign rule and 0 generalized
[2026-05-25 10:40:49] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9390841223847368456.kers
Total runtime 6 ms.
[2026-05-25 10:40:49] [INFO ] Implicit Places using invariants in 467 ms returned []
[2026-05-25 10:40:49] [INFO ] Invariant cache hit.
[2026-05-25 10:40:50] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
Running 1023 sub problems to find dead transitions.
[2026-05-25 10:40:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/786 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
SMT process timed out in 30305ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 30308ms
Starting structural reductions in LTL mode, iteration 1 : 787/939 places, 1024/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32393 ms. Remains : 787/939 places, 1024/1183 transitions.
[2026-05-25 10:41:20] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:41:20] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:41:20] [INFO ] Input system was already deterministic with 1024 transitions.
[2026-05-25 10:41:20] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:41:21] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:41:21] [INFO ] Time to serialize gal into /tmp/CTLFireability16919889766098088825.gal : 4 ms
[2026-05-25 10:41:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16453296465615989662.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/CTLFireability16919889766098088825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16453296465615989662.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,9.42683e+09,22.6464,457004,2,26026,5,1.37324e+06,6,0,4174,1.97292e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:41:51] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:41:51] [INFO ] Applying decomposition
[2026-05-25 10:41:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12471111956214527143.txt' '-o' '/tmp/graph12471111956214527143.bin' '-w' '/tmp/graph12471111956214527143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12471111956214527143.bin' '-l' '-1' '-v' '-w' '/tmp/graph12471111956214527143.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:41:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:41:51] [INFO ] Removed a total of 854 redundant transitions.
[2026-05-25 10:41:51] [INFO ] Flatten gal took : 49 ms
[2026-05-25 10:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2026-05-25 10:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability18289216622037912014.gal : 9 ms
[2026-05-25 10:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3726010924281860442.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/CTLFireability18289216622037912014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3726010924281860442.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,9.42683e+09,7.17358,212136,2240,14,359655,988,1224,1.19541e+06,47,3099,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((EX((i19.i1.i0.u179.p645==1)) + ((i6.u62.p182==0)&&(((i0.u4.p72==0)||(i0.u90.p328==0))||((i0.u166.p674==0)||(i0.u261.p952==0))))...159
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((EX((i19.i1.i0.u179.p645==1)) + ((i6.u62.p182==0)&&(((i0.u4.p72==0)||(i0.u90.p328==0)...214
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t329, t330, t386, t420, t502, t558, t591, t730, t750, t751, t754, t757...593
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 912 transition count 1156
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 912 transition count 1156
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 74 place count 892 transition count 1136
Iterating global reduction 0 with 20 rules applied. Total rules applied 94 place count 892 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 108 place count 878 transition count 1122
Iterating global reduction 0 with 14 rules applied. Total rules applied 122 place count 878 transition count 1122
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 135 place count 865 transition count 1109
Iterating global reduction 0 with 13 rules applied. Total rules applied 148 place count 865 transition count 1109
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 161 place count 852 transition count 1096
Iterating global reduction 0 with 13 rules applied. Total rules applied 174 place count 852 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 175 place count 852 transition count 1095
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 187 place count 840 transition count 1083
Iterating global reduction 1 with 12 rules applied. Total rules applied 199 place count 840 transition count 1083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 200 place count 840 transition count 1082
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 209 place count 831 transition count 1073
Iterating global reduction 2 with 9 rules applied. Total rules applied 218 place count 831 transition count 1073
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 824 transition count 1066
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 824 transition count 1066
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 824 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 237 place count 820 transition count 1061
Iterating global reduction 3 with 4 rules applied. Total rules applied 241 place count 820 transition count 1061
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 245 place count 816 transition count 1057
Iterating global reduction 3 with 4 rules applied. Total rules applied 249 place count 816 transition count 1057
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 252 place count 813 transition count 1054
Iterating global reduction 3 with 3 rules applied. Total rules applied 255 place count 813 transition count 1054
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 258 place count 810 transition count 1051
Iterating global reduction 3 with 3 rules applied. Total rules applied 261 place count 810 transition count 1051
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 264 place count 807 transition count 1048
Iterating global reduction 3 with 3 rules applied. Total rules applied 267 place count 807 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 270 place count 804 transition count 1045
Iterating global reduction 3 with 3 rules applied. Total rules applied 273 place count 804 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 276 place count 801 transition count 1042
Iterating global reduction 3 with 3 rules applied. Total rules applied 279 place count 801 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 282 place count 798 transition count 1039
Iterating global reduction 3 with 3 rules applied. Total rules applied 285 place count 798 transition count 1039
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 288 place count 795 transition count 1036
Iterating global reduction 3 with 3 rules applied. Total rules applied 291 place count 795 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 294 place count 792 transition count 1033
Iterating global reduction 3 with 3 rules applied. Total rules applied 297 place count 792 transition count 1033
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 792 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 300 place count 790 transition count 1030
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 790 transition count 1030
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 790 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 304 place count 789 transition count 1028
Iterating global reduction 5 with 1 rules applied. Total rules applied 305 place count 789 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 789 transition count 1027
Applied a total of 306 rules in 597 ms. Remains 789 /939 variables (removed 150) and now considering 1027/1183 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6215427548421490354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12414502872430289590.kers'
[2026-05-25 10:42:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6215427548421490354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12414502872430289590.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1027 rows 789 cols 3238 entries
Finished phase 1 with 784 SingleSign rule and 0 generalized
[2026-05-25 10:42:22] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12414502872430289590.kers
Total runtime 8 ms.
[2026-05-25 10:42:22] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-25 10:42:22] [INFO ] Invariant cache hit.
[2026-05-25 10:42:23] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2026-05-25 10:42:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Starting structural reductions in LTL mode, iteration 1 : 789/939 places, 1027/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31972 ms. Remains : 789/939 places, 1027/1183 transitions.
[2026-05-25 10:42:53] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:42:53] [INFO ] Flatten gal took : 25 ms
[2026-05-25 10:42:53] [INFO ] Input system was already deterministic with 1027 transitions.
[2026-05-25 10:42:53] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:42:53] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:42:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16468213085881738554.gal : 4 ms
[2026-05-25 10:42:53] [INFO ] Time to serialize properties into /tmp/CTLFireability808801473808393565.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/CTLFireability16468213085881738554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability808801473808393565.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,9.48694e+09,29.0482,486360,2,30462,5,1.54589e+06,6,0,4185,2.10427e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:43:23] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:43:23] [INFO ] Applying decomposition
[2026-05-25 10:43:23] [INFO ] Flatten gal took : 24 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/graph17513744980866127081.txt' '-o' '/tmp/graph17513744980866127081.bin' '-w' '/tmp/graph17513744980866127081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17513744980866127081.bin' '-l' '-1' '-v' '-w' '/tmp/graph17513744980866127081.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:43:23] [INFO ] Decomposing Gal with order
[2026-05-25 10:43:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:43:23] [INFO ] Removed a total of 855 redundant transitions.
[2026-05-25 10:43:23] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 10:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13584765604110052923.gal : 6 ms
[2026-05-25 10:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6210020814540086635.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/CTLFireability13584765604110052923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6210020814540086635.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,9.48694e+09,12.0165,306084,2375,15,592739,832,1291,1.33625e+06,47,2754,0


Converting to forward existential form...Done !
original formula: EG(((AG((AX((((i3.u8.p27==0)||(i3.u87.p328==0))||((i3.u163.p674==0)||(i3.u246.p952==0)))) * EF((((i3.u18.p116==0)||(i3.u82.p440==0))||((i...363
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !((!(EX(!((((i3.u8.p27==0)||(i3.u87.p328==0))||((i3.u163.p674==0)||(i3.u246.p952==0)))))...436
Reverse transition relation is NOT exact ! Due to transitions t76, t103, t214, t248, t330, t386, t420, t505, t506, t562, t595, t622, t677, t753, t754, t757...605
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 913 transition count 1157
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 913 transition count 1157
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 895 transition count 1139
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 895 transition count 1139
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 100 place count 883 transition count 1127
Iterating global reduction 0 with 12 rules applied. Total rules applied 112 place count 883 transition count 1127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 883 transition count 1126
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 124 place count 872 transition count 1115
Iterating global reduction 1 with 11 rules applied. Total rules applied 135 place count 872 transition count 1115
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 146 place count 861 transition count 1104
Iterating global reduction 1 with 11 rules applied. Total rules applied 157 place count 861 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 158 place count 861 transition count 1103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 168 place count 851 transition count 1093
Iterating global reduction 2 with 10 rules applied. Total rules applied 178 place count 851 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 179 place count 851 transition count 1092
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 187 place count 843 transition count 1084
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 843 transition count 1084
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 201 place count 837 transition count 1078
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 837 transition count 1078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 837 transition count 1077
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 211 place count 834 transition count 1074
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 834 transition count 1074
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 217 place count 831 transition count 1071
Iterating global reduction 4 with 3 rules applied. Total rules applied 220 place count 831 transition count 1071
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 222 place count 829 transition count 1069
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 829 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 827 transition count 1067
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 827 transition count 1067
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 825 transition count 1065
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 825 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 823 transition count 1063
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 823 transition count 1063
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 238 place count 821 transition count 1061
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 821 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 242 place count 819 transition count 1059
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 819 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 246 place count 817 transition count 1057
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 817 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 250 place count 815 transition count 1055
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 815 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 253 place count 815 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 254 place count 814 transition count 1053
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 814 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 256 place count 814 transition count 1052
Applied a total of 256 rules in 668 ms. Remains 814 /939 variables (removed 125) and now considering 1052/1183 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13722148948895917883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4837954702057702401.kers'
[2026-05-25 10:43:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13722148948895917883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4837954702057702401.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1052 rows 814 cols 3296 entries
Finished phase 1 with 809 SingleSign rule and 0 generalized
[2026-05-25 10:43:54] [INFO ] Computed 5 invariants in 27 ms
Computed 5 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-4837954702057702401.kers
Total runtime 42 ms.
[2026-05-25 10:43:55] [INFO ] Implicit Places using invariants in 480 ms returned []
[2026-05-25 10:43:55] [INFO ] Invariant cache hit.
[2026-05-25 10:43:55] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
Running 1051 sub problems to find dead transitions.
[2026-05-25 10:43:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 813/1866 variables, and 0 constraints, problems are : Problem set: 0 solved, 1051 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/814 constraints, PredecessorRefiner: 1051/1051 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1051 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 813/1866 variables, and 0 constraints, problems are : Problem set: 0 solved, 1051 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/814 constraints, PredecessorRefiner: 0/1051 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 1051 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Starting structural reductions in LTL mode, iteration 1 : 814/939 places, 1052/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62450 ms. Remains : 814/939 places, 1052/1183 transitions.
[2026-05-25 10:44:56] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:56] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:56] [INFO ] Input system was already deterministic with 1052 transitions.
[2026-05-25 10:44:56] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:56] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:44:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16837295551422796674.gal : 4 ms
[2026-05-25 10:44:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10676302892697818371.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/CTLFireability16837295551422796674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10676302892697818371.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01954e+10,23.6714,496120,2,33573,5,1.62374e+06,6,0,4310,2.09566e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01954e+10,8.00833,232604,2309,15,394241,1032,1218,1.31459e+06,47,3196,0


Converting to forward existential form...Done !
original formula: A((i19.u162.p609==1) U AF(E((AF((i34.i0.i2.u307.p1123==1)) + !(AG((((i3.u35.p94==1)&&(i3.u83.p417==1))&&((i3.u192.p696==1)&&(i3.u268.p104...204
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(E((!(EG(!((i34.i0.i2.u307.p1123==1)))) + !(!(E(TRUE U !((((i3.u35.p94==1)&&(i3.u83.p417=...677
Reverse transition relation is NOT exact ! Due to transitions t76, t232, t266, t348, t349, t406, t407, t441, t579, t612, t694, t770, t771, t778, t781, t784...620
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 911 transition count 1155
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 911 transition count 1155
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 77 place count 890 transition count 1134
Iterating global reduction 0 with 21 rules applied. Total rules applied 98 place count 890 transition count 1134
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 113 place count 875 transition count 1119
Iterating global reduction 0 with 15 rules applied. Total rules applied 128 place count 875 transition count 1119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 129 place count 875 transition count 1118
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 142 place count 862 transition count 1105
Iterating global reduction 1 with 13 rules applied. Total rules applied 155 place count 862 transition count 1105
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 168 place count 849 transition count 1092
Iterating global reduction 1 with 13 rules applied. Total rules applied 181 place count 849 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 182 place count 849 transition count 1091
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 837 transition count 1079
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 837 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 837 transition count 1078
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 215 place count 829 transition count 1070
Iterating global reduction 3 with 8 rules applied. Total rules applied 223 place count 829 transition count 1070
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 822 transition count 1063
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 822 transition count 1063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 822 transition count 1062
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 242 place count 818 transition count 1058
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 818 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 815 transition count 1055
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 813 transition count 1053
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 813 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 811 transition count 1051
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 811 transition count 1051
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 262 place count 809 transition count 1049
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 266 place count 807 transition count 1047
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 270 place count 805 transition count 1045
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 274 place count 803 transition count 1043
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 803 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 278 place count 801 transition count 1041
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 801 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 799 transition count 1039
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 799 transition count 1039
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 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 286 place count 798 transition count 1037
Iterating global reduction 5 with 1 rules applied. Total rules applied 287 place count 798 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 288 place count 797 transition count 1036
Iterating global reduction 5 with 1 rules applied. Total rules applied 289 place count 797 transition count 1036
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 797 transition count 1035
Applied a total of 290 rules in 610 ms. Remains 797 /939 variables (removed 142) and now considering 1035/1183 (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-10000825730219775655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1509005205101650090.kers'
[2026-05-25 10:45:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10000825730219775655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1509005205101650090.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1035 rows 797 cols 3258 entries
Finished phase 1 with 792 SingleSign rule and 0 generalized
[2026-05-25 10:45:57] [INFO ] Computed 5 invariants in 9 ms
Computed 5 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-1509005205101650090.kers
Total runtime 22 ms.
[2026-05-25 10:45:57] [INFO ] Implicit Places using invariants in 505 ms returned []
[2026-05-25 10:45:57] [INFO ] Invariant cache hit.
[2026-05-25 10:45:58] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Running 1034 sub problems to find dead transitions.
[2026-05-25 10:45:58] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/1832 variables, and 0 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1034/1034 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1034 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/1832 variables, and 0 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/1034 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 1034 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 797/939 places, 1035/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62522 ms. Remains : 797/939 places, 1035/1183 transitions.
[2026-05-25 10:46:59] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:46:59] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:46:59] [INFO ] Input system was already deterministic with 1035 transitions.
[2026-05-25 10:46:59] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:46:59] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:46:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7545818631541000378.gal : 4 ms
[2026-05-25 10:46:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2070626442986997829.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/CTLFireability7545818631541000378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2070626442986997829.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,9.72736e+09,22.2163,501640,2,31768,5,1.6062e+06,6,0,4225,2.13216e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:47:29] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:47:29] [INFO ] Applying decomposition
[2026-05-25 10:47:29] [INFO ] Flatten gal took : 14 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/graph1867462881964267638.txt' '-o' '/tmp/graph1867462881964267638.bin' '-w' '/tmp/graph1867462881964267638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1867462881964267638.bin' '-l' '-1' '-v' '-w' '/tmp/graph1867462881964267638.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:47:29] [INFO ] Decomposing Gal with order
[2026-05-25 10:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:47:29] [INFO ] Removed a total of 859 redundant transitions.
[2026-05-25 10:47:29] [INFO ] Flatten gal took : 39 ms
[2026-05-25 10:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 10:47:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4147332857115647310.gal : 5 ms
[2026-05-25 10:47:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2804128008160331972.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/CTLFireability4147332857115647310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2804128008160331972.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,9.72736e+09,5.6083,193692,2206,14,337748,1033,1275,1.04848e+06,47,3183,0


Converting to forward existential form...Done !
original formula: AX(EX(AF((((i10.u89.p329==0)&&(i22.u166.p626==0))&&(i14.u139.p497==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!((((i10.u89.p329==0)&&(i22.u166.p626==0))&&(i14.u139.p497==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t248, t330, t386, t420, t510, t599, t681, t737, t757, t758, t761, t764, t767, t768...586
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 916 transition count 1160
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 916 transition count 1160
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 900 transition count 1144
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 900 transition count 1144
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 888 transition count 1132
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 888 transition count 1132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 888 transition count 1131
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 113 place count 878 transition count 1121
Iterating global reduction 1 with 10 rules applied. Total rules applied 123 place count 878 transition count 1121
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 133 place count 868 transition count 1111
Iterating global reduction 1 with 10 rules applied. Total rules applied 143 place count 868 transition count 1111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 868 transition count 1110
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 153 place count 859 transition count 1101
Iterating global reduction 2 with 9 rules applied. Total rules applied 162 place count 859 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 859 transition count 1100
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 170 place count 852 transition count 1093
Iterating global reduction 3 with 7 rules applied. Total rules applied 177 place count 852 transition count 1093
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 182 place count 847 transition count 1088
Iterating global reduction 3 with 5 rules applied. Total rules applied 187 place count 847 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 844 transition count 1085
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 844 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 841 transition count 1082
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 841 transition count 1082
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 201 place count 839 transition count 1080
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 839 transition count 1080
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 205 place count 837 transition count 1078
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 837 transition count 1078
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 835 transition count 1076
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 835 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 213 place count 833 transition count 1074
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 833 transition count 1074
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 217 place count 831 transition count 1072
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 831 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 829 transition count 1070
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 829 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 225 place count 827 transition count 1068
Iterating global reduction 3 with 2 rules applied. Total rules applied 227 place count 827 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 229 place count 825 transition count 1066
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 825 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 233 place count 823 transition count 1064
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 823 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 236 place count 823 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 822 transition count 1062
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 822 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 822 transition count 1061
Applied a total of 239 rules in 616 ms. Remains 822 /939 variables (removed 117) and now considering 1061/1183 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12145643484761808723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2444903347774551088.kers'
[2026-05-25 10:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12145643484761808723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2444903347774551088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1061 rows 822 cols 3312 entries
Finished phase 1 with 817 SingleSign rule and 0 generalized
[2026-05-25 10:48:00] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2444903347774551088.kers
Total runtime 5 ms.
[2026-05-25 10:48:00] [INFO ] Implicit Places using invariants in 502 ms returned []
[2026-05-25 10:48:00] [INFO ] Invariant cache hit.
[2026-05-25 10:48:01] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
Running 1060 sub problems to find dead transitions.
[2026-05-25 10:48:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/821 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
SMT process timed out in 30246ms, After SMT, problems are : Problem set: 0 solved, 1060 unsolved
Search for dead transitions found 0 dead transitions in 30247ms
Starting structural reductions in LTL mode, iteration 1 : 822/939 places, 1061/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32268 ms. Remains : 822/939 places, 1061/1183 transitions.
[2026-05-25 10:48:31] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:48:32] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:48:32] [INFO ] Input system was already deterministic with 1061 transitions.
[2026-05-25 10:48:32] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:48:32] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:48:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7696716555603415814.gal : 4 ms
[2026-05-25 10:48:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2540259520885585206.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/CTLFireability7696716555603415814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2540259520885585206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03544e+10,22.7741,449196,2,24805,5,1.34012e+06,6,0,4351,1.98292e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03544e+10,4.60295,155256,2188,13,281697,909,1390,723851,52,2861,0


Converting to forward existential form...Done !
original formula: E(((!(EF((((i2.u33.p94==1)&&(i2.u107.p440==1))&&((i2.u182.p718==1)&&(i2.u259.p1019==1))))) + ((i2.u87.p327==1)&&(i36.i1.i0.u339.p1210==1)...805
=> equivalent forward existential formula: ([((FwdU((FwdU(FwdU(Init,((!(E(TRUE U (((i2.u33.p94==1)&&(i2.u107.p440==1))&&((i2.u182.p718==1)&&(i2.u259.p1019=...1817
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t406, t445, t528, t584, t617, t701, t777, t778, t781, t784, t791, t797...641
Using 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
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Graph (trivial) has 928 edges and 939 vertex of which 68 / 939 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 656 transitions
Trivial Post-agglo rules discarded 656 transitions
Performed 656 trivial Post agglomeration. Transition count delta: 656
Iterating post reduction 0 with 656 rules applied. Total rules applied 657 place count 882 transition count 462
Reduce places removed 656 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 670 rules applied. Total rules applied 1327 place count 226 transition count 448
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1335 place count 219 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1336 place count 218 transition count 447
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1336 place count 218 transition count 400
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1430 place count 171 transition count 400
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1444 place count 157 transition count 386
Iterating global reduction 4 with 14 rules applied. Total rules applied 1458 place count 157 transition count 386
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1464 place count 151 transition count 380
Iterating global reduction 4 with 6 rules applied. Total rules applied 1470 place count 151 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1471 place count 151 transition count 379
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1473 place count 149 transition count 377
Iterating global reduction 5 with 2 rules applied. Total rules applied 1475 place count 149 transition count 377
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1477 place count 147 transition count 375
Iterating global reduction 5 with 2 rules applied. Total rules applied 1479 place count 147 transition count 375
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1529 place count 122 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1533 place count 122 transition count 346
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1556 place count 99 transition count 204
Iterating global reduction 6 with 23 rules applied. Total rules applied 1579 place count 99 transition count 204
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1589 place count 99 transition count 194
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1602 place count 86 transition count 177
Iterating global reduction 7 with 13 rules applied. Total rules applied 1615 place count 86 transition count 177
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1628 place count 73 transition count 160
Iterating global reduction 7 with 13 rules applied. Total rules applied 1641 place count 73 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1648 place count 73 transition count 153
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 1650 place count 72 transition count 152
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1651 place count 71 transition count 148
Iterating global reduction 8 with 1 rules applied. Total rules applied 1652 place count 71 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1653 place count 71 transition count 147
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 1657 place count 71 transition count 143
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 1665 place count 67 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1666 place count 66 transition count 138
Applied a total of 1666 rules in 66 ms. Remains 66 /939 variables (removed 873) and now considering 138/1183 (removed 1045) transitions.
[2026-05-25 10:49:32] [INFO ] Flow matrix only has 133 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-18423037531147705214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11288844301201561704.kers'
[2026-05-25 10:49:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18423037531147705214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11288844301201561704.kers]
Normalized transition count is 132 out of 133 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 132 rows 65 cols 541 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-25 10:49:32] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11288844301201561704.kers
Total runtime 1 ms.
[2026-05-25 10:49:32] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-25 10:49:32] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
[2026-05-25 10:49:32] [INFO ] Invariant cache hit.
[2026-05-25 10:49:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:49:32] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2026-05-25 10:49:32] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2026-05-25 10:49:32] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
[2026-05-25 10:49:32] [INFO ] Invariant cache hit.
[2026-05-25 10:49:32] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 132/198 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 1/199 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 97 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 132/198 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 129/225 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 1/199 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 229 constraints, problems are : Problem set: 0 solved, 129 unsolved in 15379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25051ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 25062ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/939 places, 138/1183 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25545 ms. Remains : 66/939 places, 138/1183 transitions.
[2026-05-25 10:49:58] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:49:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:49:58] [INFO ] Input system was already deterministic with 138 transitions.
[2026-05-25 10:49:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:49:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:49:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16575304332823450172.gal : 1 ms
[2026-05-25 10:49:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16056038950618626129.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/CTLFireability16575304332823450172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16056038950618626129.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,79108,0.238902,14432,2,2817,5,31238,6,0,394,36221,0


Converting to forward existential form...Done !
original formula: AF((A((p137!=1) U (p937==1)) * (p201==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((p937==1)) U (!((p137!=1)) * !((p937==1)))) + EG(!((p937==1))))) * (p201==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t9, t14, t16, t17, t18, t21, t24, t25, t28, t34, t53, t60, t61, t69, t80,...335
(forward)formula 0,0,11.1131,275916,1,0,679,1.51835e+06,302,336,3714,1.26975e+06,730
FORMULA MedleyB-PT-B02-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 913 transition count 1157
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 913 transition count 1157
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 893 transition count 1137
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 893 transition count 1137
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 106 place count 879 transition count 1123
Iterating global reduction 0 with 14 rules applied. Total rules applied 120 place count 879 transition count 1123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 879 transition count 1122
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 867 transition count 1110
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 867 transition count 1110
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 157 place count 855 transition count 1098
Iterating global reduction 1 with 12 rules applied. Total rules applied 169 place count 855 transition count 1098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 170 place count 855 transition count 1097
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 181 place count 844 transition count 1086
Iterating global reduction 2 with 11 rules applied. Total rules applied 192 place count 844 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 844 transition count 1085
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 201 place count 836 transition count 1077
Iterating global reduction 3 with 8 rules applied. Total rules applied 209 place count 836 transition count 1077
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 215 place count 830 transition count 1071
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 830 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 830 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 224 place count 828 transition count 1068
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 828 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 228 place count 826 transition count 1066
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 826 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 231 place count 825 transition count 1065
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 825 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 233 place count 824 transition count 1064
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 824 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 235 place count 823 transition count 1063
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 823 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 237 place count 822 transition count 1062
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 822 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 239 place count 821 transition count 1061
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 821 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 241 place count 820 transition count 1060
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 820 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 243 place count 819 transition count 1059
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 819 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 245 place count 818 transition count 1058
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 818 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 817 transition count 1057
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 817 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 249 place count 816 transition count 1056
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 816 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 816 transition count 1055
Applied a total of 251 rules in 783 ms. Remains 816 /939 variables (removed 123) and now considering 1055/1183 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16506454727571380309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1189357392942625804.kers'
[2026-05-25 10:50:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16506454727571380309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1189357392942625804.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1055 rows 816 cols 3304 entries
Finished phase 1 with 811 SingleSign rule and 0 generalized
[2026-05-25 10:50:10] [INFO ] Computed 5 invariants in 15 ms
Computed 5 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1189357392942625804.kers
Total runtime 21 ms.
[2026-05-25 10:50:10] [INFO ] Implicit Places using invariants in 573 ms returned []
[2026-05-25 10:50:10] [INFO ] Invariant cache hit.
[2026-05-25 10:50:11] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
Running 1054 sub problems to find dead transitions.
[2026-05-25 10:50:11] [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/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
SMT process timed out in 30294ms, After SMT, problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Starting structural reductions in LTL mode, iteration 1 : 816/939 places, 1055/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32782 ms. Remains : 816/939 places, 1055/1183 transitions.
[2026-05-25 10:50:42] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:50:42] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:50:42] [INFO ] Input system was already deterministic with 1055 transitions.
[2026-05-25 10:50:42] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:50:42] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:50:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14264056202964670842.gal : 4 ms
[2026-05-25 10:50:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4941314822575685606.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/CTLFireability14264056202964670842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4941314822575685606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03471e+10,24.9183,478476,2,26629,5,1.44366e+06,6,0,4321,2.05956e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03471e+10,5.05463,153376,2278,17,276292,943,1229,759159,46,2675,0


Converting to forward existential form...Done !
original formula: EX(AF(((E(A((i9.i1.i1.u145.p521==1) U (i23.u224.p798==1)) U (i1.u11.p33==1)) + (i27.u253.p1156==1)) + ((i37.u230.p832==1)&&(i21.u205.p712...163
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((E(!((E(!((i23.u224.p798==1)) U (!((i9.i1.i1.u145.p521==1)) * !((i23.u224.p798==1)))) + EG(...279
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t338, t428, t524, t580, t613, t695, t751, t771, t772, t775, t778, t781...622
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 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
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Graph (trivial) has 924 edges and 939 vertex of which 61 / 939 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 656 transitions
Trivial Post-agglo rules discarded 656 transitions
Performed 656 trivial Post agglomeration. Transition count delta: 656
Iterating post reduction 0 with 656 rules applied. Total rules applied 657 place count 888 transition count 469
Reduce places removed 656 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 674 rules applied. Total rules applied 1331 place count 232 transition count 451
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 1341 place count 223 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1342 place count 222 transition count 450
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1342 place count 222 transition count 402
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1438 place count 174 transition count 402
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1452 place count 160 transition count 388
Iterating global reduction 4 with 14 rules applied. Total rules applied 1466 place count 160 transition count 388
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1472 place count 154 transition count 356
Iterating global reduction 4 with 6 rules applied. Total rules applied 1478 place count 154 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1480 place count 154 transition count 354
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1482 place count 152 transition count 352
Iterating global reduction 5 with 2 rules applied. Total rules applied 1484 place count 152 transition count 352
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1486 place count 150 transition count 350
Iterating global reduction 5 with 2 rules applied. Total rules applied 1488 place count 150 transition count 350
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1540 place count 124 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1544 place count 124 transition count 320
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1565 place count 103 transition count 200
Iterating global reduction 6 with 21 rules applied. Total rules applied 1586 place count 103 transition count 200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1595 place count 103 transition count 191
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1605 place count 93 transition count 179
Iterating global reduction 7 with 10 rules applied. Total rules applied 1615 place count 93 transition count 179
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1624 place count 84 transition count 168
Iterating global reduction 7 with 9 rules applied. Total rules applied 1633 place count 84 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1639 place count 84 transition count 162
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 1641 place count 83 transition count 161
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1642 place count 82 transition count 155
Iterating global reduction 8 with 1 rules applied. Total rules applied 1643 place count 82 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1644 place count 82 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1649 place count 82 transition count 149
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 9 with 10 rules applied. Total rules applied 1659 place count 77 transition count 144
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1660 place count 77 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1661 place count 76 transition count 143
Applied a total of 1661 rules in 49 ms. Remains 76 /939 variables (removed 863) and now considering 143/1183 (removed 1040) transitions.
[2026-05-25 10:51:42] [INFO ] Flow matrix only has 138 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-13410356538150431576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3421731113456223162.kers'
[2026-05-25 10:51:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13410356538150431576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3421731113456223162.kers]
Normalized transition count is 137 out of 138 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 137 rows 75 cols 506 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 10:51:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3421731113456223162.kers
Total runtime 1 ms.
[2026-05-25 10:51:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 10:51:42] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
[2026-05-25 10:51:42] [INFO ] Invariant cache hit.
[2026-05-25 10:51:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:51:42] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2026-05-25 10:51:42] [INFO ] Redundant transitions in 1 ms returned []
Running 133 sub problems to find dead transitions.
[2026-05-25 10:51:42] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
[2026-05-25 10:51:42] [INFO ] Invariant cache hit.
[2026-05-25 10:51:42] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 137/213 variables, 76/102 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 1/214 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 118 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 137/213 variables, 76/106 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 14/120 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 133/253 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 1/214 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (OVERLAPS) 0/214 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 255 constraints, problems are : Problem set: 0 solved, 133 unsolved in 15916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27159ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 27159ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/939 places, 143/1183 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27452 ms. Remains : 76/939 places, 143/1183 transitions.
[2026-05-25 10:52:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:52:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:52:09] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-25 10:52:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:52:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15212984629321197028.gal : 1 ms
[2026-05-25 10:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14396666802432248255.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/CTLFireability15212984629321197028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14396666802432248255.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,88668,0.256916,14388,2,3279,5,32151,6,0,439,34422,0


Converting to forward existential form...Done !
original formula: EF(((!(A(!(EF((p615==1))) U EF(((p658==1)&&(p321==1))))) + AG(EF((p890==1)))) + AG((p254==0))))
=> equivalent forward existential formula: ((([((FwdU(FwdU(Init,TRUE),!(E(TRUE U ((p658==1)&&(p321==1))))) * !(!(E(TRUE U (p615==1))))) * !(E(TRUE U ((p658...386
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t8, t9, t19, t20, t21, t22, t23, t28, t35, t59, t60, t64, t72, t86, t87, t88,...338
(forward)formula 0,1,8.32709,204356,1,0,331,1.19252e+06,306,153,3767,607342,358
FORMULA MedleyB-PT-B02-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 911 transition count 1155
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 911 transition count 1155
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 77 place count 890 transition count 1134
Iterating global reduction 0 with 21 rules applied. Total rules applied 98 place count 890 transition count 1134
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 113 place count 875 transition count 1119
Iterating global reduction 0 with 15 rules applied. Total rules applied 128 place count 875 transition count 1119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 129 place count 875 transition count 1118
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 142 place count 862 transition count 1105
Iterating global reduction 1 with 13 rules applied. Total rules applied 155 place count 862 transition count 1105
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 168 place count 849 transition count 1092
Iterating global reduction 1 with 13 rules applied. Total rules applied 181 place count 849 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 182 place count 849 transition count 1091
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 837 transition count 1079
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 837 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 837 transition count 1078
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 216 place count 828 transition count 1069
Iterating global reduction 3 with 9 rules applied. Total rules applied 225 place count 828 transition count 1069
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 821 transition count 1062
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 821 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 821 transition count 1061
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 244 place count 817 transition count 1057
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 817 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 252 place count 813 transition count 1053
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 259 place count 810 transition count 1050
Iterating global reduction 4 with 3 rules applied. Total rules applied 262 place count 810 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 264 place count 808 transition count 1048
Iterating global reduction 4 with 2 rules applied. Total rules applied 266 place count 808 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 268 place count 806 transition count 1046
Iterating global reduction 4 with 2 rules applied. Total rules applied 270 place count 806 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 272 place count 804 transition count 1044
Iterating global reduction 4 with 2 rules applied. Total rules applied 274 place count 804 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 802 transition count 1042
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 802 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 280 place count 800 transition count 1040
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 800 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 284 place count 798 transition count 1038
Iterating global reduction 4 with 2 rules applied. Total rules applied 286 place count 798 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 796 transition count 1036
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 291 place count 796 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 292 place count 795 transition count 1034
Iterating global reduction 5 with 1 rules applied. Total rules applied 293 place count 795 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 294 place count 794 transition count 1033
Iterating global reduction 5 with 1 rules applied. Total rules applied 295 place count 794 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 794 transition count 1032
Applied a total of 296 rules in 608 ms. Remains 794 /939 variables (removed 145) and now considering 1032/1183 (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-13668433465065635561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5889180886429745871.kers'
[2026-05-25 10:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13668433465065635561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5889180886429745871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1032 rows 794 cols 3250 entries
Finished phase 1 with 789 SingleSign rule and 0 generalized
[2026-05-25 10:52:18] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5889180886429745871.kers
Total runtime 7 ms.
[2026-05-25 10:52:19] [INFO ] Implicit Places using invariants in 512 ms returned []
[2026-05-25 10:52:19] [INFO ] Invariant cache hit.
[2026-05-25 10:52:20] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 1031 sub problems to find dead transitions.
[2026-05-25 10:52:20] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/1826 variables, and 0 constraints, problems are : Problem set: 0 solved, 1031 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 1031/1031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1031 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/1826 variables, and 0 constraints, problems are : Problem set: 0 solved, 1031 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/794 constraints, PredecessorRefiner: 0/1031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 1031 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in LTL mode, iteration 1 : 794/939 places, 1032/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62328 ms. Remains : 794/939 places, 1032/1183 transitions.
[2026-05-25 10:53:20] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:53:20] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:53:20] [INFO ] Input system was already deterministic with 1032 transitions.
[2026-05-25 10:53:20] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:53:20] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:53:20] [INFO ] Time to serialize gal into /tmp/CTLFireability17258647492999152377.gal : 4 ms
[2026-05-25 10:53:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14531465598099773180.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/CTLFireability17258647492999152377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14531465598099773180.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,9.6372e+09,24.666,482424,2,27693,5,1.46311e+06,6,0,4210,2.03749e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:53:50] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:53:50] [INFO ] Applying decomposition
[2026-05-25 10:53:50] [INFO ] Flatten gal took : 28 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/graph1751598531325792680.txt' '-o' '/tmp/graph1751598531325792680.bin' '-w' '/tmp/graph1751598531325792680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1751598531325792680.bin' '-l' '-1' '-v' '-w' '/tmp/graph1751598531325792680.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:53:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:53:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:53:51] [INFO ] Removed a total of 859 redundant transitions.
[2026-05-25 10:53:51] [INFO ] Flatten gal took : 44 ms
[2026-05-25 10:53:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 10:53:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11632350803294684638.gal : 6 ms
[2026-05-25 10:53:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2058980919034045151.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/CTLFireability11632350803294684638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2058980919034045151.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,9.6372e+09,4.7469,147840,2015,18,269843,960,1290,706031,49,2960,0


Converting to forward existential form...Done !
original formula: AG(!(E(((EG((i2.u168.p855==1)) * (i34.u308.p1164==1)) + EX((i9.i1.i2.u142.p500==1))) U EG((i32.u286.p1024==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,TRUE),((EG((i2.u168.p855==1)) * (i34.u308.p1164==1)) + EX((i9.i1.i2.u142.p500==1)))),(i32.u...178
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t248, t330, t386, t420, t509, t565, t598, t680, t736, t756, t757, t760, t763, t766...628
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
(forward)formula 0,0,28.3596,719340,1,0,1.2086e+06,960,11337,4.46396e+06,247,2960,2405028
FORMULA MedleyB-PT-B02-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 939/939 places, 1183/1183 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 913 transition count 1157
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 913 transition count 1157
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 893 transition count 1137
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 893 transition count 1137
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 106 place count 879 transition count 1123
Iterating global reduction 0 with 14 rules applied. Total rules applied 120 place count 879 transition count 1123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 879 transition count 1122
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 867 transition count 1110
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 867 transition count 1110
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 157 place count 855 transition count 1098
Iterating global reduction 1 with 12 rules applied. Total rules applied 169 place count 855 transition count 1098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 170 place count 855 transition count 1097
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 180 place count 845 transition count 1087
Iterating global reduction 2 with 10 rules applied. Total rules applied 190 place count 845 transition count 1087
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 845 transition count 1086
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 198 place count 838 transition count 1079
Iterating global reduction 3 with 7 rules applied. Total rules applied 205 place count 838 transition count 1079
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 211 place count 832 transition count 1073
Iterating global reduction 3 with 6 rules applied. Total rules applied 217 place count 832 transition count 1073
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 221 place count 828 transition count 1069
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 828 transition count 1069
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 228 place count 825 transition count 1066
Iterating global reduction 3 with 3 rules applied. Total rules applied 231 place count 825 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 233 place count 823 transition count 1064
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 823 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 237 place count 821 transition count 1062
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 821 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 241 place count 819 transition count 1060
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 819 transition count 1060
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 245 place count 817 transition count 1058
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 817 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 249 place count 815 transition count 1056
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 815 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 253 place count 813 transition count 1054
Iterating global reduction 3 with 2 rules applied. Total rules applied 255 place count 813 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 257 place count 811 transition count 1052
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 811 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 261 place count 809 transition count 1050
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 809 transition count 1050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 809 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 265 place count 808 transition count 1048
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 808 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 267 place count 807 transition count 1047
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 269 place count 807 transition count 1046
Applied a total of 269 rules in 563 ms. Remains 807 /939 variables (removed 132) and now considering 1046/1183 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6261713095812461879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17045998648935542357.kers'
[2026-05-25 10:54:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6261713095812461879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17045998648935542357.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1046 rows 807 cols 3280 entries
Finished phase 1 with 802 SingleSign rule and 0 generalized
[2026-05-25 10:54:20] [INFO ] Computed 5 invariants in 13 ms
Computed 5 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-17045998648935542357.kers
Total runtime 14 ms.
[2026-05-25 10:54:20] [INFO ] Implicit Places using invariants in 493 ms returned []
[2026-05-25 10:54:20] [INFO ] Invariant cache hit.
[2026-05-25 10:54:21] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
Running 1045 sub problems to find dead transitions.
[2026-05-25 10:54:21] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/806 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
SMT process timed out in 30244ms, After SMT, problems are : Problem set: 0 solved, 1045 unsolved
Search for dead transitions found 0 dead transitions in 30248ms
Starting structural reductions in LTL mode, iteration 1 : 807/939 places, 1046/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32282 ms. Remains : 807/939 places, 1046/1183 transitions.
[2026-05-25 10:54:52] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:54:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:54:52] [INFO ] Input system was already deterministic with 1046 transitions.
[2026-05-25 10:54:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:54:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4076169195867037999.gal : 3 ms
[2026-05-25 10:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7386422541944659400.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/CTLFireability4076169195867037999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7386422541944659400.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00441e+10,21.7946,454860,2,26373,5,1.38432e+06,6,0,4276,1.9403e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00441e+10,7.87413,206152,2352,15,352107,973,1312,1.12286e+06,47,3086,0


Converting to forward existential form...Done !
original formula: E((!((AX((AF((i15.u139.p502==1)) * (((i8.i1.i1.u142.p530==1)&&(i8.i1.i1.u326.p1225==1))||(i25.u226.p816==1)))) * AG((i32.i0.i1.u299.p1064...367
=> equivalent forward existential formula: [(FwdU(Init,(!((!(EX(!((!(EG(!((i15.u139.p502==1)))) * (((i8.i1.i1.u142.p530==1)&&(i8.i1.i1.u326.p1225==1))||(i2...485
Reverse transition relation is NOT exact ! Due to transitions t76, t164, t218, t221, t255, t341, t394, t397, t431, t520, t573, t576, t609, t747, t767, t768...608
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
[2026-05-25 10:55:52] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:55:52] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:55:52] [INFO ] Applying decomposition
[2026-05-25 10:55:52] [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/graph8779883962559074454.txt' '-o' '/tmp/graph8779883962559074454.bin' '-w' '/tmp/graph8779883962559074454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8779883962559074454.bin' '-l' '-1' '-v' '-w' '/tmp/graph8779883962559074454.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:55:52] [INFO ] Decomposing Gal with order
[2026-05-25 10:55:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:55:52] [INFO ] Removed a total of 883 redundant transitions.
[2026-05-25 10:55:52] [INFO ] Flatten gal took : 29 ms
[2026-05-25 10:55:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 10:55:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10019564876997034144.gal : 8 ms
[2026-05-25 10:55:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13841012923753546404.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/CTLFireability10019564876997034144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13841012923753546404.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42458e+10,13.5157,358752,2946,16,622015,1186,1409,1.89512e+06,54,4091,0


Converting to forward existential form...Done !
original formula: AF((EX(E(!(E((i2.u31.p78==1) U (i11.u75.p252==1))) U AX((i3.i0.i0.u38.p95==1)))) * (((i29.u275.p900==0) + EF((((i11.u37.p94==0)||(i11.u12...286
=> equivalent forward existential formula: [FwdG(Init,!((EX(E(!(E((i2.u31.p78==1) U (i11.u75.p252==1))) U !(EX(!((i3.i0.i0.u38.p95==1)))))) * (((i29.u275.p...343
Reverse transition relation is NOT exact ! Due to transitions t83, t141, t196, t251, t253, t293, t396, t397, t455, t456, t495, t600, t601, t658, t698, t794...525
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 11
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
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
(forward)formula 0,1,439.844,3129244,1,0,2.3971e+06,1186,5786,3.24713e+07,164,4091,2177363
FORMULA MedleyB-PT-B02-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(((A((E((((i11.u8.p27==1)&&(i11.u98.p373==1))&&((i11.u188.p651==1)&&(i11.u279.p975==1))) U (i36.u347.p1122==1)) * (i8.i0.i1.u83.p271==1...470
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(((!(!((E(!((i6.u58.p250==1)) U (!((i2.u34.p84==1)) * !((i6.u58.p250==1)))) + EG(!((i6.u58.p2...1101
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 11
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
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
(forward)formula 1,1,1319.62,5707128,1,0,4.29426e+06,1186,3373,6.88084e+07,105,4091,2737529
FORMULA MedleyB-PT-B02-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-25 11:24:39] [INFO ] Applying decomposition
[2026-05-25 11:24:39] [INFO ] Flatten gal took : 15 ms
[2026-05-25 11:24:39] [INFO ] Decomposing Gal with order
[2026-05-25 11:24:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:24:39] [INFO ] Removed a total of 752 redundant transitions.
[2026-05-25 11:24:39] [INFO ] Flatten gal took : 36 ms
[2026-05-25 11:24:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 263 labels/synchronizations in 5 ms.
[2026-05-25 11:24:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13128844320622345835.gal : 4 ms
[2026-05-25 11:24:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5221037113456019249.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/CTLFireability13128844320622345835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5221037113456019249.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42458e+10,2.74343,63900,112,6068,5490,129262,140,19262,1876,846603,0


Converting to forward existential form...Done !
original formula: AF(E(!((EF((i0.i0.u6.p878==1)) * !(((i0.i0.u6.p855==1)&&(i0.u7.p1032==1))))) U (EX(!(AG((i0.i0.i0.u4.p291==1)))) * (i0.i0.i0.u4.p182==1))...157
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(TRUE U (i0.i0.u6.p878==1)) * !(((i0.i0.u6.p855==1)&&(i0.u7.p1032==1))))) U (EX(!(!(E(TRUE U ...220
Reverse transition relation is NOT exact ! Due to transitions t914, i0.u7.t83, i0.u7.t133, i0.u7.t141, i0.u7.t194, i0.u7.t195, i0.u7.t196, i0.u7.t250, i0.u...793

BK_TIME_CONFINEMENT_REACHED

--------------------
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-B02"
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-B02, 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-177969020000290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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