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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K 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-COL-D20N100-ReachabilityCardinality-2024-00
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-01
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-02
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-03
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-04
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-05
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-06
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-07
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-08
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-09
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-10
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-11
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-12
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-13
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-14
FORMULA_NAME CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716281674127

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D20N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:54:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:54:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 08:54:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:54:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2024-05-21 08:54:35] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:54:35] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 3 ms.
[2024-05-21 08:54:35] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 40257 steps (735 resets) in 242 ms. (165 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40004 steps (96 resets) in 274 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (242 resets) in 583 ms. (68 steps per ms) remains 5/5 properties
[2024-05-21 08:54:36] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 08:54:36] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 08:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-02 is UNSAT
Problem CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-03 is UNSAT
Problem CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-07 is UNSAT
Problem CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-08 is UNSAT
Problem CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-15 is UNSAT
After SMT solving in domain Real declared 6/7 variables, and 3 constraints, problems are : Problem set: 5 solved, 0 unsolved in 240 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 08:54:36] [INFO ] Flatten gal took : 21 ms
[2024-05-21 08:54:37] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Arc [0:1*[(MOD (ADD $x 1) 21)]] contains successor/predecessor on variables of sort CD
[2024-05-21 08:54:37] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 10 ms.
[2024-05-21 08:54:37] [INFO ] Unfolded 14 HLPN properties in 1 ms.
RANDOM walk for 40293 steps (9 resets) in 153 ms. (261 steps per ms) remains 1/9 properties
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D20N100-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1780 ms. (22 steps per ms) remains 1/1 properties
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 08:54:37] [INFO ] Computed 1 invariants in 3 ms
[2024-05-21 08:54:37] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 63/63 places, 63/63 transitions.
RANDOM walk for 40355 steps (11 resets) in 18 ms. (2123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 666 ms. (59 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2759780 steps, run timeout after 3001 ms. (steps per millisecond=919 ) properties seen :0 out of 1
Probabilistic random walk after 2759780 steps, saw 1074054 distinct states, run finished after 3006 ms. (steps per millisecond=918 ) properties seen :0
[2024-05-21 08:54:41] [INFO ] Invariant cache hit.
[2024-05-21 08:54:41] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 63/126 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 63/63 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-21 08:54:41] [INFO ] Invariant cache hit.
[2024-05-21 08:54:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 08:54:41] [INFO ] Invariant cache hit.
[2024-05-21 08:54:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:54:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-21 08:54:41] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 08:54:41] [INFO ] Invariant cache hit.
[2024-05-21 08:54:41] [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 1369 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 1717 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 3097ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3197 ms. Remains : 63/63 places, 63/63 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 08:54:44] [INFO ] Invariant cache hit.
[2024-05-21 08:54:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 08:54:44] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:54:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 08:54:45] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 08:54:45] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 08:54:45] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 304 ms.
[2024-05-21 08:54:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-21 08:54:45] [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.
[2024-05-21 08:54:45] [INFO ] Flatten gal took : 11 ms
Total runtime 9994 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-COL-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.002s, Sys 0.000s]


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: 566
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-COL-D20N100-ReachabilityCardinality-2024-00 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716282104439

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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 ReachabilityCardinality -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="CryptoMiner-COL-D20N100"
export BK_EXAMINATION="ReachabilityCardinality"
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-COL-D20N100, examination is ReachabilityCardinality"
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-171624187500358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D20N100.tgz
mv CryptoMiner-COL-D20N100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;