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.r091-tall-171624187800465.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 greatspnxred
Input is DBSingleClientW-PT-d0m08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187800465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 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-d0m08-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716286006177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:06:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:06:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:06:47] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 10:06:47] [INFO ] Transformed 553 places.
[2024-05-21 10:06:47] [INFO ] Transformed 150 transitions.
[2024-05-21 10:06:47] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 148
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 29 place count 82 transition count 101
Iterating global reduction 1 with 22 rules applied. Total rules applied 51 place count 82 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 82 transition count 99
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 64 place count 71 transition count 88
Iterating global reduction 2 with 11 rules applied. Total rules applied 75 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 71 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 68 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 68 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 68 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 67 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 66 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 66 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 66 transition count 75
Applied a total of 90 rules in 46 ms. Remains 66 /109 variables (removed 43) and now considering 75/150 (removed 75) transitions.
// Phase 1: matrix 75 rows 66 cols
[2024-05-21 10:06:47] [INFO ] Computed 2 invariants in 15 ms
[2024-05-21 10:06:47] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 10:06:47] [INFO ] Invariant cache hit.
[2024-05-21 10:06:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 10:06:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 10:06:47] [INFO ] Invariant cache hit.
[2024-05-21 10:06:47] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 92 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1802 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 64/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 2/141 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 10/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 166 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 4828ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 4838ms
Starting structural reductions in LTL mode, iteration 1 : 66/109 places, 75/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5269 ms. Remains : 66/109 places, 75/150 transitions.
Support contains 7 out of 66 places after structural reductions.
[2024-05-21 10:06:52] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 10:06:52] [INFO ] Flatten gal took : 25 ms
[2024-05-21 10:06:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:06:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 10:06:52] [INFO ] Input system was already deterministic with 75 transitions.
Support contains 5 out of 66 places (down from 7) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9111 resets) in 895 ms. (44 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 212 ms. (187 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (4125 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4032 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4024 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
[2024-05-21 10:06:53] [INFO ] Invariant cache hit.
[2024-05-21 10:06:53] [INFO ] State equation strengthened by 24 read => feed constraints.
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) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/71 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 21/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:06:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 19/111 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 140/141 variables, and 78 constraints, problems are : Problem set: 3 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/66 constraints, ReadFeed: 10/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 143ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:06:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 8 ms
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 10:06:53] [INFO ] Input system was already deterministic with 75 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 211 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 75/75 transitions.
Graph (complete) has 211 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 63 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 62 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 61 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 59 transition count 65
Applied a total of 16 rules in 23 ms. Remains 59 /66 variables (removed 7) and now considering 65/75 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 59/66 places, 65/75 transitions.
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:06:53] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 75/75 transitions.
Graph (complete) has 211 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 62 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 61 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 58 transition count 64
Applied a total of 17 rules in 18 ms. Remains 58 /66 variables (removed 8) and now considering 64/75 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 58/66 places, 64/75 transitions.
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 10:06:53] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 31797 steps (7245 resets) in 414 ms. (76 steps per ms) remains 0/1 properties
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 75/75 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 62 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 61 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 58 transition count 64
Applied a total of 18 rules in 16 ms. Remains 58 /66 variables (removed 8) and now considering 64/75 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 58/66 places, 64/75 transitions.
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 10:06:53] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 10:06:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:06:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-21 10:06:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 75 transitions and 296 arcs took 1 ms.
Total runtime 6751 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d0m08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 66
TRANSITIONS: 75
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 540
MODEL NAME: /home/mcc/execution/410/model
66 places, 75 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-04 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716287283462

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

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-d0m08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d0m08, 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 r091-tall-171624187800465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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