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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K 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 MedleyA-PT-17-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779700691456

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:18:12] [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 09:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:18:13] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2026-05-25 09:18:13] [INFO ] Transformed 248 places.
[2026-05-25 09:18:13] [INFO ] Transformed 591 transitions.
[2026-05-25 09:18:13] [INFO ] Found NUPN structural information;
[2026-05-25 09:18:13] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 87 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 214 transition count 534
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 214 transition count 534
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 101 place count 214 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 213 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 213 transition count 499
Applied a total of 103 rules in 81 ms. Remains 213 /248 variables (removed 35) and now considering 499/589 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5618335466945293355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7836963825199713941.kers'
[2026-05-25 09:18:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5618335466945293355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7836963825199713941.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 499 rows 213 cols 2384 entries
Finished phase 1 with 205 SingleSign rule and 1 generalized
[2026-05-25 09:18:13] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7836963825199713941.kers
Total runtime 3 ms.
[2026-05-25 09:18:14] [INFO ] Implicit Places using invariants in 490 ms returned []
[2026-05-25 09:18:14] [INFO ] Invariant cache hit.
[2026-05-25 09:18:14] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2026-05-25 09:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 498 unsolved
SMT process timed out in 30555ms, After SMT, problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 30570ms
Starting structural reductions in LTL mode, iteration 1 : 213/248 places, 499/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31714 ms. Remains : 213/248 places, 499/589 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Applied a total of 0 rules in 4 ms. Remains 213 /213 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2026-05-25 09:18:45] [INFO ] Invariant cache hit.
[2026-05-25 09:18:45] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 09:18:45] [INFO ] Invariant cache hit.
[2026-05-25 09:18:45] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 213/213 places, 499/499 transitions.
Support contains 87 out of 213 places after structural reductions.
[2026-05-25 09:18:45] [INFO ] Flatten gal took : 79 ms
[2026-05-25 09:18:45] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:18:45] [INFO ] Input system was already deterministic with 499 transitions.
RANDOM walk for 40000 steps (1376 resets) in 1801 ms. (22 steps per ms) remains 56/62 properties
BEST_FIRST walk for 4003 steps (29 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (28 resets) in 62 ms. (63 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (28 resets) in 68 ms. (58 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (27 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (28 resets) in 71 ms. (55 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (26 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (30 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (31 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (32 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (26 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (30 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 39 ms. (100 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (30 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (29 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (30 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
[2026-05-25 09:18:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 130/213 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 49 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 8/15 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 4/19 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 3/22 constraints. Problems are: Problem set: 7 solved, 48 unsolved
SMT process timed out in 7767ms, After SMT, problems are : Problem set: 7 solved, 48 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 499/499 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 213 transition count 486
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 200 transition count 480
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 38 place count 194 transition count 480
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 38 place count 194 transition count 469
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 60 place count 183 transition count 469
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 179 transition count 462
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 179 transition count 462
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 88 place count 169 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 166 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 166 transition count 448
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 162 transition count 444
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 162 transition count 444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 160 transition count 451
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 127 place count 160 transition count 440
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 138 place count 149 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 149 transition count 439
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 144 place count 149 transition count 444
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 149 place count 144 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 144 transition count 444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 143 transition count 443
Applied a total of 151 rules in 134 ms. Remains 143 /213 variables (removed 70) and now considering 443/499 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 143/213 places, 443/499 transitions.
RANDOM walk for 40000 steps (2351 resets) in 353 ms. (112 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4002 steps (46 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (47 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4004 steps (49 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (43 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (51 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (48 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (49 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (40 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (48 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (46 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (48 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (36 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (48 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (49 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (50 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (48 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (49 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (47 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
Interrupted probabilistic random walk after 508096 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :21 out of 44
Probabilistic random walk after 508096 steps, saw 90630 distinct states, run finished after 3011 ms. (steps per millisecond=168 ) properties seen :21
[2026-05-25 09:18:58] [INFO ] Flow matrix only has 425 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15545424765108940754.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6493310234965936110.kers'
[2026-05-25 09:18:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15545424765108940754.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6493310234965936110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 143 cols 2235 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-25 09:18:58] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6493310234965936110.kers
Total runtime 2 ms.
[2026-05-25 09:18:58] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 96/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 425/568 variables, 143/157 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 12/169 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/568 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 171 constraints, problems are : Problem set: 1 solved, 22 unsolved in 3727 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 101/143 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 425/568 variables, 143/163 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 12/175 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 18/193 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 193 constraints, problems are : Problem set: 5 solved, 18 unsolved in 45045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 18/23 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48801ms problems are : Problem set: 5 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 443/443 transitions.
Graph (trivial) has 65 edges and 143 vertex of which 4 / 143 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 433
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 135 transition count 433
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 135 transition count 426
Deduced a syphon composed of 7 places in 13 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 128 transition count 426
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 41 place count 114 transition count 401
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 114 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 55 place count 114 transition count 400
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 113 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 112 transition count 384
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 112 transition count 384
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 107 transition count 379
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 106 transition count 376
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 106 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 105 transition count 377
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 105 transition count 374
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 103 transition count 377
Free-agglomeration rule applied 15 times with reduction of 3 identical transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 95 place count 103 transition count 359
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 119 place count 88 transition count 350
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 86 transition count 343
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 86 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 86 transition count 342
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 86 transition count 347
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 130 place count 84 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 84 transition count 342
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 83 transition count 341
Applied a total of 134 rules in 152 ms. Remains 83 /143 variables (removed 60) and now considering 341/443 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 83/143 places, 341/443 transitions.
RANDOM walk for 40000 steps (3993 resets) in 930 ms. (42 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (73 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (73 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (76 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (76 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (82 resets) in 6 ms. (571 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (73 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (74 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (79 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (76 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (76 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (75 resets) in 6 ms. (572 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (74 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (82 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (78 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (74 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (74 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (81 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (55 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 867489 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :17 out of 18
Probabilistic random walk after 867489 steps, saw 166940 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :17
[2026-05-25 09:19:50] [INFO ] Flow matrix only has 303 transitions (discarded 38 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5144835316793973884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8348619295178746672.kers'
[2026-05-25 09:19:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5144835316793973884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8348619295178746672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 83 cols 1694 entries
Finished phase 1 with 75 SingleSign rule and 1 generalized
[2026-05-25 09:19:50] [INFO ] Computed 7 invariants in 14 ms
Computed 7 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8348619295178746672.kers
Total runtime 14 ms.
[2026-05-25 09:19:50] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 274/339 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/386 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 274/339 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 47/386 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 18/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 341/341 transitions.
Graph (trivial) has 60 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 82 transition count 334
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 77 transition count 334
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 19 place count 73 transition count 346
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 73 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 73 transition count 339
Free-agglomeration rule applied 15 times with reduction of 4 identical transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 41 place count 73 transition count 320
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 89 place count 58 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 56 transition count 285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 54 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 114 place count 54 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 53 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 52 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 52 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 51 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 51 transition count 268
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 51 transition count 364
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 48 transition count 364
Applied a total of 130 rules in 68 ms. Remains 48 /83 variables (removed 35) and now considering 364/341 (removed -23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 48/83 places, 364/341 transitions.
RANDOM walk for 40000 steps (5889 resets) in 597 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (6664 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2062 steps, run visited all 1 properties in 12 ms. (steps per millisecond=171 )
Probabilistic random walk after 2062 steps, saw 813 distinct states, run finished after 16 ms. (steps per millisecond=128 ) properties seen :1
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:19:51] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:19:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:19:51] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:19:51] [INFO ] Input system was already deterministic with 499 transitions.
Support contains 68 out of 213 places (down from 72) after GAL structural reductions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Graph (trivial) has 225 edges and 213 vertex of which 9 / 213 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 206 transition count 464
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 178 transition count 464
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 57 place count 178 transition count 447
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 91 place count 161 transition count 447
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 111 place count 141 transition count 411
Iterating global reduction 2 with 20 rules applied. Total rules applied 131 place count 141 transition count 411
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 131 place count 141 transition count 408
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 138 transition count 408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 137 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 137 transition count 392
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 167 place count 123 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 123 transition count 377
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 122 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 122 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 122 transition count 367
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 186 place count 118 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 117 transition count 362
Applied a total of 187 rules in 63 ms. Remains 117 /213 variables (removed 96) and now considering 362/499 (removed 137) transitions.
[2026-05-25 09:19:51] [INFO ] Flow matrix only has 360 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8876102643506487194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6828805417770126649.kers'
[2026-05-25 09:19:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8876102643506487194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6828805417770126649.kers]
Normalized transition count is 359 out of 360 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 117 cols 1718 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 09:19:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6828805417770126649.kers
Total runtime 2 ms.
[2026-05-25 09:19:51] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:19:51] [INFO ] Flow matrix only has 360 transitions (discarded 2 similar events)
[2026-05-25 09:19:51] [INFO ] Invariant cache hit.
[2026-05-25 09:19:51] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:19:51] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2026-05-25 09:19:51] [INFO ] Redundant transitions in 33 ms returned []
Running 353 sub problems to find dead transitions.
[2026-05-25 09:19:51] [INFO ] Flow matrix only has 360 transitions (discarded 2 similar events)
[2026-05-25 09:19:51] [INFO ] Invariant cache hit.
[2026-05-25 09:19:51] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 359/476 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 64/203 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (OVERLAPS) 1/477 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 3 (OVERLAPS) 359/476 variables, 117/139 constraints. Problems are: Problem set: 42 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 64/203 constraints. Problems are: Problem set: 42 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 311/514 constraints. Problems are: Problem set: 42 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/477 variables, and 514 constraints, problems are : Problem set: 42 solved, 311 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 311/353 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 42 solved, 311 unsolved
Search for dead transitions found 42 dead transitions in 60196ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/213 places, 320/499 transitions.
Applied a total of 0 rules in 16 ms. Remains 117 /117 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2026-05-25 09:20:52] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60651 ms. Remains : 117/213 places, 320/499 transitions.
[2026-05-25 09:20:52] [INFO ] Flatten gal took : 31 ms
[2026-05-25 09:20:52] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:20:52] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-25 09:20:52] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:20:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:20:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10156386062221947619.gal : 10 ms
[2026-05-25 09:20:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6102536679517360977.ctl : 4 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/CTLFireability10156386062221947619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6102536679517360977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF(((p64==0)&&((p96==0)||(p166==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p64==0)&&((p96==0)||(p166==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t11, t12, t17, t18, t19, t22, t28, t31, t37, t39, t41, t43, t44, t45, t50, t...614
(forward)formula 0,1,24.3294,624008,1,0,644,2.62733e+06,662,304,8563,1.71358e+06,656
FORMULA MedleyA-PT-17-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Graph (trivial) has 212 edges and 213 vertex of which 9 / 213 are part of one of the 3 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 206 transition count 465
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 179 transition count 465
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 55 place count 179 transition count 448
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 162 transition count 448
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 109 place count 142 transition count 412
Iterating global reduction 2 with 20 rules applied. Total rules applied 129 place count 142 transition count 412
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 129 place count 142 transition count 409
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 135 place count 139 transition count 409
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 137 transition count 381
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 137 transition count 381
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 167 place count 123 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 123 transition count 366
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 122 transition count 364
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 122 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 179 place count 122 transition count 355
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 187 place count 118 transition count 351
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 118 transition count 351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 117 transition count 350
Applied a total of 189 rules in 112 ms. Remains 117 /213 variables (removed 96) and now considering 350/499 (removed 149) transitions.
[2026-05-25 09:21:16] [INFO ] Flow matrix only has 348 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12915372663322795705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9733842264150879525.kers'
[2026-05-25 09:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12915372663322795705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9733842264150879525.kers]
Normalized transition count is 347 out of 348 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 347 rows 117 cols 1598 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 09:21:16] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9733842264150879525.kers
Total runtime 12 ms.
[2026-05-25 09:21:17] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:21:17] [INFO ] Flow matrix only has 348 transitions (discarded 2 similar events)
[2026-05-25 09:21:17] [INFO ] Invariant cache hit.
[2026-05-25 09:21:17] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:21:17] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2026-05-25 09:21:17] [INFO ] Redundant transitions in 6 ms returned []
Running 341 sub problems to find dead transitions.
[2026-05-25 09:21:17] [INFO ] Flow matrix only has 348 transitions (discarded 2 similar events)
[2026-05-25 09:21:17] [INFO ] Invariant cache hit.
[2026-05-25 09:21:17] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (OVERLAPS) 347/464 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 64/203 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 1/465 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 205 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 3 (OVERLAPS) 347/464 variables, 117/140 constraints. Problems are: Problem set: 36 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 64/204 constraints. Problems are: Problem set: 36 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 305/509 constraints. Problems are: Problem set: 36 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/510 constraints. Problems are: Problem set: 36 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/465 variables, and 510 constraints, problems are : Problem set: 36 solved, 305 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 305/341 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 36 solved, 305 unsolved
Search for dead transitions found 36 dead transitions in 60153ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/213 places, 314/499 transitions.
Applied a total of 0 rules in 14 ms. Remains 117 /117 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-25 09:22:17] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60740 ms. Remains : 117/213 places, 314/499 transitions.
[2026-05-25 09:22:17] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:22:17] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:22:17] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-25 09:22:17] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:22:17] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:22:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11529368462317997124.gal : 3 ms
[2026-05-25 09:22:17] [INFO ] Time to serialize properties into /tmp/CTLFireability225325739343485111.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/CTLFireability11529368462317997124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability225325739343485111.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,2.44022e+06,3.75362,94180,2,23050,5,275284,6,0,782,273359,0


Converting to forward existential form...Done !
original formula: AG(AF(((p120==1) + !(A(!(((p93==1)&&(p167==1))) U (p49!=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p120==1) + !(!((E(!((p49!=1)) U (!(!(((p93==1)&&(p167==1)))) * !((p49!=1)))) + EG(!((p...178
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t11, t12, t17, t18, t19, t22, t28, t31, t37, t39, t41, t43, t44, t45, t50, t...584
(forward)formula 0,0,18.032,392380,1,0,686,1.69186e+06,656,323,8009,1.39022e+06,715
FORMULA MedleyA-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 191 transition count 461
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 191 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 190 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 190 transition count 458
Applied a total of 47 rules in 6 ms. Remains 190 /213 variables (removed 23) and now considering 458/499 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9690786121474863478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6802970523918563176.kers'
[2026-05-25 09:22:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9690786121474863478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6802970523918563176.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:22:35] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6802970523918563176.kers
Total runtime 7 ms.
[2026-05-25 09:22:35] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-25 09:22:35] [INFO ] Invariant cache hit.
[2026-05-25 09:22:36] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:22:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 52 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 6 (OVERLAPS) 458/648 variables, 190/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 407/653 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60207ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/213 places, 408/499 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60648 ms. Remains : 190/213 places, 408/499 transitions.
[2026-05-25 09:23:36] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:23:36] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:23:36] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-25 09:23:36] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:23:36] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:23:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9737385376415390280.gal : 3 ms
[2026-05-25 09:23:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12685833832136928747.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/CTLFireability9737385376415390280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12685833832136928747.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.
Detected timeout of ITS tools.
[2026-05-25 09:24:06] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:24:06] [INFO ] Applying decomposition
[2026-05-25 09:24:06] [INFO ] Flatten gal took : 47 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/graph17304628130043009665.txt' '-o' '/tmp/graph17304628130043009665.bin' '-w' '/tmp/graph17304628130043009665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17304628130043009665.bin' '-l' '-1' '-v' '-w' '/tmp/graph17304628130043009665.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:24:06] [INFO ] Decomposing Gal with order
[2026-05-25 09:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:24:07] [INFO ] Removed a total of 937 redundant transitions.
[2026-05-25 09:24:07] [INFO ] Flatten gal took : 152 ms
[2026-05-25 09:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 17 ms.
[2026-05-25 09:24:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2540081987144537883.gal : 6 ms
[2026-05-25 09:24:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17071297600987753217.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/CTLFireability2540081987144537883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17071297600987753217.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,2.81198e+07,1.68012,56484,2438,52,105793,564,937,247983,90,1350,0


Converting to forward existential form...Done !
original formula: EG(!(E(AX(AG(((i3.u8.p43==1)&&(i3.u29.p124==1)))) U (((i0.u1.p108!=1)&&((i7.i0.i1.u58.p228==1)||(((i0.u5.p27==1)&&(i0.u16.p79==1))&&((i7....297
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EX(!(!(E(TRUE U !(((i3.u8.p43==1)&&(i3.u29.p124==1)))))))) U (((i0.u1.p108!=1)&&((i7.i0.i1.u58....364
Reverse transition relation is NOT exact ! Due to transitions t48, t56, t61, t112, t164, t172, t180, t186, t188, t212, t214, t220, t222, t244, t246, t252, ...974
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
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
(forward)formula 0,0,18.9504,624632,1,0,950969,1465,6648,4.64364e+06,445,5195,1770327
FORMULA MedleyA-PT-17-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 192 transition count 462
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 192 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 192 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 191 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 191 transition count 459
Applied a total of 45 rules in 14 ms. Remains 191 /213 variables (removed 22) and now considering 459/499 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17351024659105822067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13992209917874998495.kers'
[2026-05-25 09:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17351024659105822067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13992209917874998495.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 459 rows 191 cols 2300 entries
Finished phase 1 with 183 SingleSign rule and 1 generalized
[2026-05-25 09:24:26] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13992209917874998495.kers
Total runtime 6 ms.
[2026-05-25 09:24:26] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 09:24:26] [INFO ] Invariant cache hit.
[2026-05-25 09:24:26] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2026-05-25 09:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/650 variables, and 51 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 8 (OVERLAPS) 459/650 variables, 191/249 constraints. Problems are: Problem set: 50 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 408/657 constraints. Problems are: Problem set: 50 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 657 constraints, problems are : Problem set: 50 solved, 408 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 408/458 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 50 solved, 408 unsolved
Search for dead transitions found 50 dead transitions in 60225ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/213 places, 409/499 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60813 ms. Remains : 191/213 places, 409/499 transitions.
[2026-05-25 09:25:27] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:25:27] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:25:27] [INFO ] Input system was already deterministic with 409 transitions.
[2026-05-25 09:25:27] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:25:27] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:25:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15518692319534730190.gal : 3 ms
[2026-05-25 09:25:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9562864321861773609.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/CTLFireability15518692319534730190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9562864321861773609.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.
Detected timeout of ITS tools.
[2026-05-25 09:25:57] [INFO ] Flatten gal took : 31 ms
[2026-05-25 09:25:57] [INFO ] Applying decomposition
[2026-05-25 09:25:57] [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/graph14783719421196965573.txt' '-o' '/tmp/graph14783719421196965573.bin' '-w' '/tmp/graph14783719421196965573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14783719421196965573.bin' '-l' '-1' '-v' '-w' '/tmp/graph14783719421196965573.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:25:57] [INFO ] Decomposing Gal with order
[2026-05-25 09:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:25:57] [INFO ] Removed a total of 929 redundant transitions.
[2026-05-25 09:25:57] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:25:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 11 ms.
[2026-05-25 09:25:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13664502540428936019.gal : 4 ms
[2026-05-25 09:25:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10269758739811726985.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/CTLFireability13664502540428936019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10269758739811726985.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.95443e+07,2.76924,81524,1948,50,171458,1170,866,343485,90,3343,0


Converting to forward existential form...Done !
original formula: EF((AX(((i8.u12.p60==1)&&((i0.u25.p172==0)||(i9.i1.u53.p204==0)))) + EG(((((u5.p16==0)||(i7.u10.p50==0))||((i8.u13.p65==0)||(i7.u24.p103=...182
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(((i8.u12.p60==1)&&((i0.u25.p172==0)||(i9.i1.u53.p204==0)))))))] != FALSE + [FwdG(Fwd...269
Reverse transition relation is NOT exact ! Due to transitions t10, t12, t65, t77, t94, t165, t171, t173, t181, t187, t189, t214, t215, t222, t223, t246, t2...1060
(forward)formula 0,1,4.08553,81524,1,0,171458,1170,5109,444276,388,3343,278894
FORMULA MedleyA-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 191 transition count 461
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 191 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 190 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 190 transition count 458
Applied a total of 47 rules in 13 ms. Remains 190 /213 variables (removed 23) and now considering 458/499 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-620557554482669628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-182751038963310661.kers'
[2026-05-25 09:26:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-620557554482669628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-182751038963310661.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:26:01] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-182751038963310661.kers
Total runtime 8 ms.
[2026-05-25 09:26:01] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 09:26:01] [INFO ] Invariant cache hit.
[2026-05-25 09:26:02] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:26:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 458/648 variables, 190/232 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 232 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 8 (OVERLAPS) 458/648 variables, 190/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 407/653 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60233ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60234ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/213 places, 408/499 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60760 ms. Remains : 190/213 places, 408/499 transitions.
[2026-05-25 09:27:02] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:27:02] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:27:02] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-25 09:27:02] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:27:02] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:27:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3248844566464691491.gal : 3 ms
[2026-05-25 09:27:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7120151273904968030.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/CTLFireability3248844566464691491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7120151273904968030.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.
Detected timeout of ITS tools.
[2026-05-25 09:27:32] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:27:32] [INFO ] Applying decomposition
[2026-05-25 09:27:32] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17219485193900368169.txt' '-o' '/tmp/graph17219485193900368169.bin' '-w' '/tmp/graph17219485193900368169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17219485193900368169.bin' '-l' '-1' '-v' '-w' '/tmp/graph17219485193900368169.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:27:32] [INFO ] Decomposing Gal with order
[2026-05-25 09:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:27:32] [INFO ] Removed a total of 940 redundant transitions.
[2026-05-25 09:27:32] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2026-05-25 09:27:32] [INFO ] Time to serialize gal into /tmp/CTLFireability956237217130824278.gal : 3 ms
[2026-05-25 09:27:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4451209695852620986.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/CTLFireability956237217130824278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4451209695852620986.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.89613e+07,1.29635,47088,2090,45,90041,564,765,178607,83,1266,0


Converting to forward existential form...Done !
original formula: (AG(AF(((((i0.u2.p21==0)||(i0.u24.p105==0))||((i0.u42.p170==0)||(i0.u61.p242==0)))&&(((i0.u9.p52==0)||(i2.u21.p97==0))||((i7.u60.p235==0)...280
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((((i0.u2.p21==0)||(i0.u24.p105==0))||((i0.u42.p170==0)||(i0.u61.p242==0)))&&(((i0.u9.p...354
Reverse transition relation is NOT exact ! Due to transitions t59, t93, t97, t110, t164, t172, t180, t186, t188, t214, t222, t246, t254, t259, t260, t267, ...980
(forward)formula 0,0,1.93027,49968,1,0,99635,653,5441,178607,406,1898,298057
FORMULA MedleyA-PT-17-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Graph (trivial) has 229 edges and 213 vertex of which 9 / 213 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 206 transition count 464
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 178 transition count 464
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 57 place count 178 transition count 448
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 89 place count 162 transition count 448
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 110 place count 141 transition count 410
Iterating global reduction 2 with 21 rules applied. Total rules applied 131 place count 141 transition count 410
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 131 place count 141 transition count 407
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 138 transition count 407
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 136 transition count 379
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 136 transition count 379
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 169 place count 122 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 122 transition count 364
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 121 transition count 362
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 180 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 188 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 116 transition count 349
Applied a total of 189 rules in 81 ms. Remains 116 /213 variables (removed 97) and now considering 349/499 (removed 150) transitions.
[2026-05-25 09:27:34] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13608262749862723549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6295126429843739801.kers'
[2026-05-25 09:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13608262749862723549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6295126429843739801.kers]
Normalized transition count is 346 out of 347 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 116 cols 1596 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-25 09:27:34] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6295126429843739801.kers
Total runtime 5 ms.
[2026-05-25 09:27:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 09:27:34] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2026-05-25 09:27:34] [INFO ] Invariant cache hit.
[2026-05-25 09:27:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:27:35] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2026-05-25 09:27:35] [INFO ] Redundant transitions in 6 ms returned []
Running 340 sub problems to find dead transitions.
[2026-05-25 09:27:35] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2026-05-25 09:27:35] [INFO ] Invariant cache hit.
[2026-05-25 09:27:35] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 346/462 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/200 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 1/463 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 201 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/136 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/200 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 304/504 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 2/506 constraints. Problems are: Problem set: 36 solved, 304 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 462/463 variables, and 506 constraints, problems are : Problem set: 36 solved, 304 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 304/340 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 36 solved, 304 unsolved
Search for dead transitions found 36 dead transitions in 60188ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/213 places, 313/499 transitions.
Applied a total of 0 rules in 39 ms. Remains 116 /116 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-25 09:28:35] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60707 ms. Remains : 116/213 places, 313/499 transitions.
[2026-05-25 09:28:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:28:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:28:35] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 09:28:35] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:28:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:28:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13312880226369618490.gal : 2 ms
[2026-05-25 09:28:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16179283797456821794.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13312880226369618490.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16179283797456821794.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (7457 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality16179283797456821794.prop.
BEST_FIRST walk for 40002 steps (1385 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 124
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124 after 206
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :206 after 300
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :300 after 1776
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1776 after 3632
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3632 after 7044
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7044 after 22824
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :22824 after 79403
Finished probabilistic random walk after 1755982 steps, run visited all 1 properties in 2798 ms. (steps per millisecond=627 )
Probabilistic random walk after 1755982 steps, saw 318573 distinct states, run finished after 2799 ms. (steps per millisecond=627 ) properties seen :1
FORMULA MedleyA-PT-17-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 194 transition count 466
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 194 transition count 466
Applied a total of 38 rules in 3 ms. Remains 194 /213 variables (removed 19) and now considering 466/499 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11165652468515339912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4585725584760043651.kers'
[2026-05-25 09:28:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11165652468515339912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4585725584760043651.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 466 rows 194 cols 2314 entries
Finished phase 1 with 186 SingleSign rule and 1 generalized
[2026-05-25 09:28:38] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4585725584760043651.kers
Total runtime 6 ms.
[2026-05-25 09:28:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 09:28:38] [INFO ] Invariant cache hit.
[2026-05-25 09:28:38] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2026-05-25 09:28:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/660 variables, and 48 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/194 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 5 (OVERLAPS) 466/660 variables, 194/248 constraints. Problems are: Problem set: 50 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 415/663 constraints. Problems are: Problem set: 50 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/660 variables, and 663 constraints, problems are : Problem set: 50 solved, 415 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 415/465 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 50 solved, 415 unsolved
Search for dead transitions found 50 dead transitions in 60213ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 194/213 places, 416/499 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60753 ms. Remains : 194/213 places, 416/499 transitions.
[2026-05-25 09:29:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:29:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:29:39] [INFO ] Input system was already deterministic with 416 transitions.
[2026-05-25 09:29:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:29:39] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:29:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3385860761993518689.gal : 2 ms
[2026-05-25 09:29:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5723023783757474545.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/CTLFireability3385860761993518689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5723023783757474545.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.
Detected timeout of ITS tools.
[2026-05-25 09:30:09] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:30:09] [INFO ] Applying decomposition
[2026-05-25 09:30:09] [INFO ] Flatten gal took : 17 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/graph17304391293165167426.txt' '-o' '/tmp/graph17304391293165167426.bin' '-w' '/tmp/graph17304391293165167426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17304391293165167426.bin' '-l' '-1' '-v' '-w' '/tmp/graph17304391293165167426.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:30:09] [INFO ] Decomposing Gal with order
[2026-05-25 09:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:30:09] [INFO ] Removed a total of 957 redundant transitions.
[2026-05-25 09:30:09] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 10 ms.
[2026-05-25 09:30:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2473751211747700307.gal : 4 ms
[2026-05-25 09:30:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13898801029353813527.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/CTLFireability2473751211747700307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13898801029353813527.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,3.05792e+07,2.7813,83032,3086,52,129838,711,1049,493358,85,2471,0


Converting to forward existential form...Done !
original formula: EX((((EF((i1.u17.p72==1)) * AX((i0.i1.u26.p104!=1))) * (EF(((((i0.i0.u6.p28!=1)||(i5.u9.p39!=1))||((i1.u16.p70!=1)||(i0.i1.u26.p106!=1)))...224
=> equivalent forward existential formula: [(FwdU((((EY(Init) * (i0.i1.u7.p22!=1)) * (E(TRUE U (i1.u17.p72==1)) * !(EX(!((i0.i1.u26.p104!=1)))))) * (i4.i0....288
Reverse transition relation is NOT exact ! Due to transitions t45, t51, t54, t71, t78, t95, t170, t176, t178, t188, t196, t222, t230, t254, t262, t267, t26...1188
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 191 transition count 461
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 191 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 190 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 190 transition count 458
Applied a total of 47 rules in 13 ms. Remains 190 /213 variables (removed 23) and now considering 458/499 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7768379269070253855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17823220065939818823.kers'
[2026-05-25 09:30:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7768379269070253855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17823220065939818823.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:30:39] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17823220065939818823.kers
Total runtime 6 ms.
[2026-05-25 09:30:39] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-25 09:30:39] [INFO ] Invariant cache hit.
[2026-05-25 09:30:40] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:30:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 52 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/244 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 407/651 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 651 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60150ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/213 places, 408/499 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60775 ms. Remains : 190/213 places, 408/499 transitions.
[2026-05-25 09:31:40] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:31:40] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:31:40] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-25 09:31:40] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:31:40] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:31:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3078719923937233870.gal : 2 ms
[2026-05-25 09:31:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14476835558630693775.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/CTLFireability3078719923937233870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14476835558630693775.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.
Detected timeout of ITS tools.
[2026-05-25 09:32:10] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:32:10] [INFO ] Applying decomposition
[2026-05-25 09:32:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17771448859154797495.txt' '-o' '/tmp/graph17771448859154797495.bin' '-w' '/tmp/graph17771448859154797495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17771448859154797495.bin' '-l' '-1' '-v' '-w' '/tmp/graph17771448859154797495.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:32:10] [INFO ] Decomposing Gal with order
[2026-05-25 09:32:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:32:10] [INFO ] Removed a total of 921 redundant transitions.
[2026-05-25 09:32:10] [INFO ] Flatten gal took : 32 ms
[2026-05-25 09:32:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 16 ms.
[2026-05-25 09:32:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9638305597566463568.gal : 2 ms
[2026-05-25 09:32:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7574409752586284551.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/CTLFireability9638305597566463568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7574409752586284551.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,2.89275e+07,2.87245,116640,2028,56,214465,1230,810,663840,90,3623,0


Converting to forward existential form...Done !
original formula: AX(AG(E((EX(((i1.u12.p67==1)&&(i5.u39.p167==1))) + !(EF((i2.u21.p95==1)))) U AG(((i4.u4.p14==1)&&(i5.u39.p113==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E((EX(((i1.u12.p67==1)&&(i5.u39.p167==1))) + !(E(TRUE U (i2.u21.p95==1)))) U !(E(TRUE ...208
Reverse transition relation is NOT exact ! Due to transitions t54, t107, t115, t164, t170, t172, t180, t188, t213, t221, t245, t253, t259, t260, t267, t268...972
(forward)formula 0,0,25.6544,881824,1,0,871947,1990,6612,8.12489e+06,497,6702,1966033
FORMULA MedleyA-PT-17-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 190 transition count 459
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 190 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 190 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 189 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 189 transition count 456
Applied a total of 49 rules in 5 ms. Remains 189 /213 variables (removed 24) and now considering 456/499 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-742802276003342111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13968347837856884022.kers'
[2026-05-25 09:32:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-742802276003342111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13968347837856884022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:32:36] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13968347837856884022.kers
Total runtime 3 ms.
[2026-05-25 09:32:36] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-25 09:32:36] [INFO ] Invariant cache hit.
[2026-05-25 09:32:37] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:32:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/231 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 231 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/241 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/646 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 646 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60216ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/213 places, 406/499 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60690 ms. Remains : 189/213 places, 406/499 transitions.
[2026-05-25 09:33:37] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:33:37] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:33:37] [INFO ] Input system was already deterministic with 406 transitions.
[2026-05-25 09:33:37] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:33:37] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:33:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6443205351635375040.gal : 3 ms
[2026-05-25 09:33:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3939739908885992315.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/CTLFireability6443205351635375040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3939739908885992315.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.
Detected timeout of ITS tools.
[2026-05-25 09:34:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:34:07] [INFO ] Applying decomposition
[2026-05-25 09:34:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15237664270254784628.txt' '-o' '/tmp/graph15237664270254784628.bin' '-w' '/tmp/graph15237664270254784628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15237664270254784628.bin' '-l' '-1' '-v' '-w' '/tmp/graph15237664270254784628.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:34:07] [INFO ] Decomposing Gal with order
[2026-05-25 09:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:34:07] [INFO ] Removed a total of 935 redundant transitions.
[2026-05-25 09:34:07] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2026-05-25 09:34:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17075243205348571348.gal : 2 ms
[2026-05-25 09:34:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11954634661476973582.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/CTLFireability17075243205348571348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11954634661476973582.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,1.74454,70884,2157,37,124516,537,788,387268,82,1327,0


Converting to forward existential form...Done !
original formula: EX(!(E(!(AG((i2.u16.p80==1))) U (EX((((i2.u5.p27==1)&&(i1.u13.p71==1))&&((i6.u46.p232==1)&&(i2.u59.p242==1)))) + (((i2.u2.p21==1)&&(i2.u2...209
=> equivalent forward existential formula: [(EY(Init) * !(E(!(!(E(TRUE U !((i2.u16.p80==1))))) U (EX((((i2.u5.p27==1)&&(i1.u13.p71==1))&&((i6.u46.p232==1)&...266
Reverse transition relation is NOT exact ! Due to transitions t28, t37, t115, t162, t168, t170, t178, t184, t186, t210, t218, t242, t250, t257, t258, t265,...891
(forward)formula 0,0,26.2819,1064364,1,0,1.06724e+06,1018,5891,1.02942e+07,394,3229,2066251
FORMULA MedleyA-PT-17-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 194 transition count 465
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 194 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 194 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 193 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 193 transition count 462
Applied a total of 41 rules in 14 ms. Remains 193 /213 variables (removed 20) and now considering 462/499 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2570036265389846044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11350117216738597075.kers'
[2026-05-25 09:34:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2570036265389846044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11350117216738597075.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 193 cols 2306 entries
Finished phase 1 with 185 SingleSign rule and 1 generalized
[2026-05-25 09:34:34] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11350117216738597075.kers
Total runtime 3 ms.
[2026-05-25 09:34:34] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 09:34:34] [INFO ] Invariant cache hit.
[2026-05-25 09:34:34] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:34:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/655 variables, and 49 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/193 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
At refinement iteration 8 (OVERLAPS) 462/655 variables, 193/253 constraints. Problems are: Problem set: 33 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 681 constraints, problems are : Problem set: 33 solved, 428 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 428/461 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60329ms problems are : Problem set: 33 solved, 428 unsolved
Search for dead transitions found 33 dead transitions in 60331ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/213 places, 429/499 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60788 ms. Remains : 193/213 places, 429/499 transitions.
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:35:34] [INFO ] Input system was already deterministic with 429 transitions.
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:35:34] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9061415874388233223.gal : 2 ms
[2026-05-25 09:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15619514109009164687.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/CTLFireability9061415874388233223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15619514109009164687.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.
Detected timeout of ITS tools.
[2026-05-25 09:36:05] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:36:05] [INFO ] Applying decomposition
[2026-05-25 09:36:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17373944330412775737.txt' '-o' '/tmp/graph17373944330412775737.bin' '-w' '/tmp/graph17373944330412775737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17373944330412775737.bin' '-l' '-1' '-v' '-w' '/tmp/graph17373944330412775737.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:36:05] [INFO ] Decomposing Gal with order
[2026-05-25 09:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:36:05] [INFO ] Removed a total of 1046 redundant transitions.
[2026-05-25 09:36:05] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 5 ms.
[2026-05-25 09:36:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11758927811459266800.gal : 3 ms
[2026-05-25 09:36:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14633076456351501759.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/CTLFireability11758927811459266800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14633076456351501759.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,3.18916e+07,1.33152,54272,2664,45,112716,858,942,194829,91,2478,0


Converting to forward existential form...Done !
original formula: AX((EF(((!(E((i0.i1.u62.p236==1) U (((i2.i0.u11.p52==1)&&(i2.i0.u19.p79==1))&&((i11.i1.u57.p232==1)&&(i2.i0.u64.p242==1))))) * EG((((i2.i...634
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(E(TRUE U ((!(E((i0.i1.u62.p236==1) U (((i2.i0.u11.p52==1)&&(i2.i0.u19.p79==1))&&((i11.i1.u...1495
Reverse transition relation is NOT exact ! Due to transitions t11, t13, t16, t48, t56, t78, t84, t99, t166, t176, t178, t184, t190, t192, t211, t212, t215,...1174
Fast SCC detection found an SCC at level 1
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 191 transition count 461
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 191 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 191 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 190 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 190 transition count 458
Applied a total of 47 rules in 5 ms. Remains 190 /213 variables (removed 23) and now considering 458/499 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14716337070876888325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-428822535408412832.kers'
[2026-05-25 09:36:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14716337070876888325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-428822535408412832.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:36:35] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-428822535408412832.kers
Total runtime 2 ms.
[2026-05-25 09:36:35] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-25 09:36:35] [INFO ] Invariant cache hit.
[2026-05-25 09:36:35] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 457 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Starting structural reductions in LTL mode, iteration 1 : 190/213 places, 458/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30704 ms. Remains : 190/213 places, 458/499 transitions.
[2026-05-25 09:37:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:37:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:37:05] [INFO ] Input system was already deterministic with 458 transitions.
[2026-05-25 09:37:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:37:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14933427755570751866.gal : 2 ms
[2026-05-25 09:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7602618862787331650.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/CTLFireability14933427755570751866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7602618862787331650.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.
Detected timeout of ITS tools.
[2026-05-25 09:37:36] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:37:36] [INFO ] Applying decomposition
[2026-05-25 09:37:36] [INFO ] Flatten gal took : 11 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/graph4254136661568461197.txt' '-o' '/tmp/graph4254136661568461197.bin' '-w' '/tmp/graph4254136661568461197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4254136661568461197.bin' '-l' '-1' '-v' '-w' '/tmp/graph4254136661568461197.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:37:36] [INFO ] Decomposing Gal with order
[2026-05-25 09:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:37:36] [INFO ] Removed a total of 1080 redundant transitions.
[2026-05-25 09:37:36] [INFO ] Flatten gal took : 24 ms
[2026-05-25 09:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2026-05-25 09:37:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10692998227744434807.gal : 3 ms
[2026-05-25 09:37:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4264297667705341223.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/CTLFireability10692998227744434807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4264297667705341223.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,2.95505e+07,19.4848,342576,4973,524,213786,9100,1083,3.27508e+06,167,37431,0


Converting to forward existential form...Done !
original formula: ((EX(AG((!(A((((i3.u7.p46==1)&&(i2.u20.p105==1))&&((i9.i1.i1.u52.p232==1)&&(i3.u59.p242==1))) U ((u4.p18==1)&&(i4.u26.p124==1)))) * !(E((...336
=> equivalent forward existential formula: (([(Init * !(EX(!(E(TRUE U !((!(!((E(!(((u4.p18==1)&&(i4.u26.p124==1))) U (!((((i3.u7.p46==1)&&(i2.u20.p105==1))...528
Reverse transition relation is NOT exact ! Due to transitions t51, t76, t93, t138, t168, t170, t172, t180, t186, t189, t190, t212, t214, t220, t222, t244, ...1046
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Graph (trivial) has 230 edges and 213 vertex of which 9 / 213 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 206 transition count 464
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 178 transition count 464
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 57 place count 178 transition count 447
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 91 place count 161 transition count 447
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 112 place count 140 transition count 409
Iterating global reduction 2 with 21 rules applied. Total rules applied 133 place count 140 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 133 place count 140 transition count 406
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 139 place count 137 transition count 406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 135 transition count 378
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 135 transition count 378
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 169 place count 122 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 122 transition count 364
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 121 transition count 362
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 180 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 188 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 116 transition count 349
Applied a total of 189 rules in 31 ms. Remains 116 /213 variables (removed 97) and now considering 349/499 (removed 150) transitions.
[2026-05-25 09:38:06] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13356254205386829796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5351561401323732016.kers'
[2026-05-25 09:38:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13356254205386829796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5351561401323732016.kers]
Normalized transition count is 346 out of 347 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 116 cols 1596 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-25 09:38:06] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5351561401323732016.kers
Total runtime 1 ms.
[2026-05-25 09:38:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:38:06] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2026-05-25 09:38:06] [INFO ] Invariant cache hit.
[2026-05-25 09:38:06] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:38:06] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2026-05-25 09:38:06] [INFO ] Redundant transitions in 3 ms returned []
Running 340 sub problems to find dead transitions.
[2026-05-25 09:38:06] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2026-05-25 09:38:06] [INFO ] Invariant cache hit.
[2026-05-25 09:38:06] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/139 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/203 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 204 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (OVERLAPS) 346/462 variables, 116/140 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/204 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 304/508 constraints. Problems are: Problem set: 36 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/463 variables, and 508 constraints, problems are : Problem set: 36 solved, 304 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 304/340 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 36 solved, 304 unsolved
Search for dead transitions found 36 dead transitions in 60155ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/213 places, 313/499 transitions.
Applied a total of 0 rules in 12 ms. Remains 116 /116 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-25 09:39:06] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60641 ms. Remains : 116/213 places, 313/499 transitions.
[2026-05-25 09:39:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:39:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:39:06] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 09:39:06] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 1478 steps (274 resets) in 8 ms. (164 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-17-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 09:39:06] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:39:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7869289163111654662.gal : 3 ms
[2026-05-25 09:39:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17545800809544283354.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7869289163111654662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17545800809544283354.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 499/499 transitions.
Graph (trivial) has 181 edges and 213 vertex of which 6 / 213 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 208 transition count 467
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 181 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 180 transition count 466
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 57 place count 180 transition count 449
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 91 place count 163 transition count 449
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 112 place count 142 transition count 411
Iterating global reduction 3 with 21 rules applied. Total rules applied 133 place count 142 transition count 411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 133 place count 142 transition count 409
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 140 transition count 409
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 138 transition count 381
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 138 transition count 381
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 165 place count 126 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 126 transition count 368
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 125 transition count 366
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 125 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 174 place count 125 transition count 360
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 4 with 4 rules applied. Total rules applied 178 place count 123 transition count 358
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 123 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 122 transition count 357
Applied a total of 180 rules in 38 ms. Remains 122 /213 variables (removed 91) and now considering 357/499 (removed 142) transitions.
[2026-05-25 09:39:06] [INFO ] Flow matrix only has 356 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17440641837773746962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1240037593125472831.kers'
[2026-05-25 09:39:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17440641837773746962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1240037593125472831.kers]
Normalized transition count is 355 out of 356 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 355 rows 122 cols 1802 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-25 09:39:07] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1240037593125472831.kers
Total runtime 5 ms.
[2026-05-25 09:39:07] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-25 09:39:07] [INFO ] Flow matrix only has 356 transitions (discarded 1 similar events)
[2026-05-25 09:39:07] [INFO ] Invariant cache hit.
[2026-05-25 09:39:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:39:07] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2026-05-25 09:39:07] [INFO ] Redundant transitions in 2 ms returned []
Running 349 sub problems to find dead transitions.
[2026-05-25 09:39:07] [INFO ] Flow matrix only has 356 transitions (discarded 1 similar events)
[2026-05-25 09:39:07] [INFO ] Invariant cache hit.
[2026-05-25 09:39:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (OVERLAPS) 355/477 variables, 122/148 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 8 (OVERLAPS) 1/478 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 149 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 6 (OVERLAPS) 355/477 variables, 122/148 constraints. Problems are: Problem set: 36 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 313/461 constraints. Problems are: Problem set: 36 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/478 variables, and 461 constraints, problems are : Problem set: 36 solved, 313 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 313/349 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 36 solved, 313 unsolved
Search for dead transitions found 36 dead transitions in 60158ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 122/213 places, 321/499 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2026-05-25 09:40:07] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60623 ms. Remains : 122/213 places, 321/499 transitions.
[2026-05-25 09:40:07] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:40:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:40:07] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-25 09:40:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:40:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:40:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11503958504830966946.gal : 2 ms
[2026-05-25 09:40:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1528757803721670056.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11503958504830966946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1528757803721670056.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4435 resets) in 90 ms. (439 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1528757803721670056.prop.
BEST_FIRST walk for 40004 steps (635 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 225
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :225 after 949
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :949 after 3756
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3756 after 10794
Finished probabilistic random walk after 418982 steps, run visited all 1 properties in 719 ms. (steps per millisecond=582 )
Probabilistic random walk after 418982 steps, saw 80328 distinct states, run finished after 719 ms. (steps per millisecond=582 ) properties seen :1
FORMULA MedleyA-PT-17-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:40:08] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:40:08] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:40:08] [INFO ] Applying decomposition
[2026-05-25 09:40:08] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6006903911569532793.txt' '-o' '/tmp/graph6006903911569532793.bin' '-w' '/tmp/graph6006903911569532793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6006903911569532793.bin' '-l' '-1' '-v' '-w' '/tmp/graph6006903911569532793.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:40:08] [INFO ] Decomposing Gal with order
[2026-05-25 09:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:40:08] [INFO ] Removed a total of 808 redundant transitions.
[2026-05-25 09:40:08] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 5 ms.
[2026-05-25 09:40:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17266134494849207749.gal : 3 ms
[2026-05-25 09:40:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6916074847349366381.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/CTLFireability17266134494849207749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6916074847349366381.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.37713e+07,968.442,8086148,16794,11596,1.26986e+06,299071,967,1.0182e+08,251,1.68839e+06,0


Converting to forward existential form...Done !
original formula: EX((((EF((i1.u15.p72==1)) * AX((i8.u19.p104!=1))) * (EF(((((i2.u60.p28!=1)||(i3.u10.p39!=1))||((i1.u15.p70!=1)||(i8.u19.p106!=1)))||(i8.u...214
=> equivalent forward existential formula: [(FwdU((((EY(Init) * (i8.u7.p22!=1)) * (E(TRUE U (i1.u15.p72==1)) * !(EX(!((i8.u19.p104!=1)))))) * (i4.i1.i1.u35...278
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t19, t33, t42, t72, t127, t139, t171, t172, t174, t175, t189, t191, t196, t198, t199...1393
Detected timeout of ITS tools.
[2026-05-25 10:07:26] [INFO ] Applying decomposition
[2026-05-25 10:07:27] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:07:27] [INFO ] Decomposing Gal with order
[2026-05-25 10:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:07:27] [INFO ] Removed a total of 868 redundant transitions.
[2026-05-25 10:07:27] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 3 ms.
[2026-05-25 10:07:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15995277088188356275.gal : 2 ms
[2026-05-25 10:07:27] [INFO ] Time to serialize properties into /tmp/CTLFireability523476191023763150.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/CTLFireability15995277088188356275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability523476191023763150.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.37713e+07,3.04447,103832,1368,3068,83733,79806,238,415421,517,843824,0


Converting to forward existential form...Done !
original formula: EX((((EF((i0.i0.i1.u7.p72==1)) * AX((i0.i0.i1.u8.p104!=1))) * (EF(((((i0.i0.i0.u4.p28!=1)||(i0.i0.i0.u5.p39!=1))||((i0.i0.i1.u7.p70!=1)||...244
=> equivalent forward existential formula: [(FwdU((((EY(Init) * (i0.i0.i0.u4.p22!=1)) * (E(TRUE U (i0.i0.i1.u7.p72==1)) * !(EX(!((i0.i0.i1.u8.p104!=1))))))...308
Reverse transition relation is NOT exact ! Due to transitions t239, t354, i0.t497, i0.t454, i0.t400, i0.i0.i0.u4.t206, i0.i0.i0.u4.t209, i0.i0.i0.u4.t210, ...2093
(forward)formula 0,1,65.0957,1752728,1,0,1.05325e+06,1.28457e+06,4056,1.12954e+07,3490,1.00723e+07,674278
FORMULA MedleyA-PT-17-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((EF(((!(E((i0.i1.u11.p236==1) U (((i0.i0.i0.u5.p52==1)&&(i0.i0.i1.u7.p79==1))&&((i0.i1.u11.p232==1)&&(u12.p242==1))))) * EG((((i0.i0.i...642
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(E(TRUE U ((!(E((i0.i1.u11.p236==1) U (((i0.i0.i0.u5.p52==1)&&(i0.i0.i1.u7.p79==1))&&((i0.i...1499
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-25 10:11:41] [INFO ] Flatten gal took : 31 ms
[2026-05-25 10:11:42] [INFO ] Input system was already deterministic with 499 transitions.
[2026-05-25 10:11:42] [INFO ] Transformed 213 places.
[2026-05-25 10:11:42] [INFO ] Transformed 499 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 10:11:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8625411127918229084.gal : 2 ms
[2026-05-25 10:11:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14151380459231240626.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/CTLFireability8625411127918229084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14151380459231240626.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.37713e+07,74.134,1452272,2,98810,5,4.30262e+06,6,0,1353,3.28351e+06,0


Converting to forward existential form...Done !
original formula: AX((EF(((!(E((p236==1) U (((p52==1)&&(p79==1))&&((p232==1)&&(p242==1))))) * EG((((p21==0)||(p105==0))||((p167==0)||(p242==0))))) * ((p230...384
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(E(TRUE U ((!(E((p236==1) U (((p52==1)&&(p79==1))&&((p232==1)&&(p242==1))))) * EG((((p21==0...953
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t12, t14, t16, t17, t19, t23, t25, t28, t31, t33, t34, t36, t42, t43, t46, t47, t50,...975

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="MedleyA-PT-17"
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 MedleyA-PT-17, 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-177969020000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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