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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 238K 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-22-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779702493133

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-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:48:14] [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:48:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:48:14] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2026-05-25 09:48:14] [INFO ] Transformed 307 places.
[2026-05-25 09:48:14] [INFO ] Transformed 740 transitions.
[2026-05-25 09:48:14] [INFO ] Found NUPN structural information;
[2026-05-25 09:48:14] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 85 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 86 place count 221 transition count 645
Iterating global reduction 1 with 82 rules applied. Total rules applied 168 place count 221 transition count 645
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 176 place count 221 transition count 637
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 184 place count 213 transition count 629
Iterating global reduction 2 with 8 rules applied. Total rules applied 192 place count 213 transition count 629
Applied a total of 192 rules in 60 ms. Remains 213 /307 variables (removed 94) and now considering 629/740 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6992602569858850727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10811840900171100168.kers'
[2026-05-25 09:48:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6992602569858850727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10811840900171100168.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 629 rows 213 cols 3589 entries
Finished phase 1 with 183 SingleSign rule and 8 generalized
[2026-05-25 09:48:15] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10811840900171100168.kers
Total runtime 5 ms.
[2026-05-25 09:48:15] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-25 09:48:15] [INFO ] Invariant cache hit.
[2026-05-25 09:48:15] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 628 sub problems to find dead transitions.
[2026-05-25 09:48:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 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 TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD575 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/213 variables, 10/22 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 13/35 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/37 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 144 solved, 484 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/250 constraints. Problems are: Problem set: 144 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 842/842 variables, and 250 constraints, problems are : Problem set: 144 solved, 484 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 12/12 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/12 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 10/22 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 15/37 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 5 (OVERLAPS) 629/842 variables, 213/250 constraints. Problems are: Problem set: 144 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/842 variables, 484/734 constraints. Problems are: Problem set: 144 solved, 484 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 842/842 variables, and 740 constraints, problems are : Problem set: 144 solved, 484 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 484/628 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61228ms problems are : Problem set: 144 solved, 484 unsolved
Search for dead transitions found 144 dead transitions in 61250ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 213/307 places, 485/740 transitions.
Applied a total of 0 rules in 6 ms. Remains 213 /213 variables (removed 0) and now considering 485/485 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61993 ms. Remains : 213/307 places, 485/740 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Applied a total of 0 rules in 5 ms. Remains 213 /213 variables (removed 0) and now considering 485/485 (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-5159866626797845337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15775697578270729591.kers'
[2026-05-25 09:49:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5159866626797845337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15775697578270729591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 485 rows 213 cols 2437 entries
Finished phase 1 with 183 SingleSign rule and 8 generalized
[2026-05-25 09:49:17] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15775697578270729591.kers
Total runtime 3 ms.
[2026-05-25 09:49:17] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 09:49:17] [INFO ] Invariant cache hit.
[2026-05-25 09:49:17] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 484 sub problems to find dead transitions.
[2026-05-25 09:49:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (OVERLAPS) 485/698 variables, 213/251 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 698/698 variables, and 254 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/213 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (OVERLAPS) 485/698 variables, 213/254 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 484/738 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/698 variables, and 747 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 60398ms
Finished structural reductions in LTL mode , in 1 iterations and 61034 ms. Remains : 213/213 places, 485/485 transitions.
Support contains 85 out of 213 places after structural reductions.
[2026-05-25 09:50:18] [INFO ] Flatten gal took : 77 ms
[2026-05-25 09:50:18] [INFO ] Flatten gal took : 36 ms
[2026-05-25 09:50:18] [INFO ] Input system was already deterministic with 485 transitions.
RANDOM walk for 40000 steps (1164 resets) in 2236 ms. (17 steps per ms) remains 64/82 properties
BEST_FIRST walk for 4003 steps (23 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (18 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (22 resets) in 25 ms. (154 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (20 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (23 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (25 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (23 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (21 resets) in 46 ms. (85 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (22 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (21 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (22 resets) in 24 ms. (160 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4003 steps (21 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (21 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (22 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (18 resets) in 22 ms. (174 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4002 steps (21 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (23 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (25 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (19 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (21 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (20 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (24 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (19 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (23 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (19 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
[2026-05-25 09:50:19] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 1 (OVERLAPS) 118/184 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 49 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/200 variables, 9/21 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 3/203 variables, 1/22 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 478/681 variables, 203/225 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 1/226 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 2/228 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 1/229 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 0/229 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 11/692 variables, 7/236 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 1/237 constraints. Problems are: Problem set: 15 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 692/698 variables, and 237 constraints, problems are : Problem set: 15 solved, 44 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 210/213 constraints, PredecessorRefiner: 59/56 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 15 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 44 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 120/177 variables, 12/12 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 1/13 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 11/188 variables, 6/19 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/21 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 3/24 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 3/27 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 5/32 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 2/34 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/35 constraints. Problems are: Problem set: 16 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 5/40 constraints. Problems are: Problem set: 16 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/698 variables, and 40 constraints, problems are : Problem set: 16 solved, 43 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/10 constraints, State Equation: 0/213 constraints, PredecessorRefiner: 3/56 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 10138ms problems are : Problem set: 16 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 485/485 transitions.
Graph (complete) has 910 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 212 transition count 467
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 196 transition count 467
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 196 transition count 462
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 191 transition count 462
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 53 place count 182 transition count 447
Iterating global reduction 2 with 9 rules applied. Total rules applied 62 place count 182 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 182 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 181 transition count 444
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 181 transition count 444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 180 transition count 441
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 180 transition count 441
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 95 place count 166 transition count 427
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 165 transition count 426
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 165 transition count 426
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 117 place count 155 transition count 551
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 149 place count 155 transition count 519
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 4 with 92 rules applied. Total rules applied 241 place count 155 transition count 427
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 155 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 154 transition count 426
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 250 place count 154 transition count 420
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 257 place count 147 transition count 420
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 275 place count 147 transition count 420
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 277 place count 145 transition count 417
Iterating global reduction 6 with 2 rules applied. Total rules applied 279 place count 145 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 144 transition count 416
Applied a total of 280 rules in 168 ms. Remains 144 /213 variables (removed 69) and now considering 416/485 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 144/213 places, 416/485 transitions.
RANDOM walk for 40000 steps (2448 resets) in 640 ms. (62 steps per ms) remains 30/43 properties
BEST_FIRST walk for 4001 steps (17 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (36 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (35 resets) in 18 ms. (210 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (18 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (39 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12707772254021048481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12321823291176459062.kers'
[2026-05-25 09:50:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12707772254021048481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12321823291176459062.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 416 rows 144 cols 2331 entries
Finished phase 1 with 114 SingleSign rule and 7 generalized
[2026-05-25 09:50:30] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12321823291176459062.kers
Total runtime 2 ms.
[2026-05-25 09:50:30] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 85/125 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 6/131 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 410/541 variables, 131/150 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 19/560 variables, 13/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/560 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 180 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 144/144 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 27/24 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 85/125 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 6/131 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 410/541 variables, 131/150 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 11/169 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 19/560 variables, 13/186 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 13/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/560 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/560 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/560 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/560 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 24 (OVERLAPS) 0/560 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 216 constraints, problems are : Problem set: 0 solved, 27 unsolved in 22364 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 144/144 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 27/24 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24292ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 11 properties in 9175 ms.
Support contains 29 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 416/416 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 135 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 135 transition count 400
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 132 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 132 transition count 395
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 129 transition count 392
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 127 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 127 transition count 399
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 45 place count 127 transition count 396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 48 place count 124 transition count 396
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 124 transition count 462
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 120 transition count 462
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 120 transition count 462
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 118 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 118 transition count 455
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 116 transition count 448
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 116 transition count 448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 115 transition count 446
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 115 transition count 446
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 113 transition count 444
Applied a total of 74 rules in 58 ms. Remains 113 /144 variables (removed 31) and now considering 444/416 (removed -28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 113/144 places, 444/416 transitions.
RANDOM walk for 40000 steps (2852 resets) in 343 ms. (116 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40004 steps (173 resets) in 48 ms. (816 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (271 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (359 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (425 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (433 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (416 resets) in 72 ms. (548 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (190 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (435 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (360 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (200 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (371 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (268 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (455 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3307539714407398558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14232369856733544032.kers'
[2026-05-25 09:51:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3307539714407398558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14232369856733544032.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 444 rows 113 cols 2692 entries
Finished phase 1 with 83 SingleSign rule and 7 generalized
[2026-05-25 09:51:04] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14232369856733544032.kers
Total runtime 2 ms.
[2026-05-25 09:51:04] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 20/92 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 8/100 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 438/538 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 16/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 19/557 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/557 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/557 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 158 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 13/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 20/92 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 8/100 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 438/538 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 16/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 19/557 variables, 13/156 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 171 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3546 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 13/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5281ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 9 properties in 15045 ms.
Support contains 9 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 444/444 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 443
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 2 place count 112 transition count 443
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 108 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 108 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 427
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 33 place count 95 transition count 418
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 36 place count 92 transition count 391
Iterating global reduction 0 with 3 rules applied. Total rules applied 39 place count 92 transition count 391
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 41 place count 92 transition count 389
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 92 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 45 place count 90 transition count 387
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 90 transition count 478
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 86 transition count 477
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 55 place count 86 transition count 476
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 86 transition count 476
Applied a total of 60 rules in 60 ms. Remains 86 /113 variables (removed 27) and now considering 476/444 (removed -32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 86/113 places, 476/444 transitions.
RANDOM walk for 40000 steps (3449 resets) in 707 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (576 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (574 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (394 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (380 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 845884 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :3 out of 4
Probabilistic random walk after 845884 steps, saw 178692 distinct states, run finished after 3010 ms. (steps per millisecond=281 ) properties seen :3
[2026-05-25 09:51:28] [INFO ] Flow matrix only has 464 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5141473865622944821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9188954663329851242.kers'
[2026-05-25 09:51:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5141473865622944821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9188954663329851242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 464 rows 86 cols 2695 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 09:51:28] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9188954663329851242.kers
Total runtime 3 ms.
[2026-05-25 09:51:28] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 218/241 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 256/497 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 41/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/524 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/532 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/535 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 15/550 variables, 26/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/550 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 218/241 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 256/497 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 41/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/524 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/532 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/535 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/550 variables, 26/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/550 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 202 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 476/476 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 475
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 85 transition count 474
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 84 transition count 474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 83 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 83 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 82 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 82 transition count 467
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 82 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 81 transition count 466
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 81 transition count 516
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 24 place count 78 transition count 508
Applied a total of 24 rules in 36 ms. Remains 78 /86 variables (removed 8) and now considering 508/476 (removed -32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 78/86 places, 508/476 transitions.
RANDOM walk for 40000 steps (4209 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (477 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1149120 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1149120 steps, saw 245244 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2026-05-25 09:51:32] [INFO ] Flow matrix only has 492 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5317069812842159728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11488429480301872303.kers'
[2026-05-25 09:51:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5317069812842159728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11488429480301872303.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 492 rows 78 cols 2749 entries
Finished phase 1 with 54 SingleSign rule and 4 generalized
[2026-05-25 09:51:32] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11488429480301872303.kers
Total runtime 2 ms.
[2026-05-25 09:51:32] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 218/241 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 288/529 variables, 24/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 35/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/550 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/558 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/560 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 10/570 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/570 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/570 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 78/78 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 218/241 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 288/529 variables, 24/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 35/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/550 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/550 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/558 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/560 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/570 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/570 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/570 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/570 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 78/78 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1155ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 510 steps, including 18 resets, run visited all 1 properties in 4 ms. (steps per millisecond=127 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-22-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:51:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:51:33] [INFO ] Flatten gal took : 52 ms
FORMULA MedleyA-PT-22-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:51:33] [INFO ] Flatten gal took : 53 ms
[2026-05-25 09:51:33] [INFO ] Input system was already deterministic with 485 transitions.
Support contains 76 out of 213 places (down from 78) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 910 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 429
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 186 transition count 428
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 70 place count 171 transition count 384
Iterating global reduction 1 with 15 rules applied. Total rules applied 85 place count 171 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 93 place count 163 transition count 363
Iterating global reduction 1 with 8 rules applied. Total rules applied 101 place count 163 transition count 363
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 160 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 160 transition count 354
Applied a total of 107 rules in 11 ms. Remains 160 /213 variables (removed 53) and now considering 354/485 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2710064016579149635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13484510304580186834.kers'
[2026-05-25 09:51:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2710064016579149635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13484510304580186834.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 354 rows 160 cols 1945 entries
Finished phase 1 with 130 SingleSign rule and 8 generalized
[2026-05-25 09:51:33] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13484510304580186834.kers
Total runtime 2 ms.
[2026-05-25 09:51:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:51:34] [INFO ] Invariant cache hit.
[2026-05-25 09:51:34] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2026-05-25 09:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 192 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 353/542 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 548 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 160/213 places, 354/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60549 ms. Remains : 160/213 places, 354/485 transitions.
[2026-05-25 09:52:34] [INFO ] Flatten gal took : 38 ms
[2026-05-25 09:52:34] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:52:34] [INFO ] Input system was already deterministic with 354 transitions.
[2026-05-25 09:52:34] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:52:34] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:52:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8804061838933254071.gal : 12 ms
[2026-05-25 09:52:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8906944800690281671.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/CTLFireability8804061838933254071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8906944800690281671.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:53:04] [INFO ] Flatten gal took : 34 ms
[2026-05-25 09:53:04] [INFO ] Applying decomposition
[2026-05-25 09:53:04] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2265085571120947496.txt' '-o' '/tmp/graph2265085571120947496.bin' '-w' '/tmp/graph2265085571120947496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2265085571120947496.bin' '-l' '-1' '-v' '-w' '/tmp/graph2265085571120947496.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:53:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:53:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:53:05] [INFO ] Removed a total of 739 redundant transitions.
[2026-05-25 09:53:05] [INFO ] Flatten gal took : 78 ms
[2026-05-25 09:53:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 12 ms.
[2026-05-25 09:53:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2067338435340030682.gal : 4 ms
[2026-05-25 09:53:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10416012476621418829.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/CTLFireability2067338435340030682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10416012476621418829.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.70872e+10,4.6753,110044,2575,364,153306,3861,528,501427,118,41548,0


Converting to forward existential form...Done !
original formula: EX(AG(((AF((((i2.u2.p30==0)||(i1.u12.p57==0))||((i8.u30.p210==0)||(i8.u41.p271==0)))) + EX((((i4.u17.p120==1)&&(i5.u26.p147==1))&&((i8.u3...269
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((!(EG(!((((i2.u2.p30==0)||(i1.u12.p57==0))||((i8.u30.p210==0)||(i8.u41.p271==0)))))) ...332
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t97, t130, t139, t178, t180, t188, t191, t193, t202, i0.t181, i0.t135, i0.u5.t1...981
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 213/213 places, 485/485 transitions.
Graph (complete) has 910 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 211 transition count 462
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 190 transition count 462
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 190 transition count 455
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 183 transition count 455
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 82 place count 158 transition count 404
Iterating global reduction 2 with 25 rules applied. Total rules applied 107 place count 158 transition count 404
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 145 transition count 366
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 145 transition count 366
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 141 place count 137 transition count 345
Iterating global reduction 2 with 8 rules applied. Total rules applied 149 place count 137 transition count 345
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 152 place count 134 transition count 336
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 134 transition count 336
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 187 place count 117 transition count 321
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 115 transition count 319
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 115 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 194 place count 115 transition count 316
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 2 with 6 rules applied. Total rules applied 200 place count 112 transition count 313
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 110 transition count 311
Applied a total of 202 rules in 109 ms. Remains 110 /213 variables (removed 103) and now considering 311/485 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7180649971491081803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13937718210480822955.kers'
[2026-05-25 09:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7180649971491081803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13937718210480822955.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 110 cols 1675 entries
Finished phase 1 with 84 SingleSign rule and 6 generalized
[2026-05-25 09:53:35] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13937718210480822955.kers
Total runtime 3 ms.
[2026-05-25 09:53:35] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 09:53:35] [INFO ] Invariant cache hit.
[2026-05-25 09:53:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 09:53:35] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2026-05-25 09:53:35] [INFO ] Redundant transitions in 11 ms returned []
Running 297 sub problems to find dead transitions.
[2026-05-25 09:53:35] [INFO ] Invariant cache hit.
[2026-05-25 09:53:35] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 5/108 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 310/419 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 2/421 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (OVERLAPS) 0/421 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 154 constraints, problems are : Problem set: 0 solved, 297 unsolved in 21748 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 110/110 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 5/108 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 310/419 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 296/449 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/421 variables, and 451 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 109/110 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 296/297 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52003ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 52004ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/213 places, 311/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52498 ms. Remains : 110/213 places, 311/485 transitions.
[2026-05-25 09:54:27] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:54:27] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:54:27] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-25 09:54:27] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:54:27] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:54:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3096623440646903592.gal : 4 ms
[2026-05-25 09:54:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14549108384143731224.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/CTLFireability3096623440646903592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14549108384143731224.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:54:57] [INFO ] Flatten gal took : 34 ms
[2026-05-25 09:54:57] [INFO ] Applying decomposition
[2026-05-25 09:54:57] [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/graph3511248725813965923.txt' '-o' '/tmp/graph3511248725813965923.bin' '-w' '/tmp/graph3511248725813965923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3511248725813965923.bin' '-l' '-1' '-v' '-w' '/tmp/graph3511248725813965923.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:54:58] [INFO ] Decomposing Gal with order
[2026-05-25 09:54:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:54:58] [INFO ] Removed a total of 657 redundant transitions.
[2026-05-25 09:54:58] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:54:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 5 ms.
[2026-05-25 09:54:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1324820623371877962.gal : 2 ms
[2026-05-25 09:54:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9499919177405779313.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/CTLFireability1324820623371877962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9499919177405779313.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.3372e+10,6.32557,155452,1360,473,226190,6007,388,689769,159,44123,0


Converting to forward existential form...Done !
original formula: A((i0.u6.p73==1) U AF(((E((((i6.u7.p120==1)&&(i6.u7.p181==1))&&((i4.u13.p210==1)&&(i3.u18.p231==1))) U (((i0.u0.p30==1)&&(i0.u6.p91==1))&...412
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((E((((i6.u7.p120==1)&&(i6.u7.p181==1))&&((i4.u13.p210==1)&&(i3.u18.p231==1))) U (((i0.u...1273
Reverse transition relation is NOT exact ! Due to transitions t23, t72, t233, t238, t306, i0.t67, i0.u1.t50, i0.u2.t73, i0.u2.t76, i0.u4.t68, i0.u4.t71, i0...907
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 194 transition count 447
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 194 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 194 transition count 446
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 185 transition count 419
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 185 transition count 419
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 181 transition count 409
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 181 transition count 409
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 179 transition count 403
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 179 transition count 403
Applied a total of 69 rules in 10 ms. Remains 179 /213 variables (removed 34) and now considering 403/485 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3669444784319088870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1290035224147993508.kers'
[2026-05-25 09:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3669444784319088870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1290035224147993508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 179 cols 2123 entries
Finished phase 1 with 149 SingleSign rule and 8 generalized
[2026-05-25 09:55:28] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1290035224147993508.kers
Total runtime 5 ms.
[2026-05-25 09:55:28] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:55:28] [INFO ] Invariant cache hit.
[2026-05-25 09:55:28] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2026-05-25 09:55:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (OVERLAPS) 403/582 variables, 179/209 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 214 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (OVERLAPS) 403/582 variables, 179/214 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 402/616 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 618 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in LTL mode, iteration 1 : 179/213 places, 403/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60635 ms. Remains : 179/213 places, 403/485 transitions.
[2026-05-25 09:56:28] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:56:28] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:56:28] [INFO ] Input system was already deterministic with 403 transitions.
[2026-05-25 09:56:28] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:56:28] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:56:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15531660069661209349.gal : 4 ms
[2026-05-25 09:56:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5483124984144056217.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/CTLFireability15531660069661209349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5483124984144056217.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:56:59] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:56:59] [INFO ] Applying decomposition
[2026-05-25 09:56:59] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2643071123635786119.txt' '-o' '/tmp/graph2643071123635786119.bin' '-w' '/tmp/graph2643071123635786119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2643071123635786119.bin' '-l' '-1' '-v' '-w' '/tmp/graph2643071123635786119.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:56:59] [INFO ] Decomposing Gal with order
[2026-05-25 09:56:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:56:59] [INFO ] Removed a total of 681 redundant transitions.
[2026-05-25 09:56:59] [INFO ] Flatten gal took : 41 ms
[2026-05-25 09:56:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 13 ms.
[2026-05-25 09:56:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10821841408362060719.gal : 3 ms
[2026-05-25 09:56:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15587930289474295617.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/CTLFireability10821841408362060719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15587930289474295617.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 : 213/213 places, 485/485 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 436
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 188 transition count 435
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 175 transition count 398
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 175 transition count 398
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 169 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 169 transition count 382
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 167 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 167 transition count 376
Applied a total of 93 rules in 22 ms. Remains 167 /213 variables (removed 46) and now considering 376/485 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-141102941355161445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4264847979286539790.kers'
[2026-05-25 09:57:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-141102941355161445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4264847979286539790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 167 cols 2029 entries
Finished phase 1 with 137 SingleSign rule and 8 generalized
[2026-05-25 09:57:29] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4264847979286539790.kers
Total runtime 5 ms.
[2026-05-25 09:57:29] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 09:57:29] [INFO ] Invariant cache hit.
[2026-05-25 09:57:29] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2026-05-25 09:57:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/543 variables, 167/195 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 198 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/543 variables, 167/196 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 375/571 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 580 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60262ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 167/213 places, 376/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 167/213 places, 376/485 transitions.
[2026-05-25 09:58:30] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:58:30] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:58:30] [INFO ] Input system was already deterministic with 376 transitions.
[2026-05-25 09:58:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:58:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15353261540681941046.gal : 3 ms
[2026-05-25 09:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9019060937473230803.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/CTLFireability15353261540681941046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9019060937473230803.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:59:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:59:00] [INFO ] Applying decomposition
[2026-05-25 09:59:00] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3149525570055391815.txt' '-o' '/tmp/graph3149525570055391815.bin' '-w' '/tmp/graph3149525570055391815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3149525570055391815.bin' '-l' '-1' '-v' '-w' '/tmp/graph3149525570055391815.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:59:00] [INFO ] Decomposing Gal with order
[2026-05-25 09:59:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:59:00] [INFO ] Removed a total of 695 redundant transitions.
[2026-05-25 09:59:00] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 10 ms.
[2026-05-25 09:59:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5521077043479344203.gal : 3 ms
[2026-05-25 09:59:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3897952321970069477.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/CTLFireability5521077043479344203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3897952321970069477.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.6075e+11,11.9534,290780,5667,733,422445,11683,621,1.18442e+06,170,96805,0


Converting to forward existential form...Done !
original formula: EF(AX(E(!(((((i9.u32.p210==1)&&(i8.u37.p225==1))&&(i9.u32.p257==1))||(i3.u15.p66==1))) U AX(AF((i1.i2.u44.p290==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(!(((((i9.u32.p210==1)&&(i8.u37.p225==1))&&(i9.u32.p257==1))||(i3.u15.p66==1))) U !(...207
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t63, t101, t120, t140, t153, t185, t187, t189, t199, t205, t209, t268, t269, t303, t...1228
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Graph (complete) has 910 edges and 213 vertex of which 212 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 211 transition count 460
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 188 transition count 460
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 47 place count 188 transition count 454
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 182 transition count 454
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 84 place count 157 transition count 403
Iterating global reduction 2 with 25 rules applied. Total rules applied 109 place count 157 transition count 403
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 123 place count 143 transition count 362
Iterating global reduction 2 with 14 rules applied. Total rules applied 137 place count 143 transition count 362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 145 place count 135 transition count 341
Iterating global reduction 2 with 8 rules applied. Total rules applied 153 place count 135 transition count 341
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 132 transition count 332
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 132 transition count 332
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 198 place count 111 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 111 transition count 313
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 108 transition count 310
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 108 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 108 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 106 transition count 306
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 104 transition count 304
Applied a total of 213 rules in 63 ms. Remains 104 /213 variables (removed 109) and now considering 304/485 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16210288056997056639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13795006514793842614.kers'
[2026-05-25 09:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16210288056997056639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13795006514793842614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 104 cols 1616 entries
Finished phase 1 with 80 SingleSign rule and 5 generalized
[2026-05-25 09:59:30] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13795006514793842614.kers
Total runtime 4 ms.
[2026-05-25 09:59:30] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:59:30] [INFO ] Invariant cache hit.
[2026-05-25 09:59:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:59:30] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2026-05-25 09:59:30] [INFO ] Redundant transitions in 3 ms returned []
Running 292 sub problems to find dead transitions.
[2026-05-25 09:59:30] [INFO ] Invariant cache hit.
[2026-05-25 09:59:30] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 303/406 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 2/408 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 159 constraints, problems are : Problem set: 0 solved, 292 unsolved in 18526 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 303/406 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 291/449 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 2/408 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 451 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48754ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 48755ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/213 places, 304/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49108 ms. Remains : 104/213 places, 304/485 transitions.
[2026-05-25 10:00:19] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:00:19] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:00:19] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-25 10:00:19] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:00:19] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:00:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17615508919334086485.gal : 3 ms
[2026-05-25 10:00:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13894507611079913302.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/CTLFireability17615508919334086485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13894507611079913302.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 10:00:49] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:00:49] [INFO ] Applying decomposition
[2026-05-25 10:00:49] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12563476841668590311.txt' '-o' '/tmp/graph12563476841668590311.bin' '-w' '/tmp/graph12563476841668590311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12563476841668590311.bin' '-l' '-1' '-v' '-w' '/tmp/graph12563476841668590311.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:00:49] [INFO ] Decomposing Gal with order
[2026-05-25 10:00:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:00:49] [INFO ] Removed a total of 736 redundant transitions.
[2026-05-25 10:00:49] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:00:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2026-05-25 10:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16965646226762740589.gal : 2 ms
[2026-05-25 10:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2330753900085225826.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/CTLFireability16965646226762740589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2330753900085225826.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,8.69095e+09,0.292435,16112,619,99,19961,982,299,55595,93,4361,0


Converting to forward existential form...Done !
original formula: AF(AG(((EF((((i0.u0.p30==0)||(i0.u1.p38==0))||(i0.u6.p72==0))) * AG((((i0.u0.p30==0)||(i1.u4.p54==0))||((i3.u7.p120==0)||(i3.u13.p181==0)...319
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((E(TRUE U (((i0.u0.p30==0)||(i0.u1.p38==0))||(i0.u6.p72==0))) * !(E(TRUE U !((((i0.u0...394
Reverse transition relation is NOT exact ! Due to transitions t59, t64, t99, t215, t237, t258, t279, t296, t298, t301, t303, i0.t217, i0.t205, i0.u1.t48, i...836
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 429
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 186 transition count 428
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 70 place count 171 transition count 384
Iterating global reduction 1 with 15 rules applied. Total rules applied 85 place count 171 transition count 384
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 93 place count 163 transition count 363
Iterating global reduction 1 with 8 rules applied. Total rules applied 101 place count 163 transition count 363
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 160 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 160 transition count 354
Applied a total of 107 rules in 8 ms. Remains 160 /213 variables (removed 53) and now considering 354/485 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6849349597499829884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15274637568255708798.kers'
[2026-05-25 10:01:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6849349597499829884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15274637568255708798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 354 rows 160 cols 1945 entries
Finished phase 1 with 130 SingleSign rule and 8 generalized
[2026-05-25 10:01:19] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15274637568255708798.kers
Total runtime 5 ms.
[2026-05-25 10:01:20] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 10:01:20] [INFO ] Invariant cache hit.
[2026-05-25 10:01:20] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2026-05-25 10:01:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 192 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 353/542 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 548 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 160/213 places, 354/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60612 ms. Remains : 160/213 places, 354/485 transitions.
[2026-05-25 10:02:20] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:02:20] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:02:20] [INFO ] Input system was already deterministic with 354 transitions.
[2026-05-25 10:02:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:02:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:02:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4754624268877900216.gal : 2 ms
[2026-05-25 10:02:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16268472322205371754.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/CTLFireability4754624268877900216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16268472322205371754.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 10:02:50] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:02:50] [INFO ] Applying decomposition
[2026-05-25 10:02:50] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11364768906139585871.txt' '-o' '/tmp/graph11364768906139585871.bin' '-w' '/tmp/graph11364768906139585871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11364768906139585871.bin' '-l' '-1' '-v' '-w' '/tmp/graph11364768906139585871.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:02:50] [INFO ] Decomposing Gal with order
[2026-05-25 10:02:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:02:50] [INFO ] Removed a total of 694 redundant transitions.
[2026-05-25 10:02:50] [INFO ] Flatten gal took : 31 ms
[2026-05-25 10:02:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 6 ms.
[2026-05-25 10:02:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8937907921773516494.gal : 3 ms
[2026-05-25 10:02:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16384627122991942076.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/CTLFireability8937907921773516494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16384627122991942076.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.70872e+10,2.43152,86004,2300,1003,110191,20104,514,401145,165,242142,0


Converting to forward existential form...Done !
original formula: E(!((((i5.u24.p141==1) + AX((((i1.u4.p30==1)&&(i1.u14.p91==1))&&((i6.u17.p120==1)&&(i5.u23.p138==1))))) * EX((EF((((i7.u31.p210==1)&&(i7....326
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((((i5.u24.p141==1) + !(EX(!((((i1.u4.p30==1)&&(i1.u14.p91==1))&&((i6.u17.p120==1)&&(i5.u23.p1...391
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t97, t130, t135, t139, t148, t150, t181, t185, t191, t195, i1.u14.t96, i1.u14.t...1070
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Graph (complete) has 910 edges and 213 vertex of which 212 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 211 transition count 457
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 185 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 184 transition count 456
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 55 place count 184 transition count 452
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 63 place count 180 transition count 452
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 88 place count 155 transition count 398
Iterating global reduction 3 with 25 rules applied. Total rules applied 113 place count 155 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 113 place count 155 transition count 396
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 153 transition count 396
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 131 place count 139 transition count 355
Iterating global reduction 3 with 14 rules applied. Total rules applied 145 place count 139 transition count 355
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 153 place count 131 transition count 334
Iterating global reduction 3 with 8 rules applied. Total rules applied 161 place count 131 transition count 334
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 129 transition count 328
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 129 transition count 328
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 212 place count 104 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 104 transition count 305
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 217 place count 100 transition count 299
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 100 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 100 transition count 296
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 4 with 6 rules applied. Total rules applied 230 place count 97 transition count 293
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 95 transition count 291
Applied a total of 232 rules in 45 ms. Remains 95 /213 variables (removed 118) and now considering 291/485 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2300311780181895071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11659218098877998226.kers'
[2026-05-25 10:03:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2300311780181895071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11659218098877998226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 95 cols 1283 entries
Finished phase 1 with 71 SingleSign rule and 5 generalized
[2026-05-25 10:03:20] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11659218098877998226.kers
Total runtime 1 ms.
[2026-05-25 10:03:21] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 10:03:21] [INFO ] Invariant cache hit.
[2026-05-25 10:03:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 10:03:21] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2026-05-25 10:03:21] [INFO ] Redundant transitions in 3 ms returned []
Running 280 sub problems to find dead transitions.
[2026-05-25 10:03:21] [INFO ] Invariant cache hit.
[2026-05-25 10:03:21] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 3/94 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 290/384 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 2/386 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 150 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20328 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 3/94 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 290/384 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 279/428 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 2/386 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 430 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50454ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 50455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/213 places, 291/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50879 ms. Remains : 95/213 places, 291/485 transitions.
[2026-05-25 10:04:11] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:04:11] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:04:11] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-25 10:04:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:04:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:04:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14300657130902150631.gal : 2 ms
[2026-05-25 10:04:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15286009322336486276.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/CTLFireability14300657130902150631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15286009322336486276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72123e+09,21.3305,377464,2,19038,5,1.16198e+06,6,0,663,1.48288e+06,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((p80==1)) * AF(((p139==1)&&(p142==1)))) * ((p99==1)&&(p126==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((p80==1)))) * !(EG(!(((p139==1)&&(p142==1)))))) * ((p99==1)&&(p126==1)))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t23, t25,...580
Detected timeout of ITS tools.
[2026-05-25 10:04:41] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:04:41] [INFO ] Applying decomposition
[2026-05-25 10:04:41] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph502776345130984076.txt' '-o' '/tmp/graph502776345130984076.bin' '-w' '/tmp/graph502776345130984076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph502776345130984076.bin' '-l' '-1' '-v' '-w' '/tmp/graph502776345130984076.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:04:41] [INFO ] Decomposing Gal with order
[2026-05-25 10:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:04:41] [INFO ] Removed a total of 665 redundant transitions.
[2026-05-25 10:04:41] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 5 ms.
[2026-05-25 10:04:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17297157950132701031.gal : 2 ms
[2026-05-25 10:04:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11820975149680901690.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/CTLFireability17297157950132701031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11820975149680901690.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.72123e+09,1.33023,38788,797,94,61845,693,299,127886,104,4186,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((i0.u6.p80==1)) * AF(((i3.u10.p139==1)&&(i2.u11.p142==1)))) * ((i4.u8.p99==1)&&(i4.u8.p126==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((i0.u6.p80==1)))) * !(EG(!(((i3.u10.p139==1)&&(i2.u11.p142==1)))))) * ((i4.u8.p...191
Reverse transition relation is NOT exact ! Due to transitions t29, t34, t66, t76, t81, t250, i0.u6.t40, i0.u6.t41, i0.u6.t42, i0.u6.t43, i0.u6.t44, i0.u6.t...794
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 187 transition count 432
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 173 transition count 391
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 173 transition count 391
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 89 place count 165 transition count 370
Iterating global reduction 1 with 8 rules applied. Total rules applied 97 place count 165 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 162 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 162 transition count 361
Applied a total of 103 rules in 19 ms. Remains 162 /213 variables (removed 51) and now considering 361/485 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6848609837241295074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15156229844258774918.kers'
[2026-05-25 10:05:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6848609837241295074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15156229844258774918.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 361 rows 162 cols 1975 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 10:05:12] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15156229844258774918.kers
Total runtime 4 ms.
[2026-05-25 10:05:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 10:05:12] [INFO ] Invariant cache hit.
[2026-05-25 10:05:12] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2026-05-25 10:05:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 195 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/193 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 360/553 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 360 unsolved
SMT process timed out in 60264ms, After SMT, problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in LTL mode, iteration 1 : 162/213 places, 361/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 162/213 places, 361/485 transitions.
[2026-05-25 10:06:12] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:06:12] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:12] [INFO ] Input system was already deterministic with 361 transitions.
[2026-05-25 10:06:12] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:12] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8543777623506822406.gal : 2 ms
[2026-05-25 10:06:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11008373657875530619.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/CTLFireability8543777623506822406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11008373657875530619.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 10:06:42] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:06:42] [INFO ] Applying decomposition
[2026-05-25 10:06:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13191064275808900383.txt' '-o' '/tmp/graph13191064275808900383.bin' '-w' '/tmp/graph13191064275808900383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13191064275808900383.bin' '-l' '-1' '-v' '-w' '/tmp/graph13191064275808900383.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:06:42] [INFO ] Decomposing Gal with order
[2026-05-25 10:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:06:42] [INFO ] Removed a total of 758 redundant transitions.
[2026-05-25 10:06:42] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:06:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2026-05-25 10:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16392057930831091443.gal : 2 ms
[2026-05-25 10:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2953615054140785151.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/CTLFireability16392057930831091443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2953615054140785151.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.13437e+11,7.22419,181512,3645,256,284468,4127,601,842587,115,39547,0


Converting to forward existential form...Done !
original formula: A(AX(!(EG(AX(FALSE)))) U ((((i5.u17.p120==1)&&(i5.u21.p128==1))&&(i5.u28.p162==1))||(((i0.u3.p30==1)&&(i0.u14.p91==1))&&((i5.u17.p120==1)...177
=> equivalent forward existential formula: [((Init * !(EG(!(((((i5.u17.p120==1)&&(i5.u21.p128==1))&&(i5.u28.p162==1))||(((i0.u3.p30==1)&&(i0.u14.p91==1))&&...532
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t75, t82, t100, t133, t138, t174, t178, t184, t186, t201, t203, i0.t102, i0.t10...1112
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 189 transition count 438
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 189 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 189 transition count 437
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 177 transition count 404
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 177 transition count 404
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 172 transition count 391
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 172 transition count 391
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 170 transition count 385
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 170 transition count 385
Applied a total of 87 rules in 23 ms. Remains 170 /213 variables (removed 43) and now considering 385/485 (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-11717775321738351321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10153841713256725341.kers'
[2026-05-25 10:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11717775321738351321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10153841713256725341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 170 cols 2063 entries
Finished phase 1 with 140 SingleSign rule and 8 generalized
[2026-05-25 10:07:12] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10153841713256725341.kers
Total runtime 3 ms.
[2026-05-25 10:07:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 10:07:13] [INFO ] Invariant cache hit.
[2026-05-25 10:07:13] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2026-05-25 10:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 385/555 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/555 variables, and 204 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 385/555 variables, 170/201 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 384/585 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 588 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 170/213 places, 385/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 170/213 places, 385/485 transitions.
[2026-05-25 10:08:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:08:13] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:08:13] [INFO ] Input system was already deterministic with 385 transitions.
[2026-05-25 10:08:13] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:08:13] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:08:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16653881149417041923.gal : 3 ms
[2026-05-25 10:08:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12672505876728784387.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/CTLFireability16653881149417041923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12672505876728784387.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 10:08:43] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:08:43] [INFO ] Applying decomposition
[2026-05-25 10:08:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8007737697733453681.txt' '-o' '/tmp/graph8007737697733453681.bin' '-w' '/tmp/graph8007737697733453681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8007737697733453681.bin' '-l' '-1' '-v' '-w' '/tmp/graph8007737697733453681.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:08:43] [INFO ] Decomposing Gal with order
[2026-05-25 10:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:08:43] [INFO ] Removed a total of 687 redundant transitions.
[2026-05-25 10:08:43] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 4 ms.
[2026-05-25 10:08:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9172953685062699471.gal : 2 ms
[2026-05-25 10:08:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14945963512909613262.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/CTLFireability9172953685062699471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14945963512909613262.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 430
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 187 transition count 429
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 173 transition count 386
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 173 transition count 386
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 89 place count 165 transition count 365
Iterating global reduction 1 with 8 rules applied. Total rules applied 97 place count 165 transition count 365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 162 transition count 356
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 162 transition count 356
Applied a total of 103 rules in 7 ms. Remains 162 /213 variables (removed 51) and now considering 356/485 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16695539855291724758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2043461208916057574.kers'
[2026-05-25 10:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16695539855291724758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2043461208916057574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 356 rows 162 cols 1951 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 10:09:14] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2043461208916057574.kers
Total runtime 5 ms.
[2026-05-25 10:09:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 10:09:14] [INFO ] Invariant cache hit.
[2026-05-25 10:09:14] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2026-05-25 10:09:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 356/518 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/518 variables, and 193 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 356/518 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 355/547 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 2/549 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 553 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Starting structural reductions in LTL mode, iteration 1 : 162/213 places, 356/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 162/213 places, 356/485 transitions.
[2026-05-25 10:10:14] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:10:14] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:10:14] [INFO ] Input system was already deterministic with 356 transitions.
[2026-05-25 10:10:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:10:14] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14601446858605934053.gal : 2 ms
[2026-05-25 10:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10266155771328419433.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/CTLFireability14601446858605934053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10266155771328419433.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 10:10:44] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:10:44] [INFO ] Applying decomposition
[2026-05-25 10:10:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11414574920334692424.txt' '-o' '/tmp/graph11414574920334692424.bin' '-w' '/tmp/graph11414574920334692424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11414574920334692424.bin' '-l' '-1' '-v' '-w' '/tmp/graph11414574920334692424.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:10:44] [INFO ] Decomposing Gal with order
[2026-05-25 10:10:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:10:44] [INFO ] Removed a total of 721 redundant transitions.
[2026-05-25 10:10:44] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 3 ms.
[2026-05-25 10:10:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4507128882131393184.gal : 2 ms
[2026-05-25 10:10:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4282046192253967680.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/CTLFireability4507128882131393184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4282046192253967680.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.15219e+11,12.1871,209940,3948,739,312987,7519,574,1.05426e+06,138,57214,0


Converting to forward existential form...Done !
original formula: AX(EG(EF(AX((i7.u30.p194==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U !(EX(!((i7.u30.p194==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t60, t98, t111, t132, t137, t157, t175, t177, t183, t187, t197, i1.u4.t127, i2.t118,...1043
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 189 transition count 432
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 189 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 189 transition count 431
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 179 transition count 405
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 179 transition count 405
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 175 transition count 394
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 175 transition count 394
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 174 transition count 391
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 174 transition count 391
Applied a total of 79 rules in 18 ms. Remains 174 /213 variables (removed 39) and now considering 391/485 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16095144346306414851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-633933476112458529.kers'
[2026-05-25 10:11:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16095144346306414851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-633933476112458529.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 174 cols 2079 entries
Finished phase 1 with 144 SingleSign rule and 8 generalized
[2026-05-25 10:11:15] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-633933476112458529.kers
Total runtime 3 ms.
[2026-05-25 10:11:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 10:11:15] [INFO ] Invariant cache hit.
[2026-05-25 10:11:15] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2026-05-25 10:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 391/565 variables, 174/204 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 207 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 391/565 variables, 174/207 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 390/597 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 600 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 174/213 places, 391/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 174/213 places, 391/485 transitions.
[2026-05-25 10:12:15] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:12:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:12:15] [INFO ] Input system was already deterministic with 391 transitions.
[2026-05-25 10:12:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:12:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:12:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2902965788946834243.gal : 2 ms
[2026-05-25 10:12:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15848376786179296296.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/CTLFireability2902965788946834243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15848376786179296296.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 10:12:45] [INFO ] Flatten gal took : 20 ms
[2026-05-25 10:12:45] [INFO ] Applying decomposition
[2026-05-25 10:12:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17665804184703974096.txt' '-o' '/tmp/graph17665804184703974096.bin' '-w' '/tmp/graph17665804184703974096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17665804184703974096.bin' '-l' '-1' '-v' '-w' '/tmp/graph17665804184703974096.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:12:45] [INFO ] Decomposing Gal with order
[2026-05-25 10:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:12:45] [INFO ] Removed a total of 757 redundant transitions.
[2026-05-25 10:12:45] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 6 ms.
[2026-05-25 10:12:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12641241147161973525.gal : 3 ms
[2026-05-25 10:12:45] [INFO ] Time to serialize properties into /tmp/CTLFireability304312887705610300.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/CTLFireability12641241147161973525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability304312887705610300.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,3.11072e+11,20.1404,467864,7250,943,700229,17659,665,2.42264e+06,165,151778,0


Converting to forward existential form...Done !
original formula: A(((A(E((i5.u17.p102==1) U EG((((i3.u2.p30==1)&&(i2.i1.u8.p45==1))&&(i3.u14.p67==1)))) U (AX((i4.u27.p177==1)) + (i4.u27.p175!=1))) + EX(...927
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U !(EX(!((((i3.u13.p15==1)&&(i1.u3.p36==1))||(((i3.u2.p30==1)&&(i3.u13.p91==1))&&((i4...1526
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t39, t46, t65, t111, t156, t157, t163, t176, t180, t201, t216, t220, t239, t240, t24...1602
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Graph (complete) has 910 edges and 213 vertex of which 212 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 211 transition count 459
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 187 transition count 459
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 187 transition count 455
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 183 transition count 455
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 83 place count 157 transition count 400
Iterating global reduction 2 with 26 rules applied. Total rules applied 109 place count 157 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 157 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 110 place count 157 transition count 398
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 156 transition count 398
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 125 place count 143 transition count 360
Iterating global reduction 3 with 13 rules applied. Total rules applied 138 place count 143 transition count 360
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 145 place count 136 transition count 341
Iterating global reduction 3 with 7 rules applied. Total rules applied 152 place count 136 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 134 transition count 335
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 134 transition count 335
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 192 place count 115 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 112 transition count 315
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 112 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 112 transition count 312
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 3 with 6 rules applied. Total rules applied 207 place count 109 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 108 transition count 308
Applied a total of 208 rules in 36 ms. Remains 108 /213 variables (removed 105) and now considering 308/485 (removed 177) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16726217483079367373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15381688188406817142.kers'
[2026-05-25 10:13:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16726217483079367373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15381688188406817142.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 108 cols 1618 entries
Finished phase 1 with 82 SingleSign rule and 6 generalized
[2026-05-25 10:13:16] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15381688188406817142.kers
Total runtime 1 ms.
[2026-05-25 10:13:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 10:13:16] [INFO ] Invariant cache hit.
[2026-05-25 10:13:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 10:13:16] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2026-05-25 10:13:16] [INFO ] Redundant transitions in 2 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-25 10:13:16] [INFO ] Invariant cache hit.
[2026-05-25 10:13:16] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 308/415 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 12 (OVERLAPS) 1/416 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 165 constraints, problems are : Problem set: 0 solved, 298 unsolved in 22248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 108/108 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 308/415 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 298/462 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 13 (OVERLAPS) 1/416 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 463 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 108/108 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52501ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 52503ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/213 places, 308/485 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52801 ms. Remains : 108/213 places, 308/485 transitions.
[2026-05-25 10:14:08] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:14:08] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:14:08] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-25 10:14:08] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:14:08] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:14:08] [INFO ] Time to serialize gal into /tmp/CTLFireability25360680440578059.gal : 2 ms
[2026-05-25 10:14:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12140794042820115597.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/CTLFireability25360680440578059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12140794042820115597.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:14:39] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:14:39] [INFO ] Applying decomposition
[2026-05-25 10:14:39] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17503390484744678507.txt' '-o' '/tmp/graph17503390484744678507.bin' '-w' '/tmp/graph17503390484744678507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17503390484744678507.bin' '-l' '-1' '-v' '-w' '/tmp/graph17503390484744678507.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:14:39] [INFO ] Decomposing Gal with order
[2026-05-25 10:14:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:14:39] [INFO ] Removed a total of 687 redundant transitions.
[2026-05-25 10:14:39] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:14:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2026-05-25 10:14:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2641560622347022334.gal : 2 ms
[2026-05-25 10:14:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3676477466441119174.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/CTLFireability2641560622347022334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3676477466441119174.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.02056e+10,0.968608,33056,1043,221,51403,1041,354,150194,137,7780,0


Converting to forward existential form...Done !
original formula: E((EF(!(AG((i4.u16.p217==1)))) + (((i1.u0.p30==1)&&(i1.u7.p91==1))&&((i6.u23.p274==1)&&(i1.u28.p301==1)))) U !(AG(AF((((((i1.u0.p30==1)&&...249
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(E(TRUE U !(!(E(TRUE U !((i4.u16.p217==1)))))) + (((i1.u0.p30==1)&&(i1.u7.p91==1))&&((i6.u2...318
Reverse transition relation is NOT exact ! Due to transitions t6, t43, t100, t107, t108, t109, t144, t209, t211, t238, t243, t261, t262, t294, t296, t307, ...1013
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,18.5381,389216,1,0,661691,7639,2579,2.0776e+06,775,75741,594889
FORMULA MedleyA-PT-22-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 485/485 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 187 transition count 432
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 173 transition count 391
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 173 transition count 391
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 89 place count 165 transition count 370
Iterating global reduction 1 with 8 rules applied. Total rules applied 97 place count 165 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 162 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 162 transition count 361
Applied a total of 103 rules in 7 ms. Remains 162 /213 variables (removed 51) and now considering 361/485 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12078388005107431794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1191205772497712157.kers'
[2026-05-25 10:14:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12078388005107431794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1191205772497712157.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 361 rows 162 cols 1975 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 10:14:57] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1191205772497712157.kers
Total runtime 2 ms.
[2026-05-25 10:14:57] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 10:14:57] [INFO ] Invariant cache hit.
[2026-05-25 10:14:58] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2026-05-25 10:14:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 193 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 360/551 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 360 unsolved
SMT process timed out in 60261ms, After SMT, problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 162/213 places, 361/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60598 ms. Remains : 162/213 places, 361/485 transitions.
[2026-05-25 10:15:58] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:15:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:15:58] [INFO ] Input system was already deterministic with 361 transitions.
[2026-05-25 10:15:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:15:58] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:15:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8125729695983322094.gal : 1 ms
[2026-05-25 10:15:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3761346076447275227.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/CTLFireability8125729695983322094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3761346076447275227.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 10:16:28] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:16:28] [INFO ] Applying decomposition
[2026-05-25 10:16:28] [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/graph17425914594406589726.txt' '-o' '/tmp/graph17425914594406589726.bin' '-w' '/tmp/graph17425914594406589726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17425914594406589726.bin' '-l' '-1' '-v' '-w' '/tmp/graph17425914594406589726.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:16:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:16:28] [INFO ] Removed a total of 638 redundant transitions.
[2026-05-25 10:16:28] [INFO ] Flatten gal took : 40 ms
[2026-05-25 10:16:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 5 ms.
[2026-05-25 10:16:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16813901319720091030.gal : 1 ms
[2026-05-25 10:16:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11145978130796696491.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/CTLFireability16813901319720091030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11145978130796696491.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 : 213/213 places, 485/485 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 431
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 188 transition count 430
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 173 transition count 386
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 173 transition count 386
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 89 place count 165 transition count 365
Iterating global reduction 1 with 8 rules applied. Total rules applied 97 place count 165 transition count 365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 162 transition count 356
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 162 transition count 356
Applied a total of 103 rules in 14 ms. Remains 162 /213 variables (removed 51) and now considering 356/485 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2508571061045394176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8242580237539826443.kers'
[2026-05-25 10:16:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2508571061045394176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8242580237539826443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 356 rows 162 cols 1951 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 10:16:58] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8242580237539826443.kers
Total runtime 2 ms.
[2026-05-25 10:16:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 10:16:58] [INFO ] Invariant cache hit.
[2026-05-25 10:16:59] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2026-05-25 10:16:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 356/518 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/518 variables, and 194 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 356/518 variables, 162/194 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 355/549 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 555 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in LTL mode, iteration 1 : 162/213 places, 356/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 162/213 places, 356/485 transitions.
[2026-05-25 10:17:59] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:17:59] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:17:59] [INFO ] Input system was already deterministic with 356 transitions.
[2026-05-25 10:17:59] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:17:59] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:17:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3598083396728613696.gal : 3 ms
[2026-05-25 10:17:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10566733567041914589.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/CTLFireability3598083396728613696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10566733567041914589.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 10:18:29] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:18:29] [INFO ] Applying decomposition
[2026-05-25 10:18:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5015384857145930983.txt' '-o' '/tmp/graph5015384857145930983.bin' '-w' '/tmp/graph5015384857145930983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5015384857145930983.bin' '-l' '-1' '-v' '-w' '/tmp/graph5015384857145930983.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:18:29] [INFO ] Decomposing Gal with order
[2026-05-25 10:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:18:29] [INFO ] Removed a total of 739 redundant transitions.
[2026-05-25 10:18:29] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:18:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 3 ms.
[2026-05-25 10:18:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14046859843504390221.gal : 2 ms
[2026-05-25 10:18:29] [INFO ] Time to serialize properties into /tmp/CTLFireability18404653455576890679.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/CTLFireability14046859843504390221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18404653455576890679.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.29004e+11,11.9659,221860,4037,381,299293,4687,632,1.32629e+06,121,57948,0


Converting to forward existential form...Done !
original formula: (EF((AF(AG(((i5.u16.p101==1)&&(i3.u17.p126==1)))) * AX(((((i5.u16.p120==0)||(i5.u28.p181==0))||((i9.i1.u43.p274==0)||(i9.i1.u43.p296==0))...278
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((i5.u16.p101==1)&&(i3.u17.p126==1))))))))) * !(EX(!(((((i5.u16.p120==...384
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t98, t131, t140, t142, t143, t155, t173, t177, t185, t198, t202, i1.i0.u12.t113...1105
Detected timeout of ITS tools.
[2026-05-25 10:18:59] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:18:59] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:18:59] [INFO ] Applying decomposition
[2026-05-25 10:18:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16106521335758877409.txt' '-o' '/tmp/graph16106521335758877409.bin' '-w' '/tmp/graph16106521335758877409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16106521335758877409.bin' '-l' '-1' '-v' '-w' '/tmp/graph16106521335758877409.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:18:59] [INFO ] Decomposing Gal with order
[2026-05-25 10:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:18:59] [INFO ] Removed a total of 607 redundant transitions.
[2026-05-25 10:18:59] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 4 ms.
[2026-05-25 10:19:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17951147082677621672.gal : 2 ms
[2026-05-25 10:19:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15718032000384897236.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/CTLFireability17951147082677621672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15718032000384897236.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 13 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.78684e+12,393.761,3474912,26860,10778,3.43995e+06,1.35195e+06,732,1.5795e+07,425,1.38901e+07,0


Converting to forward existential form...Done !
original formula: EX(AG(((AF((((i3.u4.p30==0)||(i2.u13.p57==0))||((u29.p210==0)||(u29.p271==0)))) + EX((((i4.u16.p120==1)&&(i1.i1.u25.p147==1))&&((u29.p210...260
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((!(EG(!((((i3.u4.p30==0)||(i2.u13.p57==0))||((u29.p210==0)||(u29.p271==0)))))) + EX((...323
Reverse transition relation is NOT exact ! Due to transitions t20, t51, t58, t78, t107, t114, t137, t170, t177, t195, t211, t219, t221, t223, t233, t249, u...2225
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,619.769,3852912,1,0,4.23541e+06,1.35195e+06,1914,1.76356e+07,1340,1.38901e+07,594777
FORMULA MedleyA-PT-22-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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