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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 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 160K 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-11-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779699855966

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:04:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:04:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:04:17] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2026-05-25 09:04:17] [INFO ] Transformed 150 places.
[2026-05-25 09:04:17] [INFO ] Transformed 478 transitions.
[2026-05-25 09:04:17] [INFO ] Found NUPN structural information;
[2026-05-25 09:04:17] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 87 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 129 transition count 440
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 129 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 128 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 128 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 127 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 127 transition count 431
Applied a total of 46 rules in 27 ms. Remains 127 /150 variables (removed 23) and now considering 431/469 (removed 38) transitions.
[2026-05-25 09:04:18] [INFO ] Flow matrix only has 359 transitions (discarded 72 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5648135674217385250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16608669362083562936.kers'
[2026-05-25 09:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5648135674217385250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16608669362083562936.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 359 rows 124 cols 1456 entries
Finished phase 1 with 100 SingleSign rule and 4 generalized
[2026-05-25 09:04:18] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16608669362083562936.kers
Total runtime 2 ms.
[2026-05-25 09:04:18] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-25 09:04:18] [INFO ] Flow matrix only has 359 transitions (discarded 72 similar events)
[2026-05-25 09:04:18] [INFO ] Invariant cache hit.
[2026-05-25 09:04:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2026-05-25 09:04:18] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-25 09:04:18] [INFO ] Flow matrix only has 359 transitions (discarded 72 similar events)
[2026-05-25 09:04:18] [INFO ] Invariant cache hit.
[2026-05-25 09:04:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/127 variables, 15/23 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 14/57 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 6/63 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 359/486 variables, 127/190 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 168/358 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 1/359 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/359 constraints. Problems are: Problem set: 108 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 360 constraints, problems are : Problem set: 108 solved, 322 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 8/8 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 15/23 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 42/65 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 5 (OVERLAPS) 359/486 variables, 127/192 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 168/360 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 322/682 constraints. Problems are: Problem set: 108 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 2/684 constraints. Problems are: Problem set: 108 solved, 322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 684 constraints, problems are : Problem set: 108 solved, 322 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 322/430 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60558ms problems are : Problem set: 108 solved, 322 unsolved
Search for dead transitions found 108 dead transitions in 60584ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/150 places, 323/469 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61267 ms. Remains : 127/150 places, 323/469 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 323/323 (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-12824117398644427730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8427789127346743284.kers'
[2026-05-25 09:05:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12824117398644427730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8427789127346743284.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 323 rows 124 cols 1276 entries
Finished phase 1 with 100 SingleSign rule and 4 generalized
[2026-05-25 09:05:19] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8427789127346743284.kers
Total runtime 2 ms.
[2026-05-25 09:05:19] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 09:05:19] [INFO ] Invariant cache hit.
[2026-05-25 09:05:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2026-05-25 09:05:19] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2026-05-25 09:05:19] [INFO ] Invariant cache hit.
[2026-05-25 09:05:19] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 323/450 variables, 127/191 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 132/323 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 324 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 323/450 variables, 127/195 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 132/327 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 322/649 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 651 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 127/127 places, 323/323 transitions.
Support contains 87 out of 127 places after structural reductions.
[2026-05-25 09:06:20] [INFO ] Flatten gal took : 51 ms
[2026-05-25 09:06:20] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:06:20] [INFO ] Input system was already deterministic with 323 transitions.
Reduction of identical properties reduced properties to check from 92 to 91
RANDOM walk for 40000 steps (3131 resets) in 2479 ms. (16 steps per ms) remains 69/91 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (48 resets) in 15 ms. (250 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4004 steps (44 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (51 resets) in 23 ms. (166 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4003 steps (50 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (49 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (53 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (56 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (53 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (52 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (55 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 78 ms. (50 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4003 steps (55 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (38 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (40 resets) in 17 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (45 resets) in 27 ms. (143 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (39 resets) in 28 ms. (138 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (61 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (39 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (52 resets) in 21 ms. (182 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 63/65 properties
BEST_FIRST walk for 4004 steps (52 resets) in 21 ms. (182 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (54 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (56 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (50 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (47 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
[2026-05-25 09:06:21] [INFO ] Invariant cache hit.
[2026-05-25 09:06:21] [INFO ] State equation strengthened by 132 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 2 (OVERLAPS) 47/121 variables, 15/18 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 5/126 variables, 5/23 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/26 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/26 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 322/448 variables, 126/152 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 132/284 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/284 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 2/450 variables, 1/285 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/285 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/285 constraints. Problems are: Problem set: 21 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 285 constraints, problems are : Problem set: 21 solved, 40 unsolved in 2978 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 61/60 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 21 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 40 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 2 (OVERLAPS) 56/119 variables, 15/18 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/19 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/19 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 7/126 variables, 5/24 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/26 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 7/33 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/34 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 2/36 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/38 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 322/448 variables, 126/164 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 132/296 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 11/307 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 2/309 constraints. Problems are: Problem set: 26 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 3/312 constraints. Problems are: Problem set: 26 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/450 variables, and 312 constraints, problems are : Problem set: 26 solved, 35 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/127 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 12/60 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8052ms problems are : Problem set: 26 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 628 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 117 transition count 309
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 117 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 117 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 116 transition count 305
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 116 transition count 303
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 112 transition count 303
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 112 transition count 303
Applied a total of 40 rules in 119 ms. Remains 112 /127 variables (removed 15) and now considering 303/323 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 112/127 places, 303/323 transitions.
RANDOM walk for 40000 steps (3302 resets) in 476 ms. (83 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4004 steps (51 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (55 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (55 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (58 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (56 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (51 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (47 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (55 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (53 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (54 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (48 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (65 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (52 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (55 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (58 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (58 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (52 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (50 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (55 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (58 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (48 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (53 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (51 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (54 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6349553863558006623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18433046837278491900.kers'
[2026-05-25 09:06:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6349553863558006623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18433046837278491900.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 303 rows 109 cols 1229 entries
Finished phase 1 with 85 SingleSign rule and 4 generalized
[2026-05-25 09:06:30] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18433046837278491900.kers
Total runtime 2 ms.
[2026-05-25 09:06:30] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 46/104 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 8/112 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 303/415 variables, 112/136 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 132/268 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 268 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 31/30 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 46/104 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 8/112 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 303/415 variables, 112/148 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 30/310 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 19 (OVERLAPS) 0/415 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 320 constraints, problems are : Problem set: 0 solved, 31 unsolved in 23697 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 31/30 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25730ms problems are : Problem set: 0 solved, 31 unsolved
Parikh walk visited 23 properties in 26425 ms.
Support contains 28 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 303
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 106 transition count 291
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 106 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 105 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 105 transition count 285
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 1 with 4 rules applied. Total rules applied 17 place count 103 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 102 transition count 285
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 102 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 100 transition count 283
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 100 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 98 transition count 281
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 44 place count 98 transition count 281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 97 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 97 transition count 275
Applied a total of 46 rules in 44 ms. Remains 97 /112 variables (removed 15) and now considering 275/303 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 97/112 places, 275/303 transitions.
RANDOM walk for 40000 steps (3707 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (725 resets) in 61 ms. (645 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (782 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (674 resets) in 75 ms. (526 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (139 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (788 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (636 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (834 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (721 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1554201972946817252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15459184250918281601.kers'
[2026-05-25 09:07:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1554201972946817252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15459184250918281601.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 275 rows 95 cols 1175 entries
Finished phase 1 with 71 SingleSign rule and 4 generalized
[2026-05-25 09:07:22] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15459184250918281601.kers
Total runtime 2 ms.
[2026-05-25 09:07:22] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 62/85 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 12/97 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 275/372 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 128/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 249 constraints, problems are : Problem set: 0 solved, 6 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 62/85 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 12/97 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 275/372 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 128/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/372 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 260 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4824ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 2 properties in 901 ms.
Support contains 17 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 275/275 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 275
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 95 transition count 274
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 95 transition count 377
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 25 place count 92 transition count 361
Applied a total of 25 rules in 21 ms. Remains 92 /97 variables (removed 5) and now considering 361/275 (removed -86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 92/97 places, 361/275 transitions.
RANDOM walk for 40000 steps (3806 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (779 resets) in 67 ms. (588 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (781 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (643 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (714 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13839669311783534883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10892955287472160829.kers'
[2026-05-25 09:07:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13839669311783534883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10892955287472160829.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 361 rows 91 cols 1694 entries
Finished phase 1 with 67 SingleSign rule and 4 generalized
[2026-05-25 09:07:28] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10892955287472160829.kers
Total runtime 2 ms.
[2026-05-25 09:07:28] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/81 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/91 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 361/452 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 152/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/453 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/453 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 265 constraints, problems are : Problem set: 0 solved, 3 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/81 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/91 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 361/452 variables, 91/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 152/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/453 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/453 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/453 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/453 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 276 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3700ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 221 ms.
Support contains 15 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 361/361 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 361
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 91 transition count 361
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 90 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 90 transition count 359
Applied a total of 5 rules in 34 ms. Remains 90 /92 variables (removed 2) and now considering 359/361 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 90/92 places, 359/361 transitions.
RANDOM walk for 40000 steps (3719 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (765 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (651 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (718 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 855312 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 3
Probabilistic random walk after 855312 steps, saw 170421 distinct states, run finished after 3008 ms. (steps per millisecond=284 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17570956624293584473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4353726021091169742.kers'
[2026-05-25 09:07:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17570956624293584473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4353726021091169742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 90 cols 1690 entries
Finished phase 1 with 66 SingleSign rule and 4 generalized
[2026-05-25 09:07:35] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4353726021091169742.kers
Total runtime 2 ms.
[2026-05-25 09:07:35] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/79 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/89 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 359/448 variables, 89/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 152/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/449 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/79 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 10/89 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 359/448 variables, 89/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 152/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/449 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/449 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 273 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2567 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2930ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 463 ms.
Support contains 15 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 359/359 transitions.
Applied a total of 0 rules in 19 ms. Remains 90 /90 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 90/90 places, 359/359 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 359/359 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 359/359 (removed 0) transitions.
[2026-05-25 09:07:39] [INFO ] Invariant cache hit.
[2026-05-25 09:07:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 09:07:39] [INFO ] Invariant cache hit.
[2026-05-25 09:07:39] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-25 09:07:39] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2026-05-25 09:07:39] [INFO ] Redundant transitions in 23 ms returned []
Running 358 sub problems to find dead transitions.
[2026-05-25 09:07:39] [INFO ] Invariant cache hit.
[2026-05-25 09:07:39] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 359/449 variables, 90/136 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 152/288 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (OVERLAPS) 0/449 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 288 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 359/449 variables, 90/137 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 152/289 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 358/647 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 653 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60994 ms. Remains : 90/90 places, 359/359 transitions.
Successfully simplified 27 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-11-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:08:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-25 09:08:40] [INFO ] Flatten gal took : 32 ms
FORMULA MedleyA-PT-11-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:08:40] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:08:40] [INFO ] Input system was already deterministic with 323 transitions.
Support contains 53 out of 127 places (down from 69) after GAL structural reductions.
Computed a total of 25 stabilizing places and 132 stable transitions
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 103 transition count 278
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 103 transition count 278
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 48 place count 96 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 55 place count 96 transition count 241
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 58 place count 93 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 93 transition count 229
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 0 with 2 rules applied. Total rules applied 63 place count 92 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 92 transition count 226
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 0 with 4 rules applied. Total rules applied 69 place count 90 transition count 224
Applied a total of 69 rules in 28 ms. Remains 90 /127 variables (removed 37) and now considering 224/323 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4452171506997555249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-270268524784877673.kers'
[2026-05-25 09:08:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4452171506997555249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-270268524784877673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 90 cols 915 entries
Finished phase 1 with 66 SingleSign rule and 4 generalized
[2026-05-25 09:08:40] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-270268524784877673.kers
Total runtime 4 ms.
[2026-05-25 09:08:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:08:40] [INFO ] Invariant cache hit.
[2026-05-25 09:08:40] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 09:08:40] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2026-05-25 09:08:40] [INFO ] Redundant transitions in 4 ms returned []
Running 223 sub problems to find dead transitions.
[2026-05-25 09:08:40] [INFO ] Invariant cache hit.
[2026-05-25 09:08:40] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/314 variables, 90/116 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 110/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 226 constraints, problems are : Problem set: 0 solved, 223 unsolved in 11191 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/314 variables, 90/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 110/227 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 223/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 451 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41292ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 41293ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/127 places, 224/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41621 ms. Remains : 90/127 places, 224/323 transitions.
[2026-05-25 09:09:21] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:09:21] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:09:21] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-25 09:09:21] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:09:21] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:09:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14567725308518924339.gal : 5 ms
[2026-05-25 09:09:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7572534572045233380.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14567725308518924339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7572534572045233380.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:09:52] [INFO ] Flatten gal took : 24 ms
[2026-05-25 09:09:52] [INFO ] Applying decomposition
[2026-05-25 09:09:52] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8224186662269534134.txt' '-o' '/tmp/graph8224186662269534134.bin' '-w' '/tmp/graph8224186662269534134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8224186662269534134.bin' '-l' '-1' '-v' '-w' '/tmp/graph8224186662269534134.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:09:52] [INFO ] Decomposing Gal with order
[2026-05-25 09:09:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:09:52] [INFO ] Removed a total of 476 redundant transitions.
[2026-05-25 09:09:52] [INFO ] Flatten gal took : 134 ms
[2026-05-25 09:09:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 14 ms.
[2026-05-25 09:09:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3400321947722175211.gal : 4 ms
[2026-05-25 09:09:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11882664373266741483.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/CTLFireability3400321947722175211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11882664373266741483.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.83206e+08,28.7932,513184,3914,225,654294,2640,416,2.85579e+06,89,30494,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 323
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 105 transition count 279
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 105 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 97 transition count 236
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 97 transition count 236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 94 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 94 transition count 224
Applied a total of 64 rules in 23 ms. Remains 94 /127 variables (removed 33) and now considering 224/323 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8024492955571621105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1612417621150870952.kers'
[2026-05-25 09:10:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8024492955571621105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1612417621150870952.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 224 rows 93 cols 916 entries
Finished phase 1 with 69 SingleSign rule and 4 generalized
[2026-05-25 09:10:22] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1612417621150870952.kers
Total runtime 1 ms.
[2026-05-25 09:10:22] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 09:10:22] [INFO ] Invariant cache hit.
[2026-05-25 09:10:22] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:10:22] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 09:10:22] [INFO ] Invariant cache hit.
[2026-05-25 09:10:22] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/318 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 108/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/318 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 236 constraints, problems are : Problem set: 0 solved, 223 unsolved in 23008 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/318 variables, 94/128 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 108/236 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 223/459 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 459 constraints, problems are : Problem set: 0 solved, 223 unsolved in 23954 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47065ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 47066ms
Starting structural reductions in LTL mode, iteration 1 : 94/127 places, 224/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47410 ms. Remains : 94/127 places, 224/323 transitions.
[2026-05-25 09:11:10] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:11:10] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:11:10] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-25 09:11:10] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:11:10] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:11:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16529437831036394363.gal : 3 ms
[2026-05-25 09:11:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12039613536675401664.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/CTLFireability16529437831036394363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12039613536675401664.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.
Detected timeout of ITS tools.
[2026-05-25 09:11:40] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:11:40] [INFO ] Applying decomposition
[2026-05-25 09:11:40] [INFO ] Flatten gal took : 35 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/graph5741656452783200407.txt' '-o' '/tmp/graph5741656452783200407.bin' '-w' '/tmp/graph5741656452783200407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5741656452783200407.bin' '-l' '-1' '-v' '-w' '/tmp/graph5741656452783200407.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:11:40] [INFO ] Decomposing Gal with order
[2026-05-25 09:11:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:11:40] [INFO ] Removed a total of 498 redundant transitions.
[2026-05-25 09:11:40] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2026-05-25 09:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12114332749451437521.gal : 3 ms
[2026-05-25 09:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9373931249077348529.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/CTLFireability12114332749451437521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9373931249077348529.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.018e+09,23.0525,491240,2996,51,666592,314,380,2.835e+06,51,1265,0


Converting to forward existential form...Done !
original formula: E(AF(!(AG((((i2.i0.u16.p97==1)&&(i2.i1.u17.p101==1))&&(i2.i0.u23.p119==1))))) U !(EG(!(AX((((i0.i1.u0.p9==1)&&(i0.i0.u3.p18==1))&&((i3.u3...188
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!(!(E(TRUE U !((((i2.i0.u16.p97==1)&&(i2.i1.u17.p101==1))&&(i2.i0.u23.p119==1)))))))))) * !(E...258
Reverse transition relation is NOT exact ! Due to transitions i0.t220, i0.t218, i0.t216, i0.t214, i0.t56, i0.i0.t61, i0.i0.t222, i0.i0.u1.t47, i0.i0.u1.t66...1111
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 101 transition count 272
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 101 transition count 272
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 52 place count 92 transition count 225
Iterating global reduction 0 with 9 rules applied. Total rules applied 61 place count 92 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 64 place count 89 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 89 transition count 213
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 0 with 2 rules applied. Total rules applied 69 place count 88 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 88 transition count 209
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 0 with 4 rules applied. Total rules applied 76 place count 86 transition count 207
Applied a total of 76 rules in 23 ms. Remains 86 /127 variables (removed 41) and now considering 207/323 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5594983596598361889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7055897777390876880.kers'
[2026-05-25 09:12:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5594983596598361889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7055897777390876880.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 86 cols 839 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 09:12:10] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7055897777390876880.kers
Total runtime 1 ms.
[2026-05-25 09:12:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:12:10] [INFO ] Invariant cache hit.
[2026-05-25 09:12:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:12:10] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2026-05-25 09:12:10] [INFO ] Redundant transitions in 3 ms returned []
Running 198 sub problems to find dead transitions.
[2026-05-25 09:12:10] [INFO ] Invariant cache hit.
[2026-05-25 09:12:10] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 207/293 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 145 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11789 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 207/293 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 198/343 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 343 constraints, problems are : Problem set: 0 solved, 198 unsolved in 15519 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27391ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 27391ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/127 places, 207/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27799 ms. Remains : 86/127 places, 207/323 transitions.
[2026-05-25 09:12:38] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:12:38] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:12:38] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:12:38] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:12:38] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:12:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13473384591127469572.gal : 2 ms
[2026-05-25 09:12:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12281675265306761675.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/CTLFireability13473384591127469572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12281675265306761675.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.04961e+08,23.7031,460452,2,44098,5,1.4933e+06,6,0,544,2.47675e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:13:08] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:13:08] [INFO ] Applying decomposition
[2026-05-25 09:13:08] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15727957858375921632.txt' '-o' '/tmp/graph15727957858375921632.bin' '-w' '/tmp/graph15727957858375921632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15727957858375921632.bin' '-l' '-1' '-v' '-w' '/tmp/graph15727957858375921632.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:13:08] [INFO ] Decomposing Gal with order
[2026-05-25 09:13:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:13:08] [INFO ] Removed a total of 459 redundant transitions.
[2026-05-25 09:13:08] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2026-05-25 09:13:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4776117509553709257.gal : 6 ms
[2026-05-25 09:13:08] [INFO ] Time to serialize properties into /tmp/CTLFireability17468417514171887538.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/CTLFireability4776117509553709257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17468417514171887538.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.04961e+08,21.5226,474436,2699,28,635484,117,257,2.74861e+06,35,466,0


Converting to forward existential form...Done !
original formula: AF((i2.i0.u17.p100==1))
=> equivalent forward existential formula: [FwdG(Init,!((i2.i0.u17.p100==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 323
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 106 transition count 278
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 106 transition count 278
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 99 transition count 241
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 99 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 98 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 98 transition count 237
Applied a total of 56 rules in 13 ms. Remains 98 /127 variables (removed 29) and now considering 237/323 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11992243919388554773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4160074888279891439.kers'
[2026-05-25 09:13:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11992243919388554773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4160074888279891439.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 237 rows 97 cols 958 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:13:38] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4160074888279891439.kers
Total runtime 3 ms.
[2026-05-25 09:13:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 09:13:38] [INFO ] Invariant cache hit.
[2026-05-25 09:13:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-25 09:13:38] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2026-05-25 09:13:38] [INFO ] Invariant cache hit.
[2026-05-25 09:13:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 237/335 variables, 98/127 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 111/238 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 238 constraints, problems are : Problem set: 0 solved, 236 unsolved in 12709 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 237/335 variables, 98/127 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 111/238 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 236/474 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 474 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42841ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 42842ms
Starting structural reductions in LTL mode, iteration 1 : 98/127 places, 237/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43192 ms. Remains : 98/127 places, 237/323 transitions.
[2026-05-25 09:14:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:21] [INFO ] Input system was already deterministic with 237 transitions.
[2026-05-25 09:14:21] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:14:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10800910241830486922.gal : 2 ms
[2026-05-25 09:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8772444542237023019.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/CTLFireability10800910241830486922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8772444542237023019.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:14:51] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:14:51] [INFO ] Applying decomposition
[2026-05-25 09:14:51] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14188718852712259451.txt' '-o' '/tmp/graph14188718852712259451.bin' '-w' '/tmp/graph14188718852712259451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14188718852712259451.bin' '-l' '-1' '-v' '-w' '/tmp/graph14188718852712259451.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:14:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:14:51] [INFO ] Removed a total of 399 redundant transitions.
[2026-05-25 09:14:51] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:14:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2026-05-25 09:14:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11775620259776554482.gal : 1 ms
[2026-05-25 09:14:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14610491296865818183.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/CTLFireability11775620259776554482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14610491296865818183.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,1.41687e+09,11.7065,261680,4231,289,358350,1018,352,1.40428e+06,142,9628,0


Converting to forward existential form...Done !
original formula: A((AG(((EG((i1.i1.u12.p71!=1)) * (u19.p123==1)) * AX((i2.u17.p110==1)))) + E((((i0.u5.p9==1)&&(u1.p15==1))&&((i4.u25.p51==1)&&(i4.u22.p54...305
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(EX(!(!(E(TRUE U !((((i0.u5.p9==1)&&(i0.u0.p13==1))&&(i0.u5.p31==1)))))))))))))...618
Reverse transition relation is NOT exact ! Due to transitions t68, t106, t129, t156, t162, t175, t177, t190, t204, t235, u19.t3, u19.t4, u19.t5, u19.t6, u1...1155
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 104 transition count 279
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 104 transition count 279
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 49 place count 96 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 57 place count 96 transition count 236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 60 place count 93 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 93 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 93 transition count 221
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 90 transition count 218
Applied a total of 72 rules in 23 ms. Remains 90 /127 variables (removed 37) and now considering 218/323 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5561981716476095188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7577104718288003249.kers'
[2026-05-25 09:15:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5561981716476095188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7577104718288003249.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 218 rows 89 cols 887 entries
Finished phase 1 with 65 SingleSign rule and 4 generalized
[2026-05-25 09:15:21] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7577104718288003249.kers
Total runtime 1 ms.
[2026-05-25 09:15:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:15:22] [INFO ] Invariant cache hit.
[2026-05-25 09:15:22] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:15:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2026-05-25 09:15:22] [INFO ] Redundant transitions in 2 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-25 09:15:22] [INFO ] Invariant cache hit.
[2026-05-25 09:15:22] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 218/308 variables, 90/123 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 108/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 231 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15311 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/308 variables, 90/123 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 108/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 217/448 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 449 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45437ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45438ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/127 places, 218/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45801 ms. Remains : 90/127 places, 218/323 transitions.
[2026-05-25 09:16:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:16:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:16:07] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-25 09:16:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:16:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:16:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6314391136457461755.gal : 2 ms
[2026-05-25 09:16:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5617971861686013908.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/CTLFireability6314391136457461755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5617971861686013908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:16:37] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:16:37] [INFO ] Applying decomposition
[2026-05-25 09:16:37] [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/graph10968069728232030305.txt' '-o' '/tmp/graph10968069728232030305.bin' '-w' '/tmp/graph10968069728232030305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10968069728232030305.bin' '-l' '-1' '-v' '-w' '/tmp/graph10968069728232030305.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:16:37] [INFO ] Decomposing Gal with order
[2026-05-25 09:16:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:16:37] [INFO ] Removed a total of 457 redundant transitions.
[2026-05-25 09:16:37] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:16:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2026-05-25 09:16:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6278084785776214402.gal : 1 ms
[2026-05-25 09:16:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9233401573189808869.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/CTLFireability6278084785776214402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9233401573189808869.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.18828e+08,21.56,467300,3416,85,627081,954,352,2.60905e+06,88,4835,0


Converting to forward existential form...Done !
original formula: EF((A(((((i4.u16.p97==1)&&(i4.u16.p101==1))&&(i4.u21.p117==1))||(((i1.i1.u8.p53==1)&&(i5.i0.u25.p54==1))&&((i5.i0.u23.p133==1)&&(i5.i0.u2...367
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(E((((i5.i1.u24.p95==1)&&(i5.i1.u26.p98==1))&&((i5.i0.u23.p133==1)&&(i5.i1.u26.p148=...834
Reverse transition relation is NOT exact ! Due to transitions t20, t138, t144, t166, t169, t183, u17.t21, u17.t24, u18.t22, u18.t23, i0.t207, i0.t205, i0.t...1060
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 104 transition count 280
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 104 transition count 280
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 47 place count 96 transition count 238
Iterating global reduction 0 with 8 rules applied. Total rules applied 55 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 94 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 94 transition count 230
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 0 with 2 rules applied. Total rules applied 61 place count 93 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 93 transition count 226
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 90 transition count 223
Applied a total of 70 rules in 57 ms. Remains 90 /127 variables (removed 37) and now considering 223/323 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6678060762671183392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11024592741492202661.kers'
[2026-05-25 09:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6678060762671183392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11024592741492202661.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 90 cols 915 entries
Finished phase 1 with 66 SingleSign rule and 4 generalized
[2026-05-25 09:17:08] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11024592741492202661.kers
Total runtime 2 ms.
[2026-05-25 09:17:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-25 09:17:08] [INFO ] Invariant cache hit.
[2026-05-25 09:17:08] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-25 09:17:08] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2026-05-25 09:17:08] [INFO ] Redundant transitions in 0 ms returned []
Running 222 sub problems to find dead transitions.
[2026-05-25 09:17:08] [INFO ] Invariant cache hit.
[2026-05-25 09:17:08] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/313 variables, 90/117 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 110/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 227 constraints, problems are : Problem set: 0 solved, 222 unsolved in 12139 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/313 variables, 90/117 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 110/227 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 222/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 0/313 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 449 constraints, problems are : Problem set: 0 solved, 222 unsolved in 29468 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41719ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 41719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/127 places, 223/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42118 ms. Remains : 90/127 places, 223/323 transitions.
[2026-05-25 09:17:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:17:50] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:17:50] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-25 09:17:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:17:50] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:17:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14760166329909890208.gal : 1 ms
[2026-05-25 09:17:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8739077752855020429.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/CTLFireability14760166329909890208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8739077752855020429.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:18:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:18:20] [INFO ] Applying decomposition
[2026-05-25 09:18:20] [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/graph15940589228614489400.txt' '-o' '/tmp/graph15940589228614489400.bin' '-w' '/tmp/graph15940589228614489400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15940589228614489400.bin' '-l' '-1' '-v' '-w' '/tmp/graph15940589228614489400.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:18:20] [INFO ] Decomposing Gal with order
[2026-05-25 09:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:18:20] [INFO ] Removed a total of 434 redundant transitions.
[2026-05-25 09:18:20] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2026-05-25 09:18:20] [INFO ] Time to serialize gal into /tmp/CTLFireability388677565206320215.gal : 3 ms
[2026-05-25 09:18:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16275679377758798165.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/CTLFireability388677565206320215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16275679377758798165.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 102 transition count 277
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 102 transition count 277
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 49 place count 94 transition count 234
Iterating global reduction 0 with 8 rules applied. Total rules applied 57 place count 94 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 60 place count 91 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 91 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 90 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 90 transition count 218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 87 transition count 215
Applied a total of 74 rules in 19 ms. Remains 87 /127 variables (removed 40) and now considering 215/323 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12384089943526618754.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6006629157699575188.kers'
[2026-05-25 09:18:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12384089943526618754.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6006629157699575188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 87 cols 871 entries
Finished phase 1 with 63 SingleSign rule and 4 generalized
[2026-05-25 09:18:50] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6006629157699575188.kers
Total runtime 3 ms.
[2026-05-25 09:18:50] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 09:18:50] [INFO ] Invariant cache hit.
[2026-05-25 09:18:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:18:50] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2026-05-25 09:18:50] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2026-05-25 09:18:50] [INFO ] Invariant cache hit.
[2026-05-25 09:18:50] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 215/302 variables, 87/114 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 150 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15140 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (OVERLAPS) 3/87 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 215/302 variables, 87/114 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 206/356 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 206 unsolved in 27741 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42970ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 42971ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/127 places, 215/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43258 ms. Remains : 87/127 places, 215/323 transitions.
[2026-05-25 09:19:33] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:19:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:19:33] [INFO ] Input system was already deterministic with 215 transitions.
[2026-05-25 09:19:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:19:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:19:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2031748508046589081.gal : 2 ms
[2026-05-25 09:19:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12672586816744400285.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/CTLFireability2031748508046589081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12672586816744400285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:20:03] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:20:03] [INFO ] Applying decomposition
[2026-05-25 09:20:03] [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/graph2354560336891029196.txt' '-o' '/tmp/graph2354560336891029196.bin' '-w' '/tmp/graph2354560336891029196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2354560336891029196.bin' '-l' '-1' '-v' '-w' '/tmp/graph2354560336891029196.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:20:03] [INFO ] Decomposing Gal with order
[2026-05-25 09:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:20:03] [INFO ] Removed a total of 405 redundant transitions.
[2026-05-25 09:20:03] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2026-05-25 09:20:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16647110266652458186.gal : 1 ms
[2026-05-25 09:20:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6428542507493089699.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/CTLFireability16647110266652458186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6428542507493089699.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07484e+08,17.6071,348272,3049,266,455630,3441,266,1.99963e+06,108,22535,0


Converting to forward existential form...Done !
original formula: EF(EG((i3.u16.p129==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i3.u16.p129==1))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 106 transition count 284
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 106 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 99 transition count 247
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 99 transition count 247
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 97 transition count 239
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 97 transition count 239
Applied a total of 57 rules in 12 ms. Remains 97 /127 variables (removed 30) and now considering 239/323 (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-3323800535884609742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1908846030361923409.kers'
[2026-05-25 09:20:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3323800535884609742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1908846030361923409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 97 cols 962 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:20:33] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1908846030361923409.kers
Total runtime 4 ms.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:20:34] [INFO ] Invariant cache hit.
[2026-05-25 09:20:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-25 09:20:34] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-25 09:20:34] [INFO ] Invariant cache hit.
[2026-05-25 09:20:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 239/336 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 239 constraints, problems are : Problem set: 0 solved, 238 unsolved in 15771 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 239/336 variables, 97/129 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 111/240 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 238/478 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 478 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45867ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 45868ms
Starting structural reductions in LTL mode, iteration 1 : 97/127 places, 239/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46196 ms. Remains : 97/127 places, 239/323 transitions.
[2026-05-25 09:21:20] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:21:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:21:20] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-25 09:21:20] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:21:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:21:20] [INFO ] Time to serialize gal into /tmp/CTLFireability320276747535767691.gal : 2 ms
[2026-05-25 09:21:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13021608018461495254.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/CTLFireability320276747535767691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13021608018461495254.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:21:50] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:21:50] [INFO ] Applying decomposition
[2026-05-25 09:21:50] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2490203786494353016.txt' '-o' '/tmp/graph2490203786494353016.bin' '-w' '/tmp/graph2490203786494353016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2490203786494353016.bin' '-l' '-1' '-v' '-w' '/tmp/graph2490203786494353016.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:21:50] [INFO ] Decomposing Gal with order
[2026-05-25 09:21:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:21:50] [INFO ] Removed a total of 389 redundant transitions.
[2026-05-25 09:21:50] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:21:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 3 ms.
[2026-05-25 09:21:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12797672514670344403.gal : 2 ms
[2026-05-25 09:21:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17022680397988988740.ctl : 12 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/CTLFireability12797672514670344403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17022680397988988740.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 106 transition count 283
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 106 transition count 283
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 100 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 100 transition count 252
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 97 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 97 transition count 240
Applied a total of 57 rules in 14 ms. Remains 97 /127 variables (removed 30) and now considering 240/323 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4454752242820936073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2989808916084796627.kers'
[2026-05-25 09:22:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4454752242820936073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2989808916084796627.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 240 rows 97 cols 976 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:22:20] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2989808916084796627.kers
Total runtime 4 ms.
[2026-05-25 09:22:20] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 09:22:20] [INFO ] Invariant cache hit.
[2026-05-25 09:22:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-25 09:22:20] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2026-05-25 09:22:20] [INFO ] Invariant cache hit.
[2026-05-25 09:22:20] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/337 variables, 97/130 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 112/242 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 242 constraints, problems are : Problem set: 0 solved, 239 unsolved in 16571 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 240/337 variables, 97/130 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 112/242 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 239/481 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 484 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46708ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 46709ms
Starting structural reductions in LTL mode, iteration 1 : 97/127 places, 240/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47126 ms. Remains : 97/127 places, 240/323 transitions.
[2026-05-25 09:23:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:23:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:23:07] [INFO ] Input system was already deterministic with 240 transitions.
[2026-05-25 09:23:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:23:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:23:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13864983923136416512.gal : 2 ms
[2026-05-25 09:23:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9917844212628685920.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/CTLFireability13864983923136416512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9917844212628685920.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:23:37] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:23:37] [INFO ] Applying decomposition
[2026-05-25 09:23:37] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7991097738732125045.txt' '-o' '/tmp/graph7991097738732125045.bin' '-w' '/tmp/graph7991097738732125045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7991097738732125045.bin' '-l' '-1' '-v' '-w' '/tmp/graph7991097738732125045.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:37] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:37] [INFO ] Removed a total of 436 redundant transitions.
[2026-05-25 09:23:37] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2026-05-25 09:23:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8608463952275038778.gal : 2 ms
[2026-05-25 09:23:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1784091435218286765.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/CTLFireability8608463952275038778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1784091435218286765.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 323
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 104 transition count 274
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 104 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 97 transition count 239
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 97 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 94 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 94 transition count 227
Applied a total of 64 rules in 10 ms. Remains 94 /127 variables (removed 33) and now considering 227/323 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3687418817599792711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16783480522023567886.kers'
[2026-05-25 09:24:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3687418817599792711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16783480522023567886.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 227 rows 93 cols 934 entries
Finished phase 1 with 69 SingleSign rule and 4 generalized
[2026-05-25 09:24:07] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16783480522023567886.kers
Total runtime 4 ms.
[2026-05-25 09:24:08] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:24:08] [INFO ] Invariant cache hit.
[2026-05-25 09:24:08] [INFO ] State equation strengthened by 109 read => feed constraints.
[2026-05-25 09:24:08] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-25 09:24:08] [INFO ] Invariant cache hit.
[2026-05-25 09:24:08] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/321 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 230 constraints, problems are : Problem set: 0 solved, 226 unsolved in 14927 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 227/321 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 109/230 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 226/456 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 458 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45053ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 45053ms
Starting structural reductions in LTL mode, iteration 1 : 94/127 places, 227/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45471 ms. Remains : 94/127 places, 227/323 transitions.
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:24:53] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10328521839723751301.gal : 1 ms
[2026-05-25 09:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9260992385422151383.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/CTLFireability10328521839723751301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9260992385422151383.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:25:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:25:23] [INFO ] Applying decomposition
[2026-05-25 09:25:23] [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/graph13351696523891687863.txt' '-o' '/tmp/graph13351696523891687863.bin' '-w' '/tmp/graph13351696523891687863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13351696523891687863.bin' '-l' '-1' '-v' '-w' '/tmp/graph13351696523891687863.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:25:23] [INFO ] Decomposing Gal with order
[2026-05-25 09:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:25:23] [INFO ] Removed a total of 399 redundant transitions.
[2026-05-25 09:25:23] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2026-05-25 09:25:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15439548816496198654.gal : 1 ms
[2026-05-25 09:25:23] [INFO ] Time to serialize properties into /tmp/CTLFireability711415577152487265.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/CTLFireability15439548816496198654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability711415577152487265.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.05433e+09,21.1114,435084,3435,133,555175,1242,331,2.51634e+06,95,10701,0


Converting to forward existential form...Done !
original formula: AX(((((i1.u5.p9==0)||(i1.u0.p13==0))||(i1.u5.p29==0)) * (EX((i2.u11.p78==1)) + EF((((i1.u5.p9==1)&&(u2.p18==1))&&((i4.u26.p95==1)&&(i4.u2...170
=> equivalent forward existential formula: ([(EY(Init) * !((((i1.u5.p9==0)||(i1.u0.p13==0))||(i1.u5.p29==0))))] = FALSE * [((EY(Init) * !(E(TRUE U (((i1.u5...252
Reverse transition relation is NOT exact ! Due to transitions t39, t62, t120, t124, t143, t187, t211, t225, u2.t64, u2.t65, u8.t41, u8.t42, i1.t220, i1.t21...1043
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 102 transition count 273
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 102 transition count 273
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 52 place count 93 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 61 place count 93 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 64 place count 90 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 90 transition count 214
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 0 with 2 rules applied. Total rules applied 69 place count 89 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 89 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 86 transition count 207
Applied a total of 78 rules in 27 ms. Remains 86 /127 variables (removed 41) and now considering 207/323 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17824632126076614578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1526048806567880002.kers'
[2026-05-25 09:25:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17824632126076614578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1526048806567880002.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 86 cols 851 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 09:25:53] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1526048806567880002.kers
Total runtime 1 ms.
[2026-05-25 09:25:53] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:25:53] [INFO ] Invariant cache hit.
[2026-05-25 09:25:53] [INFO ] State equation strengthened by 105 read => feed constraints.
[2026-05-25 09:25:54] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2026-05-25 09:25:54] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2026-05-25 09:25:54] [INFO ] Invariant cache hit.
[2026-05-25 09:25:54] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/293 variables, 86/110 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 215 constraints, problems are : Problem set: 0 solved, 206 unsolved in 9853 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/293 variables, 86/110 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 206/421 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 421 constraints, problems are : Problem set: 0 solved, 206 unsolved in 25235 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35139ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 35139ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/127 places, 207/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35541 ms. Remains : 86/127 places, 207/323 transitions.
[2026-05-25 09:26:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:26:29] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:26:29] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:26:29] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:29] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10878377609194980384.gal : 1 ms
[2026-05-25 09:26:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10022204499647563869.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/CTLFireability10878377609194980384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10022204499647563869.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,4.81334e+08,24.6128,569608,2,50196,5,1.89202e+06,6,0,547,3.29034e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:26:59] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:59] [INFO ] Applying decomposition
[2026-05-25 09:26:59] [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/graph568612929041307656.txt' '-o' '/tmp/graph568612929041307656.bin' '-w' '/tmp/graph568612929041307656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph568612929041307656.bin' '-l' '-1' '-v' '-w' '/tmp/graph568612929041307656.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:26:59] [INFO ] Decomposing Gal with order
[2026-05-25 09:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:26:59] [INFO ] Removed a total of 464 redundant transitions.
[2026-05-25 09:26:59] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 2 ms.
[2026-05-25 09:26:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11498615843866701876.gal : 10 ms
[2026-05-25 09:26:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6300466563675076394.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/CTLFireability11498615843866701876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6300466563675076394.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,4.81334e+08,26.0755,478404,3086,25,675569,123,351,2.82802e+06,33,332,0


Converting to forward existential form...Done !
original formula: EF((((AF(AG((((i0.u0.p9==1)&&(i0.u7.p43==1))&&((i2.i1.u16.p97==1)&&(i2.i0.u18.p103==1))))) * (i0.u0.p9==1)) * ((i0.u7.p43==1)&&(i2.i1.u16...189
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (i2.i0.u20.p109==1)) * ((i0.u7.p43==1)&&(i2.i1.u16.p97==1))) * (i0.u0.p9==1)) * !(EG(!(!(...259
Reverse transition relation is NOT exact ! Due to transitions i0.t197, i0.t195, i0.t191, i0.t189, i0.t187, i0.t52, i0.t47, i0.t44, i0.t41, i0.t40, i0.u1.t3...969
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 323/323 transitions.
Graph (complete) has 807 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 104 transition count 275
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 104 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 98 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 98 transition count 243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 55 place count 96 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 96 transition count 235
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 0 with 2 rules applied. Total rules applied 59 place count 95 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 95 transition count 233
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 0 with 2 rules applied. Total rules applied 62 place count 94 transition count 232
Applied a total of 62 rules in 16 ms. Remains 94 /127 variables (removed 33) and now considering 232/323 (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-17119510777603263285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7582994799742598356.kers'
[2026-05-25 09:27:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17119510777603263285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7582994799742598356.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 232 rows 93 cols 933 entries
Finished phase 1 with 69 SingleSign rule and 4 generalized
[2026-05-25 09:27:29] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-7582994799742598356.kers
Total runtime 12 ms.
[2026-05-25 09:27:29] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 09:27:29] [INFO ] Invariant cache hit.
[2026-05-25 09:27:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-25 09:27:29] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2026-05-25 09:27:29] [INFO ] Redundant transitions in 2 ms returned []
Running 231 sub problems to find dead transitions.
[2026-05-25 09:27:29] [INFO ] Invariant cache hit.
[2026-05-25 09:27:29] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/326 variables, 94/125 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 111/236 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 237 constraints, problems are : Problem set: 0 solved, 231 unsolved in 16674 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 232/326 variables, 94/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 111/237 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 231/468 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 0/326 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 470 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46761ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 46762ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/127 places, 232/323 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47082 ms. Remains : 94/127 places, 232/323 transitions.
[2026-05-25 09:28:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:28:16] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:28:16] [INFO ] Input system was already deterministic with 232 transitions.
[2026-05-25 09:28:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:28:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:28:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11598481523521446128.gal : 2 ms
[2026-05-25 09:28:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15780219186535929575.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/CTLFireability11598481523521446128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15780219186535929575.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.
Detected timeout of ITS tools.
[2026-05-25 09:28:46] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:28:46] [INFO ] Applying decomposition
[2026-05-25 09:28:46] [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/graph18360570696977712103.txt' '-o' '/tmp/graph18360570696977712103.bin' '-w' '/tmp/graph18360570696977712103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18360570696977712103.bin' '-l' '-1' '-v' '-w' '/tmp/graph18360570696977712103.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:28:46] [INFO ] Decomposing Gal with order
[2026-05-25 09:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:28:46] [INFO ] Removed a total of 460 redundant transitions.
[2026-05-25 09:28:46] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2026-05-25 09:28:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15682732813744979959.gal : 2 ms
[2026-05-25 09:28:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18093361568979197021.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/CTLFireability15682732813744979959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18093361568979197021.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,8.10779e+08,21.6227,463348,5899,175,687273,579,409,2.78018e+06,103,5857,0


Converting to forward existential form...Done !
original formula: (AF(EG(E((((i0.u5.p9==1)&&(i0.u3.p21==1))&&((i2.i0.u26.p51==1)&&(i2.i0.u23.p54==1))) U (((i0.u5.p9==1)&&(i0.u5.p43==1))&&((i4.u14.p97==1)...469
=> equivalent forward existential formula: (((([(FwdU(FwdU((FwdU((Init * !(!(EG(!(EG(E((((i0.u5.p9==1)&&(i0.u3.p21==1))&&((i2.i0.u26.p51==1)&&(i2.i0.u23.p5...2886
Reverse transition relation is NOT exact ! Due to transitions t63, t112, t115, t123, t126, t146, t152, t169, t171, t173, t175, t182, t197, t224, i0.t219, i...1186
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Detected timeout of ITS tools.
[2026-05-25 09:29:16] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:29:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:29:16] [INFO ] Applying decomposition
[2026-05-25 09:29:16] [INFO ] Flatten gal took : 20 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/graph10820094889774559620.txt' '-o' '/tmp/graph10820094889774559620.bin' '-w' '/tmp/graph10820094889774559620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10820094889774559620.bin' '-l' '-1' '-v' '-w' '/tmp/graph10820094889774559620.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:29:16] [INFO ] Decomposing Gal with order
[2026-05-25 09:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:29:16] [INFO ] Removed a total of 437 redundant transitions.
[2026-05-25 09:29:16] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 3 ms.
[2026-05-25 09:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17933350453341293267.gal : 2 ms
[2026-05-25 09:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12507471773356252137.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/CTLFireability17933350453341293267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12507471773356252137.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 12 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:57:37] [INFO ] Applying decomposition
[2026-05-25 09:57:37] [INFO ] Flatten gal took : 139 ms
[2026-05-25 09:57:37] [INFO ] Decomposing Gal with order
[2026-05-25 09:57:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:57:38] [INFO ] Removed a total of 671 redundant transitions.
[2026-05-25 09:57:38] [INFO ] Flatten gal took : 396 ms
[2026-05-25 09:57:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 48 ms.
[2026-05-25 09:57:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7396588068792818274.gal : 27 ms
[2026-05-25 09:57:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11881811696223339727.ctl : 7 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/CTLFireability7396588068792818274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11881811696223339727.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 12 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-11"
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-11, 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-177969019900178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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