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-171624187700425.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 CryptoMiner-PT-D20N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187700425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 34K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 197K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Apr 12 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 363K Apr 12 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 219K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.2K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 27K 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 CryptoMiner-PT-D20N100-CTLCardinality-2024-00
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-01
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-02
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-03
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-04
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-05
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-06
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-07
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-08
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-09
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-10
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-11
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-12
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-13
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-14
FORMULA_NAME CryptoMiner-PT-D20N100-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716283951152

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:32:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 09:32:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:32:32] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-21 09:32:32] [INFO ] Transformed 63 places.
[2024-05-21 09:32:32] [INFO ] Transformed 63 transitions.
[2024-05-21 09:32:32] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 09:32:32] [INFO ] Computed 1 invariants in 7 ms
[2024-05-21 09:32:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 09:32:32] [INFO ] Invariant cache hit.
[2024-05-21 09:32:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:32:32] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 09:32:32] [INFO ] Invariant cache hit.
[2024-05-21 09:32:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2886ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2896ms
Finished structural reductions in LTL mode , in 1 iterations and 3185 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2024-05-21 09:32:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 09:32:35] [INFO ] Flatten gal took : 23 ms
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:32:35] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:32:35] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 40246 steps (12 resets) in 303 ms. (132 steps per ms) remains 30/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 104 ms. (38 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
[2024-05-21 09:32:36] [INFO ] Invariant cache hit.
[2024-05-21 09:32:36] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/63 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 20 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 3 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 23 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 23 solved, 6 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/43 variables, 1/1 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 44/87 variables, 43/44 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/46 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 4/91 variables, 2/48 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 2/50 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/50 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/95 variables, 2/52 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 2/54 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/95 variables, 0/54 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/99 variables, 2/56 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/99 variables, 2/58 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 0/58 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/102 variables, 2/60 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/61 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/104 variables, 1/63 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/104 variables, 1/64 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 2/106 variables, 1/65 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/106 variables, 1/66 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/106 variables, 1/67 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/106 variables, 0/67 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 2/108 variables, 1/68 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/108 variables, 1/69 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/108 variables, 0/69 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 2/110 variables, 1/70 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/110 variables, 1/71 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/110 variables, 1/72 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/110 variables, 0/72 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 2/112 variables, 1/73 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/112 variables, 1/74 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/112 variables, 0/74 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 2/114 variables, 1/75 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/114 variables, 1/76 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 2/116 variables, 1/77 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/116 variables, 1/78 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/116 variables, 1/79 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/116 variables, 0/79 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 2/118 variables, 1/80 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/118 variables, 1/81 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/118 variables, 0/81 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 2/120 variables, 1/82 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/120 variables, 1/83 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/120 variables, 0/83 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 49 (OVERLAPS) 2/122 variables, 1/84 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/122 variables, 1/85 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/122 variables, 1/86 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 53 (OVERLAPS) 2/124 variables, 1/87 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/124 variables, 1/88 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 56 (OVERLAPS) 2/126 variables, 1/89 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/126 variables, 1/90 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/126 variables, 0/90 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 59 (OVERLAPS) 0/126 variables, 0/90 constraints. Problems are: Problem set: 23 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 90 constraints, problems are : Problem set: 23 solved, 6 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 855ms problems are : Problem set: 23 solved, 6 unsolved
Finished Parikh walk after 1258 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=419 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 825 ms.
Successfully simplified 23 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:32:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 6 ms
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 63/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 63/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 63/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 63/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 62/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 62/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 62/63 places, 63/63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:32:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:32:38] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 09:32:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 63 transitions and 187 arcs took 3 ms.
Total runtime 6110 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-PT-D20N100

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 544
MODEL NAME: /home/mcc/execution/413/model
63 places, 63 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 CryptoMiner-PT-D20N100-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA CryptoMiner-PT-D20N100-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716284901481

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
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="CryptoMiner-PT-D20N100"
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 CryptoMiner-PT-D20N100, 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-171624187700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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