About the Execution of Marcie+red for CryptoMiner-COL-D05N250
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6111.399 | 3600000.00 | 3627938.00 | 12609.90 | ?F?F?????????TFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r522-tall-167987246900113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CryptoMiner-COL-D05N250, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246900113
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 9.8K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 13K Mar 31 16:48 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-D05N250-CTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D05N250-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1680866742790
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D05N250
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 11:25:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 11:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 11:25:44] [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.
[2023-04-07 11:25:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 11:25:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 397 ms
[2023-04-07 11:25:44] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 18 PT places and 30.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2023-04-07 11:25:44] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 3 ms.
[2023-04-07 11:25:44] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-COL-D05N250-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10186 steps, including 73 resets, run finished after 35 ms. (steps per millisecond=291 ) properties (out of 81) seen :60
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-04-07 11:25:44] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 11:25:44] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 11:25:45] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:17
[2023-04-07 11:25:45] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0
Fused 20 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 20 atomic propositions for a total of 15 simplifications.
FORMULA CryptoMiner-COL-D05N250-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 11:25:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 13 ms
FORMULA CryptoMiner-COL-D05N250-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D05N250-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 6)]] contains successor/predecessor on variables of sort CD
[2023-04-07 11:25:45] [INFO ] Unfolded HLPN to a Petri net with 18 places and 18 transitions 52 arcs in 5 ms.
[2023-04-07 11:25:45] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 11:25:45] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 11:25:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 11:25:45] [INFO ] Invariant cache hit.
[2023-04-07 11:25:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 11:25:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 11:25:45] [INFO ] Invariant cache hit.
[2023-04-07 11:25:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 27 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 3 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 68) seen :52
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-04-07 11:25:45] [INFO ] Invariant cache hit.
[2023-04-07 11:25:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 11:25:45] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:14
[2023-04-07 11:25:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 11:25:45] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :0
Fused 16 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 16 atomic propositions for a total of 12 simplifications.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 3 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Graph (complete) has 45 edges and 18 vertex of which 17 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 5 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 3772 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1886 )
FORMULA CryptoMiner-COL-D05N250-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 0 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 0 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 0 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Input system was already deterministic with 18 transitions.
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 1 ms
[2023-04-07 11:25:45] [INFO ] Flatten gal took : 2 ms
[2023-04-07 11:25:45] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 11:25:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 1699 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 18 NrTr: 18 NrArc: 52)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.699sec
RS generation: 0m 8.342sec
-> reachability set: #nodes 4356 (4.4e+03) #states 33,357,491,354,350,793 (16)
starting MCC model checker
--------------------------
checking: EG [AG [EX [EX [76<=sum(p5, p4, p3, p2, p1, p0)]]]]
normalized: EG [~ [E [true U ~ [EX [EX [76<=sum(p5, p4, p3, p2, p1, p0)]]]]]]
abstracting: (76<=sum(p5, p4, p3, p2, p1, p0))
MC time: 5m27.012sec
checking: AX [EF [EG [~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]
normalized: ~ [EX [~ [E [true U EG [~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]]]
abstracting: (sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0))
MC time: 4m57.001sec
checking: EF [AX [AG [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]
normalized: E [true U ~ [EX [E [true U sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]]
abstracting: (sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6))
MC time: 4m30.000sec
checking: [AX [70<=sum(p5, p4, p3, p2, p1, p0)] & AX [[AF [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=96]]] & EF [AG [sum(p17, p16, p15, p14, p13, p12)<=69]]]]]
normalized: [~ [EX [~ [[E [true U ~ [E [true U ~ [sum(p17, p16, p15, p14, p13, p12)<=69]]]] & ~ [EG [~ [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=96]]]]]]]]] & ~ [EX [~ [70<=sum(p5, p4, p3, p2, p1, p0)]]]]
abstracting: (70<=sum(p5, p4, p3, p2, p1, p0))
MC time: 4m 6.000sec
checking: E [AX [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)] U 62<=sum(p17, p16, p15, p14, p13, p12)]
normalized: E [~ [EX [~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]] U 62<=sum(p17, p16, p15, p14, p13, p12)]
abstracting: (62<=sum(p17, p16, p15, p14, p13, p12))
MC time: 3m43.000sec
checking: A [AX [[AG [AF [sum(p5, p4, p3, p2, p1, p0)<=63]] | EG [~ [8<=sum(p5, p4, p3, p2, p1, p0)]]]] U [EG [AG [[sum(p17, p16, p15, p14, p13, p12)<=42 & EG [sum(p17, p16, p15, p14, p13, p12)<=15]]]] & AX [EF [94<=sum(p17, p16, p15, p14, p13, p12)]]]]
normalized: [~ [EG [~ [[~ [EX [~ [E [true U 94<=sum(p17, p16, p15, p14, p13, p12)]]]] & EG [~ [E [true U ~ [[sum(p17, p16, p15, p14, p13, p12)<=42 & EG [sum(p17, p16, p15, p14, p13, p12)<=15]]]]]]]]]] & ~ [E [~ [[~ [EX [~ [E [true U 94<=sum(p17, p16, p15, p14, p13, p12)]]]] & EG [~ [E [true U ~ [[sum(p17, p16, p15, p14, p13, p12)<=42 & EG [sum(p17, p16, p15, p14, p13, p12)<=15]]]]]]]] U [EX [~ [[EG [~ [8<=sum(p5, p4, p3, p2, p1, p0)]] | ~ [E [true U EG [~ [sum(p5, p4, p3, p2, p1, p0)<=63]]]]]]] & ~ [[~ [EX [~ [E [true U 94<=sum(p17, p16, p15, p14, p13, p12)]]]] & EG [~ [E [true U ~ [[sum(p17, p16, p15, p14, p13, p12)<=42 & EG [sum(p17, p16, p15, p14, p13, p12)<=15]]]]]]]]]]]]
abstracting: (sum(p17, p16, p15, p14, p13, p12)<=15)
MC time: 3m23.000sec
checking: EF [[[sum(p5, p4, p3, p2, p1, p0)<=8 & EF [13<=sum(p17, p16, p15, p14, p13, p12)]] & [[~ [58<=sum(p5, p4, p3, p2, p1, p0)] | EF [sum(p17, p16, p15, p14, p13, p12)<=19]] & AX [EF [[sum(p11, p10, p9, p8, p7, p6)<=10 & sum(p5, p4, p3, p2, p1, p0)<=3]]]]]]
normalized: E [true U [[~ [EX [~ [E [true U [sum(p11, p10, p9, p8, p7, p6)<=10 & sum(p5, p4, p3, p2, p1, p0)<=3]]]]] & [E [true U sum(p17, p16, p15, p14, p13, p12)<=19] | ~ [58<=sum(p5, p4, p3, p2, p1, p0)]]] & [E [true U 13<=sum(p17, p16, p15, p14, p13, p12)] & sum(p5, p4, p3, p2, p1, p0)<=8]]]
abstracting: (sum(p5, p4, p3, p2, p1, p0)<=8)
MC time: 3m 4.000sec
checking: E [[~ [AX [[EF [57<=sum(p17, p16, p15, p14, p13, p12)] | AX [1<=0]]]] & [~ [AX [A [sum(p17, p16, p15, p14, p13, p12)<=sum(p11, p10, p9, p8, p7, p6) U sum(p5, p4, p3, p2, p1, p0)<=74]]] | [sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12) | ~ [20<=sum(p5, p4, p3, p2, p1, p0)]]]] U 96<=sum(p17, p16, p15, p14, p13, p12)]
normalized: E [[[[~ [20<=sum(p5, p4, p3, p2, p1, p0)] | sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12)] | EX [~ [[~ [EG [~ [sum(p5, p4, p3, p2, p1, p0)<=74]]] & ~ [E [~ [sum(p5, p4, p3, p2, p1, p0)<=74] U [~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p11, p10, p9, p8, p7, p6)] & ~ [sum(p5, p4, p3, p2, p1, p0)<=74]]]]]]]] & EX [~ [[~ [EX [~ [1<=0]]] | E [true U 57<=sum(p17, p16, p15, p14, p13, p12)]]]]] U 96<=sum(p17, p16, p15, p14, p13, p12)]
abstracting: (96<=sum(p17, p16, p15, p14, p13, p12))
MC time: 2m48.000sec
checking: EG [[EG [[~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)] | [~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)] | [[~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)] | ~ [sum(p5, p4, p3, p2, p1, p0)<=91]] & [~ [39<=sum(p17, p16, p15, p14, p13, p12)] & ~ [3<=sum(p5, p4, p3, p2, p1, p0)]]]]]] | E [0<=0 U ~ [EG [43<=sum(p5, p4, p3, p2, p1, p0)]]]]]
normalized: EG [[E [0<=0 U ~ [EG [43<=sum(p5, p4, p3, p2, p1, p0)]]] | EG [[[[[~ [3<=sum(p5, p4, p3, p2, p1, p0)] & ~ [39<=sum(p17, p16, p15, p14, p13, p12)]] & [~ [sum(p5, p4, p3, p2, p1, p0)<=91] | ~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]] | ~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]] | ~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)]]]]]
abstracting: (sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0))
MC time: 2m32.000sec
checking: [AX [[AF [54<=sum(p17, p16, p15, p14, p13, p12)] | sum(p17, p16, p15, p14, p13, p12)<=28]] | [E [[[AG [90<=sum(p17, p16, p15, p14, p13, p12)] & sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)] | AX [1<=0]] U [A [[74<=sum(p17, p16, p15, p14, p13, p12) | 32<=sum(p11, p10, p9, p8, p7, p6)] U [81<=sum(p11, p10, p9, p8, p7, p6) | sum(p17, p16, p15, p14, p13, p12)<=100]] & [~ [EF [76<=sum(p5, p4, p3, p2, p1, p0)]] & EX [sum(p17, p16, p15, p14, p13, p12)<=90]]]] | A [sum(p17, p16, p15, p14, p13, p12)<=68 U [sum(p17, p16, p15, p14, p13, p12)<=42 & AG [33<=sum(p5, p4, p3, p2, p1, p0)]]]]]
normalized: [[[~ [EG [~ [[~ [E [true U ~ [33<=sum(p5, p4, p3, p2, p1, p0)]]] & sum(p17, p16, p15, p14, p13, p12)<=42]]]] & ~ [E [~ [[~ [E [true U ~ [33<=sum(p5, p4, p3, p2, p1, p0)]]] & sum(p17, p16, p15, p14, p13, p12)<=42]] U [~ [sum(p17, p16, p15, p14, p13, p12)<=68] & ~ [[~ [E [true U ~ [33<=sum(p5, p4, p3, p2, p1, p0)]]] & sum(p17, p16, p15, p14, p13, p12)<=42]]]]]] | E [[~ [EX [~ [1<=0]]] | [~ [E [true U ~ [90<=sum(p17, p16, p15, p14, p13, p12)]]] & sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]] U [[EX [sum(p17, p16, p15, p14, p13, p12)<=90] & ~ [E [true U 76<=sum(p5, p4, p3, p2, p1, p0)]]] & [~ [EG [~ [[81<=sum(p11, p10, p9, p8, p7, p6) | sum(p17, p16, p15, p14, p13, p12)<=100]]]] & ~ [E [~ [[81<=sum(p11, p10, p9, p8, p7, p6) | sum(p17, p16, p15, p14, p13, p12)<=100]] U [~ [[74<=sum(p17, p16, p15, p14, p13, p12) | 32<=sum(p11, p10, p9, p8, p7, p6)]] & ~ [[81<=sum(p11, p10, p9, p8, p7, p6) | sum(p17, p16, p15, p14, p13, p12)<=100]]]]]]]]] | ~ [EX [~ [[~ [EG [~ [54<=sum(p17, p16, p15, p14, p13, p12)]]] | sum(p17, p16, p15, p14, p13, p12)<=28]]]]]
abstracting: (sum(p17, p16, p15, p14, p13, p12)<=28)
MC time: 2m19.000sec
checking: [[A [[[EX [19<=sum(p5, p4, p3, p2, p1, p0)] | sum(p5, p4, p3, p2, p1, p0)<=61] & E [[sum(p11, p10, p9, p8, p7, p6)<=71 & [sum(p11, p10, p9, p8, p7, p6)<=75 & sum(p17, p16, p15, p14, p13, p12)<=22]] U 50<=sum(p17, p16, p15, p14, p13, p12)]] U EF [[[AX [1<=0] & EX [45<=sum(p5, p4, p3, p2, p1, p0)]] | A [61<=sum(p17, p16, p15, p14, p13, p12) U 78<=sum(p17, p16, p15, p14, p13, p12)]]]] & EX [[AF [sum(p5, p4, p3, p2, p1, p0)<=47] | ~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] & [EF [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]] & AX [EF [AG [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)]]]]]
normalized: [[~ [EX [~ [E [true U ~ [E [true U ~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)]]]]]]] & E [true U EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)]]]] & [EX [[~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6)] | ~ [EG [~ [sum(p5, p4, p3, p2, p1, p0)<=47]]]]] & [~ [EG [~ [E [true U [[~ [EG [~ [78<=sum(p17, p16, p15, p14, p13, p12)]]] & ~ [E [~ [78<=sum(p17, p16, p15, p14, p13, p12)] U [~ [61<=sum(p17, p16, p15, p14, p13, p12)] & ~ [78<=sum(p17, p16, p15, p14, p13, p12)]]]]] | [EX [45<=sum(p5, p4, p3, p2, p1, p0)] & ~ [EX [~ [1<=0]]]]]]]]] & ~ [E [~ [E [true U [[~ [EG [~ [78<=sum(p17, p16, p15, p14, p13, p12)]]] & ~ [E [~ [78<=sum(p17, p16, p15, p14, p13, p12)] U [~ [61<=sum(p17, p16, p15, p14, p13, p12)] & ~ [78<=sum(p17, p16, p15, p14, p13, p12)]]]]] | [EX [45<=sum(p5, p4, p3, p2, p1, p0)] & ~ [EX [~ [1<=0]]]]]]] U [~ [[E [[sum(p11, p10, p9, p8, p7, p6)<=71 & [sum(p11, p10, p9, p8, p7, p6)<=75 & sum(p17, p16, p15, p14, p13, p12)<=22]] U 50<=sum(p17, p16, p15, p14, p13, p12)] & [sum(p5, p4, p3, p2, p1, p0)<=61 | EX [19<=sum(p5, p4, p3, p2, p1, p0)]]]] & ~ [E [true U [[~ [EG [~ [78<=sum(p17, p16, p15, p14, p13, p12)]]] & ~ [E [~ [78<=sum(p17, p16, p15, p14, p13, p12)] U [~ [61<=sum(p17, p16, p15, p14, p13, p12)] & ~ [78<=sum(p17, p16, p15, p14, p13, p12)]]]]] | [EX [45<=sum(p5, p4, p3, p2, p1, p0)] & ~ [EX [~ [1<=0]]]]]]]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (45<=sum(p5, p4, p3, p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10039704 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099828 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:8613 (478), effective:1867 (103)
initing FirstDep: 0m 0.000sec
idd.h:1025: Timeout: after 326 sec
idd.h:1025: Timeout: after 296 sec
idd.h:1025: Timeout: after 269 sec
idd.h:1025: Timeout: after 245 sec
idd.h:1025: Timeout: after 222 sec
idd.h:1025: Timeout: after 202 sec
idd.h:1025: Timeout: after 183 sec
idd.h:1025: Timeout: after 167 sec
idd.h:1025: Timeout: after 151 sec
idd.h:1025: Timeout: after 138 sec
idd.h:1025: Timeout: after 125 sec
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-D05N250"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is CryptoMiner-COL-D05N250, 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 r522-tall-167987246900113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D05N250.tgz
mv CryptoMiner-COL-D05N250 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 '
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 ;