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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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-d0m06-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717188888781

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:54:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:54:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:54:50] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-31 20:54:50] [INFO ] Transformed 553 places.
[2024-05-31 20:54:50] [INFO ] Transformed 150 transitions.
[2024-05-31 20:54:50] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 103 transition count 146
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 31 place count 82 transition count 107
Iterating global reduction 1 with 21 rules applied. Total rules applied 52 place count 82 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 73 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 71 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 70 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 69 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 69 transition count 88
Applied a total of 81 rules in 48 ms. Remains 69 /109 variables (removed 40) and now considering 88/150 (removed 62) transitions.
// Phase 1: matrix 88 rows 69 cols
[2024-05-31 20:54:50] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 20:54:50] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-31 20:54:50] [INFO ] Invariant cache hit.
[2024-05-31 20:54:50] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 20:54:51] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-31 20:54:51] [INFO ] Invariant cache hit.
[2024-05-31 20:54:51] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/156 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-31 20:54:53] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 21 ms to minimize.
[2024-05-31 20:54:53] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-31 20:54:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/157 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/157 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 108 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/156 variables, 68/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 34/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 75/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/157 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/157 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 195 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
After SMT, in 8308ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 8324ms
Starting structural reductions in LTL mode, iteration 1 : 69/109 places, 88/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8883 ms. Remains : 69/109 places, 88/150 transitions.
Support contains 9 out of 69 places after structural reductions.
[2024-05-31 20:54:59] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-31 20:54:59] [INFO ] Flatten gal took : 27 ms
[2024-05-31 20:54:59] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:54:59] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:54:59] [INFO ] Input system was already deterministic with 88 transitions.
Support contains 5 out of 69 places (down from 9) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9106 resets) in 1424 ms. (28 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (4065 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3940 resets) in 149 ms. (266 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (3944 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
[2024-05-31 20:55:00] [INFO ] Invariant cache hit.
[2024-05-31 20:55:00] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 10/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 39/151 variables, 18/78 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 21/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/157 variables, 3/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 3/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/157 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 105 constraints, problems are : Problem set: 2 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/71 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 6/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 21/92 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 21/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/112 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 8/49 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/153 variables, 27/76 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/153 variables, 26/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/157 variables, 2/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/157 variables, 2/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/157 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 106 constraints, problems are : Problem set: 2 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 730 steps, including 102 resets, run visited all 1 properties in 6 ms. (steps per millisecond=121 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA DBSingleClientW-PT-d0m06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 7 ms
[2024-05-31 20:55:00] [INFO ] Input system was already deterministic with 88 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 227 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 64 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 64 transition count 76
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 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 62 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 61 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 60 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 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 29 place count 58 transition count 64
Applied a total of 29 rules in 13 ms. Remains 58 /69 variables (removed 11) and now considering 64/88 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 58/69 places, 64/88 transitions.
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:55:00] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 62 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 60 transition count 68
Applied a total of 24 rules in 16 ms. Remains 60 /69 variables (removed 9) and now considering 68/88 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 60/69 places, 68/88 transitions.
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:55:00] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 64 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 64 transition count 76
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 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 62 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 61 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 60 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 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 29 place count 58 transition count 64
Applied a total of 29 rules in 11 ms. Remains 58 /69 variables (removed 11) and now considering 64/88 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 58/69 places, 64/88 transitions.
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:55:00] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:55:00] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:55:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:55:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 88 transitions and 345 arcs took 2 ms.
Total runtime 10642 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-d0m06-CTLCardinality-2024-02
Could not compute solution for formula : DBSingleClientW-PT-d0m06-CTLCardinality-2024-11
Could not compute solution for formula : DBSingleClientW-PT-d0m06-CTLCardinality-2023-15

BK_STOP 1717188901078

--------------------
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-d0m06-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/525/ctl_0_
ctl formula name DBSingleClientW-PT-d0m06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/525/ctl_1_
ctl formula name DBSingleClientW-PT-d0m06-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/525/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-d0m06"
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-d0m06, 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-171624189300449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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