Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600147.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DBSingleClientW-PT-d2m08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 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-d2m08-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748621816177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 16:16:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 16:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 16:16:58] [INFO ] Load time of PNML (sax parser for PT used): 563 ms
[2025-05-30 16:16:58] [INFO ] Transformed 4763 places.
[2025-05-30 16:16:59] [INFO ] Transformed 2478 transitions.
[2025-05-30 16:16:59] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 780 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 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 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 636 place count 746 transition count 1209
Iterating global reduction 1 with 391 rules applied. Total rules applied 1027 place count 746 transition count 1209
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1036 place count 746 transition count 1200
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1352 place count 430 transition count 884
Iterating global reduction 2 with 316 rules applied. Total rules applied 1668 place count 430 transition count 884
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1680 place count 430 transition count 872
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1919 place count 191 transition count 533
Iterating global reduction 3 with 239 rules applied. Total rules applied 2158 place count 191 transition count 533
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2368 place count 191 transition count 323
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2392 place count 167 transition count 278
Iterating global reduction 4 with 24 rules applied. Total rules applied 2416 place count 167 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2422 place count 167 transition count 272
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2437 place count 152 transition count 257
Iterating global reduction 5 with 15 rules applied. Total rules applied 2452 place count 152 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2456 place count 152 transition count 253
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2468 place count 140 transition count 241
Iterating global reduction 6 with 12 rules applied. Total rules applied 2480 place count 140 transition count 241
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2492 place count 140 transition count 229
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2497 place count 135 transition count 202
Iterating global reduction 7 with 5 rules applied. Total rules applied 2502 place count 135 transition count 202
Applied a total of 2502 rules in 370 ms. Remains 135 /1183 variables (removed 1048) and now considering 202/2478 (removed 2276) transitions.
// Phase 1: matrix 202 rows 135 cols
[2025-05-30 16:16:59] [INFO ] Computed 2 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:17:00] [INFO ] Implicit Places using invariants in 622 ms returned []
[2025-05-30 16:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:17:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-05-30 16:17:01] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-05-30 16:17:01] [INFO ] Invariant cache hit.
[2025-05-30 16:17:01] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/337 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 74/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 21857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/337 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 74/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52584ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 52609ms
Starting structural reductions in LTL mode, iteration 1 : 135/1183 places, 202/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54877 ms. Remains : 135/1183 places, 202/2478 transitions.
Support contains 4 out of 135 places after structural reductions.
[2025-05-30 16:17:54] [INFO ] Flatten gal took : 67 ms
[2025-05-30 16:17:54] [INFO ] Flatten gal took : 34 ms
[2025-05-30 16:17:54] [INFO ] Input system was already deterministic with 202 transitions.
RANDOM walk for 40000 steps (9188 resets) in 3035 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3847 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3699 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3838 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 38455 steps, run visited all 3 properties in 196 ms. (steps per millisecond=196 )
Probabilistic random walk after 38455 steps, saw 18198 distinct states, run finished after 203 ms. (steps per millisecond=189 ) properties seen :3
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 492 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 202/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 133 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 131 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 131 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 130 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 130 transition count 185
Applied a total of 13 rules in 46 ms. Remains 130 /135 variables (removed 5) and now considering 185/202 (removed 17) transitions.
// Phase 1: matrix 185 rows 130 cols
[2025-05-30 16:17:56] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:17:56] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-30 16:17:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:17:56] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 16:17:57] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:17:57] [INFO ] Redundant transitions in 13 ms returned []
Running 184 sub problems to find dead transitions.
[2025-05-30 16:17:57] [INFO ] Invariant cache hit.
[2025-05-30 16:17:57] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/315 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 195 constraints, problems are : Problem set: 0 solved, 184 unsolved in 19474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/315 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 184/379 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 379 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49767ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 49770ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/135 places, 185/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50953 ms. Remains : 130/135 places, 185/202 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLCardinality-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m08-LTLCardinality-10 finished in 51397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 129 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 129 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 127 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 126 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 126 transition count 182
Applied a total of 21 rules in 59 ms. Remains 126 /135 variables (removed 9) and now considering 182/202 (removed 20) transitions.
// Phase 1: matrix 182 rows 126 cols
[2025-05-30 16:18:47] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:18:47] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 16:18:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:18:47] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 16:18:48] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:18:48] [INFO ] Redundant transitions in 16 ms returned []
Running 181 sub problems to find dead transitions.
[2025-05-30 16:18:48] [INFO ] Invariant cache hit.
[2025-05-30 16:18:48] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/308 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:18:58] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:18:58] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:05] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:05] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:05] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/308 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:08] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:17] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:17] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 15 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/308 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/308 variables, and 197 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/308 variables, 126/136 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 61/197 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 181/378 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 378 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/135 places, 182/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61266 ms. Remains : 126/135 places, 182/202 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLCardinality-12
Product exploration explored 100000 steps with 23101 reset in 495 ms.
Product exploration explored 100000 steps with 22971 reset in 330 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 458 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9263 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3860 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18910 steps, run visited all 1 properties in 152 ms. (steps per millisecond=124 )
Probabilistic random walk after 18910 steps, saw 9293 distinct states, run finished after 152 ms. (steps per millisecond=124 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 182/182 transitions.
Applied a total of 0 rules in 14 ms. Remains 126 /126 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2025-05-30 16:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:50] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-05-30 16:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:19:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 16:19:51] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:19:51] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2025-05-30 16:19:51] [INFO ] Invariant cache hit.
[2025-05-30 16:19:51] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/308 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:19:59] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:00] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:06] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:06] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:07] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 14 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/308 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:09] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:18] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:20:18] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 15 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/308 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/308 variables, and 197 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/308 variables, 126/136 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 61/197 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 181/378 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 378 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60928 ms. Remains : 126/126 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 458 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9197 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3749 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18910 steps, run visited all 1 properties in 49 ms. (steps per millisecond=385 )
Probabilistic random walk after 18910 steps, saw 9293 distinct states, run finished after 49 ms. (steps per millisecond=385 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23065 reset in 367 ms.
Product exploration explored 100000 steps with 23004 reset in 281 ms.
Built C files in :
/tmp/ltsmin1082935667733371330
[2025-05-30 16:20:52] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2025-05-30 16:20:52] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:20:52] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2025-05-30 16:20:52] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:20:52] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2025-05-30 16:20:52] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 16:20:52] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1082935667733371330
Running compilation step : cd /tmp/ltsmin1082935667733371330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1206 ms.
Running link step : cd /tmp/ltsmin1082935667733371330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 102 ms.
Running LTSmin : cd /tmp/ltsmin1082935667733371330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8831140490955745260.hoa' '--buchi-type=spotba'
LTSmin run took 697 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLCardinality-12 finished in 127212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 129 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 129 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 128 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 128 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 127 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 127 transition count 177
Applied a total of 18 rules in 13 ms. Remains 127 /135 variables (removed 8) and now considering 177/202 (removed 25) transitions.
// Phase 1: matrix 177 rows 127 cols
[2025-05-30 16:20:54] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:20:54] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-30 16:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:20:55] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 16:20:55] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-05-30 16:20:55] [INFO ] Invariant cache hit.
[2025-05-30 16:20:55] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/304 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 54/183 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:04] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:05] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:05] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:05] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:05] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:05] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:05] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:21:06] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 191 constraints, problems are : Problem set: 0 solved, 176 unsolved in 24819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 177/304 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 54/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 176/367 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 367 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54989ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 54990ms
Starting structural reductions in LTL mode, iteration 1 : 127/135 places, 177/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56107 ms. Remains : 127/135 places, 177/202 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d2m08-LTLCardinality-13
Product exploration explored 100000 steps with 28552 reset in 498 ms.
Product exploration explored 100000 steps with 28584 reset in 330 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 457 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (9137 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3849 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35887 steps, run visited all 1 properties in 133 ms. (steps per millisecond=269 )
Probabilistic random walk after 35887 steps, saw 17056 distinct states, run finished after 133 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 177/177 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2025-05-30 16:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:21:53] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-30 16:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:21:53] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 16:21:53] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-05-30 16:21:53] [INFO ] Invariant cache hit.
[2025-05-30 16:21:53] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/304 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 54/183 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:02] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:02] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:03] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:03] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:03] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:03] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:03] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:03] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 191 constraints, problems are : Problem set: 0 solved, 176 unsolved in 23714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 177/304 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 54/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 176/367 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 367 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53921ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 53922ms
Finished structural reductions in LTL mode , in 1 iterations and 54909 ms. Remains : 127/127 places, 177/177 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 457 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (9163 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3848 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35887 steps, run visited all 1 properties in 130 ms. (steps per millisecond=276 )
Probabilistic random walk after 35887 steps, saw 17056 distinct states, run finished after 130 ms. (steps per millisecond=276 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 28579 reset in 320 ms.
Product exploration explored 100000 steps with 28567 reset in 328 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 177/177 transitions.
Applied a total of 0 rules in 16 ms. Remains 127 /127 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:22:50] [INFO ] Redundant transitions in 4 ms returned []
Running 176 sub problems to find dead transitions.
[2025-05-30 16:22:50] [INFO ] Invariant cache hit.
[2025-05-30 16:22:50] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/304 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 54/183 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:58] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:58] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:58] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:58] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:59] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:59] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:59] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:22:59] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 191 constraints, problems are : Problem set: 0 solved, 176 unsolved in 23106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 177/304 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 54/191 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 176/367 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 367 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53304ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 53306ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53338 ms. Remains : 127/127 places, 177/177 transitions.
Built C files in :
/tmp/ltsmin9658387473446319141
[2025-05-30 16:23:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9658387473446319141
Running compilation step : cd /tmp/ltsmin9658387473446319141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 707 ms.
Running link step : cd /tmp/ltsmin9658387473446319141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9658387473446319141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14408424150602450479.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA DBSingleClientW-PT-d2m08-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m08-LTLCardinality-13 finished in 169873 ms.
All properties solved by simple procedures.
Total runtime 406377 ms.

BK_STOP 1748622224624

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-d2m08"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063600147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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