About the Execution of ITS-Tools for DBSingleClientW-PT-d2m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1047.964 | 401902.00 | 448622.00 | 993.60 | FFFFFTFTFTTTTFFT | 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-177946993600209.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-d2m06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.5K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 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 1.6M 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-d2m06-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-12
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-13
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-14
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779601211789
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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 05:40:14] [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 05:40:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:40:14] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2026-05-24 05:40:15] [INFO ] Transformed 4763 places.
[2026-05-24 05:40:15] [INFO ] Transformed 2478 transitions.
[2026-05-24 05:40:15] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 874 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 48 ms.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 386 places :
Symmetric choice reduction at 1 with 386 rule applications. Total rules 631 place count 751 transition count 1215
Iterating global reduction 1 with 386 rules applied. Total rules applied 1017 place count 751 transition count 1215
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1025 place count 751 transition count 1207
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1337 place count 439 transition count 895
Iterating global reduction 2 with 312 rules applied. Total rules applied 1649 place count 439 transition count 895
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1661 place count 439 transition count 883
Discarding 232 places :
Symmetric choice reduction at 3 with 232 rule applications. Total rules 1893 place count 207 transition count 561
Iterating global reduction 3 with 232 rules applied. Total rules applied 2125 place count 207 transition count 561
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 3 with 206 rules applied. Total rules applied 2331 place count 207 transition count 355
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2352 place count 186 transition count 315
Iterating global reduction 4 with 21 rules applied. Total rules applied 2373 place count 186 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2378 place count 186 transition count 310
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2392 place count 172 transition count 296
Iterating global reduction 5 with 14 rules applied. Total rules applied 2406 place count 172 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2409 place count 172 transition count 293
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2421 place count 160 transition count 281
Iterating global reduction 6 with 12 rules applied. Total rules applied 2433 place count 160 transition count 281
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2441 place count 160 transition count 273
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2444 place count 157 transition count 264
Iterating global reduction 7 with 3 rules applied. Total rules applied 2447 place count 157 transition count 264
Applied a total of 2447 rules in 285 ms. Remains 157 /1183 variables (removed 1026) and now considering 264/2478 (removed 2214) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18201988286722740493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1069953156196159287.kers'
[2026-05-24 05:40:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18201988286722740493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1069953156196159287.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 157 cols 816 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-05-24 05:40:15] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1069953156196159287.kers
Total runtime 3 ms.
[2026-05-24 05:40:16] [INFO ] Implicit Places using invariants in 611 ms returned []
[2026-05-24 05:40:16] [INFO ] Invariant cache hit.
[2026-05-24 05:40:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-24 05:40:17] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2026-05-24 05:40:17] [INFO ] Invariant cache hit.
[2026-05-24 05:40:17] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 264/421 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 110/269 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/421 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 269 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 264/421 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 110/269 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 263/532 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 532 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60889ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 60917ms
Starting structural reductions in LTL mode, iteration 1 : 157/1183 places, 264/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63486 ms. Remains : 157/1183 places, 264/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2026-05-24 05:41:18] [INFO ] Invariant cache hit.
[2026-05-24 05:41:18] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-24 05:41:18] [INFO ] Invariant cache hit.
[2026-05-24 05:41:19] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-24 05:41:20] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1515 ms. Remains : 157/157 places, 264/264 transitions.
Support contains 11 out of 157 places after structural reductions.
[2026-05-24 05:41:20] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-24 05:41:20] [INFO ] Flatten gal took : 104 ms
[2026-05-24 05:41:20] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:41:20] [INFO ] Flatten gal took : 51 ms
[2026-05-24 05:41:20] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 5 out of 157 places (down from 11) after GAL structural reductions.
RANDOM walk for 40000 steps (9096 resets) in 3853 ms. (10 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3950 resets) in 429 ms. (93 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (3899 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3858 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3820 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
[2026-05-24 05:41:22] [INFO ] Invariant cache hit.
[2026-05-24 05:41:22] [INFO ] State equation strengthened by 110 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
At refinement iteration 1 (OVERLAPS) 93/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 170/272 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 16/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 8 (OVERLAPS) 141/413 variables, 51/171 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 90/261 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 11 (OVERLAPS) 8/421 variables, 4/265 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 4/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/421 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 269 constraints, problems are : Problem set: 3 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 110/110 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/168 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 9/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/227 variables, 1/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 59/75 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/264 variables, 1/76 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 14/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/90 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 147/411 variables, 74/164 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 96/260 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/421 variables, 5/265 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 5/270 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/421 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 270 constraints, problems are : Problem set: 3 solved, 1 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 264/264 transitions.
Graph (complete) has 551 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 156 transition count 259
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 16 place count 146 transition count 241
Iterating global reduction 1 with 10 rules applied. Total rules applied 26 place count 146 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 146 transition count 239
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 36 place count 138 transition count 229
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 138 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 49 place count 138 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 133 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 133 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 133 transition count 208
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 131 transition count 200
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 131 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 131 transition count 197
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 71 place count 128 transition count 177
Iterating global reduction 5 with 3 rules applied. Total rules applied 74 place count 128 transition count 177
Applied a total of 74 rules in 103 ms. Remains 128 /157 variables (removed 29) and now considering 177/264 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 128/157 places, 177/264 transitions.
RANDOM walk for 40000 steps (9238 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3819 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22221 steps, run visited all 1 properties in 238 ms. (steps per millisecond=93 )
Probabilistic random walk after 22221 steps, saw 10909 distinct states, run finished after 245 ms. (steps per millisecond=90 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:41:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 05:41:23] [INFO ] Flatten gal took : 36 ms
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:41:23] [INFO ] Flatten gal took : 36 ms
[2026-05-24 05:41:23] [INFO ] Input system was already deterministic with 264 transitions.
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 593 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 264/264 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 244
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 146 transition count 242
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 137 transition count 230
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 137 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 47 place count 137 transition count 225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 131 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 131 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 131 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 128 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 128 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 128 transition count 194
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 75 place count 124 transition count 173
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 124 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 124 transition count 171
Applied a total of 81 rules in 32 ms. Remains 124 /157 variables (removed 33) and now considering 171/264 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5465108641024093255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8924836117873589778.kers'
[2026-05-24 05:41:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5465108641024093255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8924836117873589778.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 124 cols 568 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-24 05:41:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8924836117873589778.kers
Total runtime 2 ms.
[2026-05-24 05:41:24] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 05:41:24] [INFO ] Invariant cache hit.
[2026-05-24 05:41:24] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:41:24] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-24 05:41:24] [INFO ] Invariant cache hit.
[2026-05-24 05:41:24] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 181 constraints, problems are : Problem set: 0 solved, 170 unsolved in 25009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/295 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 52/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 170/351 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 351 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55270ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 55276ms
Starting structural reductions in LTL mode, iteration 1 : 124/157 places, 171/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56028 ms. Remains : 124/157 places, 171/264 transitions.
[2026-05-24 05:42:19] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:42:19] [INFO ] Flatten gal took : 16 ms
[2026-05-24 05:42:19] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-24 05:42:19] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:42:19] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:42:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality4334435607327982482.gal : 8 ms
[2026-05-24 05:42:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14585856652480214240.ctl : 5 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/CTLCardinality4334435607327982482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14585856652480214240.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6637e+06,12.0797,251476,2,20752,5,667465,6,0,667,880467,0
Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
(forward)formula 0,1,18.6072,258988,1,0,306,971361,363,121,4758,880467,358
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 264/264 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 249
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 147 transition count 247
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 139 transition count 236
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 139 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 139 transition count 231
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 134 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 134 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 134 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 131 transition count 205
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 131 transition count 202
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 68 place count 127 transition count 181
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 127 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 127 transition count 179
Applied a total of 74 rules in 18 ms. Remains 127 /157 variables (removed 30) and now considering 179/264 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6618162438174284701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18008176210377725865.kers'
[2026-05-24 05:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6618162438174284701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18008176210377725865.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 127 cols 598 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 05:42:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18008176210377725865.kers
Total runtime 2 ms.
[2026-05-24 05:42:38] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-24 05:42:38] [INFO ] Invariant cache hit.
[2026-05-24 05:42:39] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-24 05:42:40] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2026-05-24 05:42:40] [INFO ] Invariant cache hit.
[2026-05-24 05:42:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 53/182 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 182 constraints, problems are : Problem set: 0 solved, 178 unsolved in 14308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 53/182 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/360 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 360 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44506ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 44508ms
Starting structural reductions in LTL mode, iteration 1 : 127/157 places, 179/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45787 ms. Remains : 127/157 places, 179/264 transitions.
[2026-05-24 05:43:24] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:43:24] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:43:24] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-24 05:43:24] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:43:24] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:43:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality12308540086411581853.gal : 4 ms
[2026-05-24 05:43:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality91962733833939762.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/CTLCardinality12308540086411581853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality91962733833939762.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,2.44108e+06,18.3248,367484,2,22597,5,992640,6,0,687,1.42057e+06,0
Converting to forward existential form...Done !
original formula: EF((AX(FALSE) * EG((l4308<=0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!(FALSE)))),(l4308<=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t101, t112, t116...599
Hit Full ! (commute/partial/dont) 173/0/6
(forward)formula 0,1,25.7669,370588,1,0,326,1.14527e+06,383,127,5106,1.42057e+06,378
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 264/264 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 244
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 146 transition count 242
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 137 transition count 230
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 137 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 47 place count 137 transition count 225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 131 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 131 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 131 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 128 transition count 197
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 128 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 128 transition count 194
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 75 place count 124 transition count 173
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 124 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 124 transition count 171
Applied a total of 81 rules in 18 ms. Remains 124 /157 variables (removed 33) and now considering 171/264 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7562859425812557927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9916480412532263261.kers'
[2026-05-24 05:43:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7562859425812557927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9916480412532263261.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 124 cols 568 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-24 05:43:50] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9916480412532263261.kers
Total runtime 1 ms.
[2026-05-24 05:43:50] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-24 05:43:50] [INFO ] Invariant cache hit.
[2026-05-24 05:43:50] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:43:51] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-24 05:43:51] [INFO ] Invariant cache hit.
[2026-05-24 05:43:51] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 181 constraints, problems are : Problem set: 0 solved, 170 unsolved in 25517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/295 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 52/181 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 170/351 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 351 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55599ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 55600ms
Starting structural reductions in LTL mode, iteration 1 : 124/157 places, 171/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56443 ms. Remains : 124/157 places, 171/264 transitions.
[2026-05-24 05:44:47] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:44:47] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:44:47] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-24 05:44:47] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:44:47] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:44:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3826966353047395106.gal : 3 ms
[2026-05-24 05:44:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9200972235584198511.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/CTLCardinality3826966353047395106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9200972235584198511.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6637e+06,11.6057,252756,2,20752,5,667465,6,0,667,880467,0
Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
Detected timeout of ITS tools.
[2026-05-24 05:45:17] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:45:17] [INFO ] Applying decomposition
[2026-05-24 05:45:17] [INFO ] Flatten gal took : 8 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/graph5744592753998576355.txt' '-o' '/tmp/graph5744592753998576355.bin' '-w' '/tmp/graph5744592753998576355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5744592753998576355.bin' '-l' '-1' '-v' '-w' '/tmp/graph5744592753998576355.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:45:17] [INFO ] Decomposing Gal with order
[2026-05-24 05:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:45:17] [INFO ] Removed a total of 195 redundant transitions.
[2026-05-24 05:45:17] [INFO ] Flatten gal took : 94 ms
[2026-05-24 05:45:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 21 ms.
[2026-05-24 05:45:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1054030077392354015.gal : 7 ms
[2026-05-24 05:45:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality10080267922961962839.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/CTLCardinality1054030077392354015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10080267922961962839.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6637e+06,1.38168,40364,1951,1228,54480,9485,574,128083,164,54056,0
Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t68, t69, t73, t74, t75, t81, t83, t87, t89, t90, t110, t120, t122, t123, t124, t125...524
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,7.81545,194668,1,0,297735,44470,2327,741521,828,279204,840271
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 264/264 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 245
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 147 transition count 243
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 139 transition count 232
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 139 transition count 232
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 139 transition count 227
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 134 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 134 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 134 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 132 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 132 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 132 transition count 200
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 65 place count 129 transition count 180
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 129 transition count 180
Applied a total of 68 rules in 63 ms. Remains 129 /157 variables (removed 28) and now considering 180/264 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15020372928357834967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3307793265935418421.kers'
[2026-05-24 05:45:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15020372928357834967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3307793265935418421.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 129 cols 598 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 05:45:25] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3307793265935418421.kers
Total runtime 2 ms.
[2026-05-24 05:45:25] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 05:45:25] [INFO ] Invariant cache hit.
[2026-05-24 05:45:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 05:45:26] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2026-05-24 05:45:26] [INFO ] Redundant transitions in 12 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-24 05:45:26] [INFO ] Invariant cache hit.
[2026-05-24 05:45:26] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/309 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 55/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 18880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/309 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 55/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49037ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 49038ms
Starting structural reductions in SI_CTL mode, iteration 1 : 129/157 places, 180/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50262 ms. Remains : 129/157 places, 180/264 transitions.
[2026-05-24 05:46:15] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:46:15] [INFO ] Flatten gal took : 21 ms
[2026-05-24 05:46:15] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 05:46:15] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:46:15] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:46:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality13115190141017660921.gal : 4 ms
[2026-05-24 05:46:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality5354659827846927981.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/CTLCardinality13115190141017660921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5354659827846927981.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,2.78056e+06,14.9945,334472,2,27199,5,836256,6,0,696,1.2244e+06,0
Converting to forward existential form...Done !
original formula: EF(AG((l4280<=0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((l4280<=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t97, t99, t100, ...597
Detected timeout of ITS tools.
[2026-05-24 05:46:45] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:46:45] [INFO ] Applying decomposition
[2026-05-24 05:46:45] [INFO ] Flatten gal took : 8 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/graph4392549986527282002.txt' '-o' '/tmp/graph4392549986527282002.bin' '-w' '/tmp/graph4392549986527282002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4392549986527282002.bin' '-l' '-1' '-v' '-w' '/tmp/graph4392549986527282002.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:46:45] [INFO ] Decomposing Gal with order
[2026-05-24 05:46:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:46:45] [INFO ] Removed a total of 210 redundant transitions.
[2026-05-24 05:46:45] [INFO ] Flatten gal took : 27 ms
[2026-05-24 05:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 14 ms.
[2026-05-24 05:46:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13912617879688292106.gal : 5 ms
[2026-05-24 05:46:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13097195823108879155.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/CTLCardinality13912617879688292106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13097195823108879155.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,2.78056e+06,3.76337,92200,2107,1964,80839,26851,530,369152,132,382095,0
Converting to forward existential form...Done !
original formula: EF(AG((i8.u22.l4280<=0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i8.u22.l4280<=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t70, t73, t74, t75, t83, t86, t87, t90, t97, t98, t100, t116, t120, t126, t128, ...589
(forward)formula 0,1,7.61726,133804,1,0,139755,51475,1990,637200,638,415538,386676
FORMULA DBSingleClientW-PT-d2m06-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2026-05-24 05:46:53] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:46:53] [INFO ] Flatten gal took : 10 ms
Total runtime 399455 ms.
BK_STOP 1779601613691
--------------------
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-d2m06"
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-d2m06, 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-177946993600209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m06.tgz
mv DBSingleClientW-PT-d2m06 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 ;