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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 90K 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-08-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779699451564

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 08:57:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:57:33] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-25 08:57:33] [INFO ] Transformed 147 places.
[2026-05-25 08:57:33] [INFO ] Transformed 312 transitions.
[2026-05-25 08:57:33] [INFO ] Found NUPN structural information;
[2026-05-25 08:57:33] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 72 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 121 transition count 284
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 121 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 121 transition count 282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 119 transition count 280
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 119 transition count 280
Applied a total of 56 rules in 52 ms. Remains 119 /147 variables (removed 28) and now considering 280/312 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-279292602897024351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-535284921796256727.kers'
[2026-05-25 08:57:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-279292602897024351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-535284921796256727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 119 cols 1308 entries
Finished phase 1 with 105 SingleSign rule and 4 generalized
[2026-05-25 08:57:33] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-535284921796256727.kers
Total runtime 3 ms.
[2026-05-25 08:57:33] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-25 08:57:33] [INFO ] Invariant cache hit.
[2026-05-25 08:57:33] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-25 08:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 10/20 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 280/399 variables, 119/139 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 2/141 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/142 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/143 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 1/144 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/146 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/146 constraints. Problems are: Problem set: 48 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 146 constraints, problems are : Problem set: 48 solved, 231 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 48 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 15/25 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/26 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 280/399 variables, 119/145 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 231/376 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 6/382 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/384 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/385 constraints. Problems are: Problem set: 48 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/387 constraints. Problems are: Problem set: 48 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 387 constraints, problems are : Problem set: 48 solved, 231 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 231/279 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60370ms problems are : Problem set: 48 solved, 231 unsolved
Search for dead transitions found 48 dead transitions in 60390ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/147 places, 232/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61023 ms. Remains : 119/147 places, 232/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7317498782616493085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10577417473200361709.kers'
[2026-05-25 08:58:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7317498782616493085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10577417473200361709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 119 cols 956 entries
Finished phase 1 with 105 SingleSign rule and 4 generalized
[2026-05-25 08:58:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10577417473200361709.kers
Total runtime 1 ms.
[2026-05-25 08:58:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 08:58:34] [INFO ] Invariant cache hit.
[2026-05-25 08:58:34] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-25 08:58:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 232/351 variables, 119/139 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (OVERLAPS) 0/351 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 351/351 variables, and 157 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 232/351 variables, 119/156 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 231/387 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 60141ms, After SMT, problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in LTL mode , in 1 iterations and 60296 ms. Remains : 119/119 places, 232/232 transitions.
Support contains 72 out of 119 places after structural reductions.
[2026-05-25 08:59:34] [INFO ] Flatten gal took : 46 ms
[2026-05-25 08:59:34] [INFO ] Flatten gal took : 18 ms
[2026-05-25 08:59:34] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 71 out of 119 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (1984 resets) in 1694 ms. (23 steps per ms) remains 52/71 properties
BEST_FIRST walk for 4004 steps (51 resets) in 21 ms. (182 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (59 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (56 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (51 resets) in 76 ms. (51 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (51 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (58 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (52 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (53 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (54 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (57 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (48 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (50 resets) in 18 ms. (210 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (51 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (54 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 48/50 properties
BEST_FIRST walk for 4003 steps (58 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (50 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (47 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (58 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (57 resets) in 63 ms. (62 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (56 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (48 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (64 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (52 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (53 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (57 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (55 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (44 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (52 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (50 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (49 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (63 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (59 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (50 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (58 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (54 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (47 resets) in 26 ms. (148 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4003 steps (48 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
[2026-05-25 08:59:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 50/101 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 40 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 4 (OVERLAPS) 9/110 variables, 4/11 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 3/14 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 222/332 variables, 110/124 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 2/126 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/126 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 13/345 variables, 6/132 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/132 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 5/350 variables, 2/134 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/134 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 1/351 variables, 1/135 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/135 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 0/351 variables, 0/135 constraints. Problems are: Problem set: 14 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 135 constraints, problems are : Problem set: 14 solved, 32 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 54/96 variables, 6/6 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/9 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 8/104 variables, 3/12 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 3/15 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 215/319 variables, 104/119 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 17/136 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 2/138 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 2/140 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 2/142 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 21/340 variables, 8/150 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 15/165 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 0/165 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 2/342 variables, 1/166 constraints. Problems are: Problem set: 14 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/342 variables, 2/168 constraints. Problems are: Problem set: 14 solved, 32 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/351 variables, and 168 constraints, problems are : Problem set: 14 solved, 32 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 114/119 constraints, PredecessorRefiner: 32/46 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9747ms problems are : Problem set: 14 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 232/232 transitions.
Graph (complete) has 420 edges and 119 vertex of which 114 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 114 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 25 place count 107 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 107 transition count 210
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 29 place count 105 transition count 210
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 94 transition count 197
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 94 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 94 transition count 195
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 63 place count 89 transition count 190
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 73 place count 84 transition count 216
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 89 place count 84 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 102 place count 84 transition count 187
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 84 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 82 transition count 185
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 113 place count 82 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 81 transition count 184
Applied a total of 114 rules in 103 ms. Remains 81 /119 variables (removed 38) and now considering 184/232 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 81/119 places, 184/232 transitions.
RANDOM walk for 40000 steps (2836 resets) in 845 ms. (47 steps per ms) remains 18/32 properties
BEST_FIRST walk for 4003 steps (59 resets) in 17 ms. (222 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (49 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (63 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (65 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (67 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (55 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (64 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (64 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-418885597166495334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9577141890651000093.kers'
[2026-05-25 08:59:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-418885597166495334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9577141890651000093.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 81 cols 922 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-25 08:59:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9577141890651000093.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 48/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 183/257 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 8/265 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 94 constraints, problems are : Problem set: 0 solved, 14 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 48/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 183/257 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 8/265 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 111 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2889 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3826ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 11 properties in 5703 ms.
Support contains 9 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 184/184 transitions.
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 1 place count 81 transition count 183
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 81 transition count 179
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 77 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 72 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 72 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 70 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 70 transition count 172
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 61 transition count 165
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 59 transition count 163
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 59 transition count 163
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 57 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 57 transition count 162
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 57 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 53 transition count 158
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 53 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 51 transition count 156
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 51 transition count 156
Applied a total of 76 rules in 30 ms. Remains 51 /81 variables (removed 30) and now considering 156/184 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 51/81 places, 156/184 transitions.
RANDOM walk for 40000 steps (125 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (193 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (87 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (160 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Probably explored full state space saw : 270920 states, properties seen :2
Probabilistic random walk after 1417689 steps, saw 270920 distinct states, run finished after 2545 ms. (steps per millisecond=557 ) properties seen :2
Explored full state space saw : 270920 states, properties seen :0
Exhaustive walk after 1417689 steps, saw 270920 distinct states, run finished after 1536 ms. (steps per millisecond=922 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:59:59] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:00:00] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:00:00] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 53 out of 119 places (down from 58) after GAL structural reductions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 420 edges and 119 vertex of which 114 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Graph (complete) has 420 edges and 119 vertex of which 114 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 14 place count 113 transition count 215
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 100 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 100 transition count 211
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 33 place count 98 transition count 211
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 51 place count 80 transition count 181
Iterating global reduction 2 with 18 rules applied. Total rules applied 69 place count 80 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 69 place count 80 transition count 180
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 71 place count 79 transition count 180
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 73 transition count 163
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 73 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 70 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 70 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 69 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 69 transition count 152
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 119 place count 54 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 54 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 52 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 52 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 52 transition count 131
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 129 place count 52 transition count 128
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 135 place count 49 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 47 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 46 transition count 125
Applied a total of 140 rules in 41 ms. Remains 46 /119 variables (removed 73) and now considering 125/232 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2085511148170729705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16505280162345770326.kers'
[2026-05-25 09:00:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2085511148170729705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16505280162345770326.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 46 cols 501 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-25 09:00:00] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-16505280162345770326.kers
Total runtime 11 ms.
[2026-05-25 09:00:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 09:00:00] [INFO ] Invariant cache hit.
[2026-05-25 09:00:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:00:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2026-05-25 09:00:00] [INFO ] Redundant transitions in 30 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-25 09:00:00] [INFO ] Invariant cache hit.
[2026-05-25 09:00:00] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 124/169 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 2/171 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 64 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4543 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 124/169 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 114/177 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 2/171 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 181 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6288 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10863ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 10864ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/119 places, 125/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11108 ms. Remains : 46/119 places, 125/232 transitions.
[2026-05-25 09:00:11] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:00:11] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:00:11] [INFO ] Input system was already deterministic with 125 transitions.
RANDOM walk for 39649 steps (5072 resets) in 52 ms. (748 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-08-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 09:00:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:00:11] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:00:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7579057845769307324.gal : 3 ms
[2026-05-25 09:00:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15983040736193426158.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/ReachabilityCardinality7579057845769307324.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15983040736193426158.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Graph (complete) has 420 edges and 119 vertex of which 114 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 113 transition count 216
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 101 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 100 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 29 place count 100 transition count 211
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 33 place count 98 transition count 211
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 50 place count 81 transition count 186
Iterating global reduction 3 with 17 rules applied. Total rules applied 67 place count 81 transition count 186
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 77 transition count 177
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 77 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 75 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 75 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 74 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 74 transition count 169
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 100 place count 64 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 64 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 63 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 63 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 108 place count 63 transition count 153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 108 place count 63 transition count 150
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 60 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 59 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 58 transition count 148
Applied a total of 117 rules in 28 ms. Remains 58 /119 variables (removed 61) and now considering 148/232 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14110411785573779736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2852288126756688377.kers'
[2026-05-25 09:00:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14110411785573779736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2852288126756688377.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 58 cols 700 entries
Finished phase 1 with 50 SingleSign rule and 1 generalized
[2026-05-25 09:00:11] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2852288126756688377.kers
Total runtime 1 ms.
[2026-05-25 09:00:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 09:00:11] [INFO ] Invariant cache hit.
[2026-05-25 09:00:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:00:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-25 09:00:11] [INFO ] Redundant transitions in 17 ms returned []
Running 140 sub problems to find dead transitions.
[2026-05-25 09:00:11] [INFO ] Invariant cache hit.
[2026-05-25 09:00:11] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 147/204 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 2/206 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 72 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 147/204 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 137/208 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (OVERLAPS) 0/206 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 214 constraints, problems are : Problem set: 0 solved, 140 unsolved in 16893 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24101ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 24102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/119 places, 148/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24239 ms. Remains : 58/119 places, 148/232 transitions.
[2026-05-25 09:00:35] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:00:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:00:35] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 09:00:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:00:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:00:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8641899567755667769.gal : 2 ms
[2026-05-25 09:00:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8691424065629060331.ctl : 17 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/CTLFireability8641899567755667769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8691424065629060331.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1411e+06,0.302274,16408,2,3660,5,43033,6,0,371,57418,0


Converting to forward existential form...Done !
original formula: EF(!(A(EG(!((((p22==1)&&(p32==1))&&((p76==1)&&(p87==1))))) U A(AG((p116==1)) U ((AF((p41==1)) * (p83==1)) * ((p89==1)&&(p113==1)))))))
=> equivalent forward existential formula: (((([FwdG((FwdU((FwdU(FwdU(Init,TRUE),!(!((E(!(((!(EG(!((p41==1)))) * (p83==1)) * ((p89==1)&&(p113==1)))) U (!(!...2064
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t16, t17, t20, t22, t24, t27, t28...442
Detected timeout of ITS tools.
[2026-05-25 09:01:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:01:05] [INFO ] Applying decomposition
[2026-05-25 09:01:05] [INFO ] Flatten gal took : 6 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/graph16111181974278985159.txt' '-o' '/tmp/graph16111181974278985159.bin' '-w' '/tmp/graph16111181974278985159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16111181974278985159.bin' '-l' '-1' '-v' '-w' '/tmp/graph16111181974278985159.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:01:05] [INFO ] Decomposing Gal with order
[2026-05-25 09:01:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:01:05] [INFO ] Removed a total of 277 redundant transitions.
[2026-05-25 09:01:05] [INFO ] Flatten gal took : 81 ms
[2026-05-25 09:01:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2026-05-25 09:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5725687908960279775.gal : 4 ms
[2026-05-25 09:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9028781928959766531.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/CTLFireability5725687908960279775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9028781928959766531.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1411e+06,0.167406,10144,281,164,9486,936,235,32030,115,5585,0


Converting to forward existential form...Done !
original formula: EF(!(A(EG(!((((i1.u0.p22==1)&&(i1.u1.p32==1))&&((i3.u4.p76==1)&&(i3.u5.p87==1))))) U A(AG((u9.p116==1)) U ((AF((u2.p41==1)) * (i4.u3.p83=...197
=> equivalent forward existential formula: (((([FwdG((FwdU((FwdU(FwdU(Init,TRUE),!(!((E(!(((!(EG(!((u2.p41==1)))) * (i4.u3.p83==1)) * ((i4.u8.p89==1)&&(u9....2544
Reverse transition relation is NOT exact ! Due to transitions t10, t93, t94, t95, t96, t104, t106, t146, u2.t28, u2.t29, u2.t30, u2.t32, u2.t34, u2.t35, u2...574
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.13084,152348,1,0,228462,8897,1690,581500,622,48985,253040
FORMULA MedleyA-PT-08-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 198
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 93 transition count 182
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 93 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 90 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 90 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 89 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 89 transition count 171
Applied a total of 62 rules in 6 ms. Remains 89 /119 variables (removed 30) and now considering 171/232 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15978536205551639872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18032341750609525653.kers'
[2026-05-25 09:01:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15978536205551639872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18032341750609525653.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 89 cols 756 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:01:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18032341750609525653.kers
Total runtime 1 ms.
[2026-05-25 09:01:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:01:10] [INFO ] Invariant cache hit.
[2026-05-25 09:01:10] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-25 09:01:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/260 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 103 constraints, problems are : Problem set: 0 solved, 170 unsolved in 10692 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/260 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 170/271 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 276 constraints, problems are : Problem set: 0 solved, 170 unsolved in 22763 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33503ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 33505ms
Starting structural reductions in LTL mode, iteration 1 : 89/119 places, 171/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33682 ms. Remains : 89/119 places, 171/232 transitions.
[2026-05-25 09:01:43] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:01:43] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:01:43] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-25 09:01:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:01:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:01:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11892381252959836785.gal : 2 ms
[2026-05-25 09:01:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6737719282945051468.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/CTLFireability11892381252959836785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6737719282945051468.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,4.79204e+06,0.737495,30140,2,4640,5,82386,6,0,527,121550,0


Converting to forward existential form...Done !
original formula: !(AF(!(((AX(((p8==1)&&(p27==1))) * (p136==1)) + EF((((p22==1)&&(p35==1))&&((p76==1)&&(p87==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(((!(EX(!(((p8==1)&&(p27==1))))) * (p136==1)) + E(TRUE U (((p22==1)&&(p35==1))&&((p76==1)&&(p87==1...173
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...405
Detected timeout of ITS tools.
[2026-05-25 09:02:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:02:14] [INFO ] Applying decomposition
[2026-05-25 09:02:14] [INFO ] Flatten gal took : 5 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/graph10789646026273192460.txt' '-o' '/tmp/graph10789646026273192460.bin' '-w' '/tmp/graph10789646026273192460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10789646026273192460.bin' '-l' '-1' '-v' '-w' '/tmp/graph10789646026273192460.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:02:14] [INFO ] Decomposing Gal with order
[2026-05-25 09:02:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:02:14] [INFO ] Removed a total of 305 redundant transitions.
[2026-05-25 09:02:14] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:02:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2026-05-25 09:02:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14068053110208479017.gal : 2 ms
[2026-05-25 09:02:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12633841007366151322.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/CTLFireability14068053110208479017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12633841007366151322.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,4.79204e+06,0.23641,13128,393,46,16170,654,357,37499,70,1947,0


Converting to forward existential form...Done !
original formula: !(AF(!(((AX(((i1.u4.p8==1)&&(i1.u3.p27==1))) * (i7.u25.p136==1)) + EF((((i3.u2.p22==1)&&(i2.u8.p35==1))&&((i4.u13.p76==1)&&(i4.u14.p87==1...163
=> equivalent forward existential formula: [FwdG(Init,!(!(((!(EX(!(((i1.u4.p8==1)&&(i1.u3.p27==1))))) * (i7.u25.p136==1)) + E(TRUE U (((i3.u2.p22==1)&&(i2....218
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t80, t85, i1.u4.t76, i2.t70, i2.t66, i2.t65, i2.u5.t53, i2.u5.t74, i2.u5.t75, i2.u6...607
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,5.22248,169904,1,0,305735,1341,2082,608136,320,4793,366609
FORMULA MedleyA-PT-08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 181
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 89 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 88 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 88 transition count 170
Applied a total of 64 rules in 7 ms. Remains 88 /119 variables (removed 31) and now considering 170/232 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15224352200946755089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14895234089232795448.kers'
[2026-05-25 09:02:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15224352200946755089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14895234089232795448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 88 cols 752 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 09:02:19] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14895234089232795448.kers
Total runtime 1 ms.
[2026-05-25 09:02:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:02:19] [INFO ] Invariant cache hit.
[2026-05-25 09:02:19] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2026-05-25 09:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 102 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8385 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 169/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 273 constraints, problems are : Problem set: 0 solved, 169 unsolved in 24058 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32489ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 32489ms
Starting structural reductions in LTL mode, iteration 1 : 88/119 places, 170/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32671 ms. Remains : 88/119 places, 170/232 transitions.
[2026-05-25 09:02:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:02:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:02:52] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-25 09:02:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:02:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:02:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2072797836846476586.gal : 3 ms
[2026-05-25 09:02:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11569850189694596551.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/CTLFireability2072797836846476586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11569850189694596551.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,4.57361e+06,0.907543,28892,2,4483,5,79444,6,0,522,113826,0


Converting to forward existential form...Done !
original formula: AX(AX((p28==1)))
=> equivalent forward existential formula: [(EY(EY(Init)) * !((p28==1)))] = FALSE
(forward)formula 0,0,0.917063,29072,1,0,10,79444,9,2,721,113826,3
FORMULA MedleyA-PT-08-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 198
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 95 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 95 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 93 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 93 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 92 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 92 transition count 178
Applied a total of 56 rules in 5 ms. Remains 92 /119 variables (removed 27) and now considering 178/232 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12434529964153655183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16572039766555237688.kers'
[2026-05-25 09:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12434529964153655183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16572039766555237688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 92 cols 770 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:02:53] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16572039766555237688.kers
Total runtime 1 ms.
[2026-05-25 09:02:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:02:53] [INFO ] Invariant cache hit.
[2026-05-25 09:02:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-25 09:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/270 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 107 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10806 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/270 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 177/282 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 286 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40865ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 40865ms
Starting structural reductions in LTL mode, iteration 1 : 92/119 places, 178/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41093 ms. Remains : 92/119 places, 178/232 transitions.
[2026-05-25 09:03:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:03:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:03:34] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-25 09:03:34] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:03:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:03:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8630372107483223259.gal : 2 ms
[2026-05-25 09:03:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12920250594152239093.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/CTLFireability8630372107483223259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12920250594152239093.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((!(A(((p94!=1) * EX((p55==1))) U EF((p116==1)))) * AF(((p66==0) + EF(((p67==0)||(p88==0)))))))
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(E(TRUE U (p116==1)))))) * !(E(!(E(TRUE U (p116==1))) U (!(((p94!=1) * EX((p55==1)))) * !(E...262
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...460
Detected timeout of ITS tools.
[2026-05-25 09:04:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:04:04] [INFO ] Applying decomposition
[2026-05-25 09:04:04] [INFO ] Flatten gal took : 3 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/graph12228974580341433241.txt' '-o' '/tmp/graph12228974580341433241.bin' '-w' '/tmp/graph12228974580341433241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12228974580341433241.bin' '-l' '-1' '-v' '-w' '/tmp/graph12228974580341433241.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:04:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:04:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:04:04] [INFO ] Removed a total of 300 redundant transitions.
[2026-05-25 09:04:04] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:04:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2026-05-25 09:04:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2946465969146337744.gal : 1 ms
[2026-05-25 09:04:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17802547655953943908.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/CTLFireability2946465969146337744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17802547655953943908.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,5.43628e+06,0.299765,15804,422,161,18923,1172,368,52501,85,11828,0


Converting to forward existential form...Done !
original formula: AX((!(A(((i5.u16.p94!=1) * EX((i3.u9.p55==1))) U EF((i6.u18.p116==1)))) * AF(((i4.u11.p66==0) + EF(((i6.u12.p67==0)||(i4.u13.p88==0))))))...156
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(E(TRUE U (i6.u18.p116==1)))))) * !(E(!(E(TRUE U (i6.u18.p116==1))) U (!(((i5.u16.p94!=1) *...317
Reverse transition relation is NOT exact ! Due to transitions t26, t59, t88, t92, i1.u4.t83, i2.t76, i2.t73, i2.t72, i2.u5.t57, i2.u5.t81, i2.u5.t82, i2.u6...818
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,6.58107,217408,1,0,304466,7501,2266,898434,456,110825,276478
FORMULA MedleyA-PT-08-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 204
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 94 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 94 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 92 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 92 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 91 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 91 transition count 180
Applied a total of 58 rules in 4 ms. Remains 91 /119 variables (removed 28) and now considering 180/232 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5675054561683737601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3704826420700609400.kers'
[2026-05-25 09:04:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5675054561683737601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3704826420700609400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 91 cols 792 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:04:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3704826420700609400.kers
Total runtime 0 ms.
[2026-05-25 09:04:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 09:04:11] [INFO ] Invariant cache hit.
[2026-05-25 09:04:11] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-25 09:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/271 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 106 constraints, problems are : Problem set: 0 solved, 179 unsolved in 15287 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/271 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 179/283 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 288 constraints, problems are : Problem set: 0 solved, 179 unsolved in 24142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39516ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 39517ms
Starting structural reductions in LTL mode, iteration 1 : 91/119 places, 180/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39694 ms. Remains : 91/119 places, 180/232 transitions.
[2026-05-25 09:04:50] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:04:50] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:04:50] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-25 09:04:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:04:50] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:04:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15634179474096805861.gal : 2 ms
[2026-05-25 09:04:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14948272738191213914.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/CTLFireability15634179474096805861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14948272738191213914.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.58207e+06,0.967583,36328,2,5856,5,101372,6,0,544,147638,0


Converting to forward existential form...Done !
original formula: AG((EF((((p83==1)&&(p98==1))&&(p118==1))) * (EF((p121==0)) + AX((p37!=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((p83==1)&&(p98==1))&&(p118==1)))))] = FALSE * [(EY((FwdU(Init,TRUE) * !(E(TRUE...196
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...473
(forward)formula 0,0,7.41999,206768,1,0,394,1.09365e+06,384,150,4719,847427,432
FORMULA MedleyA-PT-08-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 90 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 90 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 89 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 89 transition count 173
Applied a total of 62 rules in 5 ms. Remains 89 /119 variables (removed 30) and now considering 173/232 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12890991545399956357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14429754719415998464.kers'
[2026-05-25 09:04:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12890991545399956357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14429754719415998464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 89 cols 758 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:04:58] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14429754719415998464.kers
Total runtime 2 ms.
[2026-05-25 09:04:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:04:58] [INFO ] Invariant cache hit.
[2026-05-25 09:04:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-25 09:04:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/262 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 103 constraints, problems are : Problem set: 0 solved, 172 unsolved in 11727 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/262 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 172/273 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/262 variables, and 280 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41784ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 41785ms
Starting structural reductions in LTL mode, iteration 1 : 89/119 places, 173/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41971 ms. Remains : 89/119 places, 173/232 transitions.
[2026-05-25 09:05:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:05:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:05:40] [INFO ] Input system was already deterministic with 173 transitions.
[2026-05-25 09:05:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:05:40] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:05:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3690305344737391689.gal : 2 ms
[2026-05-25 09:05:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15673152184252289130.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/CTLFireability3690305344737391689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15673152184252289130.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,4.89357e+06,0.983071,33888,2,4945,5,97777,6,0,529,140893,0


Converting to forward existential form...Done !
original formula: AG(AX(E(!((!((((p22==1)&&(p32==1))&&((p83==1)&&(p122==1)))) * A((p55==1) U (((p83==1)&&(p122==1))&&(p138==1))))) U (p89==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(!((!((((p22==1)&&(p32==1))&&((p83==1)&&(p122==1)))) * !((E(!((((p83==1)&&(p122==1))&...295
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...430
Detected timeout of ITS tools.
[2026-05-25 09:06:10] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:06:10] [INFO ] Applying decomposition
[2026-05-25 09:06:10] [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/graph5055478177546653620.txt' '-o' '/tmp/graph5055478177546653620.bin' '-w' '/tmp/graph5055478177546653620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5055478177546653620.bin' '-l' '-1' '-v' '-w' '/tmp/graph5055478177546653620.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:06:10] [INFO ] Decomposing Gal with order
[2026-05-25 09:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:06:10] [INFO ] Removed a total of 305 redundant transitions.
[2026-05-25 09:06:10] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2026-05-25 09:06:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2155331574415987465.gal : 3 ms
[2026-05-25 09:06:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8265908261537037907.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/CTLFireability2155331574415987465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8265908261537037907.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,4.89357e+06,0.203585,13060,391,136,15771,955,352,36265,91,7139,0


Converting to forward existential form...Done !
original formula: AG(AX(E(!((!((((i1.u2.p22==1)&&(i3.u7.p32==1))&&((i6.u11.p83==1)&&(i6.u18.p122==1)))) * A((i1.u9.p55==1) U (((i6.u11.p83==1)&&(i6.u18.p12...204
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(!((!((((i1.u2.p22==1)&&(i3.u7.p32==1))&&((i6.u11.p83==1)&&(i6.u18.p122==1)))) * !((E...397
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t83, t87, i1.u9.t54, i1.u9.t56, i1.u9.t57, i1.u9.t58, i1.u9.t59, i1.u9.t60, i1.u9.t...686
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,4.99165,180232,1,0,269862,6835,2088,708354,460,70872,317294
FORMULA MedleyA-PT-08-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 102 transition count 203
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 102 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 102 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 100 transition count 193
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 100 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 98 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 98 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 97 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 97 transition count 185
Applied a total of 45 rules in 5 ms. Remains 97 /119 variables (removed 22) and now considering 185/232 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7080749793529279067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4579245600455735450.kers'
[2026-05-25 09:06:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7080749793529279067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4579245600455735450.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 97 cols 790 entries
Finished phase 1 with 83 SingleSign rule and 4 generalized
[2026-05-25 09:06:15] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4579245600455735450.kers
Total runtime 1 ms.
[2026-05-25 09:06:15] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:06:15] [INFO ] Invariant cache hit.
[2026-05-25 09:06:15] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 09:06:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/282 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 114 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10531 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/282 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 184/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 303 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40610ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 40611ms
Starting structural reductions in LTL mode, iteration 1 : 97/119 places, 185/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41058 ms. Remains : 97/119 places, 185/232 transitions.
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:06:56] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:06:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:06:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10747917547249855670.gal : 3 ms
[2026-05-25 09:06:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4190232530347035008.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/CTLFireability10747917547249855670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4190232530347035008.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((!(A(EF((((p22==1)&&(p35==1))&&((p83==1)&&(p122==1)))) U ((p83==1)&&(p119==1)))) + (EF(!(E((p31==1) U ((p67==1)&&(p88==1))))) * !(E((...297
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(((p83==1)&&(p119==1))) U (!(E(TRUE U (((p22==1)&&(p35==1))&&((p83==1)&&(p122==1))))) * !((...447
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t33, t3...490
Detected timeout of ITS tools.
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:07:26] [INFO ] Applying decomposition
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 4 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/graph4299856104160993311.txt' '-o' '/tmp/graph4299856104160993311.bin' '-w' '/tmp/graph4299856104160993311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4299856104160993311.bin' '-l' '-1' '-v' '-w' '/tmp/graph4299856104160993311.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:07:26] [INFO ] Decomposing Gal with order
[2026-05-25 09:07:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:07:26] [INFO ] Removed a total of 306 redundant transitions.
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 15 ms.
[2026-05-25 09:07:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18065640000688615172.gal : 2 ms
[2026-05-25 09:07:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3639295888288244852.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/CTLFireability18065640000688615172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3639295888288244852.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,7.01822e+06,0.301893,15460,487,247,18229,1742,388,46707,123,15537,0


Converting to forward existential form...Done !
original formula: EG(((!(A(EF((((i3.u2.p22==1)&&(i2.u8.p35==1))&&((i6.u13.p83==1)&&(i6.u19.p122==1)))) U ((i6.u13.p83==1)&&(i6.u19.p119==1)))) + (EF(!(E((i...424
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(((i6.u13.p83==1)&&(i6.u19.p119==1))) U (!(E(TRUE U (((i3.u2.p22==1)&&(i2.u8.p35==1))&&((i6...602
Reverse transition relation is NOT exact ! Due to transitions t26, t65, t93, t99, i1.u4.t86, i2.t80, i2.t76, i2.t75, i2.u5.t63, i2.u5.t84, i2.u5.t85, i2.u6...845
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,21.4182,597160,1,0,809663,33392,2469,2.28368e+06,609,349112,798941
FORMULA MedleyA-PT-08-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 204
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 94 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 94 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 92 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 92 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 91 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 91 transition count 180
Applied a total of 58 rules in 22 ms. Remains 91 /119 variables (removed 28) and now considering 180/232 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10060548741766432978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15397822676901698138.kers'
[2026-05-25 09:07:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10060548741766432978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15397822676901698138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 91 cols 792 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:07:48] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15397822676901698138.kers
Total runtime 2 ms.
[2026-05-25 09:07:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:07:48] [INFO ] Invariant cache hit.
[2026-05-25 09:07:48] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-25 09:07:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/271 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 106 constraints, problems are : Problem set: 0 solved, 179 unsolved in 11890 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/271 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 179/283 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 288 constraints, problems are : Problem set: 0 solved, 179 unsolved in 24364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36355ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 36355ms
Starting structural reductions in LTL mode, iteration 1 : 91/119 places, 180/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36640 ms. Remains : 91/119 places, 180/232 transitions.
[2026-05-25 09:08:24] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:24] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:08:24] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-25 09:08:24] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:08:24] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15419579145545468673.gal : 1 ms
[2026-05-25 09:08:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18227547873402020208.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/CTLFireability15419579145545468673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18227547873402020208.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.58207e+06,1.19241,36244,2,5856,5,101372,6,0,544,147638,0


Converting to forward existential form...Done !
original formula: EX(AF(((((p83==0)||(p89==0))||(p108==0))&&((p23==1)||(p31==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((((p83==0)||(p89==0))||(p108==0))&&((p23==1)||(p31==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...473
Detected timeout of ITS tools.
[2026-05-25 09:08:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:54] [INFO ] Applying decomposition
[2026-05-25 09:08:54] [INFO ] Flatten gal took : 3 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/graph5563982199768052978.txt' '-o' '/tmp/graph5563982199768052978.bin' '-w' '/tmp/graph5563982199768052978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5563982199768052978.bin' '-l' '-1' '-v' '-w' '/tmp/graph5563982199768052978.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:08:54] [INFO ] Decomposing Gal with order
[2026-05-25 09:08:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:08:54] [INFO ] Removed a total of 312 redundant transitions.
[2026-05-25 09:08:54] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2026-05-25 09:08:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7251139242853341459.gal : 2 ms
[2026-05-25 09:08:54] [INFO ] Time to serialize properties into /tmp/CTLFireability405497318321076466.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/CTLFireability7251139242853341459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability405497318321076466.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,5.58207e+06,0.249779,14124,397,178,16157,1750,374,43215,110,17052,0


Converting to forward existential form...Done !
original formula: EX(AF(((((i5.u12.p83==0)||(i6.u17.p89==0))||(i5.u18.p108==0))&&((i0.u1.p23==1)||(i2.u6.p31==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((((i5.u12.p83==0)||(i6.u17.p89==0))||(i5.u18.p108==0))&&((i0.u1.p23==1)||(i2.u6.p31==1)))))...167
Reverse transition relation is NOT exact ! Due to transitions t26, t59, t84, t90, t156, t157, t158, t159, i1.u4.t80, i2.t70, i2.t69, i2.u5.t57, i2.u5.t78, ...759
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.39632,193912,1,0,283208,14428,2133,798468,555,152786,293319
FORMULA MedleyA-PT-08-CTLFireability-2024-09 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 : 119/119 places, 232/232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 100 transition count 204
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 100 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 100 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 96 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 96 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 94 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 94 transition count 188
Applied a total of 52 rules in 7 ms. Remains 94 /119 variables (removed 25) and now considering 188/232 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3769951551620913804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14372148372320873718.kers'
[2026-05-25 09:09:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3769951551620913804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14372148372320873718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 94 cols 824 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:09:02] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14372148372320873718.kers
Total runtime 3 ms.
[2026-05-25 09:09:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:09:02] [INFO ] Invariant cache hit.
[2026-05-25 09:09:02] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2026-05-25 09:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/282 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/282 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 113 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21097 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/282 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 187/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 0/282 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/282 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51187ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 51188ms
Starting structural reductions in LTL mode, iteration 1 : 94/119 places, 188/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51426 ms. Remains : 94/119 places, 188/232 transitions.
[2026-05-25 09:09:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:09:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:09:53] [INFO ] Input system was already deterministic with 188 transitions.
[2026-05-25 09:09:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:09:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12563466991476403605.gal : 1 ms
[2026-05-25 09:09:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5794669034056469905.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/CTLFireability12563466991476403605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5794669034056469905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EF((EG(((p95==1)||(((p22==1)&&(p37==1))&&(p47==1)))) * AF((p78==1)))) + EX((((p22==1)&&(p35==1))&&((p83==1)&&(p122==1))))) + AG(((((p22...207
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U (EG(((p95==1)||(((p22==1)&&(p37==1))&&(p47==1)))) * !(EG(!((p78==1)))))) + EX((((p22=...276
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t34, t3...546
Detected timeout of ITS tools.
[2026-05-25 09:10:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:23] [INFO ] Applying decomposition
[2026-05-25 09:10:23] [INFO ] Flatten gal took : 3 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/graph439680847918389704.txt' '-o' '/tmp/graph439680847918389704.bin' '-w' '/tmp/graph439680847918389704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph439680847918389704.bin' '-l' '-1' '-v' '-w' '/tmp/graph439680847918389704.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:10:23] [INFO ] Decomposing Gal with order
[2026-05-25 09:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:10:23] [INFO ] Removed a total of 283 redundant transitions.
[2026-05-25 09:10:23] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 2 ms.
[2026-05-25 09:10:23] [INFO ] Time to serialize gal into /tmp/CTLFireability18063880370206875011.gal : 1 ms
[2026-05-25 09:10:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16827329375957413254.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/CTLFireability18063880370206875011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16827329375957413254.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.58142e+06,0.121518,9932,429,402,8302,4715,332,20491,147,20565,0


Converting to forward existential form...Done !
original formula: ((EF((EG(((i6.u16.p95==1)||(((i3.u2.p22==1)&&(i2.u6.p37==1))&&(i3.u10.p47==1)))) * AF((u13.p78==1)))) + EX((((i3.u2.p22==1)&&(i2.u8.p35==...284
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U (EG(((i6.u16.p95==1)||(((i3.u2.p22==1)&&(i2.u6.p37==1))&&(i3.u10.p47==1)))) * !(EG(!(...353
Reverse transition relation is NOT exact ! Due to transitions t26, t59, t88, t92, t161, t163, t178, t179, t180, t181, u13.t25, u13.t27, u13.t28, u13.t29, u...749
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.2318,259576,1,0,389942,72090,2242,1.09518e+06,855,437780,358959
FORMULA MedleyA-PT-08-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 : 119/119 places, 232/232 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 101 transition count 203
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 101 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 101 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 97 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 97 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 95 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 95 transition count 188
Applied a total of 49 rules in 4 ms. Remains 95 /119 variables (removed 24) and now considering 188/232 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2856134110635602562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12106399351676694595.kers'
[2026-05-25 09:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2856134110635602562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12106399351676694595.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 95 cols 808 entries
Finished phase 1 with 81 SingleSign rule and 4 generalized
[2026-05-25 09:10:31] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12106399351676694595.kers
Total runtime 3 ms.
[2026-05-25 09:10:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 09:10:31] [INFO ] Invariant cache hit.
[2026-05-25 09:10:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2026-05-25 09:10:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/283 variables, 95/110 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 113 constraints, problems are : Problem set: 0 solved, 187 unsolved in 17721 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/283 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 187/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 303 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47812ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 47813ms
Starting structural reductions in LTL mode, iteration 1 : 95/119 places, 188/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48022 ms. Remains : 95/119 places, 188/232 transitions.
[2026-05-25 09:11:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:19] [INFO ] Input system was already deterministic with 188 transitions.
[2026-05-25 09:11:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:19] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9023783481294597429.gal : 1 ms
[2026-05-25 09:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6533933256388181327.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/CTLFireability9023783481294597429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6533933256388181327.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.02157e+06,1.26292,45284,2,6124,5,120804,6,0,568,203374,0


Converting to forward existential form...Done !
original formula: A((EX((p90==1)) * (!(EX(((p22==1)&&(p58==1)))) + A(((EG((p105==1)) + ((p92==1)&&(p116==1))) + ((p116==1)||(p85==1))) U (p34==1)))) U !(EF...179
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U ((p46!=1)||(p98==1)))))))) * !(E(!(!(E(TRUE U ((p46!=1)||(p98==1))))) U (!((EX((p90=...373
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...494
Detected timeout of ITS tools.
[2026-05-25 09:11:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:49] [INFO ] Applying decomposition
[2026-05-25 09:11:49] [INFO ] Flatten gal took : 3 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/graph17398710009076230423.txt' '-o' '/tmp/graph17398710009076230423.bin' '-w' '/tmp/graph17398710009076230423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17398710009076230423.bin' '-l' '-1' '-v' '-w' '/tmp/graph17398710009076230423.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:11:49] [INFO ] Decomposing Gal with order
[2026-05-25 09:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:11:49] [INFO ] Removed a total of 317 redundant transitions.
[2026-05-25 09:11:49] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2026-05-25 09:11:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12096902958551907039.gal : 1 ms
[2026-05-25 09:11:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12399209795710041097.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/CTLFireability12096902958551907039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12399209795710041097.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.02157e+06,0.316398,17372,422,235,19389,2725,375,55685,122,27927,0


Converting to forward existential form...Done !
original formula: A((EX((i5.u14.p90==1)) * (!(EX(((i2.u3.p22==1)&&(i2.u9.p58==1)))) + A(((EG((i6.u18.p105==1)) + ((i5.u15.p92==1)&&(i6.u18.p116==1))) + ((i...252
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U ((i2.u9.p46!=1)||(i5.u15.p98==1)))))))) * !(E(!(!(E(TRUE U ((i2.u9.p46!=1)||(i5.u15....484
Reverse transition relation is NOT exact ! Due to transitions t26, t61, t92, t96, t174, t175, t176, t177, i1.u4.t88, i2.u9.t60, i2.u9.t62, i2.u9.t63, i2.u9...825
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,4.51251,168668,1,0,246752,19769,2336,666436,649,200525,270805
FORMULA MedleyA-PT-08-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Graph (complete) has 420 edges and 119 vertex of which 114 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 113 transition count 216
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 101 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 101 transition count 212
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 31 place count 99 transition count 212
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 50 place count 80 transition count 181
Iterating global reduction 2 with 19 rules applied. Total rules applied 69 place count 80 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 75 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 75 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 74 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 74 transition count 163
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 100 place count 64 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 64 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 63 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 63 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 108 place count 63 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 108 place count 63 transition count 144
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 114 place count 60 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 58 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 57 transition count 141
Applied a total of 119 rules in 45 ms. Remains 57 /119 variables (removed 62) and now considering 141/232 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12632920322292005680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1126025300634015600.kers'
[2026-05-25 09:11:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12632920322292005680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1126025300634015600.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 57 cols 661 entries
Finished phase 1 with 49 SingleSign rule and 1 generalized
[2026-05-25 09:11:54] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1126025300634015600.kers
Total runtime 2 ms.
[2026-05-25 09:11:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 09:11:54] [INFO ] Invariant cache hit.
[2026-05-25 09:11:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:11:54] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2026-05-25 09:11:54] [INFO ] Redundant transitions in 21 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-25 09:11:54] [INFO ] Invariant cache hit.
[2026-05-25 09:11:54] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 140/196 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 2/198 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 71 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5092 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 140/196 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 128/197 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 2/198 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 202 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9056 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14251ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 14252ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/119 places, 141/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14495 ms. Remains : 57/119 places, 141/232 transitions.
[2026-05-25 09:12:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:08] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-25 09:12:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:08] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3618026017795281903.gal : 1 ms
[2026-05-25 09:12:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13178019564720163424.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/CTLFireability3618026017795281903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13178019564720163424.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((AG((((p15==1)&&(p26==1))&&((p83==1)&&(p93==1)))) * (EG((((p22==1)&&(p61==1))&&((p83==1)&&(p93==1)))) + A(((p83==1)&&(p119==1)) U (p1...226
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !((((p15==1)&&(p26==1))&&((p83==1)&&(p93==1)))))) * (EG((((p22==1)&&(p61==1))&&((p83==1)...328
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t14, t16, t17, t20, t23, t24, t25, t26, t2...373
(forward)formula 0,1,29.6446,903368,1,0,917,5.1096e+06,326,438,3782,5.62344e+06,1041
FORMULA MedleyA-PT-08-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 181
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 89 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 88 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 88 transition count 170
Applied a total of 64 rules in 22 ms. Remains 88 /119 variables (removed 31) and now considering 170/232 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16799352323968826544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11649967691088394223.kers'
[2026-05-25 09:12:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16799352323968826544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11649967691088394223.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 88 cols 752 entries
Finished phase 1 with 74 SingleSign rule and 4 generalized
[2026-05-25 09:12:38] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11649967691088394223.kers
Total runtime 1 ms.
[2026-05-25 09:12:38] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 09:12:38] [INFO ] Invariant cache hit.
[2026-05-25 09:12:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2026-05-25 09:12:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 102 constraints, problems are : Problem set: 0 solved, 169 unsolved in 11278 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 169/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 273 constraints, problems are : Problem set: 0 solved, 169 unsolved in 23294 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 34662ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 34663ms
Starting structural reductions in LTL mode, iteration 1 : 88/119 places, 170/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34879 ms. Remains : 88/119 places, 170/232 transitions.
[2026-05-25 09:13:13] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:13:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:13] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-25 09:13:13] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:13:13] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:13:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2944538193875667735.gal : 1 ms
[2026-05-25 09:13:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2810622033642098660.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/CTLFireability2944538193875667735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2810622033642098660.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.57361e+06,0.725387,28912,2,4483,5,79444,6,0,522,113826,0


Converting to forward existential form...Done !
original formula: EG(AX(EX((p92!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX((p92!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...405
Detected timeout of ITS tools.
[2026-05-25 09:13:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:13:43] [INFO ] Applying decomposition
[2026-05-25 09:13:43] [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/graph14370604072006474091.txt' '-o' '/tmp/graph14370604072006474091.bin' '-w' '/tmp/graph14370604072006474091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14370604072006474091.bin' '-l' '-1' '-v' '-w' '/tmp/graph14370604072006474091.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:13:43] [INFO ] Decomposing Gal with order
[2026-05-25 09:13:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:13:43] [INFO ] Removed a total of 310 redundant transitions.
[2026-05-25 09:13:43] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:13:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2026-05-25 09:13:43] [INFO ] Time to serialize gal into /tmp/CTLFireability878386034795575029.gal : 2 ms
[2026-05-25 09:13:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11705254075934402599.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/CTLFireability878386034795575029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11705254075934402599.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,4.57361e+06,0.155284,10956,363,38,12890,454,343,25818,63,1347,0


Converting to forward existential form...Done !
original formula: EG(AX(EX((i5.u16.p92!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX((i5.u16.p92!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t80, t84, i1.u4.t76, i2.t70, i2.t66, i2.t65, i2.u5.t53, i2.u5.t74, i2.u5.t75, i2.u6...648
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,4.1476,152488,1,0,275544,1749,1831,566305,277,7370,431859
FORMULA MedleyA-PT-08-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 181
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 89 transition count 173
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 88 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 88 transition count 170
Applied a total of 64 rules in 8 ms. Remains 88 /119 variables (removed 31) and now considering 170/232 (removed 62) transitions.
[2026-05-25 09:13:47] [INFO ] Invariant cache hit.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:13:47] [INFO ] Invariant cache hit.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 88/119 places, 170/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 88/119 places, 170/232 transitions.
[2026-05-25 09:13:47] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:13:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:47] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-25 09:13:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:47] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:13:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14579122597524657414.gal : 2 ms
[2026-05-25 09:13:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5518776020552519237.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/CTLFireability14579122597524657414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5518776020552519237.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,4.57361e+06,0.7237,28908,2,4483,5,79444,6,0,522,113826,0


Converting to forward existential form...Done !
original formula: EX(AG(EF((p33==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (p33==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...405
(forward)formula 0,1,2.40899,80496,1,0,311,302583,361,116,4485,282427,351
FORMULA MedleyA-PT-08-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 232/232 transitions.
Graph (complete) has 420 edges and 119 vertex of which 114 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 113 transition count 218
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 103 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 103 transition count 214
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 27 place count 101 transition count 214
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 48 place count 80 transition count 181
Iterating global reduction 2 with 21 rules applied. Total rules applied 69 place count 80 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 80 transition count 179
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 74 transition count 163
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 74 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 71 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 71 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 70 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 70 transition count 152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 113 place count 58 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 56 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 56 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 56 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 122 place count 56 transition count 132
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 128 place count 53 transition count 132
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 3 with 4 rules applied. Total rules applied 132 place count 51 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 50 transition count 129
Applied a total of 133 rules in 64 ms. Remains 50 /119 variables (removed 69) and now considering 129/232 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5177870311723202416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10580729337124673148.kers'
[2026-05-25 09:13:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5177870311723202416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10580729337124673148.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 50 cols 601 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 09:13:50] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10580729337124673148.kers
Total runtime 2 ms.
[2026-05-25 09:13:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:13:50] [INFO ] Invariant cache hit.
[2026-05-25 09:13:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:13:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2026-05-25 09:13:50] [INFO ] Redundant transitions in 33 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-25 09:13:50] [INFO ] Invariant cache hit.
[2026-05-25 09:13:50] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 128/177 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 2/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 68 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5302 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 128/177 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 116/183 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 2/179 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 187 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9744 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15101ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 15102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/119 places, 129/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15407 ms. Remains : 50/119 places, 129/232 transitions.
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:05] [INFO ] Input system was already deterministic with 129 transitions.
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6320490332675184976.gal : 2 ms
[2026-05-25 09:14:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12175536657853188353.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/CTLFireability6320490332675184976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12175536657853188353.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,685216,0.103217,7704,2,328,5,14979,6,0,319,17327,0


Converting to forward existential form...Done !
original formula: EF((EG((((p22==1)&&(p61==1))&&(p141==1))) + (((p22==1)&&(p32==1))&&((p83==1)&&(p122==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((p22==1)&&(p61==1))&&(p141==1)))] != FALSE + [(FwdU(Init,TRUE) * (((p22==1)&&(p32==1))&...190
Hit Full ! (commute/partial/dont) 69/92/60
(forward)formula 0,1,0.162057,8900,1,0,10,25096,20,3,2347,17327,9
FORMULA MedleyA-PT-08-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 09:14:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:14:06] [INFO ] Flatten gal took : 8 ms
Total runtime 993035 ms.

BK_STOP 1779700446106

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

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