Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189400505.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d1m06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189400505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717189408868

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:03:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:03:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:03:30] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-31 21:03:30] [INFO ] Transformed 1440 places.
[2024-05-31 21:03:30] [INFO ] Transformed 672 transitions.
[2024-05-31 21:03:30] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 327 transition count 594
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 189 place count 236 transition count 349
Iterating global reduction 1 with 91 rules applied. Total rules applied 280 place count 236 transition count 349
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 286 place count 236 transition count 343
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 351 place count 171 transition count 278
Iterating global reduction 2 with 65 rules applied. Total rules applied 416 place count 171 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 422 place count 171 transition count 272
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 452 place count 141 transition count 224
Iterating global reduction 3 with 30 rules applied. Total rules applied 482 place count 141 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 497 place count 141 transition count 209
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 503 place count 135 transition count 198
Iterating global reduction 4 with 6 rules applied. Total rules applied 509 place count 135 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 513 place count 135 transition count 194
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 517 place count 131 transition count 190
Iterating global reduction 5 with 4 rules applied. Total rules applied 521 place count 131 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 523 place count 131 transition count 188
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 525 place count 129 transition count 186
Iterating global reduction 6 with 2 rules applied. Total rules applied 527 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 528 place count 128 transition count 184
Iterating global reduction 6 with 1 rules applied. Total rules applied 529 place count 128 transition count 184
Applied a total of 529 rules in 90 ms. Remains 128 /347 variables (removed 219) and now considering 184/672 (removed 488) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-31 21:03:30] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 21:03:31] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-31 21:03:31] [INFO ] Invariant cache hit.
[2024-05-31 21:03:31] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-31 21:03:31] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-31 21:03:31] [INFO ] Invariant cache hit.
[2024-05-31 21:03:31] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/311 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 69/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 199 constraints, problems are : Problem set: 0 solved, 183 unsolved in 10531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/311 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 69/198 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 174/372 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/312 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 9/382 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (OVERLAPS) 0/312 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 382 constraints, problems are : Problem set: 0 solved, 183 unsolved in 15757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
After SMT, in 26720ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 26744ms
Starting structural reductions in LTL mode, iteration 1 : 128/347 places, 184/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27456 ms. Remains : 128/347 places, 184/672 transitions.
Support contains 23 out of 128 places after structural reductions.
[2024-05-31 21:03:58] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-31 21:03:58] [INFO ] Flatten gal took : 39 ms
[2024-05-31 21:03:58] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:03:58] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:03:58] [INFO ] Input system was already deterministic with 184 transitions.
Support contains 9 out of 128 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (9213 resets) in 1857 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3901 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3896 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3928 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3874 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3918 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (5000 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 635513 steps, run timeout after 3005 ms. (steps per millisecond=211 ) properties seen :0 out of 6
Probabilistic random walk after 635513 steps, saw 238989 distinct states, run finished after 3008 ms. (steps per millisecond=211 ) properties seen :0
[2024-05-31 21:04:02] [INFO ] Invariant cache hit.
[2024-05-31 21:04:02] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 34/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 5 (OVERLAPS) 137/226 variables, 89/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 22/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 309/312 variables, and 150 constraints, problems are : Problem set: 6 solved, 0 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/128 constraints, ReadFeed: 22/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:04:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 13 ms
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:04:02] [INFO ] Input system was already deterministic with 184 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 445 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 184/184 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 183
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 110 transition count 158
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 110 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 110 transition count 154
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 51 place count 99 transition count 137
Iterating global reduction 2 with 11 rules applied. Total rules applied 62 place count 99 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 99 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 72 place count 92 transition count 123
Iterating global reduction 3 with 7 rules applied. Total rules applied 79 place count 92 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 92 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 87 place count 87 transition count 109
Iterating global reduction 4 with 5 rules applied. Total rules applied 92 place count 87 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 87 transition count 108
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 96 place count 84 transition count 105
Iterating global reduction 5 with 3 rules applied. Total rules applied 99 place count 84 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 101 place count 83 transition count 103
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 83 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 104 place count 83 transition count 101
Applied a total of 104 rules in 11 ms. Remains 83 /128 variables (removed 45) and now considering 101/184 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 83/128 places, 101/184 transitions.
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:04:02] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 184/184 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 183
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 110 transition count 158
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 110 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 110 transition count 154
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 51 place count 99 transition count 137
Iterating global reduction 2 with 11 rules applied. Total rules applied 62 place count 99 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 99 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 72 place count 92 transition count 123
Iterating global reduction 3 with 7 rules applied. Total rules applied 79 place count 92 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 92 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 87 place count 87 transition count 109
Iterating global reduction 4 with 5 rules applied. Total rules applied 92 place count 87 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 87 transition count 108
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 96 place count 84 transition count 105
Iterating global reduction 5 with 3 rules applied. Total rules applied 99 place count 84 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 101 place count 83 transition count 103
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 83 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 104 place count 83 transition count 101
Applied a total of 104 rules in 10 ms. Remains 83 /128 variables (removed 45) and now considering 101/184 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 83/128 places, 101/184 transitions.
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:04:02] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:04:02] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:04:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-31 21:04:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 184 transitions and 725 arcs took 2 ms.
Total runtime 32375 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d1m06-CTLCardinality-2024-10
Could not compute solution for formula : DBSingleClientW-PT-d1m06-CTLCardinality-2023-13

BK_STOP 1717189442980

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DBSingleClientW-PT-d1m06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/511/ctl_0_
ctl formula name DBSingleClientW-PT-d1m06-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/511/ctl_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-d1m06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d1m06, 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 r480-tall-171624189400505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;