About the Execution of ITS-Tools for DBSingleClientW-PT-d0m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 391.451 | 84879.00 | 113220.00 | 925.80 | FFFFTFFFTTFTFTTT | 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.r082-smll-177946993500089.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 DBSingleClientW-PT-d0m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500089
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m05-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-12
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-13
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-14
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779551564762
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 15:52:47] [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-23 15:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:52:47] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2026-05-23 15:52:47] [INFO ] Transformed 553 places.
[2026-05-23 15:52:47] [INFO ] Transformed 150 transitions.
[2026-05-23 15:52:47] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Deduced a syphon composed of 444 places in 4 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 41 place count 79 transition count 97
Iterating global reduction 1 with 23 rules applied. Total rules applied 64 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 68 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 68 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 68 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 67 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 67 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 67 transition count 81
Applied a total of 91 rules in 75 ms. Remains 67 /109 variables (removed 42) and now considering 81/150 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10906601010675188844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4273132387944312291.kers'
[2026-05-23 15:52:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10906601010675188844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4273132387944312291.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 67 cols 274 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 15:52:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4273132387944312291.kers
Total runtime 2 ms.
[2026-05-23 15:52:48] [INFO ] Implicit Places using invariants in 589 ms returned []
[2026-05-23 15:52:48] [INFO ] Invariant cache hit.
[2026-05-23 15:52:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 15:52:48] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-05-23 15:52:49] [INFO ] Invariant cache hit.
[2026-05-23 15:52:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 105 constraints, problems are : Problem set: 0 solved, 80 unsolved in 9079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/148 variables, 67/83 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 22/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 80/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 185 constraints, problems are : Problem set: 0 solved, 80 unsolved in 16196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25598ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 25626ms
Starting structural reductions in LTL mode, iteration 1 : 67/109 places, 81/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26790 ms. Remains : 67/109 places, 81/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2026-05-23 15:53:14] [INFO ] Invariant cache hit.
[2026-05-23 15:53:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-23 15:53:14] [INFO ] Invariant cache hit.
[2026-05-23 15:53:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 15:53:15] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 67/67 places, 81/81 transitions.
Support contains 5 out of 67 places after structural reductions.
[2026-05-23 15:53:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 15:53:15] [INFO ] Flatten gal took : 63 ms
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:53:15] [INFO ] Flatten gal took : 26 ms
[2026-05-23 15:53:15] [INFO ] Input system was already deterministic with 81 transitions.
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8996 resets) in 1897 ms. (21 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (4014 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4022 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4044 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4077 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
[2026-05-23 15:53:17] [INFO ] Invariant cache hit.
[2026-05-23 15:53:17] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/28 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/49 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 66/115 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 7/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 8 (OVERLAPS) 31/146 variables, 17/75 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 14/89 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/89 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/148 variables, 1/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 1/91 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/148 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 91 constraints, problems are : Problem set: 3 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/49 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/115 variables, 49/51 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 7/58 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/146 variables, 17/75 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 14/89 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 1/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/148 variables, 1/91 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 1/92 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 0/92 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/148 variables, 0/92 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 92 constraints, problems are : Problem set: 3 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 1140 steps, including 102 resets, run visited all 1 properties in 9 ms. (steps per millisecond=126 )
Parikh walk visited 1 properties in 17 ms.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:53:17] [INFO ] Flatten gal took : 15 ms
[2026-05-23 15:53:17] [INFO ] Flatten gal took : 17 ms
[2026-05-23 15:53:17] [INFO ] Input system was already deterministic with 81 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 219 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 81/81 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 58 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 58 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 58 transition count 64
Applied a total of 23 rules in 23 ms. Remains 58 /67 variables (removed 9) and now considering 64/81 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16291503687399696211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-241549900400629537.kers'
[2026-05-23 15:53:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16291503687399696211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-241549900400629537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 15:53:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-241549900400629537.kers
Total runtime 1 ms.
[2026-05-23 15:53:17] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 15:53:17] [INFO ] Invariant cache hit.
[2026-05-23 15:53:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:53:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-23 15:53:18] [INFO ] Invariant cache hit.
[2026-05-23 15:53:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/122 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 63/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 63 unsolved in 7123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10414ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 10418ms
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 64/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10681 ms. Remains : 58/67 places, 64/81 transitions.
[2026-05-23 15:53:28] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:53:28] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:53:28] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:53:28] [INFO ] Flatten gal took : 34 ms
[2026-05-23 15:53:28] [INFO ] Flatten gal took : 16 ms
[2026-05-23 15:53:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15814895722965913178.gal : 4 ms
[2026-05-23 15:53:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3373374135091450018.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15814895722965913178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3373374135091450018.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,19724,0.255515,9060,2,2898,5,19031,6,0,296,15610,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.25794,9088,1,0,6,19031,7,1,403,15610,1
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 81/81 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 58 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 58 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 58 transition count 64
Applied a total of 23 rules in 23 ms. Remains 58 /67 variables (removed 9) and now considering 64/81 (removed 17) transitions.
[2026-05-23 15:53:29] [INFO ] Invariant cache hit.
[2026-05-23 15:53:29] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 15:53:29] [INFO ] Invariant cache hit.
[2026-05-23 15:53:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:53:29] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 64/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 58/67 places, 64/81 transitions.
[2026-05-23 15:53:29] [INFO ] Flatten gal took : 11 ms
[2026-05-23 15:53:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:53:29] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:53:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:53:29] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:53:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2692281623499742713.gal : 9 ms
[2026-05-23 15:53:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality7546470153734182189.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/CTLCardinality2692281623499742713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7546470153734182189.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,19724,0.249666,9128,2,2898,5,19031,6,0,296,15610,0
Converting to forward existential form...Done !
original formula: EX(EF((AX(FALSE) * EX(TRUE))))
=> equivalent forward existential formula: [(EY((FwdU(EY(Init),TRUE) * !(EX(!(FALSE))))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,0,1.17586,26236,1,0,131,83204,144,54,2057,69273,138
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 81/81 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 62 transition count 72
Applied a total of 13 rules in 42 ms. Remains 62 /67 variables (removed 5) and now considering 72/81 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2774798215116814550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1167725163436090445.kers'
[2026-05-23 15:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2774798215116814550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1167725163436090445.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 62 cols 240 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-23 15:53:30] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1167725163436090445.kers
Total runtime 6 ms.
[2026-05-23 15:53:31] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-23 15:53:31] [INFO ] Invariant cache hit.
[2026-05-23 15:53:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 15:53:31] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2026-05-23 15:53:31] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-23 15:53:31] [INFO ] Invariant cache hit.
[2026-05-23 15:53:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 72/134 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 10155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14400ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 14402ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/67 places, 72/81 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14804 ms. Remains : 62/67 places, 72/81 transitions.
[2026-05-23 15:53:45] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:53:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:53:45] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-23 15:53:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:53:45] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:53:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17939437762296954053.gal : 2 ms
[2026-05-23 15:53:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality557222954313771488.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/CTLCardinality17939437762296954053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality557222954313771488.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,29730,0.248455,11832,2,3417,5,30323,6,0,320,23591,0
Converting to forward existential form...Done !
original formula: AF(EG(EF((p37>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (p37>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...296
Using saturation style SCC detection
(forward)formula 0,1,2.62711,68820,1,0,311,331912,177,186,2282,275388,364
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 81/81 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 58 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 58 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 58 transition count 64
Applied a total of 23 rules in 12 ms. Remains 58 /67 variables (removed 9) and now considering 64/81 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14209457084416664508.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6328323396546924570.kers'
[2026-05-23 15:53:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14209457084416664508.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6328323396546924570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 15:53:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6328323396546924570.kers
Total runtime 1 ms.
[2026-05-23 15:53:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 15:53:48] [INFO ] Invariant cache hit.
[2026-05-23 15:53:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:53:48] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-23 15:53:48] [INFO ] Invariant cache hit.
[2026-05-23 15:53:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/122 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 63/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 63 unsolved in 5962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8142ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 8142ms
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 64/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8422 ms. Remains : 58/67 places, 64/81 transitions.
[2026-05-23 15:53:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:53:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:53:56] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:53:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:53:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:53:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17225734877484593423.gal : 1 ms
[2026-05-23 15:53:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality13108312572779322346.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/CTLCardinality17225734877484593423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13108312572779322346.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,19724,0.148784,9132,2,2898,5,19031,6,0,296,15610,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.150185,9132,1,0,6,19031,7,1,403,15610,1
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 81/81 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 58 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 58 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 58 transition count 64
Applied a total of 23 rules in 10 ms. Remains 58 /67 variables (removed 9) and now considering 64/81 (removed 17) transitions.
[2026-05-23 15:53:57] [INFO ] Invariant cache hit.
[2026-05-23 15:53:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 15:53:57] [INFO ] Invariant cache hit.
[2026-05-23 15:53:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:53:57] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 64/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 58/67 places, 64/81 transitions.
[2026-05-23 15:53:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:53:57] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:53:57] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:53:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:53:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:53:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality460094913921476701.gal : 2 ms
[2026-05-23 15:53:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7476990735380855049.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality460094913921476701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7476990735380855049.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,19724,0.237901,9100,2,2898,5,19031,6,0,296,15610,0
Converting to forward existential form...Done !
original formula: (AX(FALSE) + AF(AG(EX(TRUE))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(FALSE))))),!(!(E(TRUE U !(EX(TRUE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,0,1.15183,31216,1,0,143,108466,152,61,2097,96515,156
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-12 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 : 67/67 places, 81/81 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 63 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 61 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 59 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 59 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 59 transition count 66
Applied a total of 20 rules in 25 ms. Remains 59 /67 variables (removed 8) and now considering 66/81 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12276384906430076771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1854106912591838485.kers'
[2026-05-23 15:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12276384906430076771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1854106912591838485.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 59 cols 218 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 15:53:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1854106912591838485.kers
Total runtime 1 ms.
[2026-05-23 15:53:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 15:53:58] [INFO ] Invariant cache hit.
[2026-05-23 15:53:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:53:58] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2026-05-23 15:53:58] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-23 15:53:58] [INFO ] Invariant cache hit.
[2026-05-23 15:53:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 83 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/125 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 65/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 148 constraints, problems are : Problem set: 0 solved, 65 unsolved in 6530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9792ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 9794ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/67 places, 66/81 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10090 ms. Remains : 59/67 places, 66/81 transitions.
[2026-05-23 15:54:08] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:54:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:54:08] [INFO ] Input system was already deterministic with 66 transitions.
[2026-05-23 15:54:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:54:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:54:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16612554211854146510.gal : 2 ms
[2026-05-23 15:54:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14256219017945423951.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/CTLCardinality16612554211854146510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14256219017945423951.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,19892,0.186894,9712,2,3038,5,23017,6,0,302,17219,0
Converting to forward existential form...Done !
original formula: EG((p31<=0))
=> equivalent forward existential formula: [FwdG(Init,(p31<=0))] != FALSE
Hit Full ! (commute/partial/dont) 64/0/2
(forward)formula 0,1,0.857947,23472,1,0,19,78433,19,4,1615,48805,16
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2026-05-23 15:54:09] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:54:09] [INFO ] Flatten gal took : 6 ms
Total runtime 82347 ms.
BK_STOP 1779551649641
--------------------
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="DBSingleClientW-PT-d0m05"
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 DBSingleClientW-PT-d0m05, 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 r082-smll-177946993500089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m05.tgz
mv DBSingleClientW-PT-d0m05 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 ;
