fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r091-tall-171624187500327
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CryptoMiner-COL-D05N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4096.552 399422.00 414461.00 1076.00 FFFFFFF?FFTFTTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 12:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 12:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 12:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 17K Apr 12 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 12 12:20 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-D05N100-ReachabilityFireability-2024-00
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-01
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-02
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-03
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-04
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-05
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-06
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-07
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-08
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-09
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-10
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-11
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-12
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-13
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-14
FORMULA_NAME CryptoMiner-COL-D05N100-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716279499198

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D05N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:18:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 08:18:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:18:20] [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:18:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:18:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 557 ms
[2024-05-21 08:18:21] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 18 PT places and 30.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Working with output stream class java.io.PrintStream
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:18:21] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-21 08:18:21] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 414 steps (3 resets) in 10 ms. (37 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 08:18:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 08:18:21] [INFO ] Flatten gal took : 1 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 )
Arc [0:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2024-05-21 08:18:21] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 52 arcs in 10 ms.
[2024-05-21 08:18:21] [INFO ] Unfolded 9 HLPN properties in 0 ms.
RANDOM walk for 40156 steps (8 resets) in 151 ms. (264 steps per ms) remains 6/9 properties
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (96 resets) in 888 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 634 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 6/6 properties
// Phase 1: matrix 18 rows 18 cols
[2024-05-21 08:18:22] [INFO ] Computed 1 invariants in 7 ms
[2024-05-21 08:18:22] [INFO ] State equation strengthened by 5 read => feed constraints.
Problem CryptoMiner-COL-D05N100-ReachabilityFireability-2024-00 is UNSAT
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CryptoMiner-COL-D05N100-ReachabilityFireability-2024-03 is UNSAT
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem CryptoMiner-COL-D05N100-ReachabilityFireability-2024-02 is UNSAT
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CryptoMiner-COL-D05N100-ReachabilityFireability-2024-09 is UNSAT
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem CryptoMiner-COL-D05N100-ReachabilityFireability-2024-13 is UNSAT
FORMULA CryptoMiner-COL-D05N100-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 18/36 variables, 18/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 5/24 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 24 constraints, problems are : Problem set: 5 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/17 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 5/23 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/24 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 1/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 25 constraints, problems are : Problem set: 5 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 28 edges and 18 vertex of which 17 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 13 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 17/18 places, 18/18 transitions.
RANDOM walk for 40103 steps (9 resets) in 53 ms. (742 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3074419 steps, run timeout after 3001 ms. (steps per millisecond=1024 ) properties seen :0 out of 1
Probabilistic random walk after 3074419 steps, saw 1174171 distinct states, run finished after 3004 ms. (steps per millisecond=1023 ) properties seen :0
// Phase 1: matrix 18 rows 17 cols
[2024-05-21 08:18:25] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 08:18:25] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/35 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 5/5 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/35 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 15 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 17/17 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 08:18:25] [INFO ] Invariant cache hit.
[2024-05-21 08:18:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 08:18:25] [INFO ] Invariant cache hit.
[2024-05-21 08:18:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 08:18:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-21 08:18:25] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-21 08:18:25] [INFO ] Invariant cache hit.
[2024-05-21 08:18:25] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/35 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 150 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 153 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 17/17 places, 18/18 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 08:18:26] [INFO ] Invariant cache hit.
[2024-05-21 08:18:26] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:18:26] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 08:18:26] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 08:18:26] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
[2024-05-21 08:18:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-21 08:18:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17 places, 18 transitions and 51 arcs took 3 ms.
[2024-05-21 08:18:26] [INFO ] Flatten gal took : 4 ms
Total runtime 5984 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-COL-D05N100

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: 17
TRANSITIONS: 18
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, 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: 559
MODEL NAME: /home/mcc/execution/413/model
17 places, 18 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-D05N100-ReachabilityFireability-2024-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716279898620

--------------------
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 ReachabilityFireability -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-D05N100"
export BK_EXAMINATION="ReachabilityFireability"
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-D05N100, examination is ReachabilityFireability"
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-171624187500327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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