About the Execution of ITS-Tools for BusinessProcesses-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1334.636 | 561628.00 | 630508.00 | 1041.90 | FTTFTFFTFFTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000465.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000465
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 17:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 5 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 5 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:43 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 63K 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-03-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779610281015
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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 08:11:22] [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 08:11:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:11:22] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-24 08:11:22] [INFO ] Transformed 274 places.
[2026-05-24 08:11:22] [INFO ] Transformed 237 transitions.
[2026-05-24 08:11:22] [INFO ] Found NUPN structural information;
[2026-05-24 08:11:22] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 236
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 241 transition count 205
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 241 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 241 transition count 204
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 232 transition count 195
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 232 transition count 195
Applied a total of 82 rules in 69 ms. Remains 232 /273 variables (removed 41) and now considering 195/236 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11335972032649989558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-402778888881887411.kers'
[2026-05-24 08:11:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11335972032649989558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-402778888881887411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 232 cols 547 entries
Finished phase 1 with 164 SingleSign rule and 26 generalized
[2026-05-24 08:11:22] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-402778888881887411.kers
Total runtime 2 ms.
[2026-05-24 08:11:22] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-24 08:11:22] [INFO ] Invariant cache hit.
[2026-05-24 08:11:23] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 08:11:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/232 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 194 unsolved
SMT process timed out in 30109ms, After SMT, problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Starting structural reductions in LTL mode, iteration 1 : 232/273 places, 195/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30888 ms. Remains : 232/273 places, 195/236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2026-05-24 08:11:53] [INFO ] Invariant cache hit.
[2026-05-24 08:11:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 08:11:53] [INFO ] Invariant cache hit.
[2026-05-24 08:11:53] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 232/232 places, 195/195 transitions.
Support contains 78 out of 232 places after structural reductions.
[2026-05-24 08:11:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 08:11:53] [INFO ] Flatten gal took : 39 ms
[2026-05-24 08:11:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 08:11:53] [INFO ] Flatten gal took : 14 ms
[2026-05-24 08:11:53] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 66 out of 232 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (474 resets) in 2064 ms. (19 steps per ms) remains 3/41 properties
BEST_FIRST walk for 40004 steps (92 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (87 resets) in 95 ms. (416 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 87 ms. (454 steps per ms) remains 1/2 properties
[2026-05-24 08:11:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 169/200 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/229 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/422 variables, 229/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/427 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/427 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 232/232 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 169/200 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/229 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 193/422 variables, 229/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/427 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/427 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 128 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 7 ms.
[2026-05-24 08:11:55] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:11:55] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:11:55] [INFO ] Input system was already deterministic with 195 transitions.
Computed a total of 225 stabilizing places and 187 stable transitions
Graph (complete) has 473 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 208 transition count 172
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 208 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 203 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 203 transition count 167
Applied a total of 57 rules in 17 ms. Remains 203 /232 variables (removed 29) and now considering 167/195 (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-16456386281606118295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14021967800738617538.kers'
[2026-05-24 08:11:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16456386281606118295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14021967800738617538.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 203 cols 490 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 08:11:55] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14021967800738617538.kers
Total runtime 1 ms.
[2026-05-24 08:11:55] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-24 08:11:55] [INFO ] Invariant cache hit.
[2026-05-24 08:11:55] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-24 08:11:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/263 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 0/370 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 276 constraints, problems are : Problem set: 0 solved, 166 unsolved in 17231 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/452 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 19/479 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 166 unsolved
SMT process timed out in 47260ms, After SMT, problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 47264ms
Starting structural reductions in LTL mode, iteration 1 : 203/232 places, 167/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47658 ms. Remains : 203/232 places, 167/195 transitions.
[2026-05-24 08:12:43] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:12:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:12:43] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-24 08:12:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:12:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:12:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9438791533026344177.gal : 19 ms
[2026-05-24 08:12:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5077490316471619789.ctl : 7 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/CTLCardinality9438791533026344177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5077490316471619789.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.4044e+12,0.407581,20740,2,11110,5,50060,6,0,979,81487,0
Converting to forward existential form...Done !
original formula: E((p96==1) U AX((p236==1)))
=> equivalent forward existential formula: [(FwdU(Init,(p96==1)) * !(EX(!((p236==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73...404
Hit Full ! (commute/partial/dont) 165/0/2
(forward)formula 0,0,5.51868,183524,1,0,371,669674,358,171,5516,607563,344
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 210 transition count 174
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 210 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 205 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 205 transition count 169
Applied a total of 53 rules in 11 ms. Remains 205 /232 variables (removed 27) and now considering 169/195 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6157481662778118205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14031287373760878070.kers'
[2026-05-24 08:12:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6157481662778118205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14031287373760878070.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 205 cols 494 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 08:12:48] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14031287373760878070.kers
Total runtime 3 ms.
[2026-05-24 08:12:48] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-24 08:12:48] [INFO ] Invariant cache hit.
[2026-05-24 08:12:49] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-24 08:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 169/374 variables, 205/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 10/283 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 283 constraints, problems are : Problem set: 0 solved, 168 unsolved in 16469 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/374 variables, 205/286 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 168/454 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 13/491 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 508 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 94/94 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46499ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 46500ms
Starting structural reductions in LTL mode, iteration 1 : 205/232 places, 169/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46930 ms. Remains : 205/232 places, 169/195 transitions.
[2026-05-24 08:13:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:13:35] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:13:35] [INFO ] Input system was already deterministic with 169 transitions.
[2026-05-24 08:13:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:13:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:13:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality3924257917558935116.gal : 3 ms
[2026-05-24 08:13:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality16002383840811676415.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/CTLCardinality3924257917558935116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16002383840811676415.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.50322e+12,0.416068,22264,2,11630,5,52445,6,0,989,88849,0
Converting to forward existential form...Done !
original formula: E((AG(((p140==0)||(p246==1))) + ((p258!=1) * AX(!(AX((p123==1)))))) U (p146==1))
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(((p140==0)||(p246==1))))) + ((p258!=1) * !(EX(!(!(!(EX(!((p123==1))))))))))) * (p146==...168
Reverse transition relation is NOT exact ! Due to transitions t8, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t57, t58, t60, t63, t66, t70, t71,...413
(forward)formula 0,1,13.3595,432844,1,0,827,1.59092e+06,368,517,5902,2.45618e+06,864
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Graph (trivial) has 119 edges and 232 vertex of which 6 / 232 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 466 edges and 227 vertex of which 225 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 224 transition count 159
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 196 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 195 transition count 158
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 60 place count 195 transition count 122
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 140 place count 151 transition count 122
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 159 place count 132 transition count 103
Iterating global reduction 3 with 19 rules applied. Total rules applied 178 place count 132 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 178 place count 132 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 129 transition count 101
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 107 rules applied. Total rules applied 290 place count 75 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 74 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 73 transition count 47
Applied a total of 292 rules in 44 ms. Remains 73 /232 variables (removed 159) and now considering 47/195 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8091231982105008209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-309565749460926610.kers'
[2026-05-24 08:13:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8091231982105008209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-309565749460926610.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 46 rows 52 cols 139 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 08:13:49] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-309565749460926610.kers
Total runtime 0 ms.
[2026-05-24 08:13:49] [INFO ] Implicit Places using invariants in 54 ms returned [15, 72]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/232 places, 47/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 110 ms. Remains : 71/232 places, 47/195 transitions.
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:13:49] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17121142909490690918.gal : 6 ms
[2026-05-24 08:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4506765208378696410.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/CTLCardinality17121142909490690918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4506765208378696410.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,4428,0.036958,5544,2,819,5,4992,6,0,328,5981,0
Converting to forward existential form...Done !
original formula: EF(((AG(((p166!=1)&&(p84!=1))) + (p266==1)) + (((p126==0)&&(p170==1)) * (EF(((p23==0)||(p91==1))) * (AG((p47==1)) + EF(((p156==0)&&(p189=...165
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(((p166!=1)&&(p84!=1))))))] != FALSE + [(FwdU(Init,TRUE) * (p266==1))] != FALS...409
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t11, t22, t23, t27, t29, t32, Intersection with reachable at each step enabled. ...201
(forward)formula 0,1,0.15691,10888,1,0,90,33290,115,51,2022,26116,103
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Graph (trivial) has 128 edges and 232 vertex of which 6 / 232 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 466 edges and 227 vertex of which 225 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
Reduce places removed 1 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 224 transition count 155
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 192 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 191 transition count 154
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 68 place count 191 transition count 113
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 160 place count 140 transition count 113
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 180 place count 120 transition count 93
Iterating global reduction 3 with 20 rules applied. Total rules applied 200 place count 120 transition count 93
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 200 place count 120 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 117 transition count 91
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 307 place count 66 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 308 place count 65 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 309 place count 64 transition count 39
Applied a total of 309 rules in 33 ms. Remains 64 /232 variables (removed 168) and now considering 39/195 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9139324115410970273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14896715151563315909.kers'
[2026-05-24 08:13:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9139324115410970273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14896715151563315909.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 38 rows 44 cols 136 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-24 08:13:49] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14896715151563315909.kers
Total runtime 0 ms.
[2026-05-24 08:13:49] [INFO ] Implicit Places using invariants in 52 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/232 places, 39/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 89 ms. Remains : 63/232 places, 39/195 transitions.
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:13:49] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:13:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13919867304229053222.gal : 1 ms
[2026-05-24 08:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality18084240926923668395.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/CTLCardinality13919867304229053222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18084240926923668395.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,88,0.01574,4436,2,369,5,1674,6,0,290,1436,0
Converting to forward existential form...Done !
original formula: !(E(!(EF((EG(((p210==0)||(p59==1))) * EG((p64==0))))) U AG(EF((p230==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U (EG(((p210==0)||(p59==1))) * EG((p64==0)))))) * !(E(TRUE U !(E(TRUE U (p230==1))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t12, t13, t16, t17, t19, t24, t27, t28, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.055154,6544,1,0,83,10840,98,46,1852,8401,101
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 213 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 213 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 209 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 209 transition count 173
Applied a total of 45 rules in 16 ms. Remains 209 /232 variables (removed 23) and now considering 173/195 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1504992324938587983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4971738396981951693.kers'
[2026-05-24 08:13:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1504992324938587983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4971738396981951693.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 209 cols 502 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-24 08:13:49] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4971738396981951693.kers
Total runtime 1 ms.
[2026-05-24 08:13:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 08:13:49] [INFO ] Invariant cache hit.
[2026-05-24 08:13:50] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 08:13:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/382 variables, 209/289 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 299 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 47/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/382 variables, 209/311 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 172/483 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 11/514 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 7/521 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 16/537 constraints. Problems are: Problem set: 0 solved, 172 unsolved
SMT process timed out in 60038ms, After SMT, problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60039ms
Starting structural reductions in LTL mode, iteration 1 : 209/232 places, 173/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 209/232 places, 173/195 transitions.
[2026-05-24 08:14:50] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:14:50] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:14:50] [INFO ] Input system was already deterministic with 173 transitions.
[2026-05-24 08:14:50] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:14:50] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:14:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4598025073685932328.gal : 1 ms
[2026-05-24 08:14:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1831192382767122962.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/CTLCardinality4598025073685932328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1831192382767122962.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.79756e+12,0.704844,31564,2,15047,5,71891,6,0,1009,146712,0
Converting to forward existential form...Done !
original formula: (AX((((AF((p163==1)) * (p82==0)) * (p196==1)) + EF((p254==0)))) * (A((p242!=1) U AX(AG(((p194==0)&&(p137==1))))) + AG(((E(EG((p25==1)) U ...282
=> equivalent forward existential formula: ((([FwdG((EY(Init) * !(E(TRUE U (p254==0)))),!((p163==1)))] = FALSE * [((EY(Init) * !(E(TRUE U (p254==0)))) * !(...633
Reverse transition relation is NOT exact ! Due to transitions t5, t11, t21, t29, t30, t32, t35, t38, t41, t44, t48, t49, t52, t53, t55, t58, t61, t64, t67,...431
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 08:15:20] [INFO ] Flatten gal took : 14 ms
[2026-05-24 08:15:20] [INFO ] Applying decomposition
[2026-05-24 08:15:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16756331058878524799.txt' '-o' '/tmp/graph16756331058878524799.bin' '-w' '/tmp/graph16756331058878524799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16756331058878524799.bin' '-l' '-1' '-v' '-w' '/tmp/graph16756331058878524799.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:15:20] [INFO ] Decomposing Gal with order
[2026-05-24 08:15:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:15:20] [INFO ] Removed a total of 44 redundant transitions.
[2026-05-24 08:15:20] [INFO ] Flatten gal took : 84 ms
[2026-05-24 08:15:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2026-05-24 08:15:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13037011287695349918.gal : 3 ms
[2026-05-24 08:15:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16846849436851182353.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/CTLCardinality13037011287695349918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16846849436851182353.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,9.79756e+12,0.093642,7784,1037,35,6786,509,465,9806,48,1411,0
Converting to forward existential form...Done !
original formula: (AX((((AF((i16.i1.u51.p163==1)) * (i0.i0.u26.p82==0)) * (i0.i1.u57.p196==1)) + EF((i1.u69.p254==0)))) * (A((i17.u66.p242!=1) U AX(AG(((i0...430
=> equivalent forward existential formula: ((([FwdG((EY(Init) * !(E(TRUE U (i1.u69.p254==0)))),!((i16.i1.u51.p163==1)))] = FALSE * [((EY(Init) * !(E(TRUE U...837
Reverse transition relation is NOT exact ! Due to transitions t86, t102, t107, t119, t165, t169, i0.i0.u26.t89, i0.i1.t29, i0.i1.u58.t30, i1.u20.t101, i1.u...746
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,3.73562,140808,1,0,272324,755,3617,423504,272,2092,415641
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 208 transition count 172
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 208 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 203 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 203 transition count 167
Applied a total of 57 rules in 6 ms. Remains 203 /232 variables (removed 29) and now considering 167/195 (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-5893724583680099861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11851769520074806675.kers'
[2026-05-24 08:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5893724583680099861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11851769520074806675.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 203 cols 490 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 08:15:24] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11851769520074806675.kers
Total runtime 1 ms.
[2026-05-24 08:15:24] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 08:15:24] [INFO ] Invariant cache hit.
[2026-05-24 08:15:24] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-24 08:15:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 167/370 variables, 203/267 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/370 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 286 constraints, problems are : Problem set: 0 solved, 166 unsolved in 24167 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/285 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/451 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 9/460 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 469 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54190ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 54192ms
Starting structural reductions in LTL mode, iteration 1 : 203/232 places, 167/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54492 ms. Remains : 203/232 places, 167/195 transitions.
[2026-05-24 08:16:18] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:16:18] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:16:18] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-24 08:16:18] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:16:18] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:16:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality133281661639604273.gal : 1 ms
[2026-05-24 08:16:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality8134875227170246933.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/CTLCardinality133281661639604273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8134875227170246933.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.39128e+12,0.40082,20768,2,11079,5,49717,6,0,979,80465,0
Converting to forward existential form...Done !
original formula: AG(AX(((p36==0)||(p113==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((p36==0)||(p113==1))))] = FALSE
(forward)formula 0,0,0.518934,20988,1,0,9,49717,9,2,1686,80465,2
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Graph (trivial) has 123 edges and 232 vertex of which 4 / 232 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 469 edges and 229 vertex of which 227 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 226 transition count 157
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 193 transition count 157
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 68 place count 193 transition count 118
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 156 place count 144 transition count 118
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 177 place count 123 transition count 97
Iterating global reduction 2 with 21 rules applied. Total rules applied 198 place count 123 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 198 place count 123 transition count 94
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 119 transition count 94
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 300 place count 71 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 301 place count 70 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 302 place count 69 transition count 46
Applied a total of 302 rules in 18 ms. Remains 69 /232 variables (removed 163) and now considering 46/195 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5994543141457436025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4627285380192157763.kers'
[2026-05-24 08:16:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5994543141457436025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4627285380192157763.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 45 rows 60 cols 176 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-24 08:16:19] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4627285380192157763.kers
Total runtime 0 ms.
[2026-05-24 08:16:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 08:16:19] [INFO ] Invariant cache hit.
[2026-05-24 08:16:19] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [9, 10, 11, 12, 13, 14, 15, 50, 52]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 118 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/232 places, 46/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 58 transition count 44
Applied a total of 4 rules in 4 ms. Remains 58 /60 variables (removed 2) and now considering 44/46 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9744987213510091996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12950112641958562203.kers'
[2026-05-24 08:16:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9744987213510091996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12950112641958562203.kers]
Normalized transition count is 43 out of 44 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 43 rows 58 cols 168 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-24 08:16:19] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12950112641958562203.kers
Total runtime 0 ms.
[2026-05-24 08:16:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 08:16:19] [INFO ] Invariant cache hit.
[2026-05-24 08:16:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 58/232 places, 44/195 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 228 ms. Remains : 58/232 places, 44/195 transitions.
[2026-05-24 08:16:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:16:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:16:19] [INFO ] Input system was already deterministic with 44 transitions.
[2026-05-24 08:16:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:16:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:16:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7119801609929980370.gal : 0 ms
[2026-05-24 08:16:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5523223590932509999.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/CTLCardinality7119801609929980370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5523223590932509999.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,1032,0.018125,4700,2,524,5,2482,6,0,274,2495,0
Converting to forward existential form...Done !
original formula: AF(E((EG(A(((p12==0)||(p43==1)) U ((p205==0)||(p177==1)))) * (p185!=0)) U !(AG(!((((p153==0)||(p37==1))&&(p148==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((EG(!((E(!(((p205==0)||(p177==1))) U (!(((p12==0)||(p43==1))) * !(((p205==0)||(p177==1))))) + EG(...268
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t7, t8, t9, t18, t23, t24, t27, t28, t30, t31, Intersection with reachable at each s...215
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.150172,10720,1,0,202,31486,134,121,1862,36779,229
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 209 transition count 173
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 209 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 205 transition count 169
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 205 transition count 169
Applied a total of 53 rules in 9 ms. Remains 205 /232 variables (removed 27) and now considering 169/195 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3823310332452661926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17746589675882357044.kers'
[2026-05-24 08:16:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3823310332452661926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17746589675882357044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 205 cols 494 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 08:16:19] [INFO ] Computed 41 invariants in 0 ms
Computed 41 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17746589675882357044.kers
Total runtime 1 ms.
[2026-05-24 08:16:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 08:16:19] [INFO ] Invariant cache hit.
[2026-05-24 08:16:20] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-24 08:16:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 169/374 variables, 205/268 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 279 constraints, problems are : Problem set: 0 solved, 168 unsolved in 20999 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/374 variables, 205/288 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 168/456 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 18/494 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 168 unsolved
SMT process timed out in 51025ms, After SMT, problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 51025ms
Starting structural reductions in LTL mode, iteration 1 : 205/232 places, 169/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51375 ms. Remains : 205/232 places, 169/195 transitions.
[2026-05-24 08:17:11] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:17:11] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:11] [INFO ] Input system was already deterministic with 169 transitions.
[2026-05-24 08:17:11] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:11] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:17:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5644238308149035644.gal : 1 ms
[2026-05-24 08:17:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5271040718415542621.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/CTLCardinality5644238308149035644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5271040718415542621.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.43045e+12,0.399714,21056,2,11280,5,50803,6,0,989,82677,0
Converting to forward existential form...Done !
original formula: EX(AG((AG(((EG(((p35==0)||(p248==1))) * (p224==0)) * (p189==1))) + AX(((p115==0)||(p117==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(E(TRUE U !(((EG(((p35==0)||(p248==1))) * (p224==0)) * (p189==1))))) + !(EX(!(((p115...189
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t21, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t70, t72,...408
Detected timeout of ITS tools.
[2026-05-24 08:17:41] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:17:41] [INFO ] Applying decomposition
[2026-05-24 08:17:41] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14014693014607857011.txt' '-o' '/tmp/graph14014693014607857011.bin' '-w' '/tmp/graph14014693014607857011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14014693014607857011.bin' '-l' '-1' '-v' '-w' '/tmp/graph14014693014607857011.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:17:41] [INFO ] Decomposing Gal with order
[2026-05-24 08:17:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:17:41] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-24 08:17:41] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:17:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2026-05-24 08:17:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality6934675838546835158.gal : 3 ms
[2026-05-24 08:17:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality268922001583991837.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/CTLCardinality6934675838546835158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality268922001583991837.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.43045e+12,0.213629,11916,2115,28,15573,468,405,20748,42,1162,0
Converting to forward existential form...Done !
original formula: EX(AG((AG(((EG(((i4.u12.p35==0)||(i19.u56.p248==1))) * (i19.u60.p224==0)) * (i0.u54.p189==1))) + AX(((i16.u39.p115==0)||(i1.i1.u40.p117==...162
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(E(TRUE U !(((EG(((i4.u12.p35==0)||(i19.u56.p248==1))) * (i19.u60.p224==0)) * (i0.u5...237
Reverse transition relation is NOT exact ! Due to transitions t79, t99, t107, t115, t120, t159, t161, t165, i0.u52.t37, i0.u53.t34, i0.u54.t31, i0.u55.t28,...670
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 a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,11.3613,370420,1,0,712358,468,2804,1.04235e+06,208,1162,1098850
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 213 transition count 176
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 213 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 210 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 210 transition count 173
Applied a total of 44 rules in 12 ms. Remains 210 /232 variables (removed 22) and now considering 173/195 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1763358082025913194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11972428366351577595.kers'
[2026-05-24 08:17:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1763358082025913194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11972428366351577595.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 210 cols 503 entries
Finished phase 1 with 142 SingleSign rule and 26 generalized
[2026-05-24 08:17:52] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11972428366351577595.kers
Total runtime 1 ms.
[2026-05-24 08:17:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 08:17:52] [INFO ] Invariant cache hit.
[2026-05-24 08:17:53] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 08:17:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 1/210 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 173/383 variables, 210/316 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 350 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 67/106 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/210 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 28/137 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 173/383 variables, 210/357 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 172/529 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 20/549 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 5/554 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 15/569 constraints. Problems are: Problem set: 0 solved, 172 unsolved
SMT process timed out in 60045ms, After SMT, problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 210/232 places, 173/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 210/232 places, 173/195 transitions.
[2026-05-24 08:18:53] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:18:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:18:53] [INFO ] Input system was already deterministic with 173 transitions.
[2026-05-24 08:18:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:18:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:18:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality5138454517138542822.gal : 1 ms
[2026-05-24 08:18:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17950712020184989554.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/CTLCardinality5138454517138542822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17950712020184989554.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.82407e+12,0.440297,22376,2,11763,5,52735,6,0,1011,89435,0
Converting to forward existential form...Done !
original formula: (AG(((((p93==0)&&(p148==1))||((p180==0)&&(p214==1)))||((p161==0)||(p255==1)))) * EG((AX((p204==0)) + A(AX(AG(((p143==0)||(p172==1)))) U !...200
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((((p93==0)&&(p148==1))||((p180==0)&&(p214==1)))||((p161==0)||(p255==1)))))] = FALSE * [(...431
Reverse transition relation is NOT exact ! Due to transitions t7, t17, t19, t29, t32, t35, t38, t41, t44, t47, t51, t52, t54, t58, t59, t62, t63, t65, t68,...407
Detected timeout of ITS tools.
[2026-05-24 08:19:23] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:19:23] [INFO ] Applying decomposition
[2026-05-24 08:19:23] [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/graph17135415656347019446.txt' '-o' '/tmp/graph17135415656347019446.bin' '-w' '/tmp/graph17135415656347019446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17135415656347019446.bin' '-l' '-1' '-v' '-w' '/tmp/graph17135415656347019446.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:19:23] [INFO ] Decomposing Gal with order
[2026-05-24 08:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:19:23] [INFO ] Removed a total of 48 redundant transitions.
[2026-05-24 08:19:23] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2026-05-24 08:19:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality17843117281372873560.gal : 3 ms
[2026-05-24 08:19:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality17454140138637585743.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/CTLCardinality17843117281372873560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17454140138637585743.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,9.82407e+12,0.10492,7924,978,25,7329,314,468,9770,44,568,0
Converting to forward existential form...Done !
original formula: (AG(((((i8.u29.p93==0)&&(i5.i1.u47.p148==1))||((i16.u54.p180==0)&&(i3.i1.u61.p214==1)))||((i15.u49.p161==0)||(i17.u69.p255==1)))) * EG((A...302
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((((i8.u29.p93==0)&&(i5.i1.u47.p148==1))||((i16.u54.p180==0)&&(i3.i1.u61.p214==1)))||((i1...581
Reverse transition relation is NOT exact ! Due to transitions t83, t87, t103, t111, t119, t124, t165, i0.u24.t94, i1.t107, i1.u14.t114, i1.u16.t110, i2.u8....717
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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,11.042,350700,1,0,669193,467,3093,1.03388e+06,250,993,801655
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 207 transition count 171
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 207 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 202 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 202 transition count 166
Applied a total of 59 rules in 5 ms. Remains 202 /232 variables (removed 30) and now considering 166/195 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7962284115543710063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15058286255208472037.kers'
[2026-05-24 08:19:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7962284115543710063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15058286255208472037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 202 cols 488 entries
Finished phase 1 with 161 SingleSign rule and 0 generalized
[2026-05-24 08:19:34] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15058286255208472037.kers
Total runtime 3 ms.
[2026-05-24 08:19:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 08:19:34] [INFO ] Invariant cache hit.
[2026-05-24 08:19:34] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2026-05-24 08:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 18/282 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/368 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 0/368 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 285 constraints, problems are : Problem set: 0 solved, 165 unsolved in 25350 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/287 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/452 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 5/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 479 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 55374ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 55374ms
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 166/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55666 ms. Remains : 202/232 places, 166/195 transitions.
[2026-05-24 08:20:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:20:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:30] [INFO ] Input system was already deterministic with 166 transitions.
[2026-05-24 08:20:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:20:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15499237928858119792.gal : 2 ms
[2026-05-24 08:20:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality18341370444046557846.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/CTLCardinality15499237928858119792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18341370444046557846.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,9.38735e+12,0.400075,20712,2,11047,5,49659,6,0,974,80406,0
Converting to forward existential form...Done !
original formula: (AX(FALSE) + EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * !(EX(TRUE)))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...398
(forward)formula 0,1,5.53086,182712,1,0,367,662970,347,170,5482,603249,338
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 207 transition count 171
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 207 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 202 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 202 transition count 166
Applied a total of 59 rules in 5 ms. Remains 202 /232 variables (removed 30) and now considering 166/195 (removed 29) transitions.
[2026-05-24 08:20:35] [INFO ] Invariant cache hit.
[2026-05-24 08:20:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 08:20:35] [INFO ] Invariant cache hit.
[2026-05-24 08:20:36] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 166/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 202/232 places, 166/195 transitions.
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:36] [INFO ] Input system was already deterministic with 166 transitions.
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10498035196820790427.gal : 1 ms
[2026-05-24 08:20:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8388551746632351036.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/CTLCardinality10498035196820790427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8388551746632351036.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38735e+12,0.389849,20700,2,11047,5,49659,6,0,974,80406,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.396313,20700,1,0,6,49659,7,1,1180,80406,1
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-12 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 : 232/232 places, 195/195 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 195
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 207 transition count 171
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 207 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 202 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 202 transition count 166
Applied a total of 59 rules in 5 ms. Remains 202 /232 variables (removed 30) and now considering 166/195 (removed 29) transitions.
[2026-05-24 08:20:36] [INFO ] Invariant cache hit.
[2026-05-24 08:20:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 08:20:36] [INFO ] Invariant cache hit.
[2026-05-24 08:20:36] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 166/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 202/232 places, 166/195 transitions.
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:36] [INFO ] Input system was already deterministic with 166 transitions.
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:20:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 08:20:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14908249778184145794.gal : 1 ms
[2026-05-24 08:20:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality987919509599364240.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/CTLCardinality14908249778184145794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality987919509599364240.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38735e+12,0.372944,20700,2,11047,5,49659,6,0,974,80406,0
Converting to forward existential form...Done !
original formula: AX(((p112==0) * EF((p63==1))))
=> equivalent forward existential formula: ([(EY(Init) * !((p112==0)))] = FALSE * [(EY(Init) * !(E(TRUE U (p63==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...398
(forward)formula 0,1,5.42861,196792,1,0,391,666810,355,184,5722,564227,372
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 195/195 transitions.
Graph (trivial) has 131 edges and 232 vertex of which 6 / 232 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 466 edges and 227 vertex of which 225 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
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 225 transition count 154
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 191 transition count 154
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 70 place count 191 transition count 113
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 162 place count 140 transition count 113
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 184 place count 118 transition count 91
Iterating global reduction 2 with 22 rules applied. Total rules applied 206 place count 118 transition count 91
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 206 place count 118 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 213 place count 114 transition count 88
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 103 rules applied. Total rules applied 316 place count 62 transition count 37
Applied a total of 316 rules in 15 ms. Remains 62 /232 variables (removed 170) and now considering 37/195 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11633993837135199711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7585583792925111432.kers'
[2026-05-24 08:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11633993837135199711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7585583792925111432.kers]
Normalized transition count is 36 out of 37 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 36 rows 62 cols 192 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-24 08:20:42] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7585583792925111432.kers
Total runtime 1 ms.
[2026-05-24 08:20:42] [INFO ] Implicit Places using invariants in 45 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/232 places, 37/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63 ms. Remains : 61/232 places, 37/195 transitions.
[2026-05-24 08:20:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:20:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:20:42] [INFO ] Input system was already deterministic with 37 transitions.
[2026-05-24 08:20:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:20:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 08:20:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8006030746775092533.gal : 0 ms
[2026-05-24 08:20:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6462917007424827082.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/CTLCardinality8006030746775092533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6462917007424827082.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,52,0.019403,4396,2,369,5,1588,6,0,281,1235,0
Converting to forward existential form...Done !
original formula: AG(!(E(EF((p1==1)) U AG(((p217==0)||(p194==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),E(TRUE U (p1==1))) * !(E(TRUE U !(((p217==0)||(p194==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,0,0.057661,6492,1,0,56,6647,100,42,1978,4907,94
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-24 08:20:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:20:42] [INFO ] Flatten gal took : 3 ms
Total runtime 560377 ms.
BK_STOP 1779610842643
--------------------
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-03"
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-03, 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-177946842000465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 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 '
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 ;
