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.r034-tall-177946842100594.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 BusinessProcesses-PT-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 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 189K 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 BusinessProcesses-PT-19-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779628044687

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 13:07:25] [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-24 13:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:07:26] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 13:07:26] [INFO ] Transformed 772 places.
[2026-05-24 13:07:26] [INFO ] Transformed 685 transitions.
[2026-05-24 13:07:26] [INFO ] Found NUPN structural information;
[2026-05-24 13:07:26] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
Support contains 134 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 94 place count 663 transition count 584
Iterating global reduction 1 with 86 rules applied. Total rules applied 180 place count 663 transition count 584
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 220 place count 623 transition count 544
Iterating global reduction 1 with 40 rules applied. Total rules applied 260 place count 623 transition count 544
Applied a total of 260 rules in 161 ms. Remains 623 /757 variables (removed 134) and now considering 544/670 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4247572392830601751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2160917289497749370.kers'
[2026-05-24 13:07:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4247572392830601751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2160917289497749370.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 544 rows 623 cols 1691 entries
Finished phase 1 with 416 SingleSign rule and 90 generalized
[2026-05-24 13:07:26] [INFO ] Computed 117 invariants in 4 ms
Computed 117 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2160917289497749370.kers
Total runtime 5 ms.
[2026-05-24 13:07:27] [INFO ] Implicit Places using invariants in 610 ms returned []
[2026-05-24 13:07:27] [INFO ] Invariant cache hit.
[2026-05-24 13:07:28] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2026-05-24 13:07:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 1/623 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/623 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 543 unsolved
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Starting structural reductions in LTL mode, iteration 1 : 623/757 places, 544/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32534 ms. Remains : 623/757 places, 544/670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Applied a total of 0 rules in 9 ms. Remains 623 /623 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2026-05-24 13:07:58] [INFO ] Invariant cache hit.
[2026-05-24 13:07:59] [INFO ] Implicit Places using invariants in 318 ms returned []
[2026-05-24 13:07:59] [INFO ] Invariant cache hit.
[2026-05-24 13:08:00] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1701 ms. Remains : 623/623 places, 544/544 transitions.
Support contains 134 out of 623 places after structural reductions.
[2026-05-24 13:08:00] [INFO ] Flatten gal took : 67 ms
[2026-05-24 13:08:00] [INFO ] Flatten gal took : 38 ms
[2026-05-24 13:08:00] [INFO ] Input system was already deterministic with 544 transitions.
Support contains 128 out of 623 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (218 resets) in 1870 ms. (21 steps per ms) remains 45/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
[2026-05-24 13:08:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 463/547 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 3 (OVERLAPS) 61/608 variables, 18/117 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 20/137 constraints. Problems are: Problem set: 3 solved, 42 unsolved
SMT process timed out in 5066ms, After SMT, problems are : Problem set: 3 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 544/544 transitions.
Graph (complete) has 1355 edges and 623 vertex of which 622 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 622 transition count 486
Reduce places removed 57 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 63 rules applied. Total rules applied 121 place count 565 transition count 480
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 559 transition count 480
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 127 place count 559 transition count 372
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 358 place count 436 transition count 372
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 374 place count 420 transition count 356
Iterating global reduction 3 with 16 rules applied. Total rules applied 390 place count 420 transition count 356
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 647 place count 290 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 290 transition count 228
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 649 place count 289 transition count 227
Iterating global reduction 4 with 1 rules applied. Total rules applied 650 place count 289 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 652 place count 288 transition count 230
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 659 place count 288 transition count 230
Applied a total of 659 rules in 108 ms. Remains 288 /623 variables (removed 335) and now considering 230/544 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 288/623 places, 230/544 transitions.
RANDOM walk for 40000 steps (1767 resets) in 1362 ms. (29 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (36 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (37 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (37 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (26 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (41 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (41 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (38 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (41 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (36 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 78 ms. (50 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 82 ms. (48 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (39 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (47 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (40 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (25 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (38 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (40 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 482824 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :21 out of 41
Probabilistic random walk after 482824 steps, saw 77518 distinct states, run finished after 3007 ms. (steps per millisecond=160 ) properties seen :21
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15938489655066083361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15771826327991163389.kers'
[2026-05-24 13:08:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15938489655066083361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15771826327991163389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 288 cols 1056 entries
Finished phase 1 with 111 SingleSign rule and 78 generalized
[2026-05-24 13:08:10] [INFO ] Computed 99 invariants in 3 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15771826327991163389.kers
Total runtime 3 ms.
[2026-05-24 13:08:10] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 193/244 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 40/284 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 230/514 variables, 284/456 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 5/461 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/514 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 18 (OVERLAPS) 4/518 variables, 4/465 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/465 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 0/518 variables, 0/465 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 465 constraints, problems are : Problem set: 3 solved, 17 unsolved in 12027 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 288/288 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 17 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 197/242 variables, 83/83 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 9/92 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/92 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 39/281 variables, 14/106 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 53/159 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/159 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3/284 variables, 2/161 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 11/172 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 20/192 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 20/212 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 20/232 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 20/252 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 20/272 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 6/278 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 20/298 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 20/318 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 3/321 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/322 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/322 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 230/514 variables, 284/606 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/514 variables, 5/611 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/514 variables, 15/626 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/514 variables, 7/633 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/514 variables, 7/640 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/514 variables, 20/660 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/514 variables, 18/678 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/514 variables, 20/698 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/514 variables, 17/715 constraints. Problems are: Problem set: 5 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/514 variables, 5/720 constraints. Problems are: Problem set: 5 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/518 variables, and 720 constraints, problems are : Problem set: 5 solved, 15 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 284/288 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/20 constraints, Known Traps: 317/317 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57062ms problems are : Problem set: 5 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 288 transition count 225
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 283 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 283 transition count 214
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 37 place count 267 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 263 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 263 transition count 210
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 2 with 36 rules applied. Total rules applied 81 place count 245 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 243 transition count 191
Applied a total of 83 rules in 36 ms. Remains 243 /288 variables (removed 45) and now considering 191/230 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 243/288 places, 191/230 transitions.
RANDOM walk for 40000 steps (2572 resets) in 340 ms. (117 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40004 steps (605 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (615 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (631 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (630 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (614 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (618 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (601 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (602 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (605 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (613 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (424 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (630 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (596 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17136059456499546982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6619059080618466387.kers'
[2026-05-24 13:09:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17136059456499546982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6619059080618466387.kers]
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 0 ms.
// Phase 1: matrix 191 rows 210 cols 834 entries
Finished phase 1 with 105 SingleSign rule and 45 generalized
[2026-05-24 13:09:08] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6619059080618466387.kers
Total runtime 3 ms.
[2026-05-24 13:09:08] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 104/138 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 41/180 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 10/190 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 191/382 variables, 191/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 52/434 variables, 52/316 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 24/340 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 2/342 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 0/342 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/434 variables, 0/342 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 342 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 243/243 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 50/76 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 61/137 variables, 29/45 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 43/180 variables, 14/60 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 10/190 variables, 9/69 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/191 variables, 1/70 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 191/382 variables, 191/261 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 4/265 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 8/273 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 52/434 variables, 52/326 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 24/350 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/434 variables, 4/354 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 21 (INCLUDED_ONLY) 0/434 variables, 8/363 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/434 variables, 0/363 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/434 variables, 1/364 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/434 variables, 0/364 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/434 variables, 0/364 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 364 constraints, problems are : Problem set: 3 solved, 10 unsolved in 4483 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 243/243 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5653ms problems are : Problem set: 3 solved, 10 unsolved
Parikh walk visited 0 properties in 1373 ms.
Support contains 21 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 191/191 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 243 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 242 transition count 190
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 242 transition count 179
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 28 place count 227 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 225 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 225 transition count 177
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 42 place count 220 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 219 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 218 transition count 188
Applied a total of 45 rules in 28 ms. Remains 218 /243 variables (removed 25) and now considering 188/191 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 218/243 places, 188/191 transitions.
RANDOM walk for 40000 steps (3874 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (922 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (959 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (945 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (928 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (927 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (926 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (917 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (792 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (935 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (923 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 1065429 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :9 out of 10
Probabilistic random walk after 1065429 steps, saw 171190 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :9
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7388480602355538104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14308577232032069015.kers'
[2026-05-24 13:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7388480602355538104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14308577232032069015.kers]
Culling duplicate invariants (modulo rational): removing 41 columns.
Culled 41 columns in 0 ms.
// Phase 1: matrix 188 rows 177 cols 896 entries
Finished phase 1 with 93 SingleSign rule and 36 generalized
[2026-05-24 13:09:18] [INFO ] Computed 89 invariants in 1 ms
Computed 89 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14308577232032069015.kers
Total runtime 3 ms.
[2026-05-24 13:09:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/124 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/143 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/152 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 184/336 variables, 152/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 70/406 variables, 66/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 29/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 218/218 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/124 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/143 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/152 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 184/336 variables, 152/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 70/406 variables, 66/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 29/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 218/218 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 188/188 transitions.
Graph (trivial) has 22 edges and 218 vertex of which 2 / 218 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 4 rules applied. Total rules applied 5 place count 217 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 213 transition count 182
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 213 transition count 177
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 20 place count 207 transition count 177
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 44 place count 194 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 194 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 192 transition count 164
Applied a total of 48 rules in 26 ms. Remains 192 /218 variables (removed 26) and now considering 164/188 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 192/218 places, 164/188 transitions.
RANDOM walk for 40000 steps (1972 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (983 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 145800 steps, run visited all 1 properties in 481 ms. (steps per millisecond=303 )
Probabilistic random walk after 145800 steps, saw 53940 distinct states, run finished after 484 ms. (steps per millisecond=301 ) properties seen :1
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 13:09:19] [INFO ] Flatten gal took : 26 ms
[2026-05-24 13:09:19] [INFO ] Flatten gal took : 24 ms
[2026-05-24 13:09:19] [INFO ] Input system was already deterministic with 544 transitions.
Computed a total of 565 stabilizing places and 496 stable transitions
Graph (complete) has 1355 edges and 623 vertex of which 622 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 7 / 623 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1348 edges and 617 vertex of which 616 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 615 transition count 453
Reduce places removed 82 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 533 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 532 transition count 452
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 168 place count 532 transition count 330
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 436 place count 386 transition count 330
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 464 place count 358 transition count 302
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 493 place count 357 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 493 place count 357 transition count 301
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 495 place count 356 transition count 301
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 496 place count 355 transition count 300
Iterating global reduction 3 with 1 rules applied. Total rules applied 497 place count 355 transition count 300
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 791 place count 206 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 792 place count 205 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 793 place count 204 transition count 154
Applied a total of 793 rules in 65 ms. Remains 204 /623 variables (removed 419) and now considering 154/544 (removed 390) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12145369172929774809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9913022506509190691.kers'
[2026-05-24 13:09:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12145369172929774809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9913022506509190691.kers]
Normalized transition count is 153 out of 154 initially.
Culling duplicate invariants (modulo rational): removing 49 columns.
Culled 49 columns in 0 ms.
// Phase 1: matrix 153 rows 155 cols 626 entries
Finished phase 1 with 102 SingleSign rule and 15 generalized
[2026-05-24 13:09:19] [INFO ] Computed 87 invariants in 1 ms
Computed 87 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9913022506509190691.kers
Total runtime 5 ms.
[2026-05-24 13:09:19] [INFO ] Implicit Places using invariants in 158 ms returned [0, 1, 4, 5, 6, 14, 15, 16, 17, 21, 25, 26, 27, 28, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 160 ms to find 26 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 178/623 places, 154/544 transitions.
Applied a total of 0 rules in 15 ms. Remains 178 /178 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 240 ms. Remains : 178/623 places, 154/544 transitions.
[2026-05-24 13:09:19] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:09:19] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:09:19] [INFO ] Input system was already deterministic with 154 transitions.
[2026-05-24 13:09:19] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:09:19] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:09:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16070425358024451895.gal : 4 ms
[2026-05-24 13:09:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17200835560477406707.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/CTLFireability16070425358024451895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17200835560477406707.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6308e+07,1.26581,47748,2,10929,5,192324,6,0,865,107807,0


Converting to forward existential form...Done !
original formula: EF((E((p484==1) U (((p47==1)&&(p378==1))&&(p584==1))) + ((p440==1)&&(p119==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),(p484==1)) * (((p47==1)&&(p378==1))&&(p584==1)))] != FALSE + [(FwdU(Init,TRUE) * ((p440=...182
Hit Full ! (commute/partial/dont) 152/0/2
(forward)formula 0,1,1.326,47780,1,0,8,192324,15,1,1696,107807,4
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 591 transition count 512
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 591 transition count 512
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 582 transition count 503
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 582 transition count 503
Applied a total of 82 rules in 38 ms. Remains 582 /623 variables (removed 41) and now considering 503/544 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9942372219957652794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17248563920166269002.kers'
[2026-05-24 13:09:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9942372219957652794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17248563920166269002.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 503 rows 582 cols 1609 entries
Finished phase 1 with 376 SingleSign rule and 89 generalized
[2026-05-24 13:09:21] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17248563920166269002.kers
Total runtime 5 ms.
[2026-05-24 13:09:21] [INFO ] Implicit Places using invariants in 381 ms returned []
[2026-05-24 13:09:21] [INFO ] Invariant cache hit.
[2026-05-24 13:09:23] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2450 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2026-05-24 13:09:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/177 constraints. Problems are: Problem set: 7 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/1085 variables, and 177 constraints, problems are : Problem set: 7 solved, 495 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 14/14 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 99/113 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 4/117 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 60/177 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/197 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/217 constraints. Problems are: Problem set: 7 solved, 495 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/237 constraints. Problems are: Problem set: 7 solved, 495 unsolved
Problem TDEAD446 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 20/257 constraints. Problems are: Problem set: 10 solved, 492 unsolved
Problem TDEAD427 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 20/277 constraints. Problems are: Problem set: 11 solved, 491 unsolved
SMT process timed out in 60132ms, After SMT, problems are : Problem set: 11 solved, 491 unsolved
Search for dead transitions found 11 dead transitions in 60134ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 582/623 places, 492/544 transitions.
Applied a total of 0 rules in 12 ms. Remains 582 /582 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62641 ms. Remains : 582/623 places, 492/544 transitions.
[2026-05-24 13:10:23] [INFO ] Flatten gal took : 17 ms
[2026-05-24 13:10:23] [INFO ] Flatten gal took : 17 ms
[2026-05-24 13:10:23] [INFO ] Input system was already deterministic with 492 transitions.
[2026-05-24 13:10:23] [INFO ] Flatten gal took : 15 ms
[2026-05-24 13:10:23] [INFO ] Flatten gal took : 15 ms
[2026-05-24 13:10:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9386391275701002293.gal : 5 ms
[2026-05-24 13:10:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14094207005747211176.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/CTLFireability9386391275701002293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14094207005747211176.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:10:54] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:10:54] [INFO ] Applying decomposition
[2026-05-24 13:10:54] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6919309247609384495.txt' '-o' '/tmp/graph6919309247609384495.bin' '-w' '/tmp/graph6919309247609384495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6919309247609384495.bin' '-l' '-1' '-v' '-w' '/tmp/graph6919309247609384495.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:10:54] [INFO ] Decomposing Gal with order
[2026-05-24 13:10:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:10:54] [INFO ] Removed a total of 239 redundant transitions.
[2026-05-24 13:10:54] [INFO ] Flatten gal took : 79 ms
[2026-05-24 13:10:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 17 ms.
[2026-05-24 13:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3391522262991428248.gal : 9 ms
[2026-05-24 13:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13686667800650015551.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/CTLFireability3391522262991428248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13686667800650015551.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.16307e+33,5.55669,178364,6447,66,378226,682,1247,537721,73,1594,0


Converting to forward existential form...Done !
original formula: E(EF((((AX((((i19.i0.u146.p187==1)&&(i19.i0.u146.p498==1))&&(i19.i2.u182.p674==1))) + A((i7.i1.u29.p79==1) U (((i7.i0.u35.p95==1)&&(i15.u...450
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((!(EX(!((((i19.i0.u146.p187==1)&&(i19.i0.u146.p498==1))&&(i19.i2.u182.p674==1))))) + !((E...665
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t203, t307, t344, t389, t392, t454, t459, t461, t463, t466, t469, t478, t486...1595
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 592 transition count 513
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 592 transition count 513
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 583 transition count 504
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 580 transition count 501
Applied a total of 86 rules in 79 ms. Remains 580 /623 variables (removed 43) and now considering 501/544 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3598553909023589181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17479253663534483269.kers'
[2026-05-24 13:11:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3598553909023589181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17479253663534483269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 501 rows 580 cols 1602 entries
Finished phase 1 with 375 SingleSign rule and 88 generalized
[2026-05-24 13:11:24] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17479253663534483269.kers
Total runtime 7 ms.
[2026-05-24 13:11:24] [INFO ] Implicit Places using invariants in 408 ms returned []
[2026-05-24 13:11:24] [INFO ] Invariant cache hit.
[2026-05-24 13:11:26] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2026-05-24 13:11:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Problem TDEAD408 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD453 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 7 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 177 constraints, problems are : Problem set: 7 solved, 493 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 14/14 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 99/113 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/117 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 60/177 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/237 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/257 constraints. Problems are: Problem set: 7 solved, 493 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 20/277 constraints. Problems are: Problem set: 7 solved, 493 unsolved
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 7 solved, 493 unsolved
Search for dead transitions found 7 dead transitions in 60208ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/623 places, 494/544 transitions.
Applied a total of 0 rules in 13 ms. Remains 580 /580 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62733 ms. Remains : 580/623 places, 494/544 transitions.
[2026-05-24 13:12:27] [INFO ] Flatten gal took : 20 ms
[2026-05-24 13:12:27] [INFO ] Flatten gal took : 11 ms
[2026-05-24 13:12:27] [INFO ] Input system was already deterministic with 494 transitions.
[2026-05-24 13:12:27] [INFO ] Flatten gal took : 11 ms
[2026-05-24 13:12:27] [INFO ] Flatten gal took : 11 ms
[2026-05-24 13:12:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5748935529871314527.gal : 3 ms
[2026-05-24 13:12:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5749554647512719209.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/CTLFireability5748935529871314527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5749554647512719209.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:12:57] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:12:57] [INFO ] Applying decomposition
[2026-05-24 13:12:57] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3192146100492373323.txt' '-o' '/tmp/graph3192146100492373323.bin' '-w' '/tmp/graph3192146100492373323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3192146100492373323.bin' '-l' '-1' '-v' '-w' '/tmp/graph3192146100492373323.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:12:57] [INFO ] Decomposing Gal with order
[2026-05-24 13:12:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:12:57] [INFO ] Removed a total of 256 redundant transitions.
[2026-05-24 13:12:57] [INFO ] Flatten gal took : 24 ms
[2026-05-24 13:12:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2026-05-24 13:12:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10968782903312151356.gal : 6 ms
[2026-05-24 13:12:57] [INFO ] Time to serialize properties into /tmp/CTLFireability8097862879622712291.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/CTLFireability10968782903312151356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8097862879622712291.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.24521e+33,0.649505,31268,3853,64,56596,821,1266,100674,76,2030,0


Converting to forward existential form...Done !
original formula: EX(!(E(!(A(EF((i7.i0.u28.p71==1)) U (i0.i2.u160.p556==1))) U ((i20.i1.u63.p190==1) * EX((i19.i1.u148.p504==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(!((E(!((i0.i2.u160.p556==1)) U (!(E(TRUE U (i7.i0.u28.p71==1))) * !((i0.i2.u160.p556==1)))) +...252
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t202, t286, t298, t306, t314, t343, t388, t391, t457, t458, t462, t464, t466...1577
Using 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 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 590 transition count 511
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 578 transition count 499
Applied a total of 90 rules in 112 ms. Remains 578 /623 variables (removed 45) and now considering 499/544 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8555642517807580572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11044596401416007704.kers'
[2026-05-24 13:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8555642517807580572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11044596401416007704.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 499 rows 578 cols 1598 entries
Finished phase 1 with 373 SingleSign rule and 88 generalized
[2026-05-24 13:13:27] [INFO ] Computed 117 invariants in 7 ms
Computed 117 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11044596401416007704.kers
Total runtime 9 ms.
[2026-05-24 13:13:28] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-05-24 13:13:28] [INFO ] Invariant cache hit.
[2026-05-24 13:13:30] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2026-05-24 13:13:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 10 solved, 488 unsolved
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 19 solved, 479 unsolved
Problem TDEAD429 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 177 constraints, problems are : Problem set: 20 solved, 478 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 99/113 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 4/117 constraints. Problems are: Problem set: 20 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 60/177 constraints. Problems are: Problem set: 20 solved, 478 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 473 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 28 solved, 470 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 28 solved, 470 unsolved
SMT process timed out in 60198ms, After SMT, problems are : Problem set: 28 solved, 470 unsolved
Search for dead transitions found 28 dead transitions in 60200ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/623 places, 471/544 transitions.
Applied a total of 0 rules in 18 ms. Remains 578 /578 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62747 ms. Remains : 578/623 places, 471/544 transitions.
[2026-05-24 13:14:30] [INFO ] Flatten gal took : 12 ms
[2026-05-24 13:14:30] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:14:30] [INFO ] Input system was already deterministic with 471 transitions.
[2026-05-24 13:14:30] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:14:30] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:14:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8596848102194685084.gal : 2 ms
[2026-05-24 13:14:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6123439984260921491.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/CTLFireability8596848102194685084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6123439984260921491.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:15:00] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:15:00] [INFO ] Applying decomposition
[2026-05-24 13:15:00] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8106079758274565478.txt' '-o' '/tmp/graph8106079758274565478.bin' '-w' '/tmp/graph8106079758274565478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8106079758274565478.bin' '-l' '-1' '-v' '-w' '/tmp/graph8106079758274565478.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:15:00] [INFO ] Decomposing Gal with order
[2026-05-24 13:15:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:15:00] [INFO ] Removed a total of 157 redundant transitions.
[2026-05-24 13:15:00] [INFO ] Flatten gal took : 20 ms
[2026-05-24 13:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2026-05-24 13:15:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8574533781071331789.gal : 6 ms
[2026-05-24 13:15:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10897874029059915937.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/CTLFireability8574533781071331789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10897874029059915937.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.24521e+33,5.16972,144032,6707,61,245172,890,1221,653641,67,2055,0


Converting to forward existential form...Done !
original formula: EX(EG(EX(AG((((i8.i0.u68.p209==0)||(i8.i2.u144.p498==0))||(i8.i3.u176.p763==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),EX(!(E(TRUE U !((((i8.i0.u68.p209==0)||(i8.i2.u144.p498==0))||(i8.i3.u176.p763==0)))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t10, t284, t300, t304, t312, t341, t386, t389, t435, t439, t441, t443, t446, t448, t457, t466...1581
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local 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
(forward)formula 0,0,22.4887,567312,1,0,1.2242e+06,983,8427,1.81741e+06,362,2380,2635170
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 591 transition count 512
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 591 transition count 512
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 582 transition count 503
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 579 transition count 500
Applied a total of 88 rules in 79 ms. Remains 579 /623 variables (removed 44) and now considering 500/544 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12111929639524180689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10573839210142208242.kers'
[2026-05-24 13:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12111929639524180689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10573839210142208242.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 500 rows 579 cols 1600 entries
Finished phase 1 with 374 SingleSign rule and 88 generalized
[2026-05-24 13:15:23] [INFO ] Computed 117 invariants in 8 ms
Computed 117 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10573839210142208242.kers
Total runtime 9 ms.
[2026-05-24 13:15:23] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-24 13:15:23] [INFO ] Invariant cache hit.
[2026-05-24 13:15:25] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2026-05-24 13:15:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 11 solved, 488 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 11 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 177 constraints, problems are : Problem set: 11 solved, 488 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 99/113 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/177 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/217 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/237 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/257 constraints. Problems are: Problem set: 11 solved, 488 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 20/277 constraints. Problems are: Problem set: 11 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/1079 variables, and 282 constraints, problems are : Problem set: 11 solved, 488 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 0/499 constraints, Known Traps: 165/165 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 11 solved, 488 unsolved
Search for dead transitions found 11 dead transitions in 60090ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/623 places, 489/544 transitions.
Applied a total of 0 rules in 12 ms. Remains 579 /579 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62611 ms. Remains : 579/623 places, 489/544 transitions.
[2026-05-24 13:16:25] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:16:25] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:16:25] [INFO ] Input system was already deterministic with 489 transitions.
[2026-05-24 13:16:25] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:16:25] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:16:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16513258650839494248.gal : 3 ms
[2026-05-24 13:16:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2609765115666930133.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/CTLFireability16513258650839494248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2609765115666930133.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,3.19983,95752,5291,63,109048,710,1238,706857,63,1747,0


Converting to forward existential form...Done !
original formula: (EX(AF(AX(((i18.i2.u121.p366==0)&&(i13.u151.p520==0))))) * EX(AG((((i12.i0.u100.p314==0)||(i17.i0.u131.p418==0))||(i0.u159.p737==0)))))
=> equivalent forward existential formula: [(EY((Init * EX(!(EG(!(!(EX(!(((i18.i2.u121.p366==0)&&(i13.u151.p520==0))))))))))) * !(E(TRUE U !((((i12.i0.u100...222
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t201, t285, t301, t309, t342, t387, t390, t452, t457, t459, t461, t462, t464, t4...1585
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 a local 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
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 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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Graph (trivial) has 310 edges and 623 vertex of which 7 / 623 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1348 edges and 617 vertex of which 616 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 615 transition count 451
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 170 place count 531 transition count 451
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 170 place count 531 transition count 327
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 442 place count 383 transition count 327
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 472 place count 353 transition count 297
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 503 place count 352 transition count 297
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 503 place count 352 transition count 295
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 507 place count 350 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 508 place count 349 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 349 transition count 294
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 803 place count 200 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 804 place count 199 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 805 place count 198 transition count 148
Applied a total of 805 rules in 64 ms. Remains 198 /623 variables (removed 425) and now considering 148/544 (removed 396) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6074125222422609340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17975767755265486433.kers'
[2026-05-24 13:17:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6074125222422609340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17975767755265486433.kers]
Normalized transition count is 147 out of 148 initially.
Culling duplicate invariants (modulo rational): removing 64 columns.
Culled 64 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 553 entries
Finished phase 1 with 96 SingleSign rule and 15 generalized
[2026-05-24 13:17:26] [INFO ] Computed 87 invariants in 1 ms
Computed 87 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17975767755265486433.kers
Total runtime 1 ms.
[2026-05-24 13:17:26] [INFO ] Implicit Places using invariants in 162 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 60]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 165 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 171/623 places, 148/544 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 236 ms. Remains : 171/623 places, 148/544 transitions.
[2026-05-24 13:17:26] [INFO ] Flatten gal took : 5 ms
[2026-05-24 13:17:26] [INFO ] Flatten gal took : 5 ms
[2026-05-24 13:17:26] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-24 13:17:26] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:17:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:17:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5515461301014456522.gal : 1 ms
[2026-05-24 13:17:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12712624254354164770.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/CTLFireability5515461301014456522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12712624254354164770.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.78554e+06,0.359294,20460,2,6171,5,46992,6,0,830,32910,0


Converting to forward existential form...Done !
original formula: EF(AG((((p280==1)&&(p558==1))&&(p725==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p280==1)&&(p558==1))&&(p725==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t37, t38, t39, t40, t57, t58, t59, t60, t61, t91, t92, t113, t114, t115, t116, t117, t11...276
(forward)formula 0,0,2.59041,86972,1,0,194,342085,281,102,5941,173405,269
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Graph (trivial) has 307 edges and 623 vertex of which 7 / 623 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1348 edges and 617 vertex of which 616 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 615 transition count 450
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 530 transition count 450
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 172 place count 530 transition count 327
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 443 place count 382 transition count 327
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 468 place count 357 transition count 302
Ensure Unique test removed 1 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 494 place count 356 transition count 302
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 494 place count 356 transition count 300
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 498 place count 354 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 499 place count 353 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 500 place count 353 transition count 299
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 794 place count 204 transition count 154
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 800 place count 204 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 801 place count 203 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 802 place count 202 transition count 153
Applied a total of 802 rules in 49 ms. Remains 202 /623 variables (removed 421) and now considering 153/544 (removed 391) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14956646445096258038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2005924989655573023.kers'
[2026-05-24 13:17:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14956646445096258038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2005924989655573023.kers]
Normalized transition count is 152 out of 153 initially.
Culling duplicate invariants (modulo rational): removing 64 columns.
Culled 64 columns in 0 ms.
// Phase 1: matrix 152 rows 138 cols 575 entries
Finished phase 1 with 101 SingleSign rule and 15 generalized
[2026-05-24 13:17:29] [INFO ] Computed 86 invariants in 1 ms
Computed 86 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2005924989655573023.kers
Total runtime 2 ms.
[2026-05-24 13:17:29] [INFO ] Implicit Places using invariants in 163 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 60, 61]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 173 ms to find 26 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 176/623 places, 153/544 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 226 ms. Remains : 176/623 places, 153/544 transitions.
[2026-05-24 13:17:29] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:17:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:17:29] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-24 13:17:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:17:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:17:29] [INFO ] Time to serialize gal into /tmp/CTLFireability747888636002279835.gal : 1 ms
[2026-05-24 13:17:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13370042938936267274.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/CTLFireability747888636002279835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13370042938936267274.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,9.73037e+06,0.617992,29600,2,8765,5,75019,6,0,855,74944,0


Converting to forward existential form...Done !
original formula: AF(((EF((p132==1)) + AG((p641==1))) + ((p663==1) * (!(E((p521==1) U (p655==1))) + AG(((p667==1)&&(p278==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (p132==1)) + !(E(TRUE U !((p641==1))))) + ((p663==1) * (!(E((p521==1) U (p655==1))) + !(...205
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t7, t9, t41, t44, t45, t46, t47, t59, t60, t61, t62, t63, t86, t99, t100, t120, t...296
(forward)formula 0,1,8.15369,236800,1,0,317,1.26756e+06,306,169,6271,761926,404
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-07 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 : 623/623 places, 544/544 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 592 transition count 513
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 592 transition count 513
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 583 transition count 504
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 583 transition count 504
Applied a total of 80 rules in 49 ms. Remains 583 /623 variables (removed 40) and now considering 504/544 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2148469566629414619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-479713996522609492.kers'
[2026-05-24 13:17:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2148469566629414619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-479713996522609492.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 504 rows 583 cols 1611 entries
Finished phase 1 with 377 SingleSign rule and 89 generalized
[2026-05-24 13:17:37] [INFO ] Computed 117 invariants in 12 ms
Computed 117 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-479713996522609492.kers
Total runtime 14 ms.
[2026-05-24 13:17:37] [INFO ] Implicit Places using invariants in 408 ms returned []
[2026-05-24 13:17:37] [INFO ] Invariant cache hit.
[2026-05-24 13:17:40] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2026-05-24 13:17:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1087 variables, and 177 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 60/177 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Problem TDEAD415 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/257 constraints. Problems are: Problem set: 7 solved, 496 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/277 constraints. Problems are: Problem set: 7 solved, 496 unsolved
SMT process timed out in 60084ms, After SMT, problems are : Problem set: 7 solved, 496 unsolved
Search for dead transitions found 7 dead transitions in 60087ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 583/623 places, 497/544 transitions.
Applied a total of 0 rules in 14 ms. Remains 583 /583 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62743 ms. Remains : 583/623 places, 497/544 transitions.
[2026-05-24 13:18:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:18:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:18:40] [INFO ] Input system was already deterministic with 497 transitions.
[2026-05-24 13:18:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:18:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:18:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3066744462608420818.gal : 3 ms
[2026-05-24 13:18:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14495475446776749887.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/CTLFireability3066744462608420818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14495475446776749887.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 592 transition count 513
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 592 transition count 513
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 581 transition count 502
Applied a total of 84 rules in 84 ms. Remains 581 /623 variables (removed 42) and now considering 502/544 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11170856879309501031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1089295360689053403.kers'
[2026-05-24 13:19:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11170856879309501031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1089295360689053403.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 502 rows 581 cols 1604 entries
Finished phase 1 with 376 SingleSign rule and 88 generalized
[2026-05-24 13:19:40] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1089295360689053403.kers
Total runtime 6 ms.
[2026-05-24 13:19:41] [INFO ] Implicit Places using invariants in 446 ms returned []
[2026-05-24 13:19:41] [INFO ] Invariant cache hit.
[2026-05-24 13:19:43] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2026-05-24 13:19:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
SMT process timed out in 30300ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Starting structural reductions in LTL mode, iteration 1 : 581/623 places, 502/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33101 ms. Remains : 581/623 places, 502/544 transitions.
[2026-05-24 13:20:13] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:20:13] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:20:13] [INFO ] Input system was already deterministic with 502 transitions.
[2026-05-24 13:20:13] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:20:13] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:20:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8608088748693725415.gal : 2 ms
[2026-05-24 13:20:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17728516837293353475.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/CTLFireability8608088748693725415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17728516837293353475.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24695e+33,1.8,59204,6134,51,104664,682,1296,203787,58,1720,0


Converting to forward existential form...Done !
original formula: AG((A((i6.i2.u101.p316==1) U (i18.i1.u61.p185==1)) + ((i11.i0.u49.p142==0) * EX((i10.u159.p664==0)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(((i11.i0.u49.p142==0) * EX((i10.u159.p664==0))))),!((i18.i1.u61.p185==1))) * (!((i6...324
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t201, t287, t303, t311, t344, t389, t392, t465, t470, t472, t474, t475, t477, t47...1608
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
(forward)formula 0,0,15.6409,475064,1,0,965877,746,8929,1.83764e+06,295,2525,2198023
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 591 transition count 512
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 591 transition count 512
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 582 transition count 503
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 579 transition count 500
Applied a total of 88 rules in 90 ms. Remains 579 /623 variables (removed 44) and now considering 500/544 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7060467902500516381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15597230643566110667.kers'
[2026-05-24 13:20:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7060467902500516381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15597230643566110667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 500 rows 579 cols 1600 entries
Finished phase 1 with 374 SingleSign rule and 88 generalized
[2026-05-24 13:20:59] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15597230643566110667.kers
Total runtime 4 ms.
[2026-05-24 13:21:00] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-24 13:21:00] [INFO ] Invariant cache hit.
[2026-05-24 13:21:02] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2026-05-24 13:21:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 177 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 60/177 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 499 unsolved
SMT process timed out in 60068ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 579/623 places, 500/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62444 ms. Remains : 579/623 places, 500/544 transitions.
[2026-05-24 13:22:02] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:22:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:22:02] [INFO ] Input system was already deterministic with 500 transitions.
[2026-05-24 13:22:02] [INFO ] Flatten gal took : 11 ms
[2026-05-24 13:22:02] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:22:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8157338791561427949.gal : 2 ms
[2026-05-24 13:22:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13942399984585400381.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/CTLFireability8157338791561427949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13942399984585400381.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:22:32] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:22:32] [INFO ] Applying decomposition
[2026-05-24 13:22:32] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15876219721167831125.txt' '-o' '/tmp/graph15876219721167831125.bin' '-w' '/tmp/graph15876219721167831125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15876219721167831125.bin' '-l' '-1' '-v' '-w' '/tmp/graph15876219721167831125.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:22:32] [INFO ] Decomposing Gal with order
[2026-05-24 13:22:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:22:32] [INFO ] Removed a total of 287 redundant transitions.
[2026-05-24 13:22:32] [INFO ] Flatten gal took : 42 ms
[2026-05-24 13:22:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-05-24 13:22:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7825974130723415972.gal : 5 ms
[2026-05-24 13:22:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10539813881863044355.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/CTLFireability7825974130723415972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10539813881863044355.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.24521e+33,1.86274,63696,4502,67,115762,847,1312,239223,67,2039,0


Converting to forward existential form...Done !
original formula: AG(((i4.i0.u26.p70!=1) + EX((i0.i1.u81.p244==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i4.i0.u26.p70!=1))) * !(EX((i0.i1.u81.p244==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t200, t285, t297, t305, t390, t463, t464, t468, t470, t472, t473, t475, t477...1613
(forward)formula 0,0,5.56749,184064,1,0,377422,847,7640,615542,313,2039,1073795
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Graph (trivial) has 308 edges and 623 vertex of which 7 / 623 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1348 edges and 617 vertex of which 616 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 615 transition count 452
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 532 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 531 transition count 451
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 170 place count 531 transition count 327
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 271 rules applied. Total rules applied 441 place count 384 transition count 327
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 470 place count 355 transition count 298
Ensure Unique test removed 1 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 500 place count 354 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 500 place count 354 transition count 297
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 502 place count 353 transition count 297
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 503 place count 352 transition count 296
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 352 transition count 296
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 796 place count 204 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 802 place count 204 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 803 place count 203 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 804 place count 202 transition count 151
Applied a total of 804 rules in 100 ms. Remains 202 /623 variables (removed 421) and now considering 151/544 (removed 393) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3819118619229368793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4060287259487601637.kers'
[2026-05-24 13:22:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3819118619229368793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4060287259487601637.kers]
Normalized transition count is 150 out of 151 initially.
Culling duplicate invariants (modulo rational): removing 64 columns.
Culled 64 columns in 0 ms.
// Phase 1: matrix 150 rows 138 cols 589 entries
Finished phase 1 with 98 SingleSign rule and 16 generalized
[2026-05-24 13:22:38] [INFO ] Computed 88 invariants in 1 ms
Computed 88 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4060287259487601637.kers
Total runtime 1 ms.
[2026-05-24 13:22:38] [INFO ] Implicit Places using invariants in 432 ms returned [0, 1, 2, 3, 4, 12, 13, 17, 18, 19, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 179]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 433 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 174/623 places, 151/544 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 539 ms. Remains : 174/623 places, 151/544 transitions.
[2026-05-24 13:22:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:22:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:22:38] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-24 13:22:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:22:38] [INFO ] Flatten gal took : 2 ms
[2026-05-24 13:22:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17466484426931114527.gal : 1 ms
[2026-05-24 13:22:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14008565067439258795.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/CTLFireability17466484426931114527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14008565067439258795.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((E((p294==1) U (p104==1)) * ((p680==1)||(((p181==1)&&(p483==1))&&(p760==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * ((p680==1)||(((p181==1)&&(p483==1))&&(p760==1)))),(p294==1)) * (p104==1))] != FALSE
Hit Full ! (commute/partial/dont) 149/0/2
(forward)formula 0,1,1.2019,46604,1,0,10,153180,16,2,871,114381,5
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Graph (trivial) has 311 edges and 623 vertex of which 7 / 623 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1348 edges and 617 vertex of which 616 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 615 transition count 450
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 530 transition count 450
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 172 place count 530 transition count 326
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 445 place count 381 transition count 326
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 474 place count 352 transition count 297
Ensure Unique test removed 1 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 504 place count 351 transition count 297
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 504 place count 351 transition count 295
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 508 place count 349 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 509 place count 348 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 510 place count 348 transition count 294
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 804 place count 199 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 805 place count 198 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 806 place count 197 transition count 148
Applied a total of 806 rules in 74 ms. Remains 197 /623 variables (removed 426) and now considering 148/544 (removed 396) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16661131454824086976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7851802353873762029.kers'
[2026-05-24 13:22:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16661131454824086976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7851802353873762029.kers]
Normalized transition count is 147 out of 148 initially.
Culling duplicate invariants (modulo rational): removing 64 columns.
Culled 64 columns in 0 ms.
// Phase 1: matrix 147 rows 133 cols 551 entries
Finished phase 1 with 96 SingleSign rule and 15 generalized
[2026-05-24 13:22:39] [INFO ] Computed 86 invariants in 0 ms
Computed 86 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7851802353873762029.kers
Total runtime 1 ms.
[2026-05-24 13:22:40] [INFO ] Implicit Places using invariants in 335 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 21, 22, 23, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 343 ms to find 26 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 171/623 places, 148/544 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 421 ms. Remains : 171/623 places, 148/544 transitions.
[2026-05-24 13:22:40] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:22:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 13:22:40] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-24 13:22:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:22:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:22:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10880436714190454303.gal : 1 ms
[2026-05-24 13:22:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10129407032701800586.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10880436714190454303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10129407032701800586.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10129407032701800586.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 45
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :45 after 87
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :87 after 426
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :426 after 1146
RANDOM walk for 40000 steps (8278 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2377 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1146 after 2307
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2307 after 218016
Finished probabilistic random walk after 2370 steps, run visited all 1 properties in 62 ms. (steps per millisecond=38 )
Probabilistic random walk after 2370 steps, saw 827 distinct states, run finished after 62 ms. (steps per millisecond=38 ) properties seen :1
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 593 transition count 514
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 593 transition count 514
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 586 transition count 507
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 585 transition count 506
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 584 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 583 transition count 504
Applied a total of 80 rules in 138 ms. Remains 583 /623 variables (removed 40) and now considering 504/544 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17605236267406869033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14009480838398307649.kers'
[2026-05-24 13:22:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17605236267406869033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14009480838398307649.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 504 rows 583 cols 1608 entries
Finished phase 1 with 378 SingleSign rule and 88 generalized
[2026-05-24 13:22:40] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14009480838398307649.kers
Total runtime 4 ms.
[2026-05-24 13:22:41] [INFO ] Implicit Places using invariants in 434 ms returned []
[2026-05-24 13:22:41] [INFO ] Invariant cache hit.
[2026-05-24 13:22:43] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2026-05-24 13:22:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Problem TDEAD431 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 20/137 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/157 constraints. Problems are: Problem set: 8 solved, 495 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/177 constraints. Problems are: Problem set: 8 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1087 variables, and 177 constraints, problems are : Problem set: 8 solved, 495 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 14/14 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 99/113 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 4/117 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 60/177 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/197 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/217 constraints. Problems are: Problem set: 8 solved, 495 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/237 constraints. Problems are: Problem set: 8 solved, 495 unsolved
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/257 constraints. Problems are: Problem set: 17 solved, 486 unsolved
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/277 constraints. Problems are: Problem set: 25 solved, 478 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/297 constraints. Problems are: Problem set: 25 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1087 variables, and 297 constraints, problems are : Problem set: 25 solved, 478 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 0/503 constraints, Known Traps: 180/180 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 25 solved, 478 unsolved
Search for dead transitions found 25 dead transitions in 60083ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 583/623 places, 479/544 transitions.
Applied a total of 0 rules in 12 ms. Remains 583 /583 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62821 ms. Remains : 583/623 places, 479/544 transitions.
[2026-05-24 13:23:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:23:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:23:43] [INFO ] Input system was already deterministic with 479 transitions.
[2026-05-24 13:23:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:23:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:23:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11798037416379002686.gal : 2 ms
[2026-05-24 13:23:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17702530235647443068.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/CTLFireability11798037416379002686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17702530235647443068.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-24 13:24:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:24:13] [INFO ] Applying decomposition
[2026-05-24 13:24:13] [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/graph4300068379946133962.txt' '-o' '/tmp/graph4300068379946133962.bin' '-w' '/tmp/graph4300068379946133962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4300068379946133962.bin' '-l' '-1' '-v' '-w' '/tmp/graph4300068379946133962.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:24:13] [INFO ] Decomposing Gal with order
[2026-05-24 13:24:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:24:13] [INFO ] Removed a total of 176 redundant transitions.
[2026-05-24 13:24:13] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:24:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-24 13:24:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8803679017524305743.gal : 15 ms
[2026-05-24 13:24:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2752229875384365182.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/CTLFireability8803679017524305743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2752229875384365182.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26871e+33,1.49532,57640,5517,51,89378,561,1187,284221,55,1514,0


Converting to forward existential form...Done !
original formula: (AG((((((i9.i1.u42.p118==1)&&(i15.i2.u139.p467==1))&&(i22.u158.p737==1)) + AG((AX((i5.u17.p40==1)) * (i22.u173.p642==1)))) + (i10.i1.u205...347
=> equivalent forward existential formula: (([(EY(FwdU(((FwdU(Init,TRUE) * !((i10.i1.u205.p665!=1))) * !((((i9.i1.u42.p118==1)&&(i15.i2.u139.p467==1))&&(i2...589
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t203, t287, t299, t311, t344, t391, t394, t443, t447, t449, t451, t452, t454, t4...1562
Using saturation style SCC detection
Using 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 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 a local 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
(forward)formula 0,0,14.9094,418628,1,0,845562,645,9514,1.62176e+06,320,2195,1965731
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 592 transition count 513
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 592 transition count 513
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 585 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 584 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 582 transition count 503
Applied a total of 82 rules in 75 ms. Remains 582 /623 variables (removed 41) and now considering 503/544 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12476680356047408825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5702232375946140891.kers'
[2026-05-24 13:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12476680356047408825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5702232375946140891.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 503 rows 582 cols 1606 entries
Finished phase 1 with 376 SingleSign rule and 89 generalized
[2026-05-24 13:24:28] [INFO ] Computed 117 invariants in 9 ms
Computed 117 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5702232375946140891.kers
Total runtime 12 ms.
[2026-05-24 13:24:29] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-24 13:24:29] [INFO ] Invariant cache hit.
[2026-05-24 13:24:31] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2026-05-24 13:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 30063ms
Starting structural reductions in LTL mode, iteration 1 : 582/623 places, 503/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32456 ms. Remains : 582/623 places, 503/544 transitions.
[2026-05-24 13:25:01] [INFO ] Flatten gal took : 11 ms
[2026-05-24 13:25:01] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:25:01] [INFO ] Input system was already deterministic with 503 transitions.
[2026-05-24 13:25:01] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:25:01] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:25:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14808920508726878038.gal : 2 ms
[2026-05-24 13:25:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1013138994774748093.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/CTLFireability14808920508726878038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1013138994774748093.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:25:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:25:31] [INFO ] Applying decomposition
[2026-05-24 13:25:31] [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/graph3457143278716723474.txt' '-o' '/tmp/graph3457143278716723474.bin' '-w' '/tmp/graph3457143278716723474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3457143278716723474.bin' '-l' '-1' '-v' '-w' '/tmp/graph3457143278716723474.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:25:31] [INFO ] Decomposing Gal with order
[2026-05-24 13:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:25:31] [INFO ] Removed a total of 287 redundant transitions.
[2026-05-24 13:25:31] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2026-05-24 13:25:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14984652382737536088.gal : 4 ms
[2026-05-24 13:25:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14426020450139460476.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/CTLFireability14984652382737536088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14426020450139460476.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.28225e+33,1.34332,49536,5681,63,96460,947,1264,145530,72,2440,0


Converting to forward existential form...Done !
original formula: (EF(!(E(((((i20.u169.p616==1)||((i13.i0.u62.p188==1)&&(i13.i0.u183.p675==1)))||(i20.u159.p660==1)) * E((i7.u36.p96==1) U (((i13.i0.u59.p1...307
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(((((i20.u169.p616==1)||((i13.i0.u62.p188==1)&&(i13.i0.u183.p675==1)))||(i20.u159.p660==...501
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t204, t288, t308, t316, t390, t393, t466, t467, t471, t473, t476, t480, t489, t4...1583
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 544/544 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 594 transition count 515
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 594 transition count 515
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 585 transition count 506
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 584 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 582 transition count 503
Applied a total of 82 rules in 95 ms. Remains 582 /623 variables (removed 41) and now considering 503/544 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12161501869288904725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15531127237326241980.kers'
[2026-05-24 13:26:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12161501869288904725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15531127237326241980.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 503 rows 582 cols 1606 entries
Finished phase 1 with 377 SingleSign rule and 88 generalized
[2026-05-24 13:26:01] [INFO ] Computed 117 invariants in 3 ms
Computed 117 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15531127237326241980.kers
Total runtime 5 ms.
[2026-05-24 13:26:01] [INFO ] Implicit Places using invariants in 397 ms returned []
[2026-05-24 13:26:01] [INFO ] Invariant cache hit.
[2026-05-24 13:26:03] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 582/623 places, 503/544 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2394 ms. Remains : 582/623 places, 503/544 transitions.
[2026-05-24 13:26:03] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:26:03] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:26:03] [INFO ] Input system was already deterministic with 503 transitions.
[2026-05-24 13:26:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:26:03] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:26:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9175396681620916924.gal : 4 ms
[2026-05-24 13:26:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5916074241771253554.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/CTLFireability9175396681620916924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5916074241771253554.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:26:34] [INFO ] Flatten gal took : 12 ms
[2026-05-24 13:26:34] [INFO ] Applying decomposition
[2026-05-24 13:26:34] [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/graph12402894702252573530.txt' '-o' '/tmp/graph12402894702252573530.bin' '-w' '/tmp/graph12402894702252573530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12402894702252573530.bin' '-l' '-1' '-v' '-w' '/tmp/graph12402894702252573530.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:26:34] [INFO ] Decomposing Gal with order
[2026-05-24 13:26:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:26:34] [INFO ] Removed a total of 289 redundant transitions.
[2026-05-24 13:26:34] [INFO ] Flatten gal took : 46 ms
[2026-05-24 13:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-24 13:26:34] [INFO ] Time to serialize gal into /tmp/CTLFireability18116199179006872439.gal : 4 ms
[2026-05-24 13:26:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12894883501849370462.ctl : 16 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/CTLFireability18116199179006872439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12894883501849370462.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.2659e+33,4.13887,120392,8236,79,211740,1619,1313,424403,80,4186,0


Converting to forward existential form...Done !
original formula: EF(((E((((i1.u88.p268==1)&&(i19.i1.u155.p533==1))&&(i1.u189.p717==1)) U (((!((i9.i1.u204.p761==1)&&(i9.i1.u205.p764==1)))&&(i4.i3.u136.p4...348
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (E((((i1.u88.p268==1)&&(i19.i1.u155.p533==1))&&(i1.u189.p717==1)) U (((!((i9.i1.u204.p761==...527
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t204, t288, t304, t316, t390, t466, t467, t471, t473, t476, t478, t480, t489...1628
Detected timeout of ITS tools.
[2026-05-24 13:27:04] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:27:04] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:27:04] [INFO ] Applying decomposition
[2026-05-24 13:27:04] [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/graph8726014404979025597.txt' '-o' '/tmp/graph8726014404979025597.bin' '-w' '/tmp/graph8726014404979025597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8726014404979025597.bin' '-l' '-1' '-v' '-w' '/tmp/graph8726014404979025597.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:27:04] [INFO ] Decomposing Gal with order
[2026-05-24 13:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:27:04] [INFO ] Removed a total of 286 redundant transitions.
[2026-05-24 13:27:04] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 13:27:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4710944315006265563.gal : 15 ms
[2026-05-24 13:27:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7280287826391535812.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/CTLFireability4710944315006265563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7280287826391535812.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 6 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.97512e+33,1.55043,54832,5502,113,94479,1926,1411,169318,93,6850,0


Converting to forward existential form...Done !
original formula: E(EF((((AX((((i8.i1.u62.p187==1)&&(i8.i1.u156.p498==1))&&(i8.i1.u156.p674==1))) + A((i5.i1.u30.p79==1) U (((i17.i0.u36.p95==1)&&(i17.i1.u...450
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((!(EX(!((((i8.i1.u62.p187==1)&&(i8.i1.u156.p498==1))&&(i8.i1.u156.p674==1))))) + !((E(!((...675
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t234, t344, t354, t383, t507, t511, t513, t515, t516, t530, i0.u90.t257, i0.u94.t249,...2029
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
[2026-05-24 13:53:36] [INFO ] Applying decomposition
[2026-05-24 13:53:36] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:53:36] [INFO ] Decomposing Gal with order
[2026-05-24 13:53:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:53:36] [INFO ] Removed a total of 137 redundant transitions.
[2026-05-24 13:53:36] [INFO ] Flatten gal took : 18 ms
[2026-05-24 13:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 170 ms.
[2026-05-24 13:53:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1117333407864833270.gal : 7 ms
[2026-05-24 13:53:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7379967945176785269.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/CTLFireability1117333407864833270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7379967945176785269.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 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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