About the Execution of ITS-Tools for BusinessProcesses-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.707 | 3600000.00 | 3424879.00 | 215147.40 | FTT???T??T???T?F | normal |
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-177946842100602.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-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100602
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:49 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 192K 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-20-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779629581879
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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 13:33:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 13:33:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:33:03] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-24 13:33:03] [INFO ] Transformed 782 places.
[2026-05-24 13:33:03] [INFO ] Transformed 697 transitions.
[2026-05-24 13:33:03] [INFO ] Found NUPN structural information;
[2026-05-24 13:33:03] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
Support contains 114 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 102 place count 617 transition count 550
Iterating global reduction 1 with 88 rules applied. Total rules applied 190 place count 617 transition count 550
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 232 place count 575 transition count 508
Iterating global reduction 1 with 42 rules applied. Total rules applied 274 place count 575 transition count 508
Applied a total of 274 rules in 142 ms. Remains 575 /719 variables (removed 144) and now considering 508/638 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6211627683575539352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18280876557606121299.kers'
[2026-05-24 13:33:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6211627683575539352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18280876557606121299.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 508 rows 575 cols 1583 entries
Finished phase 1 with 389 SingleSign rule and 79 generalized
[2026-05-24 13:33:03] [INFO ] Computed 107 invariants in 7 ms
Computed 107 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-18280876557606121299.kers
Total runtime 8 ms.
[2026-05-24 13:33:03] [INFO ] Implicit Places using invariants in 512 ms returned []
[2026-05-24 13:33:04] [INFO ] Invariant cache hit.
[2026-05-24 13:33:04] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Running 507 sub problems to find dead transitions.
[2026-05-24 13:33:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (OVERLAPS) 1/575 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/1083 variables, and 167 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/575 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (OVERLAPS) 1/575 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 507 unsolved
SMT process timed out in 60301ms, After SMT, problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Starting structural reductions in LTL mode, iteration 1 : 575/719 places, 508/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61742 ms. Remains : 575/719 places, 508/638 transitions.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Applied a total of 0 rules in 23 ms. Remains 575 /575 variables (removed 0) and now considering 508/508 (removed 0) transitions.
[2026-05-24 13:34:05] [INFO ] Invariant cache hit.
[2026-05-24 13:34:05] [INFO ] Implicit Places using invariants in 522 ms returned []
[2026-05-24 13:34:05] [INFO ] Invariant cache hit.
[2026-05-24 13:34:06] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1279 ms. Remains : 575/575 places, 508/508 transitions.
Support contains 114 out of 575 places after structural reductions.
[2026-05-24 13:34:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 13:34:06] [INFO ] Flatten gal took : 69 ms
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 13:34:06] [INFO ] Flatten gal took : 40 ms
[2026-05-24 13:34:06] [INFO ] Input system was already deterministic with 508 transitions.
Support contains 105 out of 575 places (down from 114) after GAL structural reductions.
RANDOM walk for 40000 steps (195 resets) in 1992 ms. (20 steps per ms) remains 24/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
[2026-05-24 13:34:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 186/231 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 264/495 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 67/562 variables, 18/106 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/126 constraints. Problems are: Problem set: 2 solved, 22 unsolved
SMT process timed out in 5379ms, After SMT, problems are : Problem set: 2 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (complete) has 1253 edges and 575 vertex of which 569 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 569 transition count 432
Reduce places removed 70 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 74 rules applied. Total rules applied 145 place count 499 transition count 428
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 149 place count 495 transition count 428
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 149 place count 495 transition count 326
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 371 place count 375 transition count 326
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 387 place count 359 transition count 310
Iterating global reduction 3 with 16 rules applied. Total rules applied 403 place count 359 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 403 place count 359 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 408 place count 356 transition count 308
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 660 place count 229 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 661 place count 229 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 665 place count 227 transition count 189
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 672 place count 227 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 673 place count 226 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 674 place count 225 transition count 188
Applied a total of 674 rules in 109 ms. Remains 225 /575 variables (removed 350) and now considering 188/508 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 225/575 places, 188/508 transitions.
RANDOM walk for 40000 steps (2136 resets) in 1059 ms. (37 steps per ms) remains 15/22 properties
BEST_FIRST walk for 4003 steps (39 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (30 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (39 resets) in 30 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (39 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (40 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 12/13 properties
[2026-05-24 13:34:13] [INFO ] Flow matrix only has 187 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14684001556976279023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6526654253776511907.kers'
[2026-05-24 13:34:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14684001556976279023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6526654253776511907.kers]
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 0 ms.
// Phase 1: matrix 187 rows 192 cols 830 entries
Finished phase 1 with 110 SingleSign rule and 30 generalized
[2026-05-24 13:34:13] [INFO ] Computed 85 invariants in 1 ms
Computed 85 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6526654253776511907.kers
Total runtime 2 ms.
[2026-05-24 13:34:13] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 65/89 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 38/127 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 46/173 variables, 13/54 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 4/58 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 15/188 variables, 15/73 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/189 variables, 1/74 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/74 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 187/376 variables, 189/263 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 7/270 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 36/412 variables, 36/306 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 17/323 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 1/324 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 0/324 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/412 variables, 0/324 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 324 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 225/225 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 64/80 variables, 17/17 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/18 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 44/124 variables, 22/40 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 49/173 variables, 13/54 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 5/59 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 15/188 variables, 15/74 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 2/76 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/189 variables, 1/77 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 187/376 variables, 189/266 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 7/273 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 4/277 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/376 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 36/412 variables, 36/313 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 17/330 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 5/335 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 2/337 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/412 variables, 20/357 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/412 variables, 15/372 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/412 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 0/412 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 372 constraints, problems are : Problem set: 3 solved, 9 unsolved in 5511 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 225/225 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6637ms problems are : Problem set: 3 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 782 ms.
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 29 edges and 225 vertex of which 2 / 225 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 224 transition count 183
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 221 transition count 183
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 7 place count 221 transition count 170
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 36 place count 205 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 202 transition count 167
Ensure Unique test removed 1 places
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 201 transition count 167
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 63 place count 191 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 65 place count 190 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 190 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 188 transition count 166
Applied a total of 69 rules in 38 ms. Remains 188 /225 variables (removed 37) and now considering 166/188 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 188/225 places, 166/188 transitions.
RANDOM walk for 40000 steps (1524 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 17486 steps (124 resets) in 40 ms. (426 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2026-05-24 13:34:21] [INFO ] Flatten gal took : 25 ms
[2026-05-24 13:34:21] [INFO ] Flatten gal took : 23 ms
[2026-05-24 13:34:21] [INFO ] Input system was already deterministic with 508 transitions.
Computed a total of 502 stabilizing places and 445 stable transitions
Graph (complete) has 1253 edges and 575 vertex of which 569 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (trivial) has 283 edges and 575 vertex of which 6 / 575 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1247 edges and 570 vertex of which 564 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 563 transition count 410
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 478 transition count 410
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 172 place count 478 transition count 301
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 239 rules applied. Total rules applied 411 place count 348 transition count 301
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 432 place count 327 transition count 280
Ensure Unique test removed 1 places
Iterating global reduction 2 with 22 rules applied. Total rules applied 454 place count 326 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 454 place count 326 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 457 place count 324 transition count 279
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 723 place count 190 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 189 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 725 place count 188 transition count 146
Applied a total of 725 rules in 61 ms. Remains 188 /575 variables (removed 387) and now considering 146/508 (removed 362) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11685477875720399746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6177370149549177689.kers'
[2026-05-24 13:34:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11685477875720399746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6177370149549177689.kers]
Normalized transition count is 145 out of 146 initially.
Culling duplicate invariants (modulo rational): removing 41 columns.
Culled 41 columns in 0 ms.
// Phase 1: matrix 145 rows 147 cols 601 entries
Finished phase 1 with 84 SingleSign rule and 23 generalized
[2026-05-24 13:34:21] [INFO ] Computed 81 invariants in 2 ms
Computed 81 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6177370149549177689.kers
Total runtime 3 ms.
[2026-05-24 13:34:21] [INFO ] Implicit Places using invariants in 160 ms returned [55, 56, 57, 58, 59, 60, 61, 62]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 161 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 180/575 places, 146/508 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 231 ms. Remains : 180/575 places, 146/508 transitions.
[2026-05-24 13:34:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:34:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:34:21] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-24 13:34:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:34:21] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:34:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12899724151391765226.gal : 4 ms
[2026-05-24 13:34:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8344985986151876736.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/CTLFireability12899724151391765226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8344985986151876736.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,9.28028e+10,1.29683,51212,2,10054,5,205119,6,0,865,142030,0
Converting to forward existential form...Done !
original formula: AG(((EF((p14==0)) * !(A((p50==1) U (p738==1)))) * EF((p751==0))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U (p14==0))))] = FALSE * [((FwdU(Init,TRUE) * !(EG(!((p738==1))))) * !(E(!((p738=...259
Reverse transition relation is NOT exact ! Due to transitions t39, t40, t41, t42, t43, t76, t77, t78, t79, t80, t91, t94, t95, t107, t110, t111, t112, t113...353
(forward)formula 0,0,25.9836,797324,1,0,355,4.81808e+06,288,166,6460,3.79098e+06,414
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (complete) has 1253 edges and 575 vertex of which 569 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 568 transition count 424
Reduce places removed 77 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 79 rules applied. Total rules applied 157 place count 491 transition count 422
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 159 place count 489 transition count 422
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 159 place count 489 transition count 309
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 405 place count 356 transition count 309
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 425 place count 336 transition count 289
Ensure Unique test removed 1 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 446 place count 335 transition count 289
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 446 place count 335 transition count 287
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 451 place count 332 transition count 287
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 709 place count 202 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 710 place count 201 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 711 place count 200 transition count 158
Applied a total of 711 rules in 49 ms. Remains 200 /575 variables (removed 375) and now considering 158/508 (removed 350) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18105175621718013008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8453855790918866239.kers'
[2026-05-24 13:34:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18105175621718013008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8453855790918866239.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 158 rows 183 cols 761 entries
Finished phase 1 with 81 SingleSign rule and 37 generalized
[2026-05-24 13:34:47] [INFO ] Computed 82 invariants in 1 ms
Computed 82 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8453855790918866239.kers
Total runtime 1 ms.
[2026-05-24 13:34:48] [INFO ] Implicit Places using invariants in 155 ms returned [55, 62, 63, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 156 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 196/575 places, 158/508 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 213 ms. Remains : 196/575 places, 158/508 transitions.
[2026-05-24 13:34:48] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:34:48] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:34:48] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-24 13:34:48] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:34:48] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:34:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1174474660705772621.gal : 3 ms
[2026-05-24 13:34:48] [INFO ] Time to serialize properties into /tmp/CTLFireability50876619322488256.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/CTLFireability1174474660705772621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability50876619322488256.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66994e+11,1.49368,58616,2,11390,5,229630,6,0,941,216681,0
Converting to forward existential form...Done !
original formula: AG(((E((p705==1) U (((p224==1)&&(p507==1))&&(p684==1))) + EF(((AG((p341==0)) * (p772==0)) * (((p282==0)||(p556==0))||(p747==0))))) + (AF(...197
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((E((p705==1) U (((p224==1)&&(p507==1))&&(p684==1))) + E(TRUE U ((!(E(TRUE U !((p341=...465
Reverse transition relation is NOT exact ! Due to transitions t2, t38, t46, t47, t48, t49, t50, t52, t85, t86, t87, t88, t89, t92, t102, t103, t104, t108, ...375
(forward)formula 0,1,7.45726,246756,1,0,286,1.10452e+06,323,126,7169,601472,317
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 553 transition count 486
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 553 transition count 486
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 544 transition count 477
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 544 transition count 477
Applied a total of 62 rules in 40 ms. Remains 544 /575 variables (removed 31) and now considering 477/508 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6634199069013240820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8990940276122073860.kers'
[2026-05-24 13:34:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6634199069013240820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8990940276122073860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 477 rows 544 cols 1523 entries
Finished phase 1 with 358 SingleSign rule and 79 generalized
[2026-05-24 13:34:55] [INFO ] Computed 107 invariants in 2 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8990940276122073860.kers
Total runtime 5 ms.
[2026-05-24 13:34:56] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-24 13:34:56] [INFO ] Invariant cache hit.
[2026-05-24 13:34:56] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2026-05-24 13:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/544 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/1021 variables, and 167 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/544 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/544 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Problem TDEAD439 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 20/267 constraints. Problems are: Problem set: 1 solved, 475 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 20/287 constraints. Problems are: Problem set: 1 solved, 475 unsolved
SMT process timed out in 60240ms, After SMT, problems are : Problem set: 1 solved, 475 unsolved
Search for dead transitions found 1 dead transitions in 60241ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 544/575 places, 476/508 transitions.
Applied a total of 0 rules in 17 ms. Remains 544 /544 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61577 ms. Remains : 544/575 places, 476/508 transitions.
[2026-05-24 13:35:57] [INFO ] Flatten gal took : 17 ms
[2026-05-24 13:35:57] [INFO ] Flatten gal took : 16 ms
[2026-05-24 13:35:57] [INFO ] Input system was already deterministic with 476 transitions.
[2026-05-24 13:35:57] [INFO ] Flatten gal took : 15 ms
[2026-05-24 13:35:57] [INFO ] Flatten gal took : 13 ms
[2026-05-24 13:35:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14691880736273084167.gal : 4 ms
[2026-05-24 13:35:57] [INFO ] Time to serialize properties into /tmp/CTLFireability1249611467680222996.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/CTLFireability14691880736273084167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1249611467680222996.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:36:27] [INFO ] Flatten gal took : 14 ms
[2026-05-24 13:36:27] [INFO ] Applying decomposition
[2026-05-24 13:36:27] [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/graph13224061793738080565.txt' '-o' '/tmp/graph13224061793738080565.bin' '-w' '/tmp/graph13224061793738080565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13224061793738080565.bin' '-l' '-1' '-v' '-w' '/tmp/graph13224061793738080565.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:36:27] [INFO ] Decomposing Gal with order
[2026-05-24 13:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:36:27] [INFO ] Removed a total of 274 redundant transitions.
[2026-05-24 13:36:27] [INFO ] Flatten gal took : 80 ms
[2026-05-24 13:36:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2026-05-24 13:36:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12058956290473846790.gal : 10 ms
[2026-05-24 13:36:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15210017180384807840.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/CTLFireability12058956290473846790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15210017180384807840.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 550 transition count 483
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 550 transition count 483
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 539 transition count 472
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 539 transition count 472
Applied a total of 72 rules in 49 ms. Remains 539 /575 variables (removed 36) and now considering 472/508 (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-14663022631265946071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13842642924213717682.kers'
[2026-05-24 13:36:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14663022631265946071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13842642924213717682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 472 rows 539 cols 1513 entries
Finished phase 1 with 353 SingleSign rule and 79 generalized
[2026-05-24 13:36:57] [INFO ] Computed 107 invariants in 4 ms
Computed 107 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13842642924213717682.kers
Total runtime 6 ms.
[2026-05-24 13:36:58] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-24 13:36:58] [INFO ] Invariant cache hit.
[2026-05-24 13:36:59] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-24 13:36:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1011 variables, and 167 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 4 solved, 467 unsolved
Problem TDEAD418 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 464 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 7 solved, 464 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 7 solved, 464 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/287 constraints. Problems are: Problem set: 7 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/1011 variables, and 287 constraints, problems are : Problem set: 7 solved, 464 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 0/471 constraints, Known Traps: 180/180 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 7 solved, 464 unsolved
Search for dead transitions found 7 dead transitions in 60077ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/575 places, 465/508 transitions.
Applied a total of 0 rules in 10 ms. Remains 539 /539 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61442 ms. Remains : 539/575 places, 465/508 transitions.
[2026-05-24 13:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:37:59] [INFO ] Input system was already deterministic with 465 transitions.
[2026-05-24 13:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:37:59] [INFO ] Time to serialize gal into /tmp/CTLFireability222258934803138206.gal : 3 ms
[2026-05-24 13:37:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16958127989443948453.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/CTLFireability222258934803138206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16958127989443948453.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:38:29] [INFO ] Flatten gal took : 10 ms
[2026-05-24 13:38:29] [INFO ] Applying decomposition
[2026-05-24 13:38:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17953117060806301866.txt' '-o' '/tmp/graph17953117060806301866.bin' '-w' '/tmp/graph17953117060806301866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17953117060806301866.bin' '-l' '-1' '-v' '-w' '/tmp/graph17953117060806301866.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:38:29] [INFO ] Decomposing Gal with order
[2026-05-24 13:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:38:29] [INFO ] Removed a total of 247 redundant transitions.
[2026-05-24 13:38:29] [INFO ] Flatten gal took : 57 ms
[2026-05-24 13:38:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2026-05-24 13:38:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8257539746321157102.gal : 23 ms
[2026-05-24 13:38:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4889968166450882834.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/CTLFireability8257539746321157102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4889968166450882834.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 552 transition count 485
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 552 transition count 485
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 541 transition count 474
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 541 transition count 474
Applied a total of 68 rules in 42 ms. Remains 541 /575 variables (removed 34) and now considering 474/508 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2211828260471167821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15516080536180892793.kers'
[2026-05-24 13:38:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2211828260471167821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15516080536180892793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 541 cols 1517 entries
Finished phase 1 with 355 SingleSign rule and 79 generalized
[2026-05-24 13:38:59] [INFO ] Computed 107 invariants in 3 ms
Computed 107 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15516080536180892793.kers
Total runtime 5 ms.
[2026-05-24 13:39:00] [INFO ] Implicit Places using invariants in 424 ms returned []
[2026-05-24 13:39:00] [INFO ] Invariant cache hit.
[2026-05-24 13:39:01] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2026-05-24 13:39:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/1015 variables, and 167 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/541 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/541 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SMT process timed out in 60065ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 541/575 places, 474/508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61602 ms. Remains : 541/575 places, 474/508 transitions.
[2026-05-24 13:40:01] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:40:01] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:40:01] [INFO ] Input system was already deterministic with 474 transitions.
[2026-05-24 13:40:01] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:40:01] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:40:01] [INFO ] Time to serialize gal into /tmp/CTLFireability18404036546026683101.gal : 2 ms
[2026-05-24 13:40:01] [INFO ] Time to serialize properties into /tmp/CTLFireability949046071256689150.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/CTLFireability18404036546026683101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability949046071256689150.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:40:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:40:31] [INFO ] Applying decomposition
[2026-05-24 13:40:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14055076748446324396.txt' '-o' '/tmp/graph14055076748446324396.bin' '-w' '/tmp/graph14055076748446324396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14055076748446324396.bin' '-l' '-1' '-v' '-w' '/tmp/graph14055076748446324396.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:40:31] [INFO ] Decomposing Gal with order
[2026-05-24 13:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:40:31] [INFO ] Removed a total of 283 redundant transitions.
[2026-05-24 13:40:31] [INFO ] Flatten gal took : 49 ms
[2026-05-24 13:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2026-05-24 13:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1642639176551948801.gal : 4 ms
[2026-05-24 13:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13057326318857137947.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/CTLFireability1642639176551948801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13057326318857137947.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (trivial) has 285 edges and 575 vertex of which 6 / 575 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1247 edges and 570 vertex of which 564 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 563 transition count 410
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 478 transition count 410
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 172 place count 478 transition count 299
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 416 place count 345 transition count 299
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 437 place count 324 transition count 278
Ensure Unique test removed 1 places
Iterating global reduction 2 with 22 rules applied. Total rules applied 459 place count 323 transition count 278
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 459 place count 323 transition count 277
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 461 place count 322 transition count 277
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 731 place count 186 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 732 place count 185 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 733 place count 184 transition count 142
Applied a total of 733 rules in 73 ms. Remains 184 /575 variables (removed 391) and now considering 142/508 (removed 366) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17754495607288934715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2259792809823472810.kers'
[2026-05-24 13:41:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17754495607288934715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2259792809823472810.kers]
Normalized transition count is 141 out of 142 initially.
Culling duplicate invariants (modulo rational): removing 59 columns.
Culled 59 columns in 0 ms.
// Phase 1: matrix 141 rows 125 cols 534 entries
Finished phase 1 with 90 SingleSign rule and 13 generalized
[2026-05-24 13:41:01] [INFO ] Computed 81 invariants in 1 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2259792809823472810.kers
Total runtime 1 ms.
[2026-05-24 13:41:02] [INFO ] Implicit Places using invariants in 189 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 58, 59, 60, 158]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 192 ms to find 24 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 160/575 places, 142/508 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 270 ms. Remains : 160/575 places, 142/508 transitions.
[2026-05-24 13:41:02] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:41:02] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:41:02] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-24 13:41:02] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 5048 steps (663 resets) in 48 ms. (103 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 13:41:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:41:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3096147217336948048.gal : 1 ms
[2026-05-24 13:41:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10317389978823029398.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3096147217336948048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10317389978823029398.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 550 transition count 483
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 550 transition count 483
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 539 transition count 472
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 539 transition count 472
Applied a total of 72 rules in 47 ms. Remains 539 /575 variables (removed 36) and now considering 472/508 (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-14238087060446458059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15108006598037127642.kers'
[2026-05-24 13:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14238087060446458059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15108006598037127642.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 472 rows 539 cols 1513 entries
Finished phase 1 with 353 SingleSign rule and 79 generalized
[2026-05-24 13:41:02] [INFO ] Computed 107 invariants in 2 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15108006598037127642.kers
Total runtime 5 ms.
[2026-05-24 13:41:02] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-24 13:41:02] [INFO ] Invariant cache hit.
[2026-05-24 13:41:03] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2026-05-24 13:41:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1011 variables, and 167 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 471 unsolved
SMT process timed out in 60093ms, After SMT, problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 539/575 places, 472/508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61466 ms. Remains : 539/575 places, 472/508 transitions.
[2026-05-24 13:42:03] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:42:03] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:42:03] [INFO ] Input system was already deterministic with 472 transitions.
[2026-05-24 13:42:03] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:42:03] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:42:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5324363485611350947.gal : 3 ms
[2026-05-24 13:42:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7833269937473336486.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/CTLFireability5324363485611350947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7833269937473336486.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:42:33] [INFO ] Flatten gal took : 12 ms
[2026-05-24 13:42:33] [INFO ] Applying decomposition
[2026-05-24 13:42:33] [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/graph4948583882207948677.txt' '-o' '/tmp/graph4948583882207948677.bin' '-w' '/tmp/graph4948583882207948677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4948583882207948677.bin' '-l' '-1' '-v' '-w' '/tmp/graph4948583882207948677.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:42:33] [INFO ] Decomposing Gal with order
[2026-05-24 13:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:42:33] [INFO ] Removed a total of 280 redundant transitions.
[2026-05-24 13:42:33] [INFO ] Flatten gal took : 19 ms
[2026-05-24 13:42:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-24 13:42:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12060625416466471589.gal : 6 ms
[2026-05-24 13:42:33] [INFO ] Time to serialize properties into /tmp/CTLFireability664979687623359136.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/CTLFireability12060625416466471589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability664979687623359136.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 549 transition count 482
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 549 transition count 482
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 538 transition count 471
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 538 transition count 471
Applied a total of 74 rules in 40 ms. Remains 538 /575 variables (removed 37) and now considering 471/508 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12141784654488577685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4091573456748472031.kers'
[2026-05-24 13:43:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12141784654488577685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4091573456748472031.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 538 cols 1511 entries
Finished phase 1 with 352 SingleSign rule and 79 generalized
[2026-05-24 13:43:03] [INFO ] Computed 107 invariants in 9 ms
Computed 107 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4091573456748472031.kers
Total runtime 12 ms.
[2026-05-24 13:43:04] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-24 13:43:04] [INFO ] Invariant cache hit.
[2026-05-24 13:43:05] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:43:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1009 variables, and 167 constraints, problems are : Problem set: 7 solved, 463 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 60/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 20 solved, 450 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 450 unsolved
SMT process timed out in 60174ms, After SMT, problems are : Problem set: 20 solved, 450 unsolved
Search for dead transitions found 20 dead transitions in 60178ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/575 places, 451/508 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61513 ms. Remains : 538/575 places, 451/508 transitions.
[2026-05-24 13:44:05] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:44:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:44:05] [INFO ] Input system was already deterministic with 451 transitions.
[2026-05-24 13:44:05] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:44:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:44:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15179976602004844197.gal : 2 ms
[2026-05-24 13:44:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16596359098026414827.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/CTLFireability15179976602004844197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16596359098026414827.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:44:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:44:35] [INFO ] Applying decomposition
[2026-05-24 13:44:35] [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/graph10106374728910330191.txt' '-o' '/tmp/graph10106374728910330191.bin' '-w' '/tmp/graph10106374728910330191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10106374728910330191.bin' '-l' '-1' '-v' '-w' '/tmp/graph10106374728910330191.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:44:35] [INFO ] Decomposing Gal with order
[2026-05-24 13:44:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:44:35] [INFO ] Removed a total of 195 redundant transitions.
[2026-05-24 13:44:35] [INFO ] Flatten gal took : 32 ms
[2026-05-24 13:44:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 23 ms.
[2026-05-24 13:44:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16354737038357775988.gal : 5 ms
[2026-05-24 13:44:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8021869172852963506.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/CTLFireability16354737038357775988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8021869172852963506.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 6 / 575 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1247 edges and 570 vertex of which 564 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 563 transition count 410
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 478 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 477 transition count 409
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 174 place count 477 transition count 300
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 412 place count 348 transition count 300
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 432 place count 328 transition count 280
Ensure Unique test removed 1 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 453 place count 327 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 453 place count 327 transition count 279
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 455 place count 326 transition count 279
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 719 place count 193 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 720 place count 192 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 721 place count 191 transition count 147
Applied a total of 721 rules in 44 ms. Remains 191 /575 variables (removed 384) and now considering 147/508 (removed 361) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7375851262818105931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18190240374418883630.kers'
[2026-05-24 13:45:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7375851262818105931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18190240374418883630.kers]
Normalized transition count is 146 out of 147 initially.
Culling duplicate invariants (modulo rational): removing 51 columns.
Culled 51 columns in 0 ms.
// Phase 1: matrix 146 rows 140 cols 574 entries
Finished phase 1 with 89 SingleSign rule and 19 generalized
[2026-05-24 13:45:05] [INFO ] Computed 83 invariants in 4 ms
Computed 83 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18190240374418883630.kers
Total runtime 6 ms.
[2026-05-24 13:45:06] [INFO ] Implicit Places using invariants in 170 ms returned [39, 40, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 61, 62, 63, 64, 164]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 172 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 171/575 places, 147/508 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 221 ms. Remains : 171/575 places, 147/508 transitions.
[2026-05-24 13:45:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:45:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:45:06] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-24 13:45:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:45:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 13:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2396727175648379723.gal : 1 ms
[2026-05-24 13:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11247473859040822964.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/CTLFireability2396727175648379723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11247473859040822964.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13128e+11,1.52312,61016,2,9386,5,274725,6,0,830,150280,0
Converting to forward existential form...Done !
original formula: E(!(((!((EF((p26==1)) + !(((p210==1)||(p719==1))))) * (p288==1)) * EF((p738==1)))) U (p578==1))
=> equivalent forward existential formula: [(FwdU(Init,!(((!((E(TRUE U (p26==1)) + !(((p210==1)||(p719==1))))) * (p288==1)) * E(TRUE U (p738==1))))) * (p57...171
Reverse transition relation is NOT exact ! Due to transitions t3, t34, t37, t38, t39, t40, t41, t75, t76, t77, t78, t79, t82, t96, t97, t98, t110, t112, t1...361
(forward)formula 0,1,6.5161,181464,1,0,246,899906,284,111,6208,448399,283
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 549 transition count 482
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 549 transition count 482
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 538 transition count 471
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 538 transition count 471
Applied a total of 74 rules in 31 ms. Remains 538 /575 variables (removed 37) and now considering 471/508 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2041435036188338911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18190066634556334402.kers'
[2026-05-24 13:45:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2041435036188338911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18190066634556334402.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 471 rows 538 cols 1511 entries
Finished phase 1 with 352 SingleSign rule and 79 generalized
[2026-05-24 13:45:12] [INFO ] Computed 107 invariants in 10 ms
Computed 107 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-18190066634556334402.kers
Total runtime 11 ms.
[2026-05-24 13:45:13] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-24 13:45:13] [INFO ] Invariant cache hit.
[2026-05-24 13:45:13] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2026-05-24 13:45:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1009 variables, and 167 constraints, problems are : Problem set: 7 solved, 463 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 89/104 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 3/107 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 60/167 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 7 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 7 solved, 463 unsolved
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 20 solved, 450 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1009 variables, and 278 constraints, problems are : Problem set: 20 solved, 450 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 171/171 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 20 solved, 450 unsolved
Search for dead transitions found 20 dead transitions in 60082ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/575 places, 451/508 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61430 ms. Remains : 538/575 places, 451/508 transitions.
[2026-05-24 13:46:14] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:46:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:46:14] [INFO ] Input system was already deterministic with 451 transitions.
[2026-05-24 13:46:14] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:46:14] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:46:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16515320049471384659.gal : 2 ms
[2026-05-24 13:46:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3121955766440340464.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/CTLFireability16515320049471384659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3121955766440340464.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:46:44] [INFO ] Flatten gal took : 5 ms
[2026-05-24 13:46:44] [INFO ] Applying decomposition
[2026-05-24 13:46:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9599881310852809165.txt' '-o' '/tmp/graph9599881310852809165.bin' '-w' '/tmp/graph9599881310852809165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9599881310852809165.bin' '-l' '-1' '-v' '-w' '/tmp/graph9599881310852809165.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:46:44] [INFO ] Decomposing Gal with order
[2026-05-24 13:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:46:44] [INFO ] Removed a total of 191 redundant transitions.
[2026-05-24 13:46:44] [INFO ] Flatten gal took : 22 ms
[2026-05-24 13:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2026-05-24 13:46:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13863829577661679476.gal : 5 ms
[2026-05-24 13:46:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11225415453164963532.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/CTLFireability13863829577661679476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11225415453164963532.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (complete) has 1253 edges and 575 vertex of which 569 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 568 transition count 426
Reduce places removed 75 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 153 place count 493 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 491 transition count 424
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 155 place count 491 transition count 316
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 391 place count 363 transition count 316
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 408 place count 346 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 426 place count 345 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 426 place count 345 transition count 297
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 431 place count 342 transition count 297
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 675 place count 219 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 676 place count 218 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 677 place count 217 transition count 175
Applied a total of 677 rules in 35 ms. Remains 217 /575 variables (removed 358) and now considering 175/508 (removed 333) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5962137222590600430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14657084315187508665.kers'
[2026-05-24 13:47:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5962137222590600430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14657084315187508665.kers]
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 0 ms.
// Phase 1: matrix 175 rows 184 cols 751 entries
Finished phase 1 with 104 SingleSign rule and 31 generalized
[2026-05-24 13:47:14] [INFO ] Computed 82 invariants in 1 ms
Computed 82 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14657084315187508665.kers
Total runtime 3 ms.
[2026-05-24 13:47:14] [INFO ] Implicit Places using invariants in 382 ms returned [58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 399 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 203/575 places, 175/508 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 438 ms. Remains : 203/575 places, 175/508 transitions.
[2026-05-24 13:47:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:47:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:47:14] [INFO ] Input system was already deterministic with 175 transitions.
[2026-05-24 13:47:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:47:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:47:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10685996201183289608.gal : 1 ms
[2026-05-24 13:47:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14210197609195908669.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/CTLFireability10685996201183289608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14210197609195908669.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,2.41822e+13,11.2374,334888,2,95430,5,1.07063e+06,6,0,987,1.11813e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 13:47:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:47:44] [INFO ] Applying decomposition
[2026-05-24 13:47:44] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17858613832373568835.txt' '-o' '/tmp/graph17858613832373568835.bin' '-w' '/tmp/graph17858613832373568835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17858613832373568835.bin' '-l' '-1' '-v' '-w' '/tmp/graph17858613832373568835.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:47:44] [INFO ] Decomposing Gal with order
[2026-05-24 13:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:47:44] [INFO ] Removed a total of 112 redundant transitions.
[2026-05-24 13:47:44] [INFO ] Flatten gal took : 19 ms
[2026-05-24 13:47:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 6 ms.
[2026-05-24 13:47:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4176525403301229875.gal : 2 ms
[2026-05-24 13:47:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10762881543105247015.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/CTLFireability4176525403301229875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10762881543105247015.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41822e+13,5.97842,187136,1498,578,312600,4943,641,949960,199,21157,0
Converting to forward existential form...Done !
original formula: A(!(EG((((E(((i10.u43.p574==1)&&(i1.u4.p125==1)) U (i5.i0.u53.p685!=1)) + (((i4.i0.u5.p186==1)&&(i9.i1.u26.p491==1))&&(i10.u54.p747==1)))...595
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(E(TRUE U ((i4.i0.u0.p26==1)||(i10.u32.p520==1))) U (((!(E(TRUE U !((i4.i0.u5.p187==1)))) *...1472
Reverse transition relation is NOT exact ! Due to transitions t45, t78, t85, t86, t87, t88, t101, t102, t103, t104, t105, t110, t128, t136, t144, t145, t14...506
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 550 transition count 483
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 550 transition count 483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 540 transition count 473
Applied a total of 70 rules in 32 ms. Remains 540 /575 variables (removed 35) and now considering 473/508 (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-5859085340741080918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8934172355711574425.kers'
[2026-05-24 13:48:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5859085340741080918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8934172355711574425.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 473 rows 540 cols 1515 entries
Finished phase 1 with 354 SingleSign rule and 79 generalized
[2026-05-24 13:48:15] [INFO ] Computed 107 invariants in 3 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8934172355711574425.kers
Total runtime 4 ms.
[2026-05-24 13:48:15] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-24 13:48:15] [INFO ] Invariant cache hit.
[2026-05-24 13:48:16] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-24 13:48:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1013 variables, and 167 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 3 solved, 469 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/287 constraints. Problems are: Problem set: 3 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1013 variables, and 297 constraints, problems are : Problem set: 3 solved, 469 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 190/190 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 3 solved, 469 unsolved
Search for dead transitions found 3 dead transitions in 60091ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/575 places, 470/508 transitions.
Applied a total of 0 rules in 9 ms. Remains 540 /540 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61487 ms. Remains : 540/575 places, 470/508 transitions.
[2026-05-24 13:49:16] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:49:16] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:49:16] [INFO ] Input system was already deterministic with 470 transitions.
[2026-05-24 13:49:16] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:49:16] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:49:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8230780066841389465.gal : 2 ms
[2026-05-24 13:49:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13353330096043486641.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/CTLFireability8230780066841389465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13353330096043486641.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:49:46] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:49:46] [INFO ] Applying decomposition
[2026-05-24 13:49:46] [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/graph2235878657036461659.txt' '-o' '/tmp/graph2235878657036461659.bin' '-w' '/tmp/graph2235878657036461659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2235878657036461659.bin' '-l' '-1' '-v' '-w' '/tmp/graph2235878657036461659.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:49:46] [INFO ] Decomposing Gal with order
[2026-05-24 13:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:49:46] [INFO ] Removed a total of 259 redundant transitions.
[2026-05-24 13:49:46] [INFO ] Flatten gal took : 15 ms
[2026-05-24 13:49:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2026-05-24 13:49:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4367254668005868568.gal : 5 ms
[2026-05-24 13:49:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1283976294483753780.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/CTLFireability4367254668005868568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1283976294483753780.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,2.00936e+34,10.3332,247068,9790,159,422058,1649,1222,1.20189e+06,71,4173,0
Converting to forward existential form...Done !
original formula: A(!(AX((i19.u174.p731==1))) U AG(((EG((i13.i0.u86.p285==1)) + !((AG(((i17.i1.u187.p771==1)&&(i17.i0.u188.p774==1))) + AF((i18.i1.u62.p213...259
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((EG((i13.i0.u86.p285==1)) + !((!(E(TRUE U !(((i17.i1.u187.p771==1)&&(i17.i0.u188....852
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t204, t208, t297, t315, t358, t372, t374, t377, t379, t381, t382, t383, t386,...1495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Graph (complete) has 1253 edges and 575 vertex of which 571 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 570 transition count 425
Reduce places removed 78 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 80 rules applied. Total rules applied 159 place count 492 transition count 423
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 161 place count 490 transition count 423
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 161 place count 490 transition count 306
Deduced a syphon composed of 117 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 416 place count 352 transition count 306
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 438 place count 330 transition count 284
Ensure Unique test removed 1 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 461 place count 329 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 461 place count 329 transition count 282
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 466 place count 326 transition count 282
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 728 place count 194 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 193 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 192 transition count 151
Applied a total of 730 rules in 55 ms. Remains 192 /575 variables (removed 383) and now considering 151/508 (removed 357) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1733426258663766443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10663028109037122719.kers'
[2026-05-24 13:50:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1733426258663766443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10663028109037122719.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 0 ms.
// Phase 1: matrix 151 rows 152 cols 659 entries
Finished phase 1 with 80 SingleSign rule and 31 generalized
[2026-05-24 13:50:16] [INFO ] Computed 81 invariants in 0 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10663028109037122719.kers
Total runtime 1 ms.
[2026-05-24 13:50:17] [INFO ] Implicit Places using invariants in 300 ms returned [34, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 311 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 176/575 places, 151/508 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 369 ms. Remains : 176/575 places, 151/508 transitions.
[2026-05-24 13:50:17] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:50:17] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:50:17] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-24 13:50:17] [INFO ] Flatten gal took : 4 ms
[2026-05-24 13:50:17] [INFO ] Flatten gal took : 3 ms
[2026-05-24 13:50:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3935914004904221396.gal : 1 ms
[2026-05-24 13:50:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18241977851024530646.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/CTLFireability3935914004904221396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18241977851024530646.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,4.14732e+11,1.13852,44384,2,6800,5,165844,6,0,853,176389,0
Converting to forward existential form...Done !
original formula: !(E((((p208==1)&&(p501==1))&&(p747==1)) U (!(EF((EG((p458==1)) + (p354==1)))) * (p655!=1))))
=> equivalent forward existential formula: [((FwdU(Init,(((p208==1)&&(p501==1))&&(p747==1))) * (p655!=1)) * !(E(TRUE U (EG((p458==1)) + (p354==1)))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t7, t34, t42, t43, t44, t45, t46, t47, t80, t81, t82, t83, t84, t96, t97, t98, t101, t102, t1...373
Hit Full ! (commute/partial/dont) 110/80/41
(forward)formula 0,1,7.8659,223932,1,0,301,1.29746e+06,302,131,6490,890700,341
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 550 transition count 483
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 550 transition count 483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 540 transition count 473
Applied a total of 70 rules in 50 ms. Remains 540 /575 variables (removed 35) and now considering 473/508 (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-16337568344242370404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8771921339273028318.kers'
[2026-05-24 13:50:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16337568344242370404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8771921339273028318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 473 rows 540 cols 1515 entries
Finished phase 1 with 354 SingleSign rule and 79 generalized
[2026-05-24 13:50:25] [INFO ] Computed 107 invariants in 3 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8771921339273028318.kers
Total runtime 4 ms.
[2026-05-24 13:50:25] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-24 13:50:25] [INFO ] Invariant cache hit.
[2026-05-24 13:50:26] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-24 13:50:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1013 variables, and 167 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 472 unsolved
SMT process timed out in 60137ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 540/575 places, 473/508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61411 ms. Remains : 540/575 places, 473/508 transitions.
[2026-05-24 13:51:26] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:51:26] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:51:26] [INFO ] Input system was already deterministic with 473 transitions.
[2026-05-24 13:51:26] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:51:26] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:51:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18366234222948485599.gal : 2 ms
[2026-05-24 13:51:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16629543661414763845.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/CTLFireability18366234222948485599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16629543661414763845.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:51:56] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:51:56] [INFO ] Applying decomposition
[2026-05-24 13:51:56] [INFO ] Flatten gal took : 14 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/graph2783349047971824458.txt' '-o' '/tmp/graph2783349047971824458.bin' '-w' '/tmp/graph2783349047971824458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2783349047971824458.bin' '-l' '-1' '-v' '-w' '/tmp/graph2783349047971824458.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:51:56] [INFO ] Decomposing Gal with order
[2026-05-24 13:51:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:51:56] [INFO ] Removed a total of 286 redundant transitions.
[2026-05-24 13:51:56] [INFO ] Flatten gal took : 25 ms
[2026-05-24 13:51:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-24 13:51:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3384532522052028608.gal : 4 ms
[2026-05-24 13:51:56] [INFO ] Time to serialize properties into /tmp/CTLFireability18246402176838226080.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/CTLFireability3384532522052028608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18246402176838226080.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 575/575 places, 508/508 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 550 transition count 483
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 550 transition count 483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 540 transition count 473
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 540 transition count 473
Applied a total of 70 rules in 32 ms. Remains 540 /575 variables (removed 35) and now considering 473/508 (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-5145333922975801526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1341546181017595835.kers'
[2026-05-24 13:52:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5145333922975801526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1341546181017595835.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 473 rows 540 cols 1514 entries
Finished phase 1 with 354 SingleSign rule and 79 generalized
[2026-05-24 13:52:26] [INFO ] Computed 107 invariants in 3 ms
Computed 107 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1341546181017595835.kers
Total runtime 4 ms.
[2026-05-24 13:52:27] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-24 13:52:27] [INFO ] Invariant cache hit.
[2026-05-24 13:52:28] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-24 13:52:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1013 variables, and 167 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 5 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 5 solved, 467 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 5 solved, 467 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 5 solved, 467 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 5 solved, 467 unsolved
SMT process timed out in 60157ms, After SMT, problems are : Problem set: 5 solved, 467 unsolved
Search for dead transitions found 5 dead transitions in 60158ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/575 places, 468/508 transitions.
Applied a total of 0 rules in 9 ms. Remains 540 /540 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61557 ms. Remains : 540/575 places, 468/508 transitions.
[2026-05-24 13:53:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:53:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:53:28] [INFO ] Input system was already deterministic with 468 transitions.
[2026-05-24 13:53:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:53:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6970395397105927248.gal : 2 ms
[2026-05-24 13:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1488378531631895975.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/CTLFireability6970395397105927248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1488378531631895975.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 13:53:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 13:53:58] [INFO ] Applying decomposition
[2026-05-24 13:53:58] [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/graph15689129778840603526.txt' '-o' '/tmp/graph15689129778840603526.bin' '-w' '/tmp/graph15689129778840603526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15689129778840603526.bin' '-l' '-1' '-v' '-w' '/tmp/graph15689129778840603526.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:53:58] [INFO ] Decomposing Gal with order
[2026-05-24 13:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:53:58] [INFO ] Removed a total of 255 redundant transitions.
[2026-05-24 13:53:58] [INFO ] Flatten gal took : 14 ms
[2026-05-24 13:53:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2026-05-24 13:53:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8526813312702835550.gal : 8 ms
[2026-05-24 13:53:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2917368412028732792.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/CTLFireability8526813312702835550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2917368412028732792.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,4.64217e+34,19.0978,401588,13524,89,700457,1234,1208,1.41169e+06,79,3365,0
Converting to forward existential form...Done !
original formula: AG(AX(AX((i7.i1.u125.p468==0))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * !((i7.i1.u125.p468==0)))] = FALSE
(forward)formula 0,0,21.802,401588,1,0,700457,1234,1786,1.41169e+06,110,3365,322830
FORMULA BusinessProcesses-PT-20-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
[2026-05-24 13:54:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 13:54:20] [INFO ] Flatten gal took : 7 ms
[2026-05-24 13:54:20] [INFO ] Applying decomposition
[2026-05-24 13:54:20] [INFO ] Flatten gal took : 29 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/graph6116899209860525696.txt' '-o' '/tmp/graph6116899209860525696.bin' '-w' '/tmp/graph6116899209860525696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6116899209860525696.bin' '-l' '-1' '-v' '-w' '/tmp/graph6116899209860525696.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:54:20] [INFO ] Decomposing Gal with order
[2026-05-24 13:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:54:20] [INFO ] Removed a total of 250 redundant transitions.
[2026-05-24 13:54:20] [INFO ] Flatten gal took : 23 ms
[2026-05-24 13:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2026-05-24 13:54:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13919256027735091390.gal : 4 ms
[2026-05-24 13:54:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12317962241551180735.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/CTLFireability13919256027735091390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12317962241551180735.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54241e+35,445.773,2619948,26178,197,3.26598e+06,1369,1367,9.84708e+06,116,4409,0
Converting to forward existential form...Done !
original formula: AF((EF(EG((i1.u11.p25==1))) + (E(((A((i12.i2.u136.p469==1) U (i3.u14.p32==1)) * (i19.u192.p729==1)) * EX((i18.i0.u3.p8==1))) U AG(((i2.i1...243
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG((i1.u11.p25==1))) + (E(((!((E(!((i3.u14.p32==1)) U (!((i12.i2.u136.p469==1)) * !((i3.u...365
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t57, t84, t232, t326, t407, t409, t414, t418, t426, t432, t434, t436, t438, t...1817
ITS-tools command line returned an error code 139
[2026-05-24 14:14:47] [INFO ] Applying decomposition
[2026-05-24 14:14:47] [INFO ] Flatten gal took : 8 ms
[2026-05-24 14:14:47] [INFO ] Decomposing Gal with order
[2026-05-24 14:14:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:14:47] [INFO ] Removed a total of 142 redundant transitions.
[2026-05-24 14:14:47] [INFO ] Flatten gal took : 19 ms
[2026-05-24 14:14:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 163 ms.
[2026-05-24 14:14:48] [INFO ] Time to serialize gal into /tmp/CTLFireability200710682920309500.gal : 8 ms
[2026-05-24 14:14:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14589053899097662571.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/CTLFireability200710682920309500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14589053899097662571.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 9 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-20"
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-20, 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-177946842100602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 '
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 ;