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-171624189400473.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-d0m09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189400473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 119K 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-d0m09-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717189063862

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-d0m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:57:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:57:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:57:45] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 20:57:45] [INFO ] Transformed 553 places.
[2024-05-31 20:57:45] [INFO ] Transformed 150 transitions.
[2024-05-31 20:57:45] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 103 transition count 139
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 83 transition count 104
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 83 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 83 transition count 103
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 76 transition count 96
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 76 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 76 transition count 95
Applied a total of 73 rules in 33 ms. Remains 76 /109 variables (removed 33) and now considering 95/150 (removed 55) transitions.
// Phase 1: matrix 95 rows 76 cols
[2024-05-31 20:57:45] [INFO ] Computed 3 invariants in 14 ms
[2024-05-31 20:57:45] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-31 20:57:45] [INFO ] Invariant cache hit.
[2024-05-31 20:57:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 20:57:45] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-31 20:57:45] [INFO ] Invariant cache hit.
[2024-05-31 20:57:45] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/171 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 111 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/171 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 94/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 205 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 5165ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5178ms
Starting structural reductions in LTL mode, iteration 1 : 76/109 places, 95/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5636 ms. Remains : 76/109 places, 95/150 transitions.
Support contains 12 out of 76 places after structural reductions.
[2024-05-31 20:57:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-31 20:57:51] [INFO ] Flatten gal took : 29 ms
[2024-05-31 20:57:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:57:51] [INFO ] Flatten gal took : 22 ms
[2024-05-31 20:57:51] [INFO ] Input system was already deterministic with 95 transitions.
Support contains 7 out of 76 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (9214 resets) in 1545 ms. (25 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (4040 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3945 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4026 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4080 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
[2024-05-31 20:57:52] [INFO ] Invariant cache hit.
[2024-05-31 20:57:52] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/31 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/60 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-31 20:57:52] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 13 ms to minimize.
[2024-05-31 20:57:52] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 79/139 variables, 60/65 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 16/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 9 (OVERLAPS) 32/171 variables, 16/97 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 16/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/171 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 113 constraints, problems are : Problem set: 3 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/136 variables, 59/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 14/78 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/79 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 35/171 variables, 17/96 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 18/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/171 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 114 constraints, problems are : Problem set: 3 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 315ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 95/95 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 71 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 66 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 66 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 66 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 64 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 64 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 62 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 62 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 60 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 60 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 60 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 59 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 59 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 59 transition count 64
Applied a total of 40 rules in 22 ms. Remains 59 /76 variables (removed 17) and now considering 64/95 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 59/76 places, 64/95 transitions.
RANDOM walk for 40000 steps (9164 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4102 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4887 steps, run visited all 1 properties in 26 ms. (steps per millisecond=187 )
Probabilistic random walk after 4887 steps, saw 2206 distinct states, run finished after 30 ms. (steps per millisecond=162 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 2 simplifications.
FORMULA DBSingleClientW-PT-d0m09-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 7 ms
[2024-05-31 20:57:52] [INFO ] Input system was already deterministic with 95 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 249 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 95/95 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 70 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 65 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 63 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 41 place count 58 transition count 64
Applied a total of 41 rules in 12 ms. Remains 58 /76 variables (removed 18) and now considering 64/95 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 58/76 places, 64/95 transitions.
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:57:52] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 95/95 transitions.
Graph (complete) has 249 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 70 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 65 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 63 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 58 transition count 64
Applied a total of 41 rules in 19 ms. Remains 58 /76 variables (removed 18) and now considering 64/95 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 58/76 places, 64/95 transitions.
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:57:52] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 95/95 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 70 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 65 transition count 79
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 63 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 41 place count 58 transition count 64
Applied a total of 41 rules in 8 ms. Remains 58 /76 variables (removed 18) and now considering 64/95 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 58/76 places, 64/95 transitions.
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:57:52] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:57:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:57:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:57:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 95 transitions and 375 arcs took 2 ms.
Total runtime 7719 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-d0m09-CTLCardinality-2024-02
Could not compute solution for formula : DBSingleClientW-PT-d0m09-CTLCardinality-2023-13
Could not compute solution for formula : DBSingleClientW-PT-d0m09-CTLCardinality-2023-14

BK_STOP 1717189073092

--------------------
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-d0m09-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/506/ctl_0_
ctl formula name DBSingleClientW-PT-d0m09-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/506/ctl_1_
ctl formula name DBSingleClientW-PT-d0m09-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/506/ctl_2_
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-d0m09"
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-d0m09, 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-171624189400473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m09.tgz
mv DBSingleClientW-PT-d0m09 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 ;