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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:51 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 3.8K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 146K 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-12-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779619331877

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 10:42:13] [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 10:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:42:13] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2026-05-24 10:42:13] [INFO ] Transformed 586 places.
[2026-05-24 10:42:13] [INFO ] Transformed 525 transitions.
[2026-05-24 10:42:13] [INFO ] Found NUPN structural information;
[2026-05-24 10:42:13] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Support contains 124 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 62 place count 520 transition count 462
Iterating global reduction 1 with 59 rules applied. Total rules applied 121 place count 520 transition count 462
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 146 place count 495 transition count 437
Iterating global reduction 1 with 25 rules applied. Total rules applied 171 place count 495 transition count 437
Applied a total of 171 rules in 124 ms. Remains 495 /582 variables (removed 87) and now considering 437/521 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12168758423471773519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7141349931340678145.kers'
[2026-05-24 10:42:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12168758423471773519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7141349931340678145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 495 cols 1381 entries
Finished phase 1 with 328 SingleSign rule and 72 generalized
[2026-05-24 10:42:13] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7141349931340678145.kers
Total runtime 4 ms.
[2026-05-24 10:42:13] [INFO ] Implicit Places using invariants in 404 ms returned []
[2026-05-24 10:42:13] [INFO ] Invariant cache hit.
[2026-05-24 10:42:15] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-24 10:42:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/495 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 436 unsolved
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Starting structural reductions in LTL mode, iteration 1 : 495/582 places, 437/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32043 ms. Remains : 495/582 places, 437/521 transitions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Applied a total of 0 rules in 18 ms. Remains 495 /495 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2026-05-24 10:42:45] [INFO ] Invariant cache hit.
[2026-05-24 10:42:45] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-24 10:42:45] [INFO ] Invariant cache hit.
[2026-05-24 10:42:46] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1451 ms. Remains : 495/495 places, 437/437 transitions.
Support contains 124 out of 495 places after structural reductions.
[2026-05-24 10:42:47] [INFO ] Flatten gal took : 65 ms
[2026-05-24 10:42:47] [INFO ] Flatten gal took : 35 ms
[2026-05-24 10:42:47] [INFO ] Input system was already deterministic with 437 transitions.
Reduction of identical properties reduced properties to check from 90 to 89
RANDOM walk for 40000 steps (290 resets) in 1217 ms. (32 steps per ms) remains 55/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
[2026-05-24 10:42:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/311 variables, 45/45 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 106/417 variables, 27/72 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 54 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 5 (OVERLAPS) 73/490 variables, 23/95 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/115 constraints. Problems are: Problem set: 2 solved, 53 unsolved
SMT process timed out in 5122ms, After SMT, problems are : Problem set: 2 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 437/437 transitions.
Graph (complete) has 1082 edges and 495 vertex of which 494 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 494 transition count 391
Reduce places removed 45 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 449 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 446 transition count 388
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 97 place count 446 transition count 313
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 259 place count 359 transition count 313
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 273 place count 345 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 288 place count 344 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 288 place count 344 transition count 298
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 290 place count 343 transition count 298
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 479 place count 247 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 480 place count 247 transition count 204
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 247 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 482 place count 246 transition count 203
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 491 place count 246 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 492 place count 245 transition count 202
Applied a total of 492 rules in 144 ms. Remains 245 /495 variables (removed 250) and now considering 202/437 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 245/495 places, 202/437 transitions.
RANDOM walk for 40000 steps (1563 resets) in 977 ms. (40 steps per ms) remains 40/53 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (23 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (31 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (32 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (31 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (34 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (34 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7796748316980779617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15570289134390563382.kers'
[2026-05-24 10:42:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7796748316980779617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15570289134390563382.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 202 rows 231 cols 829 entries
Finished phase 1 with 119 SingleSign rule and 47 generalized
[2026-05-24 10:42:53] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15570289134390563382.kers
Total runtime 2 ms.
[2026-05-24 10:42:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 75/132 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/172 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 49/221 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 10/74 constraints. Problems are: Problem set: 6 solved, 34 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 13/87 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 3/90 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/90 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 10/231 variables, 9/99 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 20/119 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 8/127 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 2/129 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 15/144 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 4/148 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 20/168 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/231 variables, 11/179 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/231 variables, 0/179 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 20 (OVERLAPS) 202/433 variables, 231/410 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 1/411 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/433 variables, 20/431 constraints. Problems are: Problem set: 11 solved, 29 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/433 variables, 0/431 constraints. Problems are: Problem set: 11 solved, 29 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 24 (OVERLAPS) 14/447 variables, 14/445 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/447 variables, 6/451 constraints. Problems are: Problem set: 12 solved, 28 unsolved
Problem AtomicPropp85 is UNSAT
At refinement iteration 26 (INCLUDED_ONLY) 0/447 variables, 9/460 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/447 variables, 0/460 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 28 (OVERLAPS) 0/447 variables, 0/460 constraints. Problems are: Problem set: 13 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 460 constraints, problems are : Problem set: 13 solved, 27 unsolved in 17042 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 135/135 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 52/91 variables, 15/15 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/16 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/18 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 63/154 variables, 27/45 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 7/52 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 13 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 54/208 variables, 16/68 constraints. Problems are: Problem set: 13 solved, 27 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 20/88 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/88 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 10/218 variables, 9/97 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 45/142 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/142 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 2/220 variables, 2/144 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 4/148 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 196/416 variables, 220/368 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 1/369 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/416 variables, 24/393 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 3/396 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/416 variables, 0/396 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 22 (OVERLAPS) 27/443 variables, 22/418 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/443 variables, 7/425 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/443 variables, 2/427 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/443 variables, 56/483 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/443 variables, 0/483 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 27 (OVERLAPS) 3/446 variables, 2/485 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/446 variables, 1/486 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/446 variables, 1/487 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/446 variables, 4/491 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/446 variables, 0/491 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 32 (OVERLAPS) 1/447 variables, 2/493 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/447 variables, 1/494 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/447 variables, 0/494 constraints. Problems are: Problem set: 14 solved, 26 unsolved
At refinement iteration 35 (OVERLAPS) 0/447 variables, 0/494 constraints. Problems are: Problem set: 14 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 494 constraints, problems are : Problem set: 14 solved, 26 unsolved in 29017 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/40 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 46089ms problems are : Problem set: 14 solved, 26 unsolved
Parikh walk visited 3 properties in 719 ms.
Support contains 30 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 245 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 243 transition count 200
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 4 place count 243 transition count 185
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 37 place count 225 transition count 185
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 221 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 221 transition count 181
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 84 place count 201 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 201 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 199 transition count 160
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 197 transition count 158
Applied a total of 90 rules in 39 ms. Remains 197 /245 variables (removed 48) and now considering 158/202 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 197/245 places, 158/202 transitions.
RANDOM walk for 40000 steps (3647 resets) in 296 ms. (134 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (111 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (108 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (99 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (108 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (107 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (112 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (112 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (101 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (113 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (117 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (106 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (99 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (111 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (110 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (120 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (108 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (110 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (102 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (103 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (113 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (110 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (102 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (112 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 5559 steps, run visited all 23 properties in 53 ms. (steps per millisecond=104 )
Probabilistic random walk after 5559 steps, saw 1627 distinct states, run finished after 57 ms. (steps per millisecond=97 ) properties seen :23
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 10:43:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 10:43:41] [INFO ] Flatten gal took : 21 ms
[2026-05-24 10:43:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 10:43:41] [INFO ] Flatten gal took : 21 ms
[2026-05-24 10:43:41] [INFO ] Input system was already deterministic with 437 transitions.
Support contains 75 out of 495 places (down from 99) after GAL structural reductions.
Computed a total of 479 stabilizing places and 421 stable transitions
Graph (complete) has 1082 edges and 495 vertex of which 494 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Graph (complete) has 1082 edges and 495 vertex of which 494 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 493 transition count 379
Reduce places removed 56 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 437 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 435 transition count 377
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 117 place count 435 transition count 272
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 345 place count 312 transition count 272
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 373 place count 284 transition count 244
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 402 place count 283 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 402 place count 283 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 406 place count 281 transition count 242
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 617 place count 174 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 618 place count 173 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 619 place count 172 transition count 137
Applied a total of 619 rules in 45 ms. Remains 172 /495 variables (removed 323) and now considering 137/437 (removed 300) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16029544216219236563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9725592210193296520.kers'
[2026-05-24 10:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16029544216219236563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9725592210193296520.kers]
Culling duplicate invariants (modulo rational): removing 41 columns.
Culled 41 columns in 0 ms.
// Phase 1: matrix 137 rows 131 cols 553 entries
Finished phase 1 with 72 SingleSign rule and 28 generalized
[2026-05-24 10:43:41] [INFO ] Computed 72 invariants in 3 ms
Computed 72 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9725592210193296520.kers
Total runtime 3 ms.
[2026-05-24 10:43:41] [INFO ] Implicit Places using invariants in 140 ms returned [45, 46, 47, 52, 53, 54, 55, 56, 57, 58]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 142 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 162/495 places, 137/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 194 ms. Remains : 162/495 places, 137/437 transitions.
[2026-05-24 10:43:41] [INFO ] Flatten gal took : 7 ms
[2026-05-24 10:43:41] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:43:41] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-24 10:43:41] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:43:41] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11418761959932519034.gal : 4 ms
[2026-05-24 10:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13467263425463692912.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/CTLFireability11418761959932519034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13467263425463692912.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,48753,0.106007,8328,2,2194,5,14476,6,0,785,12862,0


Converting to forward existential form...Done !
original formula: AG((!(A((p484==1) U (A((p137==1) U (p19==1)) + AF((((p69==1)&&(p318==1))&&(p547==1)))))) + (p137==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p137==1))) * !(EG(!((!((E(!((p19==1)) U (!((p137==1)) * !((p19==1)))) + EG(!((p19==1)))...488
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t34, t35, t36, t37, t38, t39, t71, t72, t73, t74, t75, t92, t97, t100, t101, t102, t1...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.65762,70168,1,0,524,344389,279,294,5940,330458,633
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 468 transition count 410
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 468 transition count 410
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 460 transition count 402
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 460 transition count 402
Applied a total of 70 rules in 18 ms. Remains 460 /495 variables (removed 35) and now considering 402/437 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2797865739236174202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4995891903086850560.kers'
[2026-05-24 10:43:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2797865739236174202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4995891903086850560.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 460 cols 1311 entries
Finished phase 1 with 293 SingleSign rule and 72 generalized
[2026-05-24 10:43:43] [INFO ] Computed 95 invariants in 4 ms
Computed 95 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4995891903086850560.kers
Total runtime 6 ms.
[2026-05-24 10:43:43] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-24 10:43:43] [INFO ] Invariant cache hit.
[2026-05-24 10:43:45] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2026-05-24 10:43:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/460 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/862 variables, and 185 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/460 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/460 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 90/185 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Problem TDEAD333 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 20/225 constraints. Problems are: Problem set: 11 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 20/245 constraints. Problems are: Problem set: 11 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 20/265 constraints. Problems are: Problem set: 11 solved, 390 unsolved
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 20/285 constraints. Problems are: Problem set: 14 solved, 387 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 20/305 constraints. Problems are: Problem set: 14 solved, 387 unsolved
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 20/325 constraints. Problems are: Problem set: 17 solved, 384 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/862 variables, and 332 constraints, problems are : Problem set: 17 solved, 384 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/460 constraints, PredecessorRefiner: 0/401 constraints, Known Traps: 237/237 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 17 solved, 384 unsolved
Search for dead transitions found 17 dead transitions in 60098ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 460/495 places, 385/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 460 /460 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62032 ms. Remains : 460/495 places, 385/437 transitions.
[2026-05-24 10:44:45] [INFO ] Flatten gal took : 14 ms
[2026-05-24 10:44:45] [INFO ] Flatten gal took : 13 ms
[2026-05-24 10:44:45] [INFO ] Input system was already deterministic with 385 transitions.
[2026-05-24 10:44:45] [INFO ] Flatten gal took : 13 ms
[2026-05-24 10:44:45] [INFO ] Flatten gal took : 12 ms
[2026-05-24 10:44:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5004074054901441722.gal : 8 ms
[2026-05-24 10:44:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9791721805538321640.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/CTLFireability5004074054901441722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9791721805538321640.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 10:45:15] [INFO ] Flatten gal took : 14 ms
[2026-05-24 10:45:15] [INFO ] Applying decomposition
[2026-05-24 10:45:15] [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/graph992708196097933735.txt' '-o' '/tmp/graph992708196097933735.bin' '-w' '/tmp/graph992708196097933735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph992708196097933735.bin' '-l' '-1' '-v' '-w' '/tmp/graph992708196097933735.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:45:15] [INFO ] Decomposing Gal with order
[2026-05-24 10:45:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:45:15] [INFO ] Removed a total of 178 redundant transitions.
[2026-05-24 10:45:15] [INFO ] Flatten gal took : 71 ms
[2026-05-24 10:45:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-24 10:45:15] [INFO ] Time to serialize gal into /tmp/CTLFireability82096274401894710.gal : 9 ms
[2026-05-24 10:45:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4026008608446016669.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/CTLFireability82096274401894710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4026008608446016669.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41733e+23,0.536638,25056,3116,51,40609,727,1031,76883,68,1800,0


Converting to forward existential form...Done !
original formula: E(EF((i9.i0.u64.p184==1)) U (AG((i8.i0.u7.p16==1)) * ((EF(EG((i1.u73.p210==1))) + (i8.i0.u48.p140==1)) + ((AX((i14.u147.p531==1)) * E((i5...293
=> equivalent forward existential formula: (([FwdG(FwdU((FwdU(Init,E(TRUE U (i9.i0.u64.p184==1))) * !(E(TRUE U !((i8.i0.u7.p16==1))))),TRUE),(i1.u73.p210==...836
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t157, t165, t177, t256, t373, t374, t375, t377, i0.i0.u78.t160, i0.i0.u122.t69, i...1230
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 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
(forward)formula 0,0,3.02331,119380,1,0,225668,727,7001,467722,341,1895,579663
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Graph (complete) has 1082 edges and 495 vertex of which 494 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 493 transition count 377
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 435 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 433 transition count 375
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 121 place count 433 transition count 270
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 349 place count 310 transition count 270
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 377 place count 282 transition count 242
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 406 place count 281 transition count 242
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 406 place count 281 transition count 240
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 410 place count 279 transition count 240
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 625 place count 170 transition count 134
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 626 place count 170 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 627 place count 169 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 628 place count 168 transition count 133
Applied a total of 628 rules in 46 ms. Remains 168 /495 variables (removed 327) and now considering 133/437 (removed 304) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10716102112094377175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15131748835552785337.kers'
[2026-05-24 10:45:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10716102112094377175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15131748835552785337.kers]
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 133 rows 134 cols 606 entries
Finished phase 1 with 74 SingleSign rule and 22 generalized
[2026-05-24 10:45:18] [INFO ] Computed 72 invariants in 0 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15131748835552785337.kers
Total runtime 1 ms.
[2026-05-24 10:45:19] [INFO ] Implicit Places using invariants in 118 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 119 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/495 places, 133/437 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 170 ms. Remains : 150/495 places, 133/437 transitions.
[2026-05-24 10:45:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:45:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:45:19] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-24 10:45:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 10:45:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 10:45:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9221695805580882718.gal : 1 ms
[2026-05-24 10:45:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10288521368919180368.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/CTLFireability9221695805580882718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10288521368919180368.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,40440,0.09812,8500,2,2300,5,13915,6,0,734,12989,0


Converting to forward existential form...Done !
original formula: AG(((AG((p417==0)) + (p260==0)) + AF(EG((((p153==0)||(p353==0))||(p547==0))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((!(E(TRUE U !((p417==0)))) + (p260==0)))),!(EG((((p153==0)||(p353==0))||(p547==0)))))...164
Reverse transition relation is NOT exact ! Due to transitions t29, t30, t31, t32, t33, t58, t59, t60, t61, t62, t90, t91, t95, t96, t97, t108, t112, t113, ...261
(forward)formula 0,1,1.48335,65152,1,0,300,307419,264,148,5656,267735,368
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-03 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 : 495/495 places, 437/437 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 464 transition count 406
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 464 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 454 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 454 transition count 396
Applied a total of 82 rules in 33 ms. Remains 454 /495 variables (removed 41) and now considering 396/437 (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-7576233007119445003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14162711765258969427.kers'
[2026-05-24 10:45:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7576233007119445003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14162711765258969427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 454 cols 1299 entries
Finished phase 1 with 287 SingleSign rule and 72 generalized
[2026-05-24 10:45:20] [INFO ] Computed 95 invariants in 3 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14162711765258969427.kers
Total runtime 4 ms.
[2026-05-24 10:45:20] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-24 10:45:20] [INFO ] Invariant cache hit.
[2026-05-24 10:45:22] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2026-05-24 10:45:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 395 unsolved
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Starting structural reductions in LTL mode, iteration 1 : 454/495 places, 396/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32073 ms. Remains : 454/495 places, 396/437 transitions.
[2026-05-24 10:45:52] [INFO ] Flatten gal took : 9 ms
[2026-05-24 10:45:52] [INFO ] Flatten gal took : 9 ms
[2026-05-24 10:45:52] [INFO ] Input system was already deterministic with 396 transitions.
[2026-05-24 10:45:52] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:45:52] [INFO ] Flatten gal took : 9 ms
[2026-05-24 10:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2722274322029955003.gal : 3 ms
[2026-05-24 10:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability18275053942234533677.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/CTLFireability2722274322029955003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18275053942234533677.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 10:46:22] [INFO ] Flatten gal took : 10 ms
[2026-05-24 10:46:22] [INFO ] Applying decomposition
[2026-05-24 10:46:22] [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/graph1817066016880588729.txt' '-o' '/tmp/graph1817066016880588729.bin' '-w' '/tmp/graph1817066016880588729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1817066016880588729.bin' '-l' '-1' '-v' '-w' '/tmp/graph1817066016880588729.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:46:22] [INFO ] Decomposing Gal with order
[2026-05-24 10:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:46:22] [INFO ] Removed a total of 253 redundant transitions.
[2026-05-24 10:46:22] [INFO ] Flatten gal took : 21 ms
[2026-05-24 10:46:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-24 10:46:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4587662674849914289.gal : 4 ms
[2026-05-24 10:46:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15113509810159424928.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/CTLFireability4587662674849914289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15113509810159424928.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40929e+23,0.779016,31332,3772,52,53087,843,909,117146,65,1696,0


Converting to forward existential form...Done !
original formula: AF(EX((AG(AF((i5.u14.p38==0))) + (i14.u91.p268==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(E(TRUE U !(!(EG(!((i5.u14.p38==0))))))) + (i14.u91.p268==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t155, t163, t167, t175, t253, t261, t384, t385, t386, t388, t389, i0.t260, i0...1065
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,15.3264,413036,1,0,637886,843,6085,2.21531e+06,323,1696,963777
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Graph (trivial) has 235 edges and 495 vertex of which 4 / 495 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1079 edges and 492 vertex of which 491 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 490 transition count 366
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 424 transition count 364
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 422 transition count 364
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 138 place count 422 transition count 277
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 329 place count 318 transition count 277
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 292 transition count 251
Ensure Unique test removed 1 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 382 place count 291 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 382 place count 291 transition count 249
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 386 place count 289 transition count 249
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 609 place count 176 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 611 place count 175 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 612 place count 174 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 613 place count 173 transition count 137
Applied a total of 613 rules in 45 ms. Remains 173 /495 variables (removed 322) and now considering 137/437 (removed 300) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17879411139763140138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13862302116444361242.kers'
[2026-05-24 10:46:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17879411139763140138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13862302116444361242.kers]
Normalized transition count is 136 out of 137 initially.
Culling duplicate invariants (modulo rational): removing 45 columns.
Culled 45 columns in 0 ms.
// Phase 1: matrix 136 rows 128 cols 525 entries
Finished phase 1 with 80 SingleSign rule and 20 generalized
[2026-05-24 10:46:38] [INFO ] Computed 73 invariants in 0 ms
Computed 73 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13862302116444361242.kers
Total runtime 1 ms.
[2026-05-24 10:46:38] [INFO ] Implicit Places using invariants in 139 ms returned [0, 1, 5, 6, 33, 34, 35, 36, 47, 48, 49, 54, 55, 56, 57, 58, 59, 60]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 155 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 155/495 places, 137/437 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 205 ms. Remains : 155/495 places, 137/437 transitions.
[2026-05-24 10:46:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 10:46:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 10:46:38] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-24 10:46:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 10:46:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 10:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3986373192044732606.gal : 1 ms
[2026-05-24 10:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16107656421963587558.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/CTLFireability3986373192044732606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16107656421963587558.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,50070,0.122282,7968,2,2362,5,12294,6,0,757,10068,0


Converting to forward existential form...Done !
original formula: AG(!(E(EG(!((((p148==1)&&(p151==1))&&(p154==1)))) U ((EG((p104==1)) * (p421!=1)) + ((A((p362==1) U ((p100==1)&&(p103==1))) * (p87==1)) * ...169
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),EG(!((((p148==1)&&(p151==1))&&(p154==1))))) * (p421!=1)),(p104==1))] = FALSE * [(((...371
Reverse transition relation is NOT exact ! Due to transitions t7, t39, t41, t42, t43, t44, t65, t92, t93, t94, t95, t102, t105, t106, t107, t118, t122, t12...264
Hit Full ! (commute/partial/dont) 132/0/5
(forward)formula 0,0,1.95127,79120,1,0,418,396287,285,215,5753,375458,528
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Graph (trivial) has 244 edges and 495 vertex of which 7 / 495 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 1075 edges and 489 vertex of which 488 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 487 transition count 362
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 421 transition count 362
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 134 place count 421 transition count 267
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 342 place count 308 transition count 267
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 369 place count 281 transition count 240
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 397 place count 280 transition count 240
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 397 place count 280 transition count 238
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 401 place count 278 transition count 238
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 614 place count 170 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 616 place count 169 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 617 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 618 place count 167 transition count 131
Applied a total of 618 rules in 38 ms. Remains 167 /495 variables (removed 328) and now considering 131/437 (removed 306) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17837817043495096188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8865326947332819167.kers'
[2026-05-24 10:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17837817043495096188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8865326947332819167.kers]
Normalized transition count is 130 out of 131 initially.
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 130 rows 130 cols 551 entries
Finished phase 1 with 65 SingleSign rule and 30 generalized
[2026-05-24 10:46:40] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8865326947332819167.kers
Total runtime 1 ms.
[2026-05-24 10:46:40] [INFO ] Implicit Places using invariants in 124 ms returned [41, 42, 43, 48, 49, 50, 51, 52, 53, 54]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 139 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 157/495 places, 131/437 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 181 ms. Remains : 157/495 places, 131/437 transitions.
[2026-05-24 10:46:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 10:46:40] [INFO ] Flatten gal took : 4 ms
[2026-05-24 10:46:40] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-24 10:46:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 10:46:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 10:46:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18164473071641313465.gal : 1 ms
[2026-05-24 10:46:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6643365252959266907.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/CTLFireability18164473071641313465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6643365252959266907.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,26018,0.132197,9996,2,3331,5,22656,6,0,758,13697,0


Converting to forward existential form...Done !
original formula: EF((A(!(AG((p18==1))) U (p268==1)) * AG((p285==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!((p268==1)) U (!(!(!(E(TRUE U !((p18==1)))))) * !((p268==1)))) + EG(!((p268==1)))))) ...193
Reverse transition relation is NOT exact ! Due to transitions t28, t29, t30, t31, t32, t57, t69, t79, t86, t87, t88, t89, t96, t99, t100, t101, t112, t116,...268
(forward)formula 0,0,0.931679,41272,1,0,174,148939,247,87,5628,83842,235
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 464 transition count 406
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 464 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 454 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 454 transition count 396
Applied a total of 82 rules in 28 ms. Remains 454 /495 variables (removed 41) and now considering 396/437 (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-7962671649482461962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6164235983912708474.kers'
[2026-05-24 10:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7962671649482461962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6164235983912708474.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 454 cols 1299 entries
Finished phase 1 with 287 SingleSign rule and 72 generalized
[2026-05-24 10:46:41] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6164235983912708474.kers
Total runtime 3 ms.
[2026-05-24 10:46:42] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-24 10:46:42] [INFO ] Invariant cache hit.
[2026-05-24 10:46:43] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 454/495 places, 396/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1962 ms. Remains : 454/495 places, 396/437 transitions.
[2026-05-24 10:46:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:46:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:46:43] [INFO ] Input system was already deterministic with 396 transitions.
[2026-05-24 10:46:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:46:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:46:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15176826925323523171.gal : 2 ms
[2026-05-24 10:46:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6587959352797482427.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/CTLFireability15176826925323523171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6587959352797482427.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 10:47:13] [INFO ] Flatten gal took : 12 ms
[2026-05-24 10:47:13] [INFO ] Applying decomposition
[2026-05-24 10:47:13] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1610587108497385307.txt' '-o' '/tmp/graph1610587108497385307.bin' '-w' '/tmp/graph1610587108497385307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1610587108497385307.bin' '-l' '-1' '-v' '-w' '/tmp/graph1610587108497385307.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:47:13] [INFO ] Decomposing Gal with order
[2026-05-24 10:47:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:47:13] [INFO ] Removed a total of 252 redundant transitions.
[2026-05-24 10:47:13] [INFO ] Flatten gal took : 17 ms
[2026-05-24 10:47:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-24 10:47:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16412008614043150518.gal : 4 ms
[2026-05-24 10:47:13] [INFO ] Time to serialize properties into /tmp/CTLFireability955470245503891658.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/CTLFireability16412008614043150518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability955470245503891658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.40929e+23,0.618744,26836,3055,58,43944,810,1011,84969,64,2029,0


Converting to forward existential form...Done !
original formula: EF((EG(AX((i5.i1.u159.p579==1))) * (i16.i2.u28.p71==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (i16.i2.u28.p71==1)),!(EX(!((i5.i1.u159.p579==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t155, t163, t167, t253, t261, t384, t385, t386, t388, t389, i0.t159, i0.u69.t...1149
Using saturation style SCC detection
Using 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 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
(forward)formula 0,0,2.90239,114876,1,0,215516,810,6239,509634,292,2029,502321
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 467 transition count 409
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 467 transition count 409
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 459 transition count 401
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 459 transition count 401
Applied a total of 72 rules in 26 ms. Remains 459 /495 variables (removed 36) and now considering 401/437 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6745497903827081173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11382785287942849135.kers'
[2026-05-24 10:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6745497903827081173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11382785287942849135.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 459 cols 1309 entries
Finished phase 1 with 292 SingleSign rule and 72 generalized
[2026-05-24 10:47:16] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11382785287942849135.kers
Total runtime 3 ms.
[2026-05-24 10:47:17] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-24 10:47:17] [INFO ] Invariant cache hit.
[2026-05-24 10:47:18] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2026-05-24 10:47:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30064ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30067ms
Starting structural reductions in LTL mode, iteration 1 : 459/495 places, 401/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32149 ms. Remains : 459/495 places, 401/437 transitions.
[2026-05-24 10:47:49] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:47:49] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:47:49] [INFO ] Input system was already deterministic with 401 transitions.
[2026-05-24 10:47:49] [INFO ] Flatten gal took : 7 ms
[2026-05-24 10:47:49] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2075882846762989202.gal : 7 ms
[2026-05-24 10:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7138752158172812626.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/CTLFireability2075882846762989202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7138752158172812626.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 10:48:19] [INFO ] Flatten gal took : 10 ms
[2026-05-24 10:48:19] [INFO ] Applying decomposition
[2026-05-24 10:48:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17995711963609747899.txt' '-o' '/tmp/graph17995711963609747899.bin' '-w' '/tmp/graph17995711963609747899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17995711963609747899.bin' '-l' '-1' '-v' '-w' '/tmp/graph17995711963609747899.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:48:19] [INFO ] Decomposing Gal with order
[2026-05-24 10:48:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:48:19] [INFO ] Removed a total of 253 redundant transitions.
[2026-05-24 10:48:19] [INFO ] Flatten gal took : 17 ms
[2026-05-24 10:48:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2026-05-24 10:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9205666177392245480.gal : 4 ms
[2026-05-24 10:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5909822357573938414.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/CTLFireability9205666177392245480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5909822357573938414.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.4105e+23,1.50113,49272,5138,44,80758,610,1062,189352,56,1615,0


Converting to forward existential form...Done !
original formula: AG(AF(((!(A(EG((i16.u125.p520==1)) U (((i15.i2.u116.p375==1)&&(i5.i0.u19.p52==1))&&(i16.u127.p427==1)))) + AX((i16.u128.p434==0))) + (EX(...201
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(!((E(!((((i15.i2.u116.p375==1)&&(i5.i0.u19.p52==1))&&(i16.u127.p427==1))) U (!(EG((i...418
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t160, t168, t180, t258, t266, t389, t391, t393, t394, i0.i0.u82.t155, i0.i1.u...1217
Using saturation style SCC detection
Using 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 a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 465 transition count 407
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 465 transition count 407
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 455 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 455 transition count 397
Applied a total of 80 rules in 26 ms. Remains 455 /495 variables (removed 40) and now considering 397/437 (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-11696446787494820755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13654643452985858947.kers'
[2026-05-24 10:48:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11696446787494820755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13654643452985858947.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 455 cols 1301 entries
Finished phase 1 with 288 SingleSign rule and 72 generalized
[2026-05-24 10:48:49] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13654643452985858947.kers
Total runtime 4 ms.
[2026-05-24 10:48:49] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-24 10:48:49] [INFO ] Invariant cache hit.
[2026-05-24 10:48:51] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2026-05-24 10:48:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/135 constraints. Problems are: Problem set: 7 solved, 389 unsolved
Problem TDEAD339 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/155 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/175 constraints. Problems are: Problem set: 10 solved, 386 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/852 variables, and 191 constraints, problems are : Problem set: 10 solved, 386 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 73/90 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 5/95 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 96/191 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/211 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/231 constraints. Problems are: Problem set: 10 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/251 constraints. Problems are: Problem set: 10 solved, 386 unsolved
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 20/271 constraints. Problems are: Problem set: 14 solved, 382 unsolved
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 20/291 constraints. Problems are: Problem set: 16 solved, 380 unsolved
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 20/311 constraints. Problems are: Problem set: 19 solved, 377 unsolved
Problem TDEAD356 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 20/331 constraints. Problems are: Problem set: 22 solved, 374 unsolved
SMT process timed out in 60053ms, After SMT, problems are : Problem set: 22 solved, 374 unsolved
Search for dead transitions found 22 dead transitions in 60056ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 455/495 places, 375/437 transitions.
Applied a total of 0 rules in 8 ms. Remains 455 /455 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61986 ms. Remains : 455/495 places, 375/437 transitions.
[2026-05-24 10:49:51] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:49:51] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:49:51] [INFO ] Input system was already deterministic with 375 transitions.
[2026-05-24 10:49:51] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:49:51] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:49:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3027249450975878860.gal : 2 ms
[2026-05-24 10:49:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16163974079394586874.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/CTLFireability3027249450975878860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16163974079394586874.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 10:50:21] [INFO ] Flatten gal took : 10 ms
[2026-05-24 10:50:21] [INFO ] Applying decomposition
[2026-05-24 10:50:21] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17472995529400777583.txt' '-o' '/tmp/graph17472995529400777583.bin' '-w' '/tmp/graph17472995529400777583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17472995529400777583.bin' '-l' '-1' '-v' '-w' '/tmp/graph17472995529400777583.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:50:21] [INFO ] Decomposing Gal with order
[2026-05-24 10:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:50:21] [INFO ] Removed a total of 153 redundant transitions.
[2026-05-24 10:50:21] [INFO ] Flatten gal took : 17 ms
[2026-05-24 10:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2026-05-24 10:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11902587353468832902.gal : 4 ms
[2026-05-24 10:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9983483538012882367.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/CTLFireability11902587353468832902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9983483538012882367.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.46711e+23,0.496795,22352,3141,38,34195,501,991,64870,52,1185,0


Converting to forward existential form...Done !
original formula: AG(((i6.i0.u12.p29==0) * (EX((i14.i1.u85.p255==0)) + EG((i18.u122.p425==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i6.i0.u12.p29==0)))] = FALSE * [((FwdU(Init,TRUE) * !(EG((i18.u122.p425==0)))) * !(EX((i...186
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t10, t156, t168, t176, t254, t262, t363, t364, t365, t367, t368, i0.u65.t179, i0....1186
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 472 transition count 414
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 472 transition count 414
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 465 transition count 407
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 465 transition count 407
Applied a total of 60 rules in 27 ms. Remains 465 /495 variables (removed 30) and now considering 407/437 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1439687322846155099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7963644691476880717.kers'
[2026-05-24 10:50:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1439687322846155099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7963644691476880717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 407 rows 465 cols 1321 entries
Finished phase 1 with 298 SingleSign rule and 72 generalized
[2026-05-24 10:50:51] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7963644691476880717.kers
Total runtime 3 ms.
[2026-05-24 10:50:51] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-24 10:50:51] [INFO ] Invariant cache hit.
[2026-05-24 10:50:53] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2026-05-24 10:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/465 variables, 72/90 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 406 unsolved
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 30090ms
Starting structural reductions in LTL mode, iteration 1 : 465/495 places, 407/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31646 ms. Remains : 465/495 places, 407/437 transitions.
[2026-05-24 10:51:23] [INFO ] Flatten gal took : 11 ms
[2026-05-24 10:51:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:51:23] [INFO ] Input system was already deterministic with 407 transitions.
[2026-05-24 10:51:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:51:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 10:51:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14439569653481927609.gal : 3 ms
[2026-05-24 10:51:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4929905854813818186.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/CTLFireability14439569653481927609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4929905854813818186.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 10:51:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:51:53] [INFO ] Applying decomposition
[2026-05-24 10:51:53] [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/graph16915783144075701121.txt' '-o' '/tmp/graph16915783144075701121.bin' '-w' '/tmp/graph16915783144075701121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16915783144075701121.bin' '-l' '-1' '-v' '-w' '/tmp/graph16915783144075701121.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:51:53] [INFO ] Decomposing Gal with order
[2026-05-24 10:51:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:51:53] [INFO ] Removed a total of 254 redundant transitions.
[2026-05-24 10:51:53] [INFO ] Flatten gal took : 15 ms
[2026-05-24 10:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2026-05-24 10:51:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1253070522135540742.gal : 4 ms
[2026-05-24 10:51:53] [INFO ] Time to serialize properties into /tmp/CTLFireability359207604483224738.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/CTLFireability1253070522135540742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability359207604483224738.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5758e+23,1.10258,40388,4292,59,61657,761,1097,163970,67,1574,0


Converting to forward existential form...Done !
original formula: (A((i16.u141.p494==1) U !(EF((i16.u125.p472==1)))) + ((EF((((EX(((((i14.i1.u26.p111==1)&&(i14.i1.u100.p304==1))&&(i14.i1.u160.p570==1))||...645
=> equivalent forward existential formula: (([((Init * !(!((E(!(!(E(TRUE U (i16.u125.p472==1)))) U (!((i16.u141.p494==1)) * !(!(E(TRUE U (i16.u125.p472==1)...1536
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t163, t167, t264, t395, t397, t399, t400, i0.t177, i0.t173, i0.u68.t184, i0.u...1241
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 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
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 467 transition count 409
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 467 transition count 409
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 459 transition count 401
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 459 transition count 401
Applied a total of 72 rules in 28 ms. Remains 459 /495 variables (removed 36) and now considering 401/437 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6600985332599097147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11679317371429213055.kers'
[2026-05-24 10:52:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6600985332599097147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11679317371429213055.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 459 cols 1309 entries
Finished phase 1 with 292 SingleSign rule and 72 generalized
[2026-05-24 10:52:23] [INFO ] Computed 95 invariants in 4 ms
Computed 95 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11679317371429213055.kers
Total runtime 5 ms.
[2026-05-24 10:52:23] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-24 10:52:23] [INFO ] Invariant cache hit.
[2026-05-24 10:52:25] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2252 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2026-05-24 10:52:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/860 variables, and 195 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/459 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 100/195 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/235 constraints. Problems are: Problem set: 4 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/255 constraints. Problems are: Problem set: 4 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/275 constraints. Problems are: Problem set: 4 solved, 396 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 20/295 constraints. Problems are: Problem set: 4 solved, 396 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 20/315 constraints. Problems are: Problem set: 4 solved, 396 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 20/335 constraints. Problems are: Problem set: 4 solved, 396 unsolved
SMT process timed out in 60124ms, After SMT, problems are : Problem set: 4 solved, 396 unsolved
Search for dead transitions found 4 dead transitions in 60126ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 459/495 places, 397/437 transitions.
Applied a total of 0 rules in 12 ms. Remains 459 /459 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62422 ms. Remains : 459/495 places, 397/437 transitions.
[2026-05-24 10:53:25] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:53:25] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:53:25] [INFO ] Input system was already deterministic with 397 transitions.
[2026-05-24 10:53:25] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:53:25] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:53:25] [INFO ] Time to serialize gal into /tmp/CTLFireability426320207284831166.gal : 1 ms
[2026-05-24 10:53:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8254065753249929769.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/CTLFireability426320207284831166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8254065753249929769.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.49674e+23,1.40372,50072,5790,51,74983,635,1080,233250,56,1500,0


Converting to forward existential form...Done !
original formula: E((EF(((i15.i1.u116.p390!=1)||((i16.i1.u119.p400==1)&&(i15.i1.u66.p196==1)))) + !(EG((i17.u136.p490==1)))) U (EX(AX(((i1.i1.u161.p576==1)...224
=> equivalent forward existential formula: ([(EY(FwdU(Init,(E(TRUE U ((i15.i1.u116.p390!=1)||((i16.i1.u119.p400==1)&&(i15.i1.u66.p196==1)))) + !(EG((i17.u1...419
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t168, t180, t258, t386, t387, t389, i0.i0.u80.t155, i0.i1.t160, i0.i1.t164, i...1196
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
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 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
(forward)formula 0,1,11.5865,338644,1,0,548127,716,8519,1.62595e+06,301,2218,1346984
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 465 transition count 407
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 465 transition count 407
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 456 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 456 transition count 398
Applied a total of 78 rules in 21 ms. Remains 456 /495 variables (removed 39) and now considering 398/437 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4772288522711466835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4028709704867758557.kers'
[2026-05-24 10:54:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4772288522711466835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4028709704867758557.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 456 cols 1303 entries
Finished phase 1 with 289 SingleSign rule and 72 generalized
[2026-05-24 10:54:07] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4028709704867758557.kers
Total runtime 4 ms.
[2026-05-24 10:54:08] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-24 10:54:08] [INFO ] Invariant cache hit.
[2026-05-24 10:54:09] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2026-05-24 10:54:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 20/175 constraints. Problems are: Problem set: 4 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 20/195 constraints. Problems are: Problem set: 4 solved, 393 unsolved
SMT process timed out in 30099ms, After SMT, problems are : Problem set: 4 solved, 393 unsolved
Search for dead transitions found 4 dead transitions in 30102ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/495 places, 394/437 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32259 ms. Remains : 456/495 places, 394/437 transitions.
[2026-05-24 10:54:40] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:54:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:54:40] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-24 10:54:40] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:54:40] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:54:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15004462776369108341.gal : 1 ms
[2026-05-24 10:54:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4052424219323819963.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/CTLFireability15004462776369108341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4052424219323819963.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 10:55:10] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:55:10] [INFO ] Applying decomposition
[2026-05-24 10:55:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14643570417398544270.txt' '-o' '/tmp/graph14643570417398544270.bin' '-w' '/tmp/graph14643570417398544270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14643570417398544270.bin' '-l' '-1' '-v' '-w' '/tmp/graph14643570417398544270.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:55:10] [INFO ] Decomposing Gal with order
[2026-05-24 10:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:55:10] [INFO ] Removed a total of 234 redundant transitions.
[2026-05-24 10:55:10] [INFO ] Flatten gal took : 38 ms
[2026-05-24 10:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-24 10:55:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4814868431481475201.gal : 3 ms
[2026-05-24 10:55:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6811686345097908020.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/CTLFireability4814868431481475201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6811686345097908020.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41171e+23,1.0811,42252,3391,61,64214,764,1052,186068,63,1977,0


Converting to forward existential form...Done !
original formula: AX(EG(EF(AG((i16.u134.p494==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U !(E(TRUE U !((i16.u134.p494==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t157, t165, t177, t255, t263, t382, t384, t386, t387, i0.i0.u80.t152, i0.i1.u...1176
Using 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 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
(forward)formula 0,0,4.32452,157672,1,0,286069,764,7179,710770,324,1977,727064
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 437/437 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 465 transition count 407
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 465 transition count 407
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 456 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 456 transition count 398
Applied a total of 78 rules in 27 ms. Remains 456 /495 variables (removed 39) and now considering 398/437 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13827026565490923937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10169983007323071428.kers'
[2026-05-24 10:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13827026565490923937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10169983007323071428.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 398 rows 456 cols 1303 entries
Finished phase 1 with 289 SingleSign rule and 72 generalized
[2026-05-24 10:55:14] [INFO ] Computed 95 invariants in 8 ms
Computed 95 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-10169983007323071428.kers
Total runtime 10 ms.
[2026-05-24 10:55:14] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-24 10:55:14] [INFO ] Invariant cache hit.
[2026-05-24 10:55:16] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2026-05-24 10:55:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 20/175 constraints. Problems are: Problem set: 4 solved, 393 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 4 solved, 393 unsolved
Search for dead transitions found 4 dead transitions in 30129ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/495 places, 394/437 transitions.
Applied a total of 0 rules in 11 ms. Remains 456 /456 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32238 ms. Remains : 456/495 places, 394/437 transitions.
[2026-05-24 10:55:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:55:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:55:46] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-24 10:55:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 10:55:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 10:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10181565706722750916.gal : 2 ms
[2026-05-24 10:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4616859354744412720.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/CTLFireability10181565706722750916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4616859354744412720.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 10:56:16] [INFO ] Flatten gal took : 9 ms
[2026-05-24 10:56:16] [INFO ] Applying decomposition
[2026-05-24 10:56:16] [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/graph6075856716638046707.txt' '-o' '/tmp/graph6075856716638046707.bin' '-w' '/tmp/graph6075856716638046707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6075856716638046707.bin' '-l' '-1' '-v' '-w' '/tmp/graph6075856716638046707.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:56:17] [INFO ] Decomposing Gal with order
[2026-05-24 10:56:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:56:17] [INFO ] Removed a total of 233 redundant transitions.
[2026-05-24 10:56:17] [INFO ] Flatten gal took : 13 ms
[2026-05-24 10:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-24 10:56:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14045668682793930284.gal : 3 ms
[2026-05-24 10:56:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4829069108049418857.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/CTLFireability14045668682793930284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4829069108049418857.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41005e+23,1.25273,44444,4095,68,68872,850,1040,188215,68,2189,0


Converting to forward existential form...Done !
original formula: EX(AX(EF(((i0.u136.p509==0)&&(i0.u136.p508==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U ((i0.u136.p509==0)&&(i0.u136.p508==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t157, t161, t177, t255, t263, t383, t384, t386, t387, i0.t28, i0.t10, i0.u120...1147
(forward)formula 0,1,4.78875,148780,1,0,249306,850,7051,680416,319,2268,730830
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-24 10:56:21] [INFO ] Flatten gal took : 8 ms
[2026-05-24 10:56:21] [INFO ] Flatten gal took : 11 ms
[2026-05-24 10:56:21] [INFO ] Applying decomposition
[2026-05-24 10:56:21] [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/graph8239896295603513705.txt' '-o' '/tmp/graph8239896295603513705.bin' '-w' '/tmp/graph8239896295603513705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8239896295603513705.bin' '-l' '-1' '-v' '-w' '/tmp/graph8239896295603513705.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:56:21] [INFO ] Decomposing Gal with order
[2026-05-24 10:56:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:56:21] [INFO ] Removed a total of 258 redundant transitions.
[2026-05-24 10:56:21] [INFO ] Flatten gal took : 14 ms
[2026-05-24 10:56:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 10:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6260036041879946776.gal : 3 ms
[2026-05-24 10:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11981262404450128082.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/CTLFireability6260036041879946776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11981262404450128082.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.33764e+23,5.10121,170596,6493,62,238593,799,1075,1.44193e+06,70,2025,0


Converting to forward existential form...Done !
original formula: AG(AF(((!(A(EG((i0.u138.p520==1)) U (((i8.u123.p375==1)&&(i3.u21.p52==1))&&(i18.u139.p427==1)))) + AX((i18.u141.p434==0))) + (EX((i18.u15...194
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(!((E(!((((i8.u123.p375==1)&&(i3.u21.p52==1))&&(i18.u139.p427==1))) U (!(EG((i0.u138....397
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t12, t84, t189, t193, t291, t301, t425, t429, i0.t10, i0.u138.t14, i0.u138.t16, i...1427
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 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,1,337.196,2200592,1,0,2.24195e+06,799,3319,1.47858e+07,168,2285,1643332
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((i2.u13.p29==0) * (EX((i9.u91.p255==0)) + EG((i0.u138.p425==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i2.u13.p29==0)))] = FALSE * [((FwdU(Init,TRUE) * !(EG((i0.u138.p425==0)))) * !(EX((i9.u9...178
(forward)formula 1,0,473.427,2424056,1,0,2.48551e+06,799,2290,1.59995e+07,144,2285,1205970
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (A((i18.u158.p494==1) U !(EF((i0.u138.p472==1)))) + ((EF((((EX(((((i12.u29.p111==1)&&(i12.u106.p304==1))&&(i12.u149.p570==1))||(((i12.u36...619
=> equivalent forward existential formula: (([((Init * !(!((E(!(!(E(TRUE U (i0.u138.p472==1)))) U (!((i18.u158.p494==1)) * !(!(E(TRUE U (i0.u138.p472==1)))...1517
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 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 2,0,738.559,2667116,1,0,2.81312e+06,799,3718,1.59995e+07,188,2285,2187067
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1588804 ms.

BK_STOP 1779620921944

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

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