Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074300666.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 HealthRecord-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.1K Mar 7 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 7 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-12
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-13
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-14
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779737951079

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 19:39:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:39:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:39:12] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-25 19:39:12] [INFO ] Transformed 624 places.
[2026-05-25 19:39:12] [INFO ] Transformed 828 transitions.
[2026-05-25 19:39:12] [INFO ] Found NUPN structural information;
[2026-05-25 19:39:12] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 119 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 525 transition count 713
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 525 transition count 713
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 231 place count 492 transition count 674
Iterating global reduction 0 with 33 rules applied. Total rules applied 264 place count 492 transition count 674
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 268 place count 492 transition count 670
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 282 place count 478 transition count 648
Iterating global reduction 1 with 14 rules applied. Total rules applied 296 place count 478 transition count 648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 297 place count 477 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 298 place count 477 transition count 647
Applied a total of 298 rules in 128 ms. Remains 477 /624 variables (removed 147) and now considering 647/828 (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-11294810023452906381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-275387330061461465.kers'
[2026-05-25 19:39:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11294810023452906381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-275387330061461465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 647 rows 477 cols 1517 entries
Finished phase 1 with 457 SingleSign rule and 2 generalized
[2026-05-25 19:39:12] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-275387330061461465.kers
Total runtime 3 ms.
[2026-05-25 19:39:13] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-05-25 19:39:13] [INFO ] Invariant cache hit.
[2026-05-25 19:39:13] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 646 sub problems to find dead transitions.
[2026-05-25 19:39:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 646 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 646 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Starting structural reductions in LTL mode, iteration 1 : 477/624 places, 647/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31287 ms. Remains : 477/624 places, 647/828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Applied a total of 0 rules in 6 ms. Remains 477 /477 variables (removed 0) and now considering 647/647 (removed 0) transitions.
[2026-05-25 19:39:43] [INFO ] Invariant cache hit.
[2026-05-25 19:39:43] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 19:39:43] [INFO ] Invariant cache hit.
[2026-05-25 19:39:44] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 477/477 places, 647/647 transitions.
Support contains 119 out of 477 places after structural reductions.
[2026-05-25 19:39:44] [INFO ] Flatten gal took : 63 ms
[2026-05-25 19:39:44] [INFO ] Flatten gal took : 30 ms
[2026-05-25 19:39:44] [INFO ] Input system was already deterministic with 647 transitions.
RANDOM walk for 40000 steps (349 resets) in 1745 ms. (22 steps per ms) remains 59/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
[2026-05-25 19:39:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 333/409 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 56 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 3 (OVERLAPS) 68/477 variables, 9/18 constraints. Problems are: Problem set: 4 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 12/30 constraints. Problems are: Problem set: 4 solved, 55 unsolved
Problem AtomicPropp85 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 5/35 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/36 constraints. Problems are: Problem set: 5 solved, 54 unsolved
SMT process timed out in 5111ms, After SMT, problems are : Problem set: 5 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 425 edges and 477 vertex of which 32 / 477 are part of one of the 16 SCC in 7 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 1013 edges and 461 vertex of which 452 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 452 transition count 465
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 163 rules applied. Total rules applied 314 place count 303 transition count 451
Reduce places removed 7 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 28 rules applied. Total rules applied 342 place count 296 transition count 430
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 364 place count 275 transition count 429
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 364 place count 275 transition count 421
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 380 place count 267 transition count 421
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 390 place count 257 transition count 403
Iterating global reduction 4 with 10 rules applied. Total rules applied 400 place count 257 transition count 403
Performed 62 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 524 place count 195 transition count 336
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 530 place count 195 transition count 330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 531 place count 194 transition count 328
Iterating global reduction 5 with 1 rules applied. Total rules applied 532 place count 194 transition count 328
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 562 place count 179 transition count 411
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 570 place count 179 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 6 with 35 rules applied. Total rules applied 605 place count 179 transition count 368
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 613 place count 179 transition count 360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 621 place count 171 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 622 place count 171 transition count 359
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 623 place count 171 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 624 place count 170 transition count 360
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 631 place count 170 transition count 360
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 636 place count 170 transition count 360
Applied a total of 636 rules in 125 ms. Remains 170 /477 variables (removed 307) and now considering 360/647 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 170/477 places, 360/647 transitions.
RANDOM walk for 40000 steps (3355 resets) in 866 ms. (46 steps per ms) remains 41/54 properties
BEST_FIRST walk for 4004 steps (46 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (50 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (47 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (43 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (50 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 6 ms. (572 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (49 resets) in 6 ms. (572 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (22 resets) in 5 ms. (667 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (43 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (20 resets) in 6 ms. (572 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (50 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 7 ms. (500 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (44 resets) in 6 ms. (571 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (45 resets) in 6 ms. (571 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (47 resets) in 7 ms. (500 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 6 ms. (572 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (20 resets) in 5 ms. (667 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (48 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (49 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (47 resets) in 6 ms. (572 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
[2026-05-25 19:39:51] [INFO ] Flow matrix only has 357 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4629057798134184020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13584670560572590047.kers'
[2026-05-25 19:39:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4629057798134184020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13584670560572590047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 170 cols 1334 entries
Finished phase 1 with 158 SingleSign rule and 2 generalized
[2026-05-25 19:39:51] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13584670560572590047.kers
Total runtime 1 ms.
[2026-05-25 19:39:51] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 18/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 103/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp79 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 13/43 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 4/47 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 6/53 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/55 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 4/59 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 1/60 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 3/63 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 3/66 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 3/69 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 357/527 variables, 170/239 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 5/244 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/527 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 0/527 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 244 constraints, problems are : Problem set: 1 solved, 38 unsolved in 8835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 18/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 104/170 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 59/69 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/71 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 3/74 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 2/76 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 357/527 variables, 170/246 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 5/251 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 38/289 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/527 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 289 constraints, problems are : Problem set: 1 solved, 38 unsolved in 8478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/39 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17336ms problems are : Problem set: 1 solved, 38 unsolved
Parikh walk visited 12 properties in 996 ms.
Support contains 35 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 360/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 170 transition count 353
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 17 place count 163 transition count 350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 160 transition count 350
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 160 transition count 345
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 155 transition count 345
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 39 place count 146 transition count 324
Iterating global reduction 3 with 9 rules applied. Total rules applied 48 place count 146 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 146 transition count 322
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 64 place count 139 transition count 315
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 138 transition count 313
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 138 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 78 place count 132 transition count 333
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 131 transition count 330
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 131 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 91 place count 131 transition count 319
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 130 transition count 311
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 130 transition count 311
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 130 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 105 place count 124 transition count 305
Applied a total of 105 rules in 49 ms. Remains 124 /170 variables (removed 46) and now considering 305/360 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 124/170 places, 305/360 transitions.
RANDOM walk for 40000 steps (3918 resets) in 411 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (41 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (43 resets) in 6 ms. (571 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (44 resets) in 6 ms. (571 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (45 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (43 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (45 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (46 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (31 resets) in 6 ms. (572 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (44 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 5 ms. (667 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 653821 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 26
Probabilistic random walk after 653821 steps, saw 112643 distinct states, run finished after 3005 ms. (steps per millisecond=217 ) properties seen :0
[2026-05-25 19:40:12] [INFO ] Flow matrix only has 298 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11342238302686929886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18048434637519823567.kers'
[2026-05-25 19:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11342238302686929886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18048434637519823567.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 124 cols 1250 entries
Finished phase 1 with 112 SingleSign rule and 2 generalized
[2026-05-25 19:40:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18048434637519823567.kers
Total runtime 1 ms.
[2026-05-25 19:40:12] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 13/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 76/124 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 298/422 variables, 124/156 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 166 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 13/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 76/124 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 298/422 variables, 124/162 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 199 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8857ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 3 properties in 742 ms.
Support contains 30 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 305/305 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 124 transition count 304
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 123 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 121 transition count 302
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 117 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 117 transition count 297
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 17 place count 115 transition count 290
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 115 transition count 290
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 114 transition count 287
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 114 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 23 place count 112 transition count 285
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 112 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 112 transition count 283
Applied a total of 27 rules in 25 ms. Remains 112 /124 variables (removed 12) and now considering 283/305 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 112/124 places, 283/305 transitions.
RANDOM walk for 40000 steps (4039 resets) in 280 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (45 resets) in 7 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (45 resets) in 7 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (43 resets) in 6 ms. (571 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 7 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (44 resets) in 7 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 4 ms. (800 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 6 ms. (572 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (46 resets) in 4 ms. (800 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 5 ms. (667 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 641497 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :1 out of 23
Probabilistic random walk after 641497 steps, saw 109831 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :1
[2026-05-25 19:40:25] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8580119776981648771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13489513422014544979.kers'
[2026-05-25 19:40:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8580119776981648771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13489513422014544979.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 112 cols 1196 entries
Finished phase 1 with 100 SingleSign rule and 2 generalized
[2026-05-25 19:40:25] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13489513422014544979.kers
Total runtime 1 ms.
[2026-05-25 19:40:25] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 71/112 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 276/388 variables, 112/149 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 156 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 71/112 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 276/388 variables, 112/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 22/183 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/388 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 185 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5422ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 0 properties in 578 ms.
Support contains 29 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 282
Applied a total of 2 rules in 9 ms. Remains 111 /112 variables (removed 1) and now considering 282/283 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 111/112 places, 282/283 transitions.
RANDOM walk for 40000 steps (4045 resets) in 307 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 6 ms. (572 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (45 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (46 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (37 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (45 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (45 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (45 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 6 ms. (572 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 541406 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 22
Probabilistic random walk after 541406 steps, saw 93188 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2026-05-25 19:40:34] [INFO ] Flow matrix only has 275 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11634892871895386022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7144791578552365078.kers'
[2026-05-25 19:40:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11634892871895386022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7144791578552365078.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 111 cols 1194 entries
Finished phase 1 with 99 SingleSign rule and 2 generalized
[2026-05-25 19:40:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7144791578552365078.kers
Total runtime 1 ms.
[2026-05-25 19:40:34] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 70/111 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 275/386 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/386 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 151 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 70/111 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 275/386 variables, 111/146 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 22/175 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 175 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4816ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 2 properties in 528 ms.
Support contains 27 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 282/282 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 111 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 281
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 110 transition count 280
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 109 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 108 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 12 place count 108 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 107 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 106 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 106 transition count 269
Applied a total of 16 rules in 17 ms. Remains 106 /111 variables (removed 5) and now considering 269/282 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 106/111 places, 269/282 transitions.
RANDOM walk for 40000 steps (4007 resets) in 258 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (45 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (45 resets) in 5 ms. (667 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (45 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (47 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (43 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (46 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (48 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 640112 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 20
Probabilistic random walk after 640112 steps, saw 109661 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2026-05-25 19:40:43] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1555444720206141142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1479048476135429417.kers'
[2026-05-25 19:40:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1555444720206141142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1479048476135429417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 106 cols 1128 entries
Finished phase 1 with 94 SingleSign rule and 2 generalized
[2026-05-25 19:40:43] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1479048476135429417.kers
Total runtime 1 ms.
[2026-05-25 19:40:43] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 12/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 67/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 262/368 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 133 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 12/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 67/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 262/368 variables, 106/132 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 164 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4439ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 455 ms.
Support contains 27 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 269/269 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 106/106 places, 269/269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 269/269 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2026-05-25 19:40:48] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
[2026-05-25 19:40:48] [INFO ] Invariant cache hit.
[2026-05-25 19:40:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 19:40:48] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
[2026-05-25 19:40:48] [INFO ] Invariant cache hit.
[2026-05-25 19:40:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-25 19:40:48] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/106 places, 269/269 transitions.
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 8 place count 105 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 104 transition count 267
Applied a total of 10 rules in 13 ms. Remains 104 /105 variables (removed 1) and now considering 267/269 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17885571559162154864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10908398744663055620.kers'
[2026-05-25 19:40:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17885571559162154864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10908398744663055620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 104 cols 1178 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-25 19:40:48] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10908398744663055620.kers
Total runtime 1 ms.
[2026-05-25 19:40:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 19:40:48] [INFO ] Invariant cache hit.
[2026-05-25 19:40:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 19:40:48] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/106 places, 267/269 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 395 ms. Remains : 104/106 places, 267/269 transitions.
RANDOM walk for 40000 steps (4633 resets) in 225 ms. (176 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (54 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 5 ms. (667 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (50 resets) in 6 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (49 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (49 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (48 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (45 resets) in 5 ms. (667 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (50 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (50 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (50 resets) in 6 ms. (571 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (41 resets) in 5 ms. (667 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 614531 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :3 out of 20
Probabilistic random walk after 614531 steps, saw 112474 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :3
[2026-05-25 19:40:51] [INFO ] Invariant cache hit.
[2026-05-25 19:40:51] [INFO ] State equation strengthened by 3 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, 17 unsolved
At refinement iteration 1 (OVERLAPS) 14/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 66/104 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 267/371 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 123 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 14/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 66/104 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 267/371 variables, 104/131 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 17/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 156 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3749ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 1 properties in 385 ms.
Support contains 20 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 267/267 transitions.
Graph (trivial) has 60 edges and 104 vertex of which 11 / 104 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 413 edges and 98 vertex of which 84 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 84 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 49 place count 84 transition count 206
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 83 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 81 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 81 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 80 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 80 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 80 transition count 194
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 75 transition count 189
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 71 place count 75 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 74 transition count 186
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 83 place count 74 transition count 175
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 94 place count 63 transition count 175
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 97 place count 63 transition count 172
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 63 transition count 172
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 63 transition count 172
Applied a total of 100 rules in 27 ms. Remains 63 /104 variables (removed 41) and now considering 172/267 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 63/104 places, 172/267 transitions.
RANDOM walk for 40000 steps (5688 resets) in 1003 ms. (39 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40003 steps (659 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (682 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (691 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (679 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (670 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (657 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (692 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (684 resets) in 40 ms. (975 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (672 resets) in 36 ms. (1081 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (673 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (629 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
[2026-05-25 19:40:56] [INFO ] Flow matrix only has 160 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-13251558394759121290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5336911227749677364.kers'
[2026-05-25 19:40:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13251558394759121290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5336911227749677364.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 63 cols 535 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-25 19:40:56] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5336911227749677364.kers
Total runtime 0 ms.
[2026-05-25 19:40:56] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 49/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 118/182 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 46/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 40/222 variables, 26/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/223 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 114 constraints, problems are : Problem set: 0 solved, 11 unsolved in 341 ms.
Refiners :[State Equation: 63/63 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 49/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 118/182 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 46/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 40/222 variables, 26/119 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/223 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 125 constraints, problems are : Problem set: 0 solved, 11 unsolved in 766 ms.
Refiners :[State Equation: 63/63 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1115ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 9 properties in 414 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 172/172 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 63 transition count 157
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 53 transition count 156
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 33 place count 46 transition count 149
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 46 transition count 149
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 52 place count 40 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 40 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 38 transition count 132
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 38 transition count 132
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 64 place count 38 transition count 130
Applied a total of 64 rules in 6 ms. Remains 38 /63 variables (removed 25) and now considering 130/172 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 38/63 places, 130/172 transitions.
RANDOM walk for 40000 steps (5718 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (658 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (598 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 76974 steps, run visited all 2 properties in 111 ms. (steps per millisecond=693 )
Probabilistic random walk after 76974 steps, saw 19912 distinct states, run finished after 116 ms. (steps per millisecond=663 ) properties seen :2
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2026-05-25 19:40:58] [INFO ] Flatten gal took : 22 ms
[2026-05-25 19:40:58] [INFO ] Flatten gal took : 21 ms
[2026-05-25 19:40:58] [INFO ] Input system was already deterministic with 647 transitions.
Computed a total of 120 stabilizing places and 135 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 434 transition count 590
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 434 transition count 590
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 105 place count 415 transition count 559
Iterating global reduction 0 with 19 rules applied. Total rules applied 124 place count 415 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 415 transition count 558
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 136 place count 404 transition count 536
Iterating global reduction 1 with 11 rules applied. Total rules applied 147 place count 404 transition count 536
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 152 place count 399 transition count 530
Iterating global reduction 1 with 5 rules applied. Total rules applied 157 place count 399 transition count 530
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 396 transition count 523
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 396 transition count 523
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 393 transition count 520
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 393 transition count 520
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 171 place count 391 transition count 518
Iterating global reduction 1 with 2 rules applied. Total rules applied 173 place count 391 transition count 518
Applied a total of 173 rules in 35 ms. Remains 391 /477 variables (removed 86) and now considering 518/647 (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-13794201499504149830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1927260009986704737.kers'
[2026-05-25 19:40:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13794201499504149830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1927260009986704737.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 518 rows 391 cols 1233 entries
Finished phase 1 with 371 SingleSign rule and 2 generalized
[2026-05-25 19:40:58] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1927260009986704737.kers
Total runtime 4 ms.
[2026-05-25 19:40:58] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 19:40:58] [INFO ] Invariant cache hit.
[2026-05-25 19:40:58] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2026-05-25 19:40:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 1/391 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/909 variables, and 78 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 1/391 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/909 variables, and 92 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 0/517 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 391/477 places, 518/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 391/477 places, 518/647 transitions.
[2026-05-25 19:41:58] [INFO ] Flatten gal took : 15 ms
[2026-05-25 19:41:58] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:41:58] [INFO ] Input system was already deterministic with 518 transitions.
[2026-05-25 19:41:58] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:41:58] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:41:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17819694023641229036.gal : 16 ms
[2026-05-25 19:41:58] [INFO ] Time to serialize properties into /tmp/CTLFireability545130248707546028.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17819694023641229036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability545130248707546028.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.84743e+14,9.64372,269432,2,20849,5,842195,6,0,2084,1.67307e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.84743e+14,24.2197,431844,3384,444,538998,12124,893,2.38378e+06,155,74949,0


Converting to forward existential form...Done !
original formula: (!(A((i6.u42.p205!=1) U EG(!(EF((i7.u142.p558==1)))))) * ((AX(((EG(((i8.u51.p281==1)&&(i7.u142.p617==1))) + !(E((i21.i1.i0.u115.p485==1) ...506
=> equivalent forward existential formula: ([((Init * !(EG(!(EG(!(E(TRUE U (i7.u142.p558==1)))))))) * !(E(!(EG(!(E(TRUE U (i7.u142.p558==1))))) U (!((i6.u4...1281
Reverse transition relation is NOT exact ! Due to transitions t12, t102, t151, t331, t429, t442, t443, t444, t445, t446, t453, t454, t456, t457, t458, t462...1816
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 429 transition count 584
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 429 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 429 transition count 583
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 119 place count 407 transition count 546
Iterating global reduction 1 with 22 rules applied. Total rules applied 141 place count 407 transition count 546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 143 place count 407 transition count 544
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 158 place count 392 transition count 517
Iterating global reduction 2 with 15 rules applied. Total rules applied 173 place count 392 transition count 517
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 181 place count 384 transition count 506
Iterating global reduction 2 with 8 rules applied. Total rules applied 189 place count 384 transition count 506
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 378 transition count 497
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 378 transition count 497
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 207 place count 372 transition count 490
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 372 transition count 490
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 216 place count 372 transition count 487
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 219 place count 369 transition count 483
Iterating global reduction 3 with 3 rules applied. Total rules applied 222 place count 369 transition count 483
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 225 place count 369 transition count 480
Applied a total of 225 rules in 33 ms. Remains 369 /477 variables (removed 108) and now considering 480/647 (removed 167) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9940558468586112030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4764795404502428228.kers'
[2026-05-25 19:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9940558468586112030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4764795404502428228.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 480 rows 369 cols 1141 entries
Finished phase 1 with 349 SingleSign rule and 2 generalized
[2026-05-25 19:42:59] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4764795404502428228.kers
Total runtime 2 ms.
[2026-05-25 19:42:59] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 19:42:59] [INFO ] Invariant cache hit.
[2026-05-25 19:42:59] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2026-05-25 19:42:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/849 variables, and 67 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/369 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/849 variables, and 93 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/369 constraints, PredecessorRefiner: 0/479 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 369/477 places, 480/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60520 ms. Remains : 369/477 places, 480/647 transitions.
[2026-05-25 19:43:59] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:43:59] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:43:59] [INFO ] Input system was already deterministic with 480 transitions.
[2026-05-25 19:43:59] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:43:59] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:43:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1359167704856883436.gal : 2 ms
[2026-05-25 19:43:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16183244037967764452.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/CTLFireability1359167704856883436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16183244037967764452.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43192e+14,7.27426,211476,2,19245,5,618942,6,0,1958,1.35766e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 19:44:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:44:30] [INFO ] Applying decomposition
[2026-05-25 19:44:30] [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/graph12875955883889703981.txt' '-o' '/tmp/graph12875955883889703981.bin' '-w' '/tmp/graph12875955883889703981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12875955883889703981.bin' '-l' '-1' '-v' '-w' '/tmp/graph12875955883889703981.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:44:30] [INFO ] Decomposing Gal with order
[2026-05-25 19:44:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:44:30] [INFO ] Removed a total of 188 redundant transitions.
[2026-05-25 19:44:30] [INFO ] Flatten gal took : 24 ms
[2026-05-25 19:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 11 ms.
[2026-05-25 19:44:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17846000583351637703.gal : 5 ms
[2026-05-25 19:44:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12635299704915567373.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/CTLFireability17846000583351637703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12635299704915567373.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.43192e+14,5.32473,128280,3503,203,194093,2836,939,503101,119,16154,0


Converting to forward existential form...Done !
original formula: EX(((E(EX(!(EX((i4.i1.u25.p132==1)))) U (((EX((i1.i1.u8.p28==1)) + (i1.i0.u13.p85==1)) + ((i12.i3.u69.p334==1)||(i10.i0.u53.p287==1))) + ...235
=> equivalent forward existential formula: ((((([(EY(FwdU(EY(Init),EX(!(EX((i4.i1.u25.p132==1)))))) * (i1.i1.u8.p28==1))] != FALSE + [(FwdU(EY(Init),EX(!(E...525
Reverse transition relation is NOT exact ! Due to transitions t91, t234, t428, t433, i1.i0.t371, i1.i0.t380, i1.i0.t385, i1.i0.t387, i1.i0.t389, i1.i0.t398...1956
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 565 edges and 477 vertex of which 80 / 477 are part of one of the 21 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 417 transition count 396
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 204 rules applied. Total rules applied 387 place count 235 transition count 374
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 396 place count 226 transition count 374
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 396 place count 226 transition count 366
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 412 place count 218 transition count 366
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 461 place count 169 transition count 276
Iterating global reduction 3 with 49 rules applied. Total rules applied 510 place count 169 transition count 276
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 514 place count 169 transition count 272
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 518 place count 165 transition count 272
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 532 place count 151 transition count 245
Iterating global reduction 5 with 14 rules applied. Total rules applied 546 place count 151 transition count 245
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 548 place count 151 transition count 243
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 551 place count 149 transition count 242
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 558 place count 142 transition count 232
Iterating global reduction 7 with 7 rules applied. Total rules applied 565 place count 142 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 568 place count 142 transition count 229
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 572 place count 138 transition count 224
Iterating global reduction 8 with 4 rules applied. Total rules applied 576 place count 138 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 578 place count 138 transition count 222
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 581 place count 135 transition count 219
Iterating global reduction 9 with 3 rules applied. Total rules applied 584 place count 135 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 587 place count 135 transition count 216
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 621 place count 118 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 628 place count 118 transition count 192
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 638 place count 108 transition count 172
Iterating global reduction 11 with 10 rules applied. Total rules applied 648 place count 108 transition count 172
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 653 place count 103 transition count 166
Iterating global reduction 11 with 5 rules applied. Total rules applied 658 place count 103 transition count 166
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 660 place count 101 transition count 163
Iterating global reduction 11 with 2 rules applied. Total rules applied 662 place count 101 transition count 163
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 664 place count 99 transition count 159
Iterating global reduction 11 with 2 rules applied. Total rules applied 666 place count 99 transition count 159
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 668 place count 97 transition count 155
Iterating global reduction 11 with 2 rules applied. Total rules applied 670 place count 97 transition count 155
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 671 place count 96 transition count 153
Iterating global reduction 11 with 1 rules applied. Total rules applied 672 place count 96 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 675 place count 96 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 678 place count 96 transition count 147
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 2 rules applied. Total rules applied 680 place count 96 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 682 place count 94 transition count 145
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 683 place count 93 transition count 143
Iterating global reduction 14 with 1 rules applied. Total rules applied 684 place count 93 transition count 143
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 685 place count 92 transition count 141
Iterating global reduction 14 with 1 rules applied. Total rules applied 686 place count 92 transition count 141
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 689 place count 89 transition count 138
Iterating global reduction 14 with 3 rules applied. Total rules applied 692 place count 89 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 694 place count 88 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 697 place count 88 transition count 134
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 699 place count 88 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 700 place count 87 transition count 133
Applied a total of 700 rules in 61 ms. Remains 87 /477 variables (removed 390) and now considering 133/647 (removed 514) transitions.
[2026-05-25 19:45:00] [INFO ] Flow matrix only has 123 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10741142276706651385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9593656829653535022.kers'
[2026-05-25 19:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10741142276706651385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9593656829653535022.kers]
Normalized transition count is 122 out of 123 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 87 cols 356 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 19:45:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9593656829653535022.kers
Total runtime 1 ms.
[2026-05-25 19:45:00] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 19:45:00] [INFO ] Flow matrix only has 123 transitions (discarded 10 similar events)
[2026-05-25 19:45:00] [INFO ] Invariant cache hit.
[2026-05-25 19:45:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 19:45:00] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2026-05-25 19:45:00] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-25 19:45:00] [INFO ] Flow matrix only has 123 transitions (discarded 10 similar events)
[2026-05-25 19:45:00] [INFO ] Invariant cache hit.
[2026-05-25 19:45:00] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 8/87 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 122/209 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/210 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 101 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 87/87 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 8/87 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 122/209 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 117/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 221 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7987 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 87/87 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13459ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 13459ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/477 places, 133/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13660 ms. Remains : 87/477 places, 133/647 transitions.
[2026-05-25 19:45:13] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:45:13] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:45:13] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-25 19:45:13] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:45:13] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:45:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13500594220523060701.gal : 1 ms
[2026-05-25 19:45:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1836749197082823210.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/CTLFireability13500594220523060701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1836749197082823210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.81517e+08,0.351819,18356,2,2161,5,67559,6,0,470,64589,0


Converting to forward existential form...Done !
original formula: EG(EF(((p229==0)||(p23==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p229==0)||(p23==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t16, t18, t57, t66, t70, t71, t73, t122, t124, t128, Inter...249
(forward)formula 0,1,1.41847,50548,1,0,200,246478,280,101,3278,198667,273
FORMULA HealthRecord-PT-17-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 564 edges and 477 vertex of which 76 / 477 are part of one of the 21 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 185 place count 421 transition count 399
Reduce places removed 184 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 207 rules applied. Total rules applied 392 place count 237 transition count 376
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 402 place count 228 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 403 place count 227 transition count 375
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 403 place count 227 transition count 367
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 419 place count 219 transition count 367
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 469 place count 169 transition count 275
Iterating global reduction 4 with 50 rules applied. Total rules applied 519 place count 169 transition count 275
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 523 place count 169 transition count 271
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 527 place count 165 transition count 271
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 540 place count 152 transition count 246
Iterating global reduction 6 with 13 rules applied. Total rules applied 553 place count 152 transition count 246
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 555 place count 152 transition count 244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 558 place count 150 transition count 243
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 565 place count 143 transition count 233
Iterating global reduction 8 with 7 rules applied. Total rules applied 572 place count 143 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 574 place count 143 transition count 231
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 578 place count 139 transition count 226
Iterating global reduction 9 with 4 rules applied. Total rules applied 582 place count 139 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 585 place count 139 transition count 223
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 588 place count 136 transition count 220
Iterating global reduction 10 with 3 rules applied. Total rules applied 591 place count 136 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 594 place count 136 transition count 217
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 628 place count 119 transition count 200
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 635 place count 119 transition count 193
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 645 place count 109 transition count 173
Iterating global reduction 12 with 10 rules applied. Total rules applied 655 place count 109 transition count 173
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 659 place count 105 transition count 168
Iterating global reduction 12 with 4 rules applied. Total rules applied 663 place count 105 transition count 168
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 666 place count 102 transition count 163
Iterating global reduction 12 with 3 rules applied. Total rules applied 669 place count 102 transition count 163
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 672 place count 99 transition count 157
Iterating global reduction 12 with 3 rules applied. Total rules applied 675 place count 99 transition count 157
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 678 place count 96 transition count 151
Iterating global reduction 12 with 3 rules applied. Total rules applied 681 place count 96 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 684 place count 96 transition count 148
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 685 place count 95 transition count 146
Iterating global reduction 13 with 1 rules applied. Total rules applied 686 place count 95 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 689 place count 95 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 693 place count 95 transition count 139
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 14 with 2 rules applied. Total rules applied 695 place count 95 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 697 place count 93 transition count 137
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 698 place count 92 transition count 135
Iterating global reduction 16 with 1 rules applied. Total rules applied 699 place count 92 transition count 135
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 700 place count 91 transition count 133
Iterating global reduction 16 with 1 rules applied. Total rules applied 701 place count 91 transition count 133
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 704 place count 88 transition count 130
Iterating global reduction 16 with 3 rules applied. Total rules applied 707 place count 88 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 709 place count 87 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 712 place count 87 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 713 place count 86 transition count 125
Applied a total of 713 rules in 56 ms. Remains 86 /477 variables (removed 391) and now considering 125/647 (removed 522) transitions.
[2026-05-25 19:45:15] [INFO ] Flow matrix only has 115 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10583389643730750346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-697433204297844228.kers'
[2026-05-25 19:45:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10583389643730750346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-697433204297844228.kers]
Normalized transition count is 114 out of 115 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 86 cols 322 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 19:45:15] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-697433204297844228.kers
Total runtime 1 ms.
[2026-05-25 19:45:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 19:45:15] [INFO ] Flow matrix only has 115 transitions (discarded 10 similar events)
[2026-05-25 19:45:15] [INFO ] Invariant cache hit.
[2026-05-25 19:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:45:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 19:45:15] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-25 19:45:15] [INFO ] Flow matrix only has 115 transitions (discarded 10 similar events)
[2026-05-25 19:45:15] [INFO ] Invariant cache hit.
[2026-05-25 19:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 8/86 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 114/200 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 98 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4870 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 8/86 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 114/200 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 109/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 211 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7708 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12586ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 12588ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/477 places, 125/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12807 ms. Remains : 86/477 places, 125/647 transitions.
[2026-05-25 19:45:28] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:45:28] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:45:28] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-25 19:45:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:45:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:45:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3555923101365855817.gal : 0 ms
[2026-05-25 19:45:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14464375705686149461.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/CTLFireability3555923101365855817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14464375705686149461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.28539e+08,0.145157,10396,2,2449,5,30687,6,0,456,23288,0


Converting to forward existential form...Done !
original formula: (AF(AG((p34==1))) + AG((p590==0)))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(!(E(TRUE U !((p34==1))))))))),TRUE) * !((p590==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t14, t16, t68, t116, t118, t122, t123, Intersection with r...235
(forward)formula 0,0,2.65945,95860,1,0,253,556386,267,132,3161,429842,331
FORMULA HealthRecord-PT-17-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 566 edges and 477 vertex of which 80 / 477 are part of one of the 21 SCC in 2 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 417 transition count 396
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 204 rules applied. Total rules applied 387 place count 235 transition count 374
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 396 place count 227 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 397 place count 226 transition count 373
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 397 place count 226 transition count 365
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 413 place count 218 transition count 365
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 463 place count 168 transition count 273
Iterating global reduction 4 with 50 rules applied. Total rules applied 513 place count 168 transition count 273
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 517 place count 168 transition count 269
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 521 place count 164 transition count 269
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 535 place count 150 transition count 242
Iterating global reduction 6 with 14 rules applied. Total rules applied 549 place count 150 transition count 242
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 551 place count 150 transition count 240
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 554 place count 148 transition count 239
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 561 place count 141 transition count 229
Iterating global reduction 8 with 7 rules applied. Total rules applied 568 place count 141 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 571 place count 141 transition count 226
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 576 place count 136 transition count 220
Iterating global reduction 9 with 5 rules applied. Total rules applied 581 place count 136 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 584 place count 136 transition count 217
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 587 place count 133 transition count 214
Iterating global reduction 10 with 3 rules applied. Total rules applied 590 place count 133 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 593 place count 133 transition count 211
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 30 rules applied. Total rules applied 623 place count 118 transition count 196
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 630 place count 118 transition count 189
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 640 place count 108 transition count 169
Iterating global reduction 12 with 10 rules applied. Total rules applied 650 place count 108 transition count 169
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 656 place count 102 transition count 162
Iterating global reduction 12 with 6 rules applied. Total rules applied 662 place count 102 transition count 162
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 665 place count 99 transition count 157
Iterating global reduction 12 with 3 rules applied. Total rules applied 668 place count 99 transition count 157
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 671 place count 96 transition count 151
Iterating global reduction 12 with 3 rules applied. Total rules applied 674 place count 96 transition count 151
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 677 place count 93 transition count 145
Iterating global reduction 12 with 3 rules applied. Total rules applied 680 place count 93 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 683 place count 93 transition count 142
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 684 place count 92 transition count 140
Iterating global reduction 13 with 1 rules applied. Total rules applied 685 place count 92 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 688 place count 92 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 691 place count 92 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 14 with 2 rules applied. Total rules applied 693 place count 92 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 695 place count 90 transition count 132
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 696 place count 89 transition count 130
Iterating global reduction 16 with 1 rules applied. Total rules applied 697 place count 89 transition count 130
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 698 place count 88 transition count 128
Iterating global reduction 16 with 1 rules applied. Total rules applied 699 place count 88 transition count 128
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 702 place count 85 transition count 125
Iterating global reduction 16 with 3 rules applied. Total rules applied 705 place count 85 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 707 place count 84 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 710 place count 84 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 711 place count 83 transition count 120
Applied a total of 711 rules in 61 ms. Remains 83 /477 variables (removed 394) and now considering 120/647 (removed 527) transitions.
[2026-05-25 19:45:30] [INFO ] Flow matrix only has 110 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-538147068931579587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15121828542936544080.kers'
[2026-05-25 19:45:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-538147068931579587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15121828542936544080.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 83 cols 311 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 19:45:30] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15121828542936544080.kers
Total runtime 0 ms.
[2026-05-25 19:45:31] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 19:45:31] [INFO ] Flow matrix only has 110 transitions (discarded 10 similar events)
[2026-05-25 19:45:31] [INFO ] Invariant cache hit.
[2026-05-25 19:45:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:45:31] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-25 19:45:31] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-25 19:45:31] [INFO ] Flow matrix only has 110 transitions (discarded 10 similar events)
[2026-05-25 19:45:31] [INFO ] Invariant cache hit.
[2026-05-25 19:45:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 3/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 109/192 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5143 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 3/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 109/192 variables, 83/102 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 115/217 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/193 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 218 constraints, problems are : Problem set: 0 solved, 115 unsolved in 9187 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14345ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 14346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/477 places, 120/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14603 ms. Remains : 83/477 places, 120/647 transitions.
[2026-05-25 19:45:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:45:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:45:45] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-25 19:45:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:45:45] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:45:45] [INFO ] Time to serialize gal into /tmp/CTLFireability515625665062063217.gal : 1 ms
[2026-05-25 19:45:45] [INFO ] Time to serialize properties into /tmp/CTLFireability8129265337773845588.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/CTLFireability515625665062063217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8129265337773845588.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.6891e+08,0.128235,9916,2,1399,5,26887,6,0,441,24780,0


Converting to forward existential form...Done !
original formula: E(AF((p6==1)) U (p247==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((p6==1))))) * (p247==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t12, t14, t50, t52, t55, t56, t63, t67, t94, t110, t112, t117, t118, ...255
(forward)formula 0,0,4.74285,162088,1,0,466,963462,257,241,2801,1.0317e+06,552
FORMULA HealthRecord-PT-17-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 565 edges and 477 vertex of which 80 / 477 are part of one of the 21 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 182 place count 417 transition count 397
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 204 rules applied. Total rules applied 386 place count 236 transition count 374
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 395 place count 227 transition count 374
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 395 place count 227 transition count 366
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 411 place count 219 transition count 366
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 460 place count 170 transition count 276
Iterating global reduction 3 with 49 rules applied. Total rules applied 509 place count 170 transition count 276
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 513 place count 170 transition count 272
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 517 place count 166 transition count 272
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 530 place count 153 transition count 247
Iterating global reduction 5 with 13 rules applied. Total rules applied 543 place count 153 transition count 247
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 5 with 1 rules applied. Total rules applied 544 place count 153 transition count 246
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 546 place count 152 transition count 245
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 552 place count 146 transition count 237
Iterating global reduction 7 with 6 rules applied. Total rules applied 558 place count 146 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 561 place count 146 transition count 234
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 565 place count 142 transition count 230
Iterating global reduction 8 with 4 rules applied. Total rules applied 569 place count 142 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 572 place count 142 transition count 227
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 608 place count 124 transition count 209
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 615 place count 124 transition count 202
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 626 place count 113 transition count 180
Iterating global reduction 10 with 11 rules applied. Total rules applied 637 place count 113 transition count 180
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 643 place count 107 transition count 172
Iterating global reduction 10 with 6 rules applied. Total rules applied 649 place count 107 transition count 172
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 655 place count 101 transition count 164
Iterating global reduction 10 with 6 rules applied. Total rules applied 661 place count 101 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 664 place count 101 transition count 161
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 667 place count 98 transition count 155
Iterating global reduction 11 with 3 rules applied. Total rules applied 670 place count 98 transition count 155
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 673 place count 95 transition count 149
Iterating global reduction 11 with 3 rules applied. Total rules applied 676 place count 95 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 679 place count 95 transition count 146
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 680 place count 94 transition count 144
Iterating global reduction 12 with 1 rules applied. Total rules applied 681 place count 94 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 684 place count 94 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 686 place count 94 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 686 place count 94 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 688 place count 93 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 690 place count 92 transition count 137
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 692 place count 92 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 693 place count 91 transition count 136
Applied a total of 693 rules in 40 ms. Remains 91 /477 variables (removed 386) and now considering 136/647 (removed 511) transitions.
[2026-05-25 19:45:50] [INFO ] Flow matrix only has 126 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13434281965725092576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16893577104169416529.kers'
[2026-05-25 19:45:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13434281965725092576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16893577104169416529.kers]
Normalized transition count is 125 out of 126 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 91 cols 356 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-25 19:45:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16893577104169416529.kers
Total runtime 0 ms.
[2026-05-25 19:45:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 19:45:50] [INFO ] Flow matrix only has 126 transitions (discarded 10 similar events)
[2026-05-25 19:45:50] [INFO ] Invariant cache hit.
[2026-05-25 19:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:45:50] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2026-05-25 19:45:50] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2026-05-25 19:45:50] [INFO ] Flow matrix only has 126 transitions (discarded 10 similar events)
[2026-05-25 19:45:50] [INFO ] Invariant cache hit.
[2026-05-25 19:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 8/91 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 125/216 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 104 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5390 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 8/91 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 125/216 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 120/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 225 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7846 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13256ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13256ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/477 places, 136/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13436 ms. Remains : 91/477 places, 136/647 transitions.
[2026-05-25 19:46:03] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:46:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:46:03] [INFO ] Input system was already deterministic with 136 transitions.
[2026-05-25 19:46:03] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:46:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:46:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5538228821739545871.gal : 1 ms
[2026-05-25 19:46:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5276478593826319206.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/CTLFireability5538228821739545871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5276478593826319206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17965e+09,0.048796,6064,2,455,5,10321,6,0,489,7662,0


Converting to forward existential form...Done !
original formula: E((p464==1) U EF(!(EG(AF((p365==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(p464==1)),TRUE) * !(EG(!(EG(!((p365==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t16, t17, t18, t68, t73, t90, t99, t122, t124, t128, t129, ...267
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 134/0/2
(forward)formula 0,1,1.62709,69260,1,0,484,356463,298,246,3240,411667,579
FORMULA HealthRecord-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 437 transition count 595
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 437 transition count 595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 437 transition count 594
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 99 place count 419 transition count 566
Iterating global reduction 1 with 18 rules applied. Total rules applied 117 place count 419 transition count 566
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 419 transition count 564
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 127 place count 411 transition count 548
Iterating global reduction 2 with 8 rules applied. Total rules applied 135 place count 411 transition count 548
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 408 transition count 545
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 408 transition count 545
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 406 transition count 540
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 406 transition count 540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 405 transition count 538
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 405 transition count 538
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 404 transition count 536
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 404 transition count 536
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 404 transition count 533
Applied a total of 152 rules in 43 ms. Remains 404 /477 variables (removed 73) and now considering 533/647 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4086179655125901240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2568478736057554299.kers'
[2026-05-25 19:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4086179655125901240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2568478736057554299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 533 rows 404 cols 1263 entries
Finished phase 1 with 384 SingleSign rule and 2 generalized
[2026-05-25 19:46:05] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2568478736057554299.kers
Total runtime 2 ms.
[2026-05-25 19:46:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 19:46:05] [INFO ] Invariant cache hit.
[2026-05-25 19:46:05] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 532 sub problems to find dead transitions.
[2026-05-25 19:46:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 1/404 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/937 variables, and 66 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/404 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 1/404 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/937 variables, and 105 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/404 constraints, PredecessorRefiner: 0/532 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 404/477 places, 533/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60453 ms. Remains : 404/477 places, 533/647 transitions.
[2026-05-25 19:47:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:47:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:47:05] [INFO ] Input system was already deterministic with 533 transitions.
[2026-05-25 19:47:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:47:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:47:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17093779844883265255.gal : 2 ms
[2026-05-25 19:47:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16737799971872116601.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/CTLFireability17093779844883265255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16737799971872116601.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 19:47:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:47:35] [INFO ] Applying decomposition
[2026-05-25 19:47:35] [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/graph4752251183905158354.txt' '-o' '/tmp/graph4752251183905158354.bin' '-w' '/tmp/graph4752251183905158354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4752251183905158354.bin' '-l' '-1' '-v' '-w' '/tmp/graph4752251183905158354.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:47:36] [INFO ] Decomposing Gal with order
[2026-05-25 19:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:47:36] [INFO ] Removed a total of 195 redundant transitions.
[2026-05-25 19:47:36] [INFO ] Flatten gal took : 37 ms
[2026-05-25 19:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2026-05-25 19:47:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2040078347571647546.gal : 7 ms
[2026-05-25 19:47:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11356827535190877614.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/CTLFireability2040078347571647546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11356827535190877614.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95975e+14,10.7923,173480,3438,453,215313,8544,914,757230,188,43570,0


Converting to forward existential form...Done !
original formula: E((E(((EG((u89.p350!=1)) + (((i1.u13.p41!=1)&&(i20.u126.p455==1))&&(i4.u27.p110==1))) + A((i16.u104.p393==1) U (i16.u103.p408==1))) U ((i...823
=> equivalent forward existential formula: [FwdG(FwdU(Init,(E(((EG((u89.p350!=1)) + (((i1.u13.p41!=1)&&(i20.u126.p455==1))&&(i4.u27.p110==1))) + !((E(!((i1...1265
Reverse transition relation is NOT exact ! Due to transitions t329, t443, t457, t458, t459, t460, t461, t470, t471, t472, t473, t477, t478, t479, t513, u75...1904
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 426 transition count 578
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 426 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 426 transition count 577
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 126 place count 403 transition count 539
Iterating global reduction 1 with 23 rules applied. Total rules applied 149 place count 403 transition count 539
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 151 place count 403 transition count 537
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 166 place count 388 transition count 510
Iterating global reduction 2 with 15 rules applied. Total rules applied 181 place count 388 transition count 510
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 190 place count 379 transition count 498
Iterating global reduction 2 with 9 rules applied. Total rules applied 199 place count 379 transition count 498
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 206 place count 372 transition count 485
Iterating global reduction 2 with 7 rules applied. Total rules applied 213 place count 372 transition count 485
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 220 place count 365 transition count 477
Iterating global reduction 2 with 7 rules applied. Total rules applied 227 place count 365 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 229 place count 365 transition count 475
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 233 place count 361 transition count 470
Iterating global reduction 3 with 4 rules applied. Total rules applied 237 place count 361 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 240 place count 361 transition count 467
Applied a total of 240 rules in 32 ms. Remains 361 /477 variables (removed 116) and now considering 467/647 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-121691487973053814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17434352270916842396.kers'
[2026-05-25 19:48:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-121691487973053814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17434352270916842396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 361 cols 1105 entries
Finished phase 1 with 341 SingleSign rule and 2 generalized
[2026-05-25 19:48:06] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17434352270916842396.kers
Total runtime 2 ms.
[2026-05-25 19:48:06] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 19:48:06] [INFO ] Invariant cache hit.
[2026-05-25 19:48:06] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2026-05-25 19:48:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/828 variables, and 51 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 10 (OVERLAPS) 467/828 variables, 361/440 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 466/906 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 906 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 361/477 places, 467/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60401 ms. Remains : 361/477 places, 467/647 transitions.
[2026-05-25 19:49:06] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:49:06] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:49:06] [INFO ] Input system was already deterministic with 467 transitions.
[2026-05-25 19:49:06] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:49:06] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:49:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14463558831590159354.gal : 2 ms
[2026-05-25 19:49:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5162615518416728233.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/CTLFireability14463558831590159354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5162615518416728233.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17941e+14,5.06189,145044,2,13097,5,443360,6,0,1913,877056,0


Converting to forward existential form...Done !
original formula: EX(EG(AF(((p519==1) + EX((p31==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(((p519==1) + EX((p31==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...885
Detected timeout of ITS tools.
[2026-05-25 19:49:36] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:49:36] [INFO ] Applying decomposition
[2026-05-25 19:49:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16985218733365756895.txt' '-o' '/tmp/graph16985218733365756895.bin' '-w' '/tmp/graph16985218733365756895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16985218733365756895.bin' '-l' '-1' '-v' '-w' '/tmp/graph16985218733365756895.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:49:36] [INFO ] Decomposing Gal with order
[2026-05-25 19:49:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:49:36] [INFO ] Removed a total of 178 redundant transitions.
[2026-05-25 19:49:36] [INFO ] Flatten gal took : 31 ms
[2026-05-25 19:49:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 6 ms.
[2026-05-25 19:49:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15587415216944591301.gal : 4 ms
[2026-05-25 19:49:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4316261864012837103.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/CTLFireability15587415216944591301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4316261864012837103.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.17941e+14,4.23569,104512,3616,54,145750,903,756,471936,82,3040,0


Converting to forward existential form...Done !
original formula: EX(EG(AF(((i19.u116.p519==1) + EX((i1.u9.p31==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(((i19.u116.p519==1) + EX((i1.u9.p31==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t85, t229, t418, t423, i1.t394, i1.t373, i1.t372, i1.t371, i1.t369, i1.t367, i1.t364, i1.t358...1500
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 429 transition count 581
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 429 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 429 transition count 580
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 117 place count 409 transition count 547
Iterating global reduction 1 with 20 rules applied. Total rules applied 137 place count 409 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 409 transition count 545
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 150 place count 398 transition count 526
Iterating global reduction 2 with 11 rules applied. Total rules applied 161 place count 398 transition count 526
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 169 place count 390 transition count 514
Iterating global reduction 2 with 8 rules applied. Total rules applied 177 place count 390 transition count 514
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 383 transition count 502
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 383 transition count 502
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 198 place count 376 transition count 495
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 376 transition count 495
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 208 place count 376 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 211 place count 373 transition count 489
Iterating global reduction 3 with 3 rules applied. Total rules applied 214 place count 373 transition count 489
Applied a total of 214 rules in 28 ms. Remains 373 /477 variables (removed 104) and now considering 489/647 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10972632843390041572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14691111535698308926.kers'
[2026-05-25 19:50:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10972632843390041572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14691111535698308926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 489 rows 373 cols 1167 entries
Finished phase 1 with 353 SingleSign rule and 2 generalized
[2026-05-25 19:50:06] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14691111535698308926.kers
Total runtime 5 ms.
[2026-05-25 19:50:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 19:50:06] [INFO ] Invariant cache hit.
[2026-05-25 19:50:07] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 488 sub problems to find dead transitions.
[2026-05-25 19:50:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (OVERLAPS) 1/373 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/862 variables, and 74 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (OVERLAPS) 1/373 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 9 (OVERLAPS) 489/862 variables, 373/452 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/862 variables, 488/940 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/862 variables, and 946 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 373/477 places, 489/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60403 ms. Remains : 373/477 places, 489/647 transitions.
[2026-05-25 19:51:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:51:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:51:07] [INFO ] Input system was already deterministic with 489 transitions.
[2026-05-25 19:51:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:51:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:51:07] [INFO ] Time to serialize gal into /tmp/CTLFireability18420354727616699198.gal : 2 ms
[2026-05-25 19:51:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8232056251780732444.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/CTLFireability18420354727616699198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8232056251780732444.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3834e+14,9.56994,257352,2,21743,5,719480,6,0,1983,1.68664e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 19:51:37] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:51:37] [INFO ] Applying decomposition
[2026-05-25 19:51:37] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph51461454174942415.txt' '-o' '/tmp/graph51461454174942415.bin' '-w' '/tmp/graph51461454174942415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph51461454174942415.bin' '-l' '-1' '-v' '-w' '/tmp/graph51461454174942415.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:51:37] [INFO ] Decomposing Gal with order
[2026-05-25 19:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:51:37] [INFO ] Removed a total of 170 redundant transitions.
[2026-05-25 19:51:37] [INFO ] Flatten gal took : 18 ms
[2026-05-25 19:51:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 13 ms.
[2026-05-25 19:51:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11085571796037951104.gal : 8 ms
[2026-05-25 19:51:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7922973975819068529.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/CTLFireability11085571796037951104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7922973975819068529.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.3834e+14,6.76832,167840,3492,254,236106,5604,949,733886,129,35164,0


Converting to forward existential form...Done !
original formula: A(EF(((A((i2.u139.p574==1) U (i7.i1.u36.p218==1)) + EX((((i7.i2.u38.p244==1)&&(i2.u139.p617==1))||(i6.i0.u24.p143==1)))) + ((i21.i0.u112....275
=> equivalent forward existential formula: [((Init * !(EG(!((((i3.i0.u6.p85==1)&&(i6.i0.u24.p170==1))&&((i7.i0.u33.p252==1)&&(i2.u138.p610==1))))))) * !(E(...593
Reverse transition relation is NOT exact ! Due to transitions t98, t360, t403, t417, t418, t419, t420, t421, t433, t438, i2.t62, i2.t59, i2.t49, i2.t43, i2...1879
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 556 edges and 477 vertex of which 80 / 477 are part of one of the 21 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 417 transition count 404
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 196 rules applied. Total rules applied 371 place count 243 transition count 382
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 382 place count 234 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 384 place count 232 transition count 380
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 384 place count 232 transition count 372
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 400 place count 224 transition count 372
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 452 place count 172 transition count 280
Iterating global reduction 4 with 52 rules applied. Total rules applied 504 place count 172 transition count 280
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 508 place count 172 transition count 276
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 512 place count 168 transition count 276
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 526 place count 154 transition count 249
Iterating global reduction 6 with 14 rules applied. Total rules applied 540 place count 154 transition count 249
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 542 place count 154 transition count 247
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 545 place count 152 transition count 246
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 553 place count 144 transition count 233
Iterating global reduction 8 with 8 rules applied. Total rules applied 561 place count 144 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 564 place count 144 transition count 230
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 569 place count 139 transition count 224
Iterating global reduction 9 with 5 rules applied. Total rules applied 574 place count 139 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 577 place count 139 transition count 221
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 580 place count 136 transition count 218
Iterating global reduction 10 with 3 rules applied. Total rules applied 583 place count 136 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 586 place count 136 transition count 215
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 618 place count 120 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 625 place count 120 transition count 192
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 634 place count 111 transition count 174
Iterating global reduction 12 with 9 rules applied. Total rules applied 643 place count 111 transition count 174
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 648 place count 106 transition count 169
Iterating global reduction 12 with 5 rules applied. Total rules applied 653 place count 106 transition count 169
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 655 place count 104 transition count 165
Iterating global reduction 12 with 2 rules applied. Total rules applied 657 place count 104 transition count 165
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 659 place count 102 transition count 161
Iterating global reduction 12 with 2 rules applied. Total rules applied 661 place count 102 transition count 161
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 663 place count 100 transition count 157
Iterating global reduction 12 with 2 rules applied. Total rules applied 665 place count 100 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 668 place count 100 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 670 place count 100 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 672 place count 99 transition count 151
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 673 place count 99 transition count 151
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 674 place count 98 transition count 150
Iterating global reduction 13 with 1 rules applied. Total rules applied 675 place count 98 transition count 150
Applied a total of 675 rules in 29 ms. Remains 98 /477 variables (removed 379) and now considering 150/647 (removed 497) transitions.
[2026-05-25 19:52:07] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2532266589419798453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10694348567084099980.kers'
[2026-05-25 19:52:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2532266589419798453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10694348567084099980.kers]
Normalized transition count is 139 out of 140 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 98 cols 414 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-25 19:52:07] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10694348567084099980.kers
Total runtime 1 ms.
[2026-05-25 19:52:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 19:52:07] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
[2026-05-25 19:52:07] [INFO ] Invariant cache hit.
[2026-05-25 19:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:52:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-05-25 19:52:07] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2026-05-25 19:52:07] [INFO ] Flow matrix only has 140 transitions (discarded 10 similar events)
[2026-05-25 19:52:07] [INFO ] Invariant cache hit.
[2026-05-25 19:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 139/237 variables, 98/110 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 1/238 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 111 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7797 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 98/98 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 139/237 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 148/259 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 260 constraints, problems are : Problem set: 0 solved, 148 unsolved in 14015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 98/98 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21824ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 21824ms
Starting structural reductions in SI_CTL mode, iteration 1 : 98/477 places, 150/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22086 ms. Remains : 98/477 places, 150/647 transitions.
[2026-05-25 19:52:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:52:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:52:29] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-25 19:52:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:52:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12695231413062111430.gal : 0 ms
[2026-05-25 19:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability3328620467219401270.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/CTLFireability12695231413062111430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3328620467219401270.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99007e+09,0.283319,16320,2,2288,5,55218,6,0,531,51171,0


Converting to forward existential form...Done !
original formula: AF(AG((((p509==0)&&(p57==0))&&((p77==1)&&(p617==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p509==0)&&(p57==0))&&((p77==1)&&(p617==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t8, t10, t12, t13, t17, t18, t22, t23, t29, t77, t80, t83, t84, t87, t142...257
(forward)formula 0,0,1.47975,52568,1,0,220,250624,315,113,3763,194584,305
FORMULA HealthRecord-PT-17-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 552 edges and 477 vertex of which 80 / 477 are part of one of the 21 SCC in 0 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 417 transition count 404
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 197 rules applied. Total rules applied 372 place count 243 transition count 381
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 383 place count 234 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 385 place count 232 transition count 379
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 385 place count 232 transition count 372
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 399 place count 225 transition count 372
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 451 place count 173 transition count 280
Iterating global reduction 4 with 52 rules applied. Total rules applied 503 place count 173 transition count 280
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 507 place count 173 transition count 276
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 511 place count 169 transition count 276
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 525 place count 155 transition count 249
Iterating global reduction 6 with 14 rules applied. Total rules applied 539 place count 155 transition count 249
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 541 place count 155 transition count 247
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 544 place count 153 transition count 246
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 550 place count 147 transition count 235
Iterating global reduction 8 with 6 rules applied. Total rules applied 556 place count 147 transition count 235
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 561 place count 142 transition count 229
Iterating global reduction 8 with 5 rules applied. Total rules applied 566 place count 142 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 569 place count 142 transition count 226
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 572 place count 139 transition count 223
Iterating global reduction 9 with 3 rules applied. Total rules applied 575 place count 139 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 578 place count 139 transition count 220
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 610 place count 123 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 616 place count 123 transition count 198
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 624 place count 115 transition count 182
Iterating global reduction 11 with 8 rules applied. Total rules applied 632 place count 115 transition count 182
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 636 place count 111 transition count 178
Iterating global reduction 11 with 4 rules applied. Total rules applied 640 place count 111 transition count 178
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 642 place count 109 transition count 174
Iterating global reduction 11 with 2 rules applied. Total rules applied 644 place count 109 transition count 174
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 646 place count 107 transition count 170
Iterating global reduction 11 with 2 rules applied. Total rules applied 648 place count 107 transition count 170
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 650 place count 105 transition count 166
Iterating global reduction 11 with 2 rules applied. Total rules applied 652 place count 105 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 654 place count 105 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 656 place count 105 transition count 162
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 12 with 1 rules applied. Total rules applied 657 place count 105 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 658 place count 104 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 660 place count 103 transition count 160
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 661 place count 103 transition count 160
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 662 place count 102 transition count 159
Iterating global reduction 14 with 1 rules applied. Total rules applied 663 place count 102 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 664 place count 101 transition count 158
Applied a total of 664 rules in 37 ms. Remains 101 /477 variables (removed 376) and now considering 158/647 (removed 489) transitions.
[2026-05-25 19:52:31] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15594474224980391847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10472476595722318273.kers'
[2026-05-25 19:52:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15594474224980391847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10472476595722318273.kers]
Normalized transition count is 147 out of 148 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 101 cols 414 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-25 19:52:31] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10472476595722318273.kers
Total runtime 0 ms.
[2026-05-25 19:52:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:52:31] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:52:31] [INFO ] Invariant cache hit.
[2026-05-25 19:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:52:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-25 19:52:31] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2026-05-25 19:52:31] [INFO ] Flow matrix only has 148 transitions (discarded 10 similar events)
[2026-05-25 19:52:31] [INFO ] Invariant cache hit.
[2026-05-25 19:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 8/101 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 147/248 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/249 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 115 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7736 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 8/101 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 147/248 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 143/260 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 1/249 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 262 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12282 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20028ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 20029ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/477 places, 158/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20214 ms. Remains : 101/477 places, 158/647 transitions.
[2026-05-25 19:52:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:52:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:52:51] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-25 19:52:51] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:52:51] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17856570941062810520.gal : 0 ms
[2026-05-25 19:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8836536809544393282.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/CTLFireability17856570941062810520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8836536809544393282.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41172e+09,0.599904,28692,2,2608,5,95454,6,0,550,122174,0


Converting to forward existential form...Done !
original formula: AG(E(EF(EG((p623==1))) U (AF((((p98==1)&&(p617==1))||((p71==1)&&(p237==1)))) + !(AF(((p234==1)&&(p549==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U EG((p623==1))) U (!(EG(!((((p98==1)&&(p617==1))||((p71==1)&&(p237==1)))))) + !(...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t8, t9, t11, t13, t14, t18, t19, t23, t24, t25, t29, t67, t70, t77, t85, t86,...297
(forward)formula 0,0,10.9587,353232,1,0,666,2.28022e+06,347,314,3719,2.0336e+06,819
FORMULA HealthRecord-PT-17-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 432 transition count 585
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 432 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 432 transition count 584
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 112 place count 411 transition count 548
Iterating global reduction 1 with 21 rules applied. Total rules applied 133 place count 411 transition count 548
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 135 place count 411 transition count 546
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 147 place count 399 transition count 524
Iterating global reduction 2 with 12 rules applied. Total rules applied 159 place count 399 transition count 524
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 167 place count 391 transition count 513
Iterating global reduction 2 with 8 rules applied. Total rules applied 175 place count 391 transition count 513
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 384 transition count 502
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 384 transition count 502
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 378 transition count 495
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 378 transition count 495
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 378 transition count 493
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 374 transition count 488
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 374 transition count 488
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 214 place count 374 transition count 485
Applied a total of 214 rules in 28 ms. Remains 374 /477 variables (removed 103) and now considering 485/647 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17318516889363884347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12180343919791436338.kers'
[2026-05-25 19:53:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17318516889363884347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12180343919791436338.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 485 rows 374 cols 1151 entries
Finished phase 1 with 354 SingleSign rule and 2 generalized
[2026-05-25 19:53:02] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12180343919791436338.kers
Total runtime 3 ms.
[2026-05-25 19:53:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 19:53:02] [INFO ] Invariant cache hit.
[2026-05-25 19:53:02] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 484 sub problems to find dead transitions.
[2026-05-25 19:53:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/374 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 17/75 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 374/859 variables, and 77 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/374 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 59/59 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/373 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/374 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 10 (OVERLAPS) 485/859 variables, 374/458 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/859 variables, 484/942 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 942 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 374/374 constraints, PredecessorRefiner: 484/484 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 374/477 places, 485/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60411 ms. Remains : 374/477 places, 485/647 transitions.
[2026-05-25 19:54:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:54:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:54:02] [INFO ] Input system was already deterministic with 485 transitions.
[2026-05-25 19:54:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:54:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:54:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11684950829361740862.gal : 1 ms
[2026-05-25 19:54:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1905877476754754681.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/CTLFireability11684950829361740862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1905877476754754681.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6395e+14,19.7405,498764,2,32061,5,1.38486e+06,6,0,1983,3.38791e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 19:54:32] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:54:32] [INFO ] Applying decomposition
[2026-05-25 19:54:32] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3471668671534284809.txt' '-o' '/tmp/graph3471668671534284809.bin' '-w' '/tmp/graph3471668671534284809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3471668671534284809.bin' '-l' '-1' '-v' '-w' '/tmp/graph3471668671534284809.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:54:32] [INFO ] Decomposing Gal with order
[2026-05-25 19:54:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:54:32] [INFO ] Removed a total of 192 redundant transitions.
[2026-05-25 19:54:32] [INFO ] Flatten gal took : 17 ms
[2026-05-25 19:54:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 5 ms.
[2026-05-25 19:54:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2032091594166069285.gal : 4 ms
[2026-05-25 19:54:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14566899042167624613.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/CTLFireability2032091594166069285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14566899042167624613.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 : 477/477 places, 647/647 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 425 transition count 577
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 425 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 425 transition count 576
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 128 place count 402 transition count 538
Iterating global reduction 1 with 23 rules applied. Total rules applied 151 place count 402 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 153 place count 402 transition count 536
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 166 place count 389 transition count 513
Iterating global reduction 2 with 13 rules applied. Total rules applied 179 place count 389 transition count 513
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 382 transition count 504
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 382 transition count 504
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 377 transition count 494
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 377 transition count 494
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 372 transition count 489
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 372 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 372 transition count 488
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 217 place count 369 transition count 485
Iterating global reduction 3 with 3 rules applied. Total rules applied 220 place count 369 transition count 485
Applied a total of 220 rules in 27 ms. Remains 369 /477 variables (removed 108) and now considering 485/647 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17523967265888135794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4721960317082740316.kers'
[2026-05-25 19:55:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17523967265888135794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4721960317082740316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 485 rows 369 cols 1157 entries
Finished phase 1 with 349 SingleSign rule and 2 generalized
[2026-05-25 19:55:03] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4721960317082740316.kers
Total runtime 3 ms.
[2026-05-25 19:55:03] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 19:55:03] [INFO ] Invariant cache hit.
[2026-05-25 19:55:03] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 484 sub problems to find dead transitions.
[2026-05-25 19:55:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 484 unsolved
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Starting structural reductions in LTL mode, iteration 1 : 369/477 places, 485/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30448 ms. Remains : 369/477 places, 485/647 transitions.
[2026-05-25 19:55:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:55:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:55:33] [INFO ] Input system was already deterministic with 485 transitions.
[2026-05-25 19:55:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:55:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:55:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2505954906273970866.gal : 1 ms
[2026-05-25 19:55:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11020435955605303310.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/CTLFireability2505954906273970866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11020435955605303310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50503e+14,5.4824,157960,2,13256,5,471429,6,0,1963,965629,0


Converting to forward existential form...Done !
original formula: EX(EG(!(E(((p271==1)||(p207==1)) U A((p63==1) U ((p39==1)&&(p617==1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(((p271==1)||(p207==1)) U !((E(!(((p39==1)&&(p617==1))) U (!((p63==1)) * !(((p39==1)&&(p617==1...206
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...918
Detected timeout of ITS tools.
[2026-05-25 19:56:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:56:03] [INFO ] Applying decomposition
[2026-05-25 19:56:03] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14348605405040632604.txt' '-o' '/tmp/graph14348605405040632604.bin' '-w' '/tmp/graph14348605405040632604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14348605405040632604.bin' '-l' '-1' '-v' '-w' '/tmp/graph14348605405040632604.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:56:03] [INFO ] Decomposing Gal with order
[2026-05-25 19:56:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:56:03] [INFO ] Removed a total of 174 redundant transitions.
[2026-05-25 19:56:03] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:56:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2026-05-25 19:56:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16784734198221016098.gal : 4 ms
[2026-05-25 19:56:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5869592497037958201.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/CTLFireability16784734198221016098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5869592497037958201.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.50503e+14,16.2311,414944,2759,268,585113,14135,960,2.29565e+06,140,87909,0


Converting to forward existential form...Done !
original formula: EX(EG(!(E(((i17.i1.u46.p271==1)||(i6.i0.u37.p207==1)) U A((i2.i2.u5.p63==1) U ((i2.i1.u9.p39==1)&&(i24.i2.u138.p617==1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(((i17.i1.u46.p271==1)||(i6.i0.u37.p207==1)) U !((E(!(((i2.i1.u9.p39==1)&&(i24.i2.u138.p617==1...299
Reverse transition relation is NOT exact ! Due to transitions t90, t348, t400, t401, t430, t435, i0.i0.u3.t410, i2.i2.t365, i2.i2.t377, i2.i2.t382, i2.i2.t...1888
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 551 edges and 477 vertex of which 80 / 477 are part of one of the 21 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 173 place count 417 transition count 406
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 192 rules applied. Total rules applied 365 place count 245 transition count 386
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 377 place count 237 transition count 382
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 384 place count 233 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 232 transition count 379
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 385 place count 232 transition count 372
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 399 place count 225 transition count 372
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 445 place count 179 transition count 289
Iterating global reduction 5 with 46 rules applied. Total rules applied 491 place count 179 transition count 289
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 493 place count 179 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 495 place count 177 transition count 287
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 506 place count 166 transition count 267
Iterating global reduction 7 with 11 rules applied. Total rules applied 517 place count 166 transition count 267
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 521 place count 162 transition count 263
Iterating global reduction 7 with 4 rules applied. Total rules applied 525 place count 162 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 528 place count 162 transition count 260
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 568 place count 142 transition count 240
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 576 place count 142 transition count 232
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 588 place count 130 transition count 208
Iterating global reduction 9 with 12 rules applied. Total rules applied 600 place count 130 transition count 208
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 603 place count 127 transition count 203
Iterating global reduction 9 with 3 rules applied. Total rules applied 606 place count 127 transition count 203
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 610 place count 123 transition count 199
Iterating global reduction 9 with 4 rules applied. Total rules applied 614 place count 123 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 617 place count 123 transition count 196
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 618 place count 122 transition count 194
Iterating global reduction 10 with 1 rules applied. Total rules applied 619 place count 122 transition count 194
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 620 place count 121 transition count 192
Iterating global reduction 10 with 1 rules applied. Total rules applied 621 place count 121 transition count 192
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 622 place count 120 transition count 190
Iterating global reduction 10 with 1 rules applied. Total rules applied 623 place count 120 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 625 place count 120 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 625 place count 120 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 627 place count 119 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 629 place count 118 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 630 place count 117 transition count 185
Applied a total of 630 rules in 33 ms. Remains 117 /477 variables (removed 360) and now considering 185/647 (removed 462) transitions.
[2026-05-25 19:56:33] [INFO ] Flow matrix only has 175 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6164379480174896306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6615337487857156583.kers'
[2026-05-25 19:56:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6164379480174896306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6615337487857156583.kers]
Normalized transition count is 174 out of 175 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 117 cols 493 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-25 19:56:33] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6615337487857156583.kers
Total runtime 1 ms.
[2026-05-25 19:56:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 19:56:33] [INFO ] Flow matrix only has 175 transitions (discarded 10 similar events)
[2026-05-25 19:56:33] [INFO ] Invariant cache hit.
[2026-05-25 19:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:56:33] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 19:56:33] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2026-05-25 19:56:33] [INFO ] Flow matrix only has 175 transitions (discarded 10 similar events)
[2026-05-25 19:56:33] [INFO ] Invariant cache hit.
[2026-05-25 19:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 5/117 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 174/291 variables, 117/133 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 1/292 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 0/292 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 135 constraints, problems are : Problem set: 0 solved, 176 unsolved in 11941 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 5/117 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 174/291 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 176/315 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 1/292 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (OVERLAPS) 0/292 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 316 constraints, problems are : Problem set: 0 solved, 176 unsolved in 19287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31242ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 31243ms
Starting structural reductions in SI_CTL mode, iteration 1 : 117/477 places, 185/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31436 ms. Remains : 117/477 places, 185/647 transitions.
[2026-05-25 19:57:05] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:57:05] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:57:05] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-25 19:57:05] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:57:05] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability404970180076365125.gal : 1 ms
[2026-05-25 19:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11398906314359651426.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/CTLFireability404970180076365125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11398906314359651426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.01411e+09,1.57789,57240,2,6200,5,214070,6,0,640,254347,0


Converting to forward existential form...Done !
original formula: AG(A((!(EF(((p148==1)||(p382==1)))) + (p172==1)) U (EG((((p468==1)&&(p285==1))||(p90!=1))) + EF(((p214!=1)&&(p492==1))))))
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((EG((((p468==1)&&(p285==1))||(p90!=1))) + E(TRUE U ((p214!=1)&&(p492==1)))))) * !((!...411
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t13, t16, t17, t18, t21, t22, t25, t27, t28, t29, t30, t66,...442
(forward)formula 0,0,24.7917,741232,1,0,535,4.81308e+06,391,248,4348,4.07744e+06,618
FORMULA HealthRecord-PT-17-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 426 transition count 579
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 426 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 426 transition count 578
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 126 place count 403 transition count 540
Iterating global reduction 1 with 23 rules applied. Total rules applied 149 place count 403 transition count 540
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 151 place count 403 transition count 538
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 165 place count 389 transition count 514
Iterating global reduction 2 with 14 rules applied. Total rules applied 179 place count 389 transition count 514
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 189 place count 379 transition count 500
Iterating global reduction 2 with 10 rules applied. Total rules applied 199 place count 379 transition count 500
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 207 place count 371 transition count 486
Iterating global reduction 2 with 8 rules applied. Total rules applied 215 place count 371 transition count 486
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 222 place count 364 transition count 478
Iterating global reduction 2 with 7 rules applied. Total rules applied 229 place count 364 transition count 478
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 232 place count 364 transition count 475
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 360 transition count 470
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 360 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 243 place count 360 transition count 467
Applied a total of 243 rules in 37 ms. Remains 360 /477 variables (removed 117) and now considering 467/647 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8129834125018289991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15883957493751186407.kers'
[2026-05-25 19:57:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8129834125018289991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15883957493751186407.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 467 rows 360 cols 1111 entries
Finished phase 1 with 340 SingleSign rule and 2 generalized
[2026-05-25 19:57:30] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15883957493751186407.kers
Total runtime 7 ms.
[2026-05-25 19:57:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 19:57:30] [INFO ] Invariant cache hit.
[2026-05-25 19:57:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2026-05-25 19:57:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/360 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/827 variables, and 61 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/360 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 43/61 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 7 (OVERLAPS) 467/827 variables, 360/423 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 466/889 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 827/827 variables, and 896 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 360/477 places, 467/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60388 ms. Remains : 360/477 places, 467/647 transitions.
[2026-05-25 19:58:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:58:30] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:58:30] [INFO ] Input system was already deterministic with 467 transitions.
[2026-05-25 19:58:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:58:30] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1571908503362973634.gal : 3 ms
[2026-05-25 19:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15102174395973072279.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/CTLFireability1571908503362973634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15102174395973072279.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11153e+14,5.05708,146208,2,13839,5,454615,6,0,1909,883843,0


Converting to forward existential form...Done !
original formula: EG(EX(((p237==0) + AX((p280==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(((p237==0) + !(EX(!((p280==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t49...928
Detected timeout of ITS tools.
[2026-05-25 19:59:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:59:00] [INFO ] Applying decomposition
[2026-05-25 19:59:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17535156931193041745.txt' '-o' '/tmp/graph17535156931193041745.bin' '-w' '/tmp/graph17535156931193041745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17535156931193041745.bin' '-l' '-1' '-v' '-w' '/tmp/graph17535156931193041745.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:59:00] [INFO ] Decomposing Gal with order
[2026-05-25 19:59:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:59:00] [INFO ] Removed a total of 175 redundant transitions.
[2026-05-25 19:59:00] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2026-05-25 19:59:00] [INFO ] Time to serialize gal into /tmp/CTLFireability6880969246298546045.gal : 3 ms
[2026-05-25 19:59:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12127351878522689754.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/CTLFireability6880969246298546045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12127351878522689754.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.11153e+14,5.50423,127732,3165,78,182668,1422,928,550367,104,5876,0


Converting to forward existential form...Done !
original formula: EG(EX(((i6.i0.u37.p237==0) + AX((i9.i2.u56.p280==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i6.i0.u37.p237==0) + !(EX(!((i9.i2.u56.p280==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t86, t412, t413, t415, t416, t417, t422, i1.i0.t360, i1.i0.t363, i1.i0.t369, i1.i0.t372, i1.i...1880
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 647/647 transitions.
Graph (trivial) has 539 edges and 477 vertex of which 62 / 477 are part of one of the 20 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 434 transition count 423
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 197 rules applied. Total rules applied 374 place count 258 transition count 402
Reduce places removed 9 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 19 rules applied. Total rules applied 393 place count 249 transition count 392
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 403 place count 239 transition count 392
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 403 place count 239 transition count 383
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 421 place count 230 transition count 383
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 469 place count 182 transition count 297
Iterating global reduction 4 with 48 rules applied. Total rules applied 517 place count 182 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 5 rules applied. Total rules applied 522 place count 182 transition count 292
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 526 place count 178 transition count 292
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 539 place count 165 transition count 268
Iterating global reduction 6 with 13 rules applied. Total rules applied 552 place count 165 transition count 268
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 6 with 1 rules applied. Total rules applied 553 place count 165 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 554 place count 164 transition count 267
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 557 place count 161 transition count 262
Iterating global reduction 8 with 3 rules applied. Total rules applied 560 place count 161 transition count 262
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 564 place count 157 transition count 257
Iterating global reduction 8 with 4 rules applied. Total rules applied 568 place count 157 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 570 place count 157 transition count 255
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 573 place count 154 transition count 251
Iterating global reduction 9 with 3 rules applied. Total rules applied 576 place count 154 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 578 place count 154 transition count 249
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 610 place count 138 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 618 place count 138 transition count 225
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 628 place count 128 transition count 205
Iterating global reduction 11 with 10 rules applied. Total rules applied 638 place count 128 transition count 205
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 643 place count 123 transition count 199
Iterating global reduction 11 with 5 rules applied. Total rules applied 648 place count 123 transition count 199
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 650 place count 121 transition count 196
Iterating global reduction 11 with 2 rules applied. Total rules applied 652 place count 121 transition count 196
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 653 place count 120 transition count 194
Iterating global reduction 11 with 1 rules applied. Total rules applied 654 place count 120 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 659 place count 120 transition count 189
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 2 rules applied. Total rules applied 661 place count 120 transition count 187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 3 rules applied. Total rules applied 664 place count 118 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 665 place count 117 transition count 186
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 666 place count 116 transition count 184
Iterating global reduction 14 with 1 rules applied. Total rules applied 667 place count 116 transition count 184
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 668 place count 115 transition count 182
Iterating global reduction 14 with 1 rules applied. Total rules applied 669 place count 115 transition count 182
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 672 place count 112 transition count 179
Iterating global reduction 14 with 3 rules applied. Total rules applied 675 place count 112 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 677 place count 111 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 679 place count 111 transition count 176
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 683 place count 111 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 684 place count 110 transition count 175
Applied a total of 684 rules in 34 ms. Remains 110 /477 variables (removed 367) and now considering 175/647 (removed 472) transitions.
[2026-05-25 19:59:30] [INFO ] Flow matrix only has 166 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14448767071594229240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18010049642591591641.kers'
[2026-05-25 19:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14448767071594229240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18010049642591591641.kers]
Normalized transition count is 165 out of 166 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 110 cols 480 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-25 19:59:30] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18010049642591591641.kers
Total runtime 0 ms.
[2026-05-25 19:59:30] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 19:59:30] [INFO ] Flow matrix only has 166 transitions (discarded 9 similar events)
[2026-05-25 19:59:30] [INFO ] Invariant cache hit.
[2026-05-25 19:59:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 19:59:30] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2026-05-25 19:59:30] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2026-05-25 19:59:30] [INFO ] Flow matrix only has 166 transitions (discarded 9 similar events)
[2026-05-25 19:59:30] [INFO ] Invariant cache hit.
[2026-05-25 19:59:30] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 4/110 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 165/275 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 1/276 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/276 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 128 constraints, problems are : Problem set: 0 solved, 168 unsolved in 11214 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 165/275 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 168/298 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 1/276 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 14 (OVERLAPS) 0/276 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 299 constraints, problems are : Problem set: 0 solved, 168 unsolved in 17452 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28684ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 28685ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/477 places, 175/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28860 ms. Remains : 110/477 places, 175/647 transitions.
[2026-05-25 19:59:59] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:59:59] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:59:59] [INFO ] Input system was already deterministic with 175 transitions.
[2026-05-25 19:59:59] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:59:59] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:59:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4087338711125364995.gal : 1 ms
[2026-05-25 19:59:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3619677539793097709.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/CTLFireability4087338711125364995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3619677539793097709.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.94277e+09,0.921147,38512,2,3060,5,154629,6,0,604,160217,0


Converting to forward existential form...Done !
original formula: E(AG(((p152==1) * E(EG((p146==1)) U ((EF((p147==1)) * (p121==1)) * (p545==1))))) U !((AG((AG((p271==1)) + ((((p237==1)||(p248==1))&&(p296...192
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(E(TRUE U !(((p152==1) * E(EG((p146==1)) U ((E(TRUE U (p147==1)) * (p121==1)) * (p545==1))))))...281
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t15, t16, t17, t20, t22, t23, t24, t26, t61, t64, t66, t67,...353
Hit Full ! (commute/partial/dont) 160/0/15
(forward)formula 0,1,9.82301,297444,1,0,391,1.93891e+06,390,182,4327,1.26025e+06,513
FORMULA HealthRecord-PT-17-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 20:00:09] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:00:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:00:09] [INFO ] Applying decomposition
[2026-05-25 20:00:09] [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/graph15446030376172015516.txt' '-o' '/tmp/graph15446030376172015516.bin' '-w' '/tmp/graph15446030376172015516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15446030376172015516.bin' '-l' '-1' '-v' '-w' '/tmp/graph15446030376172015516.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:00:09] [INFO ] Decomposing Gal with order
[2026-05-25 20:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:00:09] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-25 20:00:09] [INFO ] Flatten gal took : 17 ms
[2026-05-25 20:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2026-05-25 20:00:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7725887186736989774.gal : 4 ms
[2026-05-25 20:00:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6443783170078653990.ctl : 2 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/CTLFireability7725887186736989774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6443783170078653990.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 8 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.28611e+15,777.517,8820752,24561,2980,8.20068e+06,309480,1222,2.70845e+07,288,2.99899e+06,0


Converting to forward existential form...Done !
original formula: (!(A((i5.i3.u62.p205!=1) U EG(!(EF((i25.u165.p558==1)))))) * ((AX(((EG(((i9.i2.u73.p281==1)&&(i25.u165.p617==1))) + !(E((i20.i0.u143.p485...531
=> equivalent forward existential formula: ([((Init * !(EG(!(EG(!(E(TRUE U (i25.u165.p558==1)))))))) * !(E(!(EG(!(E(TRUE U (i25.u165.p558==1))))) U (!((i5....1341
Reverse transition relation is NOT exact ! Due to transitions t12, t140, t476, t477, t574, t575, t576, t581, u86.t295, u100.t256, u111.t221, i0.i0.t556, i1...2844
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Detected timeout of ITS tools.
[2026-05-25 20:27:09] [INFO ] Applying decomposition
[2026-05-25 20:27:09] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:27:09] [INFO ] Decomposing Gal with order
[2026-05-25 20:27:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:27:09] [INFO ] Removed a total of 55 redundant transitions.
[2026-05-25 20:27:09] [INFO ] Flatten gal took : 12 ms
[2026-05-25 20:27:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 3 ms.
[2026-05-25 20:27:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4889034878631229316.gal : 3 ms
[2026-05-25 20:27:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13270787243384032362.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/CTLFireability4889034878631229316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13270787243384032362.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 8 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.28611e+15,22.5115,634808,2569,10013,809723,253661,618,3.6039e+06,825,2.34218e+06,0


Converting to forward existential form...Done !
original formula: (!(A((i0.i0.u6.p205!=1) U EG(!(EF((i1.u18.p558==1)))))) * ((AX(((EG(((i0.i1.i0.i0.i0.u11.p281==1)&&(i1.u18.p617==1))) + !(E((i1.u17.p485=...547
=> equivalent forward existential formula: ([((Init * !(EG(!(EG(!(E(TRUE U (i1.u18.p558==1)))))))) * !(E(!(EG(!(E(TRUE U (i1.u18.p558==1))))) U (!((i0.i0.u...1373
Reverse transition relation is NOT exact ! Due to transitions t572, t576, t581, i0.i0.u6.t344, i0.i0.u6.t346, i0.i0.u6.t347, i0.i0.u6.t348, i0.i0.u6.t350, ...3478
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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="HealthRecord-PT-17"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-17, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074300666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-17.tgz
mv HealthRecord-PT-17 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;