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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:42 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 47K 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-01-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779608889950

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 07:48:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 07:48:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:48:11] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2026-05-24 07:48:11] [INFO ] Transformed 200 places.
[2026-05-24 07:48:11] [INFO ] Transformed 178 transitions.
[2026-05-24 07:48:11] [INFO ] Found NUPN structural information;
[2026-05-24 07:48:11] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Support contains 119 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 177
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 186 transition count 165
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 186 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 186 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 184 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 184 transition count 162
Applied a total of 30 rules in 32 ms. Remains 184 /199 variables (removed 15) and now considering 162/177 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10223601724082322868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12737652088637879800.kers'
[2026-05-24 07:48:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10223601724082322868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12737652088637879800.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 184 cols 454 entries
Finished phase 1 with 139 SingleSign rule and 16 generalized
[2026-05-24 07:48:11] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12737652088637879800.kers
Total runtime 1 ms.
[2026-05-24 07:48:11] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-24 07:48:11] [INFO ] Invariant cache hit.
[2026-05-24 07:48:11] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-24 07:48:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/184 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Problem TDEAD144 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 20/89 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 20/109 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 160 unsolved
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 19/148 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 17/165 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 20/185 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 20/205 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 10/215 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 20/235 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 20/255 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 8/263 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/184 variables, 2/265 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/184 variables, 18/283 constraints. Problems are: Problem set: 4 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/346 variables, and 283 constraints, problems are : Problem set: 4 solved, 157 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 254/254 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 2/184 variables, 24/27 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 2/29 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 254/283 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 20/303 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 20/323 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 20/343 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 20/363 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 20/383 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 8/391 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 14/405 constraints. Problems are: Problem set: 4 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 13/418 constraints. Problems are: Problem set: 4 solved, 157 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/346 variables, and 419 constraints, problems are : Problem set: 4 solved, 157 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 0/161 constraints, Known Traps: 390/390 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 4 solved, 157 unsolved
Search for dead transitions found 4 dead transitions in 60083ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 184/199 places, 158/177 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 183 transition count 158
Applied a total of 1 rules in 5 ms. Remains 183 /184 variables (removed 1) and now considering 158/158 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1950469905063549331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-917519137751376591.kers'
[2026-05-24 07:49:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1950469905063549331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-917519137751376591.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 158 rows 182 cols 426 entries
Finished phase 1 with 141 SingleSign rule and 12 generalized
[2026-05-24 07:49:11] [INFO ] Computed 30 invariants in 4 ms
Computed 30 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-917519137751376591.kers
Total runtime 4 ms.
[2026-05-24 07:49:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 07:49:11] [INFO ] Invariant cache hit.
[2026-05-24 07:49:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/199 places, 158/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60782 ms. Remains : 183/199 places, 158/177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 183 /183 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2026-05-24 07:49:12] [INFO ] Invariant cache hit.
[2026-05-24 07:49:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 07:49:12] [INFO ] Invariant cache hit.
[2026-05-24 07:49:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2026-05-24 07:49:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 2/183 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 17/138 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 17/191 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/183 variables, 8/222 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/183 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/183 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/183 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/183 variables, 11/242 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/341 variables, and 242 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 212/212 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 2/183 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 212/242 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 17/319 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 17/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/341 variables, and 374 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 0/157 constraints, Known Traps: 344/344 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Finished structural reductions in LTL mode , in 1 iterations and 60198 ms. Remains : 183/183 places, 158/158 transitions.
Support contains 119 out of 183 places after structural reductions.
[2026-05-24 07:50:12] [INFO ] Flatten gal took : 30 ms
[2026-05-24 07:50:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 07:50:12] [INFO ] Flatten gal took : 13 ms
[2026-05-24 07:50:12] [INFO ] Input system was already deterministic with 158 transitions.
Support contains 112 out of 183 places (down from 119) after GAL structural reductions.
RANDOM walk for 40000 steps (470 resets) in 1660 ms. (24 steps per ms) remains 7/76 properties
BEST_FIRST walk for 40002 steps (122 resets) in 210 ms. (189 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (118 resets) in 83 ms. (476 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (102 resets) in 81 ms. (487 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (127 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (82 resets) in 62 ms. (634 steps per ms) remains 1/2 properties
[2026-05-24 07:50:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/144 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/180 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 156/336 variables, 180/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/341 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/341 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/144 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp55 is UNSAT
After SMT solving in domain Int declared 180/341 variables, and 31 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-05-24 07:50:13] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:50:13] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:50:13] [INFO ] Input system was already deterministic with 158 transitions.
Computed a total of 155 stabilizing places and 131 stable transitions
Graph (complete) has 353 edges and 183 vertex of which 181 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 155 transition count 132
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 155 transition count 132
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 144 transition count 121
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 144 transition count 121
Applied a total of 76 rules in 23 ms. Remains 144 /183 variables (removed 39) and now considering 121/158 (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-3107735800588008220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11298475928542042159.kers'
[2026-05-24 07:50:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3107735800588008220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11298475928542042159.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 144 cols 351 entries
Finished phase 1 with 104 SingleSign rule and 12 generalized
[2026-05-24 07:50:13] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11298475928542042159.kers
Total runtime 1 ms.
[2026-05-24 07:50:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 07:50:13] [INFO ] Invariant cache hit.
[2026-05-24 07:50:13] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2026-05-24 07:50:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 198 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10089 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 120/315 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 336 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 40115ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 40116ms
Starting structural reductions in LTL mode, iteration 1 : 144/183 places, 121/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40311 ms. Remains : 144/183 places, 121/158 transitions.
[2026-05-24 07:50:53] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:50:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:50:53] [INFO ] Input system was already deterministic with 121 transitions.
[2026-05-24 07:50:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:50:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:50:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14551875176596874201.gal : 9 ms
[2026-05-24 07:50:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13082629657959082834.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/CTLCardinality14551875176596874201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13082629657959082834.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27482e+10,0.655719,30312,2,15500,5,96935,6,0,698,138134,0


Converting to forward existential form...Done !
original formula: AX(EX(AG((p127!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !((p127!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t29, t30, t32, t35, t38, t41, t44, t47, t52, t55, t58, t62, t63, t66, t67, ...306
(forward)formula 0,0,8.65125,273552,1,0,300,1.10669e+06,264,142,4150,1.1412e+06,300
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Graph (trivial) has 99 edges and 183 vertex of which 7 / 183 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 173 transition count 117
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 141 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 140 transition count 116
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 68 place count 140 transition count 94
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 117 place count 113 transition count 94
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 136 place count 94 transition count 75
Iterating global reduction 3 with 19 rules applied. Total rules applied 155 place count 94 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 94 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 92 transition count 73
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 217 place count 62 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 61 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 60 transition count 44
Applied a total of 219 rules in 37 ms. Remains 60 /183 variables (removed 123) and now considering 44/158 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17798630340964220416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3515464617049366605.kers'
[2026-05-24 07:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17798630340964220416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3515464617049366605.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 43 rows 51 cols 133 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-05-24 07:51:02] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3515464617049366605.kers
Total runtime 1 ms.
[2026-05-24 07:51:02] [INFO ] Implicit Places using invariants in 47 ms returned [9, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/183 places, 44/158 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 89 ms. Remains : 58/183 places, 44/158 transitions.
[2026-05-24 07:51:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:51:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:51:02] [INFO ] Input system was already deterministic with 44 transitions.
[2026-05-24 07:51:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:51:02] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:51:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality4729565540183084429.gal : 1 ms
[2026-05-24 07:51:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality17727246264120494111.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/CTLCardinality4729565540183084429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17727246264120494111.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,3872,0.02448,5012,2,1064,5,5140,6,0,275,4026,0


Converting to forward existential form...Done !
original formula: AG(A(!(((p19==0)||(p32==1))) U EF((((p13==0)||(p23==1)) + (A(((p69==0)||(p7==1)) U (p18==1)) * ((p164==0)||(p112==1)))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(TRUE U (((p13==0)||(p23==1)) + (!((E(!((p18==1)) U (!(((p69==0)||(p7==1))) * !((p18...577
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t6, t9, t12, t14, t22, t25, t28, t29, t36, t40, t41, t42, Intersection with reachabl...226
(forward)formula 0,1,0.452452,23156,1,0,314,108523,125,156,1720,110259,345
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 154 transition count 131
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 154 transition count 131
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 143 transition count 120
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 143 transition count 120
Applied a total of 78 rules in 10 ms. Remains 143 /183 variables (removed 40) and now considering 120/158 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6287925481825193902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8219971563516985717.kers'
[2026-05-24 07:51:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6287925481825193902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8219971563516985717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 143 cols 349 entries
Finished phase 1 with 103 SingleSign rule and 12 generalized
[2026-05-24 07:51:03] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8219971563516985717.kers
Total runtime 1 ms.
[2026-05-24 07:51:03] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-24 07:51:03] [INFO ] Invariant cache hit.
[2026-05-24 07:51:03] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 07:51:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/182 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 193 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11775 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 119/311 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 329 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 41805ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 41807ms
Starting structural reductions in LTL mode, iteration 1 : 143/183 places, 120/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42069 ms. Remains : 143/183 places, 120/158 transitions.
[2026-05-24 07:51:45] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:51:45] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:51:45] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-24 07:51:45] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:51:45] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:51:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality6446044883270858456.gal : 2 ms
[2026-05-24 07:51:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8798148271191436779.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/CTLCardinality6446044883270858456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8798148271191436779.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24738e+10,0.574573,27660,2,14993,5,88735,6,0,693,119299,0


Converting to forward existential form...Done !
original formula: AG(EF(EX(((p98==0)||(p45==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(((p98==0)||(p45==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t31, t34, t37, t40, t43, t46, t51, t54, t57, t61, t62, t65, t66, t69, ...301
(forward)formula 0,0,7.23795,231164,1,0,264,861241,261,124,4033,893698,257
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 157 transition count 134
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 157 transition count 134
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 148 transition count 125
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 148 transition count 125
Applied a total of 68 rules in 8 ms. Remains 148 /183 variables (removed 35) and now considering 125/158 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2530387193103029467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15592879719537300186.kers'
[2026-05-24 07:51:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2530387193103029467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15592879719537300186.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 148 cols 359 entries
Finished phase 1 with 108 SingleSign rule and 12 generalized
[2026-05-24 07:51:52] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15592879719537300186.kers
Total runtime 1 ms.
[2026-05-24 07:51:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 07:51:52] [INFO ] Invariant cache hit.
[2026-05-24 07:51:52] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-24 07:51:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 125/273 variables, 148/220 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/273 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (OVERLAPS) 0/273 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 237 constraints, problems are : Problem set: 0 solved, 124 unsolved in 14358 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 57/85 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 125/273 variables, 148/241 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 124/365 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 5/380 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/273 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 382 constraints, problems are : Problem set: 0 solved, 124 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 44388ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 44388ms
Starting structural reductions in LTL mode, iteration 1 : 148/183 places, 125/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44615 ms. Remains : 148/183 places, 125/158 transitions.
[2026-05-24 07:52:37] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:52:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:52:37] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-24 07:52:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:52:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:52:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12083174889611457368.gal : 1 ms
[2026-05-24 07:52:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality18292151027270294546.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/CTLCardinality12083174889611457368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18292151027270294546.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34172e+10,0.80815,35012,2,16401,5,110182,6,0,718,163967,0


Converting to forward existential form...Done !
original formula: AG((EF((p49==1)) + ((((AG((p138==0)) * EX((p198==0))) * ((p135!=1)&&(p126!=1))) * (((p2==0)&&(p75==1))&&((p198==1)&&((p0==0)||(p86==1))))...210
=> equivalent forward existential formula: (((([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U (p49==1)))),TRUE) * !((p138==0)))] = FALSE * [((FwdU(Init,TRUE) * !(E(T...516
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t11, t13, t25, t29, t30, t32, t35, t39, t40, t42, t45, t48, t51, t56, t59, t62, t66, ...315
(forward)formula 0,0,8.55126,276820,1,0,306,1.04488e+06,273,145,4092,1.00382e+06,304
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 157 transition count 134
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 157 transition count 134
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 147 transition count 124
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 147 transition count 124
Applied a total of 70 rules in 14 ms. Remains 147 /183 variables (removed 36) and now considering 124/158 (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-4433003541790025865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8617746141144018462.kers'
[2026-05-24 07:52:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4433003541790025865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8617746141144018462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 147 cols 357 entries
Finished phase 1 with 107 SingleSign rule and 12 generalized
[2026-05-24 07:52:46] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8617746141144018462.kers
Total runtime 1 ms.
[2026-05-24 07:52:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 07:52:46] [INFO ] Invariant cache hit.
[2026-05-24 07:52:46] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2026-05-24 07:52:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 124/271 variables, 147/215 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 17 (OVERLAPS) 0/271 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/271 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 19 (OVERLAPS) 0/271 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 226 constraints, problems are : Problem set: 0 solved, 123 unsolved in 15340 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 124/271 variables, 147/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 123/346 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/271 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 360 constraints, problems are : Problem set: 0 solved, 123 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 45364ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 45366ms
Starting structural reductions in LTL mode, iteration 1 : 147/183 places, 124/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45528 ms. Remains : 147/183 places, 124/158 transitions.
[2026-05-24 07:53:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:53:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:53:31] [INFO ] Input system was already deterministic with 124 transitions.
[2026-05-24 07:53:31] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:53:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:53:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality11989664827052667731.gal : 1 ms
[2026-05-24 07:53:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality10018021261645317413.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/CTLCardinality11989664827052667731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10018021261645317413.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33449e+10,0.79984,33924,2,17996,5,108497,6,0,713,155092,0


Converting to forward existential form...Done !
original formula: (AX(AG(((p57==0)&&(p91==1)))) + E(((p35==0)||(p27==1)) U AG(((((p130==0)||(p189==1))&&(p161==1))&&(((p25==0)||(p106==1))||(p70==0))))))
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(((p35==0)||(p27==1)) U !(E(TRUE U !(((((p130==0)||(p189==1))&&(p161==1))&&(((p25==0)||(p10...222
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t13, t24, t27, t31, t32, t34, t37, t40, t43, t46, t49, t54, t57, t60, t64, t65, t68, ...316
(forward)formula 0,0,8.73928,277020,1,0,274,995175,277,127,4378,1.04835e+06,266
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 154 transition count 131
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 154 transition count 131
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 143 transition count 120
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 143 transition count 120
Applied a total of 78 rules in 8 ms. Remains 143 /183 variables (removed 40) and now considering 120/158 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7631887589805547412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15421072967307993487.kers'
[2026-05-24 07:53:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7631887589805547412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15421072967307993487.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 143 cols 349 entries
Finished phase 1 with 103 SingleSign rule and 12 generalized
[2026-05-24 07:53:40] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15421072967307993487.kers
Total runtime 1 ms.
[2026-05-24 07:53:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 07:53:40] [INFO ] Invariant cache hit.
[2026-05-24 07:53:40] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 07:53:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/182 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 193 constraints, problems are : Problem set: 0 solved, 119 unsolved in 11724 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 119/311 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 329 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 41746ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 41746ms
Starting structural reductions in LTL mode, iteration 1 : 143/183 places, 120/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41914 ms. Remains : 143/183 places, 120/158 transitions.
[2026-05-24 07:54:22] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:54:22] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:54:22] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-24 07:54:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:54:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:54:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality17702344272795946576.gal : 0 ms
[2026-05-24 07:54:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12517070014392055527.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/CTLCardinality17702344272795946576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12517070014392055527.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24738e+10,0.572657,27664,2,14993,5,88735,6,0,693,119299,0


Converting to forward existential form...Done !
original formula: (EX((p20==1)) + EX(EF(AG((p59==0)))))
=> equivalent forward existential formula: ([(EY(Init) * (p20==1))] != FALSE + [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((p59==0)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t31, t34, t37, t40, t43, t46, t51, t54, t57, t61, t62, t65, t66, t69, ...301
(forward)formula 0,1,6.76518,224188,1,0,289,805931,264,137,4245,815342,292
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 155 transition count 132
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 155 transition count 132
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 63 place count 146 transition count 123
Iterating global reduction 1 with 9 rules applied. Total rules applied 72 place count 146 transition count 123
Applied a total of 72 rules in 12 ms. Remains 146 /183 variables (removed 37) and now considering 123/158 (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-12169044278000201146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5414858219252938501.kers'
[2026-05-24 07:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12169044278000201146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5414858219252938501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 146 cols 355 entries
Finished phase 1 with 106 SingleSign rule and 12 generalized
[2026-05-24 07:54:29] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5414858219252938501.kers
Total runtime 2 ms.
[2026-05-24 07:54:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 07:54:29] [INFO ] Invariant cache hit.
[2026-05-24 07:54:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 07:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/269 variables, 146/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/269 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/269 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/269 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 21 (OVERLAPS) 0/269 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 219 constraints, problems are : Problem set: 0 solved, 122 unsolved in 23118 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 42/70 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 123/269 variables, 146/220 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 122/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 355 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 53136ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 53137ms
Starting structural reductions in LTL mode, iteration 1 : 146/183 places, 123/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53304 ms. Remains : 146/183 places, 123/158 transitions.
[2026-05-24 07:55:22] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:55:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:55:22] [INFO ] Input system was already deterministic with 123 transitions.
[2026-05-24 07:55:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:55:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:55:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5887510524552969824.gal : 1 ms
[2026-05-24 07:55:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality18267136160104842866.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/CTLCardinality5887510524552969824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18267136160104842866.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.30604e+10,0.751571,34368,2,16736,5,108913,6,0,708,160004,0


Converting to forward existential form...Done !
original formula: A(!(((p31==0)||(p9==1))) U (EG((!(AF(((p52==0)||(p151==1)))) + E(((p21==0)||(p57==1)) U (p44==1)))) * (EF((p26==0)) + (AF(((p0==0)||(p140...195
=> equivalent forward existential formula: [((Init * !(EG(!((EG((!(!(EG(!(((p52==0)||(p151==1)))))) + E(((p21==0)||(p57==1)) U (p44==1)))) * (E(TRUE U (p26...624
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t23, t24, t26, t29, t32, t35, t38, t41, t44, t47, t52, t55, t58, t59, t63, t64, t67, ...315
Detected timeout of ITS tools.
[2026-05-24 07:55:52] [INFO ] Flatten gal took : 10 ms
[2026-05-24 07:55:52] [INFO ] Applying decomposition
[2026-05-24 07:55:52] [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/graph10103759216422268340.txt' '-o' '/tmp/graph10103759216422268340.bin' '-w' '/tmp/graph10103759216422268340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10103759216422268340.bin' '-l' '-1' '-v' '-w' '/tmp/graph10103759216422268340.weights' '-q' '0' '-e' '0.001'
[2026-05-24 07:55:52] [INFO ] Decomposing Gal with order
[2026-05-24 07:55:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 07:55:52] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-24 07:55:52] [INFO ] Flatten gal took : 48 ms
[2026-05-24 07:55:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 07:55:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality6878014660445903284.gal : 2 ms
[2026-05-24 07:55:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality18332110702790158369.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/CTLCardinality6878014660445903284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18332110702790158369.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30604e+10,0.230181,14100,2001,29,19150,285,370,29442,44,684,0


Converting to forward existential form...Done !
original formula: A(!(((i4.u11.p31==0)||(i1.u3.p9==1))) U (EG((!(AF(((i6.u16.p52==0)||(i14.u41.p151==1)))) + E(((u7.p21==0)||(i7.i0.u19.p57==1)) U (u13.p44...280
=> equivalent forward existential formula: [((Init * !(EG(!((EG((!(!(EG(!(((i6.u16.p52==0)||(i14.u41.p151==1)))))) + E(((u7.p21==0)||(i7.i0.u19.p57==1)) U ...853
Reverse transition relation is NOT exact ! Due to transitions t64, t68, t76, t85, t113, i0.u14.t71, i1.t72, i1.u6.t88, i1.u12.t75, i2.u4.t91, i4.t80, i4.u8...500
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found 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 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
(forward)formula 0,1,24.5904,840952,1,0,1.71939e+06,285,2430,2.33569e+06,222,684,1807344
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Graph (trivial) has 105 edges and 183 vertex of which 7 / 183 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 173 transition count 115
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 139 transition count 115
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 70 place count 139 transition count 90
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 126 place count 108 transition count 90
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 148 place count 86 transition count 68
Iterating global reduction 2 with 22 rules applied. Total rules applied 170 place count 86 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 170 place count 86 transition count 65
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 176 place count 83 transition count 65
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 236 place count 52 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 51 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 50 transition count 35
Applied a total of 238 rules in 22 ms. Remains 50 /183 variables (removed 133) and now considering 35/158 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10767984703388927621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4735907913795804089.kers'
[2026-05-24 07:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10767984703388927621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4735907913795804089.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 34 rows 36 cols 98 entries
Finished phase 1 with 29 SingleSign rule and 2 generalized
[2026-05-24 07:56:17] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4735907913795804089.kers
Total runtime 0 ms.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants in 49 ms returned [0, 1, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 52 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/183 places, 35/158 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 45 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 34
Applied a total of 2 rules in 2 ms. Remains 44 /45 variables (removed 1) and now considering 34/35 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-110710810602267296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12357839317935555389.kers'
[2026-05-24 07:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-110710810602267296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12357839317935555389.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 33 rows 35 cols 96 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-24 07:56:17] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12357839317935555389.kers
Total runtime 1 ms.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 07:56:17] [INFO ] Invariant cache hit.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [3, 11, 15, 17, 19, 21, 23, 25, 27]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 89 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 35/183 places, 34/158 transitions.
Graph (complete) has 71 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 33 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 28 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 27 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 27 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 2 with 5 rules applied. Total rules applied 18 place count 24 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 23 transition count 24
Applied a total of 20 rules in 3 ms. Remains 23 /35 variables (removed 12) and now considering 24/34 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6895986640656042590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14989029497073386158.kers'
[2026-05-24 07:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6895986640656042590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14989029497073386158.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 23 rows 22 cols 61 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-24 07:56:17] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14989029497073386158.kers
Total runtime 0 ms.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 07:56:17] [INFO ] Invariant cache hit.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 23/183 places, 24/158 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 231 ms. Remains : 23/183 places, 24/158 transitions.
[2026-05-24 07:56:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:56:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:56:17] [INFO ] Input system was already deterministic with 24 transitions.
[2026-05-24 07:56:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:56:17] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:56:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10037976264794481162.gal : 0 ms
[2026-05-24 07:56:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7236551427586658200.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10037976264794481162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7236551427586658200.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 162 transition count 139
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 162 transition count 139
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 153 transition count 130
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 153 transition count 130
Applied a total of 58 rules in 7 ms. Remains 153 /183 variables (removed 30) and now considering 130/158 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6784898301909988703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4062389940609155565.kers'
[2026-05-24 07:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6784898301909988703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4062389940609155565.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 153 cols 369 entries
Finished phase 1 with 113 SingleSign rule and 12 generalized
[2026-05-24 07:56:17] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4062389940609155565.kers
Total runtime 0 ms.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 07:56:17] [INFO ] Invariant cache hit.
[2026-05-24 07:56:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 07:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 130/283 variables, 153/241 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 16 (OVERLAPS) 0/283 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 251 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14248 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 64/92 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 130/283 variables, 153/249 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 129/378 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 9/387 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 400 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 44278ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 44279ms
Starting structural reductions in LTL mode, iteration 1 : 153/183 places, 130/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44464 ms. Remains : 153/183 places, 130/158 transitions.
[2026-05-24 07:57:02] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:57:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:57:02] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-24 07:57:02] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:57:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:57:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10007142252141448294.gal : 1 ms
[2026-05-24 07:57:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14511733426346126691.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/CTLCardinality10007142252141448294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14511733426346126691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58091e+10,1.455,45000,2,20033,5,141006,6,0,743,227915,0


Converting to forward existential form...Done !
original formula: EG((((AF((((p185==0)&&(p39==0))&&(p154==1))) + EF(((p130==0)||(p118==1)))) + ((p23==0)||(p50==1))) + (((AX(((p47==0)&&(p146==1))) * ((AG(...484
=> equivalent forward existential formula: [FwdG(Init,(((!(EG(!((((p185==0)&&(p39==0))&&(p154==1))))) + E(TRUE U ((p130==0)||(p118==1)))) + ((p23==0)||(p50...696
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t12, t17, t28, t32, t33, t36, t37, t40, t41, t43, t46, t49, t52, t55, t60, t63, t...335
Detected timeout of ITS tools.
[2026-05-24 07:57:32] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:57:32] [INFO ] Applying decomposition
[2026-05-24 07:57:32] [INFO ] Flatten gal took : 3 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/graph15540409979437645762.txt' '-o' '/tmp/graph15540409979437645762.bin' '-w' '/tmp/graph15540409979437645762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15540409979437645762.bin' '-l' '-1' '-v' '-w' '/tmp/graph15540409979437645762.weights' '-q' '0' '-e' '0.001'
[2026-05-24 07:57:32] [INFO ] Decomposing Gal with order
[2026-05-24 07:57:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 07:57:32] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-24 07:57:32] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 07:57:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2762356516796183837.gal : 2 ms
[2026-05-24 07:57:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5795219530023645731.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/CTLCardinality2762356516796183837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5795219530023645731.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58091e+10,0.121838,9512,1201,31,12398,386,407,13608,51,836,0


Converting to forward existential form...Done !
original formula: EG((((AF((((i7.i0.u52.p185==0)&&(i2.u12.p39==0))&&(i12.u45.p154==1))) + EF(((i11.i1.u38.p130==0)||(i9.u35.p118==1)))) + ((i3.u8.p23==0)||...757
=> equivalent forward existential formula: [FwdG(Init,(((!(EG(!((((i7.i0.u52.p185==0)&&(i2.u12.p39==0))&&(i12.u45.p154==1))))) + E(TRUE U ((i11.i1.u38.p130...1001
Reverse transition relation is NOT exact ! Due to transitions t75, t92, t120, t121, i0.i0.u25.t60, i0.i1.u42.t28, i0.i2.t32, i0.i2.u40.t33, i1.t71, i1.u14....552
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,9.56813,350816,1,0,696960,670,3085,916401,286,1685,880797
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Graph (trivial) has 108 edges and 183 vertex of which 7 / 183 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 174 transition count 114
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 138 transition count 114
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 138 transition count 89
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 130 place count 107 transition count 89
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 152 place count 85 transition count 67
Iterating global reduction 2 with 22 rules applied. Total rules applied 174 place count 85 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 174 place count 85 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 82 transition count 64
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 242 place count 50 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 49 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 48 transition count 33
Applied a total of 244 rules in 15 ms. Remains 48 /183 variables (removed 135) and now considering 33/158 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2619396141275664652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8806898402566123919.kers'
[2026-05-24 07:57:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2619396141275664652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8806898402566123919.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 32 rows 35 cols 96 entries
Finished phase 1 with 27 SingleSign rule and 2 generalized
[2026-05-24 07:57:42] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8806898402566123919.kers
Total runtime 1 ms.
[2026-05-24 07:57:42] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/183 places, 33/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 55 ms. Remains : 43/183 places, 33/158 transitions.
[2026-05-24 07:57:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:57:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:57:42] [INFO ] Input system was already deterministic with 33 transitions.
[2026-05-24 07:57:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:57:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:57:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6074664830823447135.gal : 0 ms
[2026-05-24 07:57:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15149739506066920629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6074664830823447135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15149739506066920629.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 3372 steps (443 resets) in 23 ms. (140 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 155 transition count 132
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 155 transition count 132
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 145 transition count 122
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 145 transition count 122
Applied a total of 74 rules in 5 ms. Remains 145 /183 variables (removed 38) and now considering 122/158 (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-17540711551294731105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13770941304969041378.kers'
[2026-05-24 07:57:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17540711551294731105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13770941304969041378.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 145 cols 353 entries
Finished phase 1 with 105 SingleSign rule and 12 generalized
[2026-05-24 07:57:42] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13770941304969041378.kers
Total runtime 2 ms.
[2026-05-24 07:57:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 07:57:42] [INFO ] Invariant cache hit.
[2026-05-24 07:57:42] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-24 07:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/267 variables, 145/191 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 200 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9728 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/267 variables, 145/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 121/322 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (OVERLAPS) 0/267 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 336 constraints, problems are : Problem set: 0 solved, 121 unsolved in 29363 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39098ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 39098ms
Starting structural reductions in LTL mode, iteration 1 : 145/183 places, 122/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39280 ms. Remains : 145/183 places, 122/158 transitions.
[2026-05-24 07:58:21] [INFO ] Flatten gal took : 13 ms
[2026-05-24 07:58:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:58:21] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-24 07:58:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:58:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:58:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1660079965877399213.gal : 1 ms
[2026-05-24 07:58:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality7470789796148331134.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/CTLCardinality1660079965877399213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7470789796148331134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32419e+10,0.601853,28004,2,15130,5,90180,6,0,703,120908,0


Converting to forward existential form...Done !
original formula: AG(!(A(EG(((p179==1) + AX((p165==1)))) U AG(!(AF((p52==0)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(!(!(EG(!((p52==0)))))))))))) * !(E(!(!(E(TRUE U !(!(!(EG(!((p52==0)))))...259
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t12, t24, t27, t30, t33, t36, t39, t42, t45, t48, t53, t56, t59, t63, t64, t67, t68, ...300
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 07:58:51] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:58:51] [INFO ] Applying decomposition
[2026-05-24 07:58:51] [INFO ] Flatten gal took : 2 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/graph12200280531036620826.txt' '-o' '/tmp/graph12200280531036620826.bin' '-w' '/tmp/graph12200280531036620826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12200280531036620826.bin' '-l' '-1' '-v' '-w' '/tmp/graph12200280531036620826.weights' '-q' '0' '-e' '0.001'
[2026-05-24 07:58:51] [INFO ] Decomposing Gal with order
[2026-05-24 07:58:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 07:58:51] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-24 07:58:51] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:58:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 07:58:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3304804716042401364.gal : 2 ms
[2026-05-24 07:58:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality15790586234393438878.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/CTLCardinality3304804716042401364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15790586234393438878.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32419e+10,0.1651,11856,1904,23,16770,342,373,19868,44,701,0


Converting to forward existential form...Done !
original formula: AG(!(A(EG(((i8.i1.u46.p179==1) + AX((i12.u43.p165==1)))) U AG(!(AF((i0.u15.p52==0)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(!(!(EG(!((i0.u15.p52==0)))))))))))) * !(E(!(!(E(TRUE U !(!(!(EG(!((i0.u...298
Reverse transition relation is NOT exact ! Due to transitions t68, t76, t84, t112, i0.t64, i0.u13.t71, i0.u15.t67, i1.u4.t90, i1.u30.t48, i2.u6.t87, i3.t83...468
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,14.8243,486160,1,0,991028,342,2349,1.16985e+06,228,701,1370840
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 157 transition count 134
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 157 transition count 134
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 149 transition count 126
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 149 transition count 126
Applied a total of 66 rules in 4 ms. Remains 149 /183 variables (removed 34) and now considering 126/158 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14631440295065565971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4369077745368680200.kers'
[2026-05-24 07:59:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14631440295065565971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4369077745368680200.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 149 cols 361 entries
Finished phase 1 with 109 SingleSign rule and 12 generalized
[2026-05-24 07:59:06] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4369077745368680200.kers
Total runtime 1 ms.
[2026-05-24 07:59:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 07:59:06] [INFO ] Invariant cache hit.
[2026-05-24 07:59:06] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-24 07:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 126/275 variables, 149/192 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 14 (OVERLAPS) 0/275 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 219 constraints, problems are : Problem set: 0 solved, 125 unsolved in 11810 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 126/275 variables, 149/226 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 125/351 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/275 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/275 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/275 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 363 constraints, problems are : Problem set: 0 solved, 125 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 41830ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 41830ms
Starting structural reductions in LTL mode, iteration 1 : 149/183 places, 126/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42014 ms. Remains : 149/183 places, 126/158 transitions.
[2026-05-24 07:59:48] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:59:48] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:59:48] [INFO ] Input system was already deterministic with 126 transitions.
[2026-05-24 07:59:48] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:59:48] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:59:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3402224187281036382.gal : 1 ms
[2026-05-24 07:59:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3179125272292533013.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/CTLCardinality3402224187281036382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3179125272292533013.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51837e+10,0.689616,31100,2,17405,5,100279,6,0,723,131584,0


Converting to forward existential form...Done !
original formula: E(((p30==0)||(p146==1)) U ((EX(AF(EX((p19==1)))) * EG((((p187==0)&&((p31==0)||(p53==1)))&&(p104==1)))) * (AF((((p54==0)||(p118==1))&&((p1...249
=> equivalent forward existential formula: (([(((FwdU(Init,((p30==0)||(p146==1))) * (EX(!(EG(!(EX((p19==1)))))) * EG((((p187==0)&&((p31==0)||(p53==1)))&&(p...710
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t12, t25, t28, t31, t34, t37, t40, t43, t46, t49, t54, t57, t60, t64, t65, t68, t...324
Detected timeout of ITS tools.
[2026-05-24 08:00:18] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:00:18] [INFO ] Applying decomposition
[2026-05-24 08:00:18] [INFO ] Flatten gal took : 3 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/graph7679322721474147458.txt' '-o' '/tmp/graph7679322721474147458.bin' '-w' '/tmp/graph7679322721474147458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7679322721474147458.bin' '-l' '-1' '-v' '-w' '/tmp/graph7679322721474147458.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:00:18] [INFO ] Decomposing Gal with order
[2026-05-24 08:00:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:00:18] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-24 08:00:18] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:00:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:00:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4265731862857880181.gal : 1 ms
[2026-05-24 08:00:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11527876085374588160.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/CTLCardinality4265731862857880181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11527876085374588160.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51837e+10,0.096715,8808,1437,33,9911,432,383,12610,56,955,0


Converting to forward existential form...Done !
original formula: E(((i5.u10.p30==0)||(i13.u42.p146==1)) U ((EX(AF(EX((i4.u6.p19==1)))) * EG((((i13.u40.p187==0)&&((i5.u10.p31==0)||(i1.u16.p53==1)))&&(i12...366
=> equivalent forward existential formula: (([(((FwdU(Init,((i5.u10.p30==0)||(i13.u42.p146==1))) * (EX(!(EG(!(EX((i4.u6.p19==1)))))) * EG((((i13.u40.p187==...987
Reverse transition relation is NOT exact ! Due to transitions t69, t77, t87, t116, u36.t34, i0.u37.t31, i0.u38.t28, i0.u39.t25, i1.t65, i1.u14.t72, i1.u16....519
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,13.4145,461556,1,0,950647,765,2903,1.14458e+06,322,2117,1066804
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 162 transition count 139
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 162 transition count 139
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 153 transition count 130
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 153 transition count 130
Applied a total of 58 rules in 5 ms. Remains 153 /183 variables (removed 30) and now considering 130/158 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6592623611914949249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12634763650250365213.kers'
[2026-05-24 08:00:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6592623611914949249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12634763650250365213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 153 cols 369 entries
Finished phase 1 with 113 SingleSign rule and 12 generalized
[2026-05-24 08:00:32] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12634763650250365213.kers
Total runtime 1 ms.
[2026-05-24 08:00:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 08:00:32] [INFO ] Invariant cache hit.
[2026-05-24 08:00:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 08:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 130/283 variables, 153/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 18 (OVERLAPS) 0/283 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 232 constraints, problems are : Problem set: 0 solved, 129 unsolved in 17446 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 48/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 130/283 variables, 153/236 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 129/365 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 389 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 47461ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 47461ms
Starting structural reductions in LTL mode, iteration 1 : 153/183 places, 130/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47614 ms. Remains : 153/183 places, 130/158 transitions.
[2026-05-24 08:01:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:01:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:01:19] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-24 08:01:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:01:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:01:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15889543216239256971.gal : 1 ms
[2026-05-24 08:01:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17840794827271015976.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/CTLCardinality15889543216239256971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17840794827271015976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34731e+10,0.928724,40160,2,19603,5,127150,6,0,743,196110,0


Converting to forward existential form...Done !
original formula: E((A(!(AG((((p48==0)||(p181==1))&&((p32==0)||(p127==1))))) U (AX(EF((p140==1))) + ((AF((p180==0)) * (p53==1)) * (((p191==0)||(p112==1))&&...196
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!((!(EX(!(E(TRUE U (p140==1))))) + ((!(EG(!((p180==0)))) * (p53==1)) * (((p191==0)||(p112==1))...525
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t7, t11, t27, t28, t30, t34, t35, t37, t40, t44, t45, t47, t50, t53, t58, t61, t64, t...334
(forward)formula 0,0,9.83213,305580,1,0,286,1.10322e+06,282,130,4203,1.13469e+06,273
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 182 transition count 158
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 160 transition count 136
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 160 transition count 136
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 151 transition count 127
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 151 transition count 127
Applied a total of 63 rules in 8 ms. Remains 151 /183 variables (removed 32) and now considering 127/158 (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-367964125278340055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16446286745726198290.kers'
[2026-05-24 08:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-367964125278340055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16446286745726198290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 151 cols 364 entries
Finished phase 1 with 110 SingleSign rule and 12 generalized
[2026-05-24 08:01:29] [INFO ] Computed 29 invariants in 1 ms
Computed 29 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16446286745726198290.kers
Total runtime 2 ms.
[2026-05-24 08:01:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 08:01:29] [INFO ] Invariant cache hit.
[2026-05-24 08:01:29] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 08:01:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 2/151 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 127/278 variables, 151/225 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 20 (OVERLAPS) 0/278 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 237 constraints, problems are : Problem set: 0 solved, 126 unsolved in 16307 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 2/151 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 54/83 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 127/278 variables, 151/241 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 126/367 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 377 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 46329ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 46330ms
Starting structural reductions in LTL mode, iteration 1 : 151/183 places, 127/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46497 ms. Remains : 151/183 places, 127/158 transitions.
[2026-05-24 08:02:16] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:02:16] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:02:16] [INFO ] Input system was already deterministic with 127 transitions.
[2026-05-24 08:02:16] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:02:16] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:02:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality15471546349287963324.gal : 0 ms
[2026-05-24 08:02:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality12726954737643126864.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/CTLCardinality15471546349287963324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12726954737643126864.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29154e+10,0.817119,38020,2,17558,5,117190,6,0,729,181277,0


Converting to forward existential form...Done !
original formula: (A((EX((p1==1)) + !(E((p120!=0) U (((p133==0)||(p76==1))||((p3==1)||((p42==1)&&(p118==0))))))) U EF(((p64==0)||(p17==1)))) * (A((!(A((p93...382
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U ((p64==0)||(p17==1))))) * !((EX((p1==1)) + !(E((p120!=0) U (((p133==0)||(p76==1))||((p...2031
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t14, t15, t26, t27, t29, t32, t35, t39, t40, t42, t45, t48, t51, t56, t59, t63, t64, ...326
Detected timeout of ITS tools.
[2026-05-24 08:02:46] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:02:46] [INFO ] Applying decomposition
[2026-05-24 08:02:46] [INFO ] Flatten gal took : 2 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/graph9251469750793460246.txt' '-o' '/tmp/graph9251469750793460246.bin' '-w' '/tmp/graph9251469750793460246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9251469750793460246.bin' '-l' '-1' '-v' '-w' '/tmp/graph9251469750793460246.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:02:46] [INFO ] Decomposing Gal with order
[2026-05-24 08:02:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:02:46] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-24 08:02:46] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:02:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:02:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality12472946452575748576.gal : 1 ms
[2026-05-24 08:02:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17767238799472415054.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/CTLCardinality12472946452575748576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17767238799472415054.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29154e+10,0.111618,9380,1221,27,12564,453,368,12583,51,935,0


Converting to forward existential form...Done !
original formula: (A((EX((i13.i0.u0.p1==1)) + !(E((i12.u36.p120!=0) U (((i13.i0.u40.p133==0)||(i0.u25.p76==1))||((i13.i0.u1.p3==1)||((i2.u13.p42==1)&&(i12....596
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U ((i7.u19.p64==0)||(i4.u7.p17==1))))) * !((EX((i13.i0.u0.p1==1)) + !(E((i12.u36.p120!=0...3007
Reverse transition relation is NOT exact ! Due to transitions t69, t77, t81, t89, t117, t118, i0.u24.t59, i1.u16.t72, i2.t73, i2.u12.t80, i2.u14.t76, i3.u5...506
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
(forward)formula 0,0,10.2282,360392,1,0,751207,662,2847,849477,295,1543,901198
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 158/158 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 158
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 156 transition count 133
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 156 transition count 133
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 145 transition count 122
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 145 transition count 122
Applied a total of 74 rules in 4 ms. Remains 145 /183 variables (removed 38) and now considering 122/158 (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-10914839733276023608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3023921068730872322.kers'
[2026-05-24 08:02:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10914839733276023608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3023921068730872322.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 145 cols 353 entries
Finished phase 1 with 105 SingleSign rule and 12 generalized
[2026-05-24 08:02:56] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3023921068730872322.kers
Total runtime 1 ms.
[2026-05-24 08:02:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 08:02:56] [INFO ] Invariant cache hit.
[2026-05-24 08:02:56] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-24 08:02:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/267 variables, 145/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 204 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10197 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/267 variables, 145/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 121/322 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 335 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 40221ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 40221ms
Starting structural reductions in LTL mode, iteration 1 : 145/183 places, 122/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40378 ms. Remains : 145/183 places, 122/158 transitions.
[2026-05-24 08:03:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:03:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:03:36] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-24 08:03:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:03:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:03:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality18044000702826696579.gal : 1 ms
[2026-05-24 08:03:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality13596378676885907281.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/CTLCardinality18044000702826696579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13596378676885907281.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38047e+10,0.666352,30316,2,15514,5,97788,6,0,703,136976,0


Converting to forward existential form...Done !
original formula: (AG(AF(EG((p171==0)))) + A((((p80==1) + !(EX(((p0==0)||(p146==1))))) + EG(((p45==1)&&(p130==1)))) U (EF(AX(((p189==1)&&(p145==0)))) * AX(...171
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!((E(TRUE U !(EX(!(((p189==1)&&(p145==0)))))) * !(EX(!(EX((p89!=0))))))) U (!((((p80==...411
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t23, t26, t30, t31, t33, t36, t39, t42, t45, t48, t53, t56, t59, t63, t64, t67, t68, ...306
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 08:04:06] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:04:06] [INFO ] Applying decomposition
[2026-05-24 08:04:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5307401575448582719.txt' '-o' '/tmp/graph5307401575448582719.bin' '-w' '/tmp/graph5307401575448582719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5307401575448582719.bin' '-l' '-1' '-v' '-w' '/tmp/graph5307401575448582719.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:04:07] [INFO ] Decomposing Gal with order
[2026-05-24 08:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:04:07] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-24 08:04:07] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:04:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16822306659400290221.gal : 2 ms
[2026-05-24 08:04:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15720943985395467016.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/CTLCardinality16822306659400290221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15720943985395467016.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38047e+10,0.11538,8780,1362,29,10046,330,382,13699,52,635,0


Converting to forward existential form...Done !
original formula: (AG(AF(EG((i5.u45.p171==0)))) + A((((i0.u25.p80==1) + !(EX(((i13.u0.p0==0)||(i14.u42.p146==1))))) + EG(((i1.u14.p45==1)&&(i12.i1.u36.p130...244
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!((E(TRUE U !(EX(!(((i8.i1.u49.p189==1)&&(i14.u41.p145==0)))))) * !(EX(!(EX((i11.u28.p...536
Reverse transition relation is NOT exact ! Due to transitions t64, t72, t76, t84, t112, t113, i0.u16.t67, i0.u25.t53, i1.t68, i1.u7.t87, i1.u14.t71, i2.u5....474
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,7.33694,254052,1,0,521131,541,2760,725480,293,1165,676302
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 08:04:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:04:14] [INFO ] Flatten gal took : 2 ms
Total runtime 963366 ms.

BK_STOP 1779609854462

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-01"
export BK_EXAMINATION="CTLCardinality"
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-01, examination is CTLCardinality"
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-177946842000449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;