About the Execution of Marcie+red for CryptoMiner-PT-D03N010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5447.852 | 8601.00 | 11952.00 | 282.70 | FTFTTTTFTTFFFTTF | 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-167987247000154.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-PT-D03N010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247000154
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K 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-PT-D03N010-CTLFireability-00
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-01
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-02
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-03
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-04
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-05
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-06
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-07
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-08
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-09
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-10
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-11
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-12
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-13
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-14
FORMULA_NAME CryptoMiner-PT-D03N010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680876383827
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 14:06:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 14:06:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:06:25] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 14:06:25] [INFO ] Transformed 12 places.
[2023-04-07 14:06:25] [INFO ] Transformed 12 transitions.
[2023-04-07 14:06:25] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D03N010-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 9 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 14:06:25] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 14:06:25] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-04-07 14:06:25] [INFO ] Invariant cache hit.
[2023-04-07 14:06:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:06:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-04-07 14:06:25] [INFO ] Invariant cache hit.
[2023-04-07 14:06:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-04-07 14:06:25] [INFO ] Flatten gal took : 15 ms
[2023-04-07 14:06:25] [INFO ] Flatten gal took : 5 ms
[2023-04-07 14:06:25] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10005 steps, including 3 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 14:06:26] [INFO ] Invariant cache hit.
[2023-04-07 14:06:26] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2023-04-07 14:06:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:06:26] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :1 sat :1 real:1
[2023-04-07 14:06:26] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 14:06:26] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2023-04-07 14:06:26] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-04-07 14:06:26] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-04-07 14:06:26] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 14:06:26] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 12/12 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 11
Applied a total of 2 rules in 10 ms. Remains 10 /11 variables (removed 1) and now considering 11/12 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 10/11 places, 11/12 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 14:06:26] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 14:06:26] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 14:06:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:06:26] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 14:06:26] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 14:06:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 11/11 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 10
Applied a total of 2 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 9/10 places, 10/11 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 226 steps, run visited all 1 properties in 13 ms. (steps per millisecond=17 )
Probabilistic random walk after 226 steps, saw 93 distinct states, run finished after 13 ms. (steps per millisecond=17 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-04-07 14:06:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 3 ms
FORMULA CryptoMiner-PT-D03N010-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 6 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 12/12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:26] [INFO ] Input system was already deterministic with 12 transitions.
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 14:06:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 14:06:26] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 14:06:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 12 transitions and 33 arcs took 1 ms.
Total runtime 1577 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 11 NrTr: 12 NrArc: 33)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.753sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 159 (1.6e+02) #states 10,636 (4)
starting MCC model checker
--------------------------
checking: AG [AF [EG [[[A [1<=p2 U 1<=p8] | p1<=0] | [p4<=0 | p8<=0]]]]]
normalized: ~ [E [true U EG [~ [EG [[[p4<=0 | p8<=0] | [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p8] & ~ [1<=p2]]]]] | p1<=0]]]]]]]
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p8)
states: 1,792 (3)
..
EG iterations: 2
abstracting: (p8<=0)
states: 8,844 (3)
abstracting: (p4<=0)
states: 3,692 (3)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [A [~ [EF [1<=p7]] U E [~ [AG [[1<=p2 & [1<=p5 & 1<=p9]]]] U ~ [[EF [1<=p1] & E [1<=p2 U 1<=p10]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [E [true U ~ [[[1<=p5 & 1<=p9] & 1<=p2]]] U ~ [[E [1<=p2 U 1<=p10] & E [true U 1<=p1]]]]]]] & ~ [E [~ [E [E [true U ~ [[[1<=p5 & 1<=p9] & 1<=p2]]] U ~ [[E [1<=p2 U 1<=p10] & E [true U 1<=p1]]]]] U [~ [E [E [true U ~ [[[1<=p5 & 1<=p9] & 1<=p2]]] U ~ [[E [1<=p2 U 1<=p10] & E [true U 1<=p1]]]]] & E [true U 1<=p7]]]]]]]]
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[~ [A [1<=p0 U [1<=p3 & [1<=p6 & 1<=p10]]]] & [AG [1<=p8] & AG [~ [E [1<=p9 U 1<=p0]]]]]]
normalized: E [true U [[~ [E [true U E [1<=p9 U 1<=p0]]] & ~ [E [true U ~ [1<=p8]]]] & ~ [[~ [EG [~ [[[1<=p6 & 1<=p10] & 1<=p3]]]] & ~ [E [~ [[[1<=p6 & 1<=p10] & 1<=p3]] U [~ [1<=p0] & ~ [[[1<=p6 & 1<=p10] & 1<=p3]]]]]]]]]
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
-> the formula is FALSE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[AG [[EF [[[1<=p1 | 1<=p0] | [1<=p2 | 1<=p3]]] & AG [[1<=p0 & 1<=p7]]]] & [1<=p0 & 1<=p7]]]
normalized: E [true U [[1<=p0 & 1<=p7] & ~ [E [true U ~ [[~ [E [true U ~ [[1<=p0 & 1<=p7]]]] & E [true U [[1<=p2 | 1<=p3] | [1<=p1 | 1<=p0]]]]]]]]]
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
-> the formula is FALSE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[EX [[AX [p0<=0] | ~ [A [1<=p7 U 1<=p7]]]] | [1<=p2 & [AX [1<=p8] | [1<=p0 & [1<=p7 & 1<=p1]]]]]]
normalized: ~ [E [true U ~ [[EX [[~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p7] & ~ [1<=p7]]]]]] | ~ [EX [~ [p0<=0]]]]] | [[[[1<=p7 & 1<=p1] & 1<=p0] | ~ [EX [~ [1<=p8]]]] & 1<=p2]]]]]
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p8)
states: 1,792 (3)
.abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (p0<=0)
states: 3,692 (3)
.abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p7)
states: 1,001 (3)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [EF [[[p0<=0 | p7<=0] & [[AF [1<=p10] | [1<=p0 & 1<=p7]] | [[AG [1<=p10] & EF [[1<=p0 & 1<=p7]]] | [[1<=p7 | [1<=p8 | 1<=p9]] & [[EX [[1<=p0 & 1<=p7]] | 1<=p0] | [1<=p1 | [1<=p2 | 1<=p3]]]]]]]]]
normalized: EG [E [true U [[p0<=0 | p7<=0] & [[[[[[1<=p2 | 1<=p3] | 1<=p1] | [EX [[1<=p0 & 1<=p7]] | 1<=p0]] & [[1<=p8 | 1<=p9] | 1<=p7]] | [E [true U [1<=p0 & 1<=p7]] & ~ [E [true U ~ [1<=p10]]]]] | [[1<=p0 & 1<=p7] | ~ [EG [~ [1<=p10]]]]]]]]
abstracting: (1<=p10)
states: 2,732 (3)
....
EG iterations: 4
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
.abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (p7<=0)
states: 9,635 (3)
abstracting: (p0<=0)
states: 3,692 (3)
.....
EG iterations: 5
-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [AX [[EG [[[[1<=p2 & [1<=p5 & 1<=p9]] | [1<=p1 & [1<=p4 & 1<=p8]]] | [[1<=p0 & 1<=p7] | [1<=p3 & [1<=p6 & 1<=p10]]]]] | EF [[[p0<=0 & p1<=0] & [p2<=0 & p3<=0]]]]] & EX [EG [[1<=p0 & 1<=p7]]]]
normalized: [EX [EG [[1<=p0 & 1<=p7]]] & ~ [EX [~ [[E [true U [[p2<=0 & p3<=0] & [p0<=0 & p1<=0]]] | EG [[[[[1<=p6 & 1<=p10] & 1<=p3] | [1<=p0 & 1<=p7]] | [[[1<=p4 & 1<=p8] & 1<=p1] | [[1<=p5 & 1<=p9] & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p4)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
..
EG iterations: 2
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p2<=0)
states: 3,692 (3)
.abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
..
EG iterations: 2
.-> the formula is FALSE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [~ [E [AX [[[[1<=p2 & [1<=p5 & 1<=p9]] | 1<=p7] & EF [[1<=p2 & [1<=p5 & 1<=p9]]]]] U [[[[A [[1<=p3 & [1<=p6 & 1<=p10]] U 1<=p9] & 1<=p7] & [1<=p0 & [1<=p7 & 1<=p2]]] | E [1<=p1 U 1<=p1]] | [EF [1<=p0] | [1<=p9 | 1<=p10]]]]]]
normalized: E [true U ~ [E [~ [EX [~ [[E [true U [[1<=p5 & 1<=p9] & 1<=p2]] & [[[1<=p5 & 1<=p9] & 1<=p2] | 1<=p7]]]]] U [[[1<=p9 | 1<=p10] | E [true U 1<=p0]] | [E [1<=p1 U 1<=p1] | [[[1<=p7 & 1<=p2] & 1<=p0] & [[~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [[[1<=p6 & 1<=p10] & 1<=p3]] & ~ [1<=p9]]]]] & 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p9)
states: 2,379 (3)
...
EG iterations: 3
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
.-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [[EG [[[AF [1<=p10] | 1<=p7] | [1<=p8 | [1<=p9 | p10<=0]]]] & EF [[E [EF [[1<=p7 | [1<=p8 | 1<=p9]]] U [[[[1<=p2 & [1<=p5 & 1<=p9]] | [1<=p1 & [1<=p4 & 1<=p8]]] | [[1<=p0 & 1<=p7] | [1<=p3 & [1<=p6 & 1<=p10]]]] & [1<=p7 | [1<=p8 | 1<=p9]]]] & [[EX [1<=p10] | 1<=p7] | [1<=p8 | [1<=p9 | [1<=p0 & 1<=p7]]]]]]]]
normalized: ~ [EG [~ [[E [true U [[[[[1<=p0 & 1<=p7] | 1<=p9] | 1<=p8] | [EX [1<=p10] | 1<=p7]] & E [E [true U [[1<=p8 | 1<=p9] | 1<=p7]] U [[[1<=p8 | 1<=p9] | 1<=p7] & [[[[1<=p6 & 1<=p10] & 1<=p3] | [1<=p0 & 1<=p7]] | [[[1<=p4 & 1<=p8] & 1<=p1] | [[1<=p5 & 1<=p9] & 1<=p2]]]]]]] & EG [[[[1<=p9 | p10<=0] | 1<=p8] | [~ [EG [~ [1<=p10]]] | 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p10)
states: 2,732 (3)
....
EG iterations: 4
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (p10<=0)
states: 7,904 (3)
abstracting: (1<=p9)
states: 2,379 (3)
EG iterations: 0
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p4)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p10)
states: 2,732 (3)
.abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EX [E [~ [[1<=p7 | [1<=p8 | 1<=p9]]] U EF [AX [[1<=p0 & 1<=p7]]]]] | [~ [E [[AG [[[1<=p0 | 1<=p1] | [1<=p2 | 1<=p3]]] & EF [1<=p10]] U AG [1<=p10]]] & [EG [[[AG [[[[p2<=0 | [p5<=0 | p9<=0]] & [p1<=0 | [p4<=0 | p8<=0]]] & [[p0<=0 | p7<=0] & [p3<=0 | [p6<=0 | p10<=0]]]]] & 1<=p0] & [1<=p7 & [[1<=p0 | 1<=p1] | [1<=p2 | 1<=p3]]]]] & AG [~ [A [AX [[[1<=p0 | 1<=p1] | [1<=p2 | 1<=p3]]] U ~ [AG [[1<=p7 | [1<=p8 | 1<=p9]]]]]]]]]]
normalized: [EX [E [~ [[[1<=p8 | 1<=p9] | 1<=p7]] U E [true U ~ [EX [~ [[1<=p0 & 1<=p7]]]]]]] | [[~ [E [true U [~ [EG [~ [E [true U ~ [[[1<=p8 | 1<=p9] | 1<=p7]]]]]] & ~ [E [~ [E [true U ~ [[[1<=p8 | 1<=p9] | 1<=p7]]]] U [EX [~ [[[1<=p2 | 1<=p3] | [1<=p0 | 1<=p1]]]] & ~ [E [true U ~ [[[1<=p8 | 1<=p9] | 1<=p7]]]]]]]]]] & EG [[[[[1<=p2 | 1<=p3] | [1<=p0 | 1<=p1]] & 1<=p7] & [~ [E [true U ~ [[[[[p6<=0 | p10<=0] | p3<=0] & [p0<=0 | p7<=0]] & [[[p4<=0 | p8<=0] | p1<=0] & [[p5<=0 | p9<=0] | p2<=0]]]]]] & 1<=p0]]]] & ~ [E [[E [true U 1<=p10] & ~ [E [true U ~ [[[1<=p2 | 1<=p3] | [1<=p0 | 1<=p1]]]]]] U ~ [E [true U ~ [1<=p10]]]]]]]
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (p2<=0)
states: 3,692 (3)
abstracting: (p9<=0)
states: 8,257 (3)
abstracting: (p5<=0)
states: 6,742 (3)
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p8<=0)
states: 8,844 (3)
abstracting: (p4<=0)
states: 3,692 (3)
abstracting: (p7<=0)
states: 9,635 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p10<=0)
states: 7,904 (3)
abstracting: (p6<=0)
states: 8,793 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
.abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
.abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
.-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: AG [[EF [[[AX [[[[1<=p2 & [1<=p5 & 1<=p9]] | [1<=p1 & [1<=p4 & 1<=p8]]] | [[1<=p0 & 1<=p7] | [1<=p3 & [1<=p6 & 1<=p10]]]]] | AG [[p0<=0 | p7<=0]]] | [[[p0<=0 & p1<=0] & [p2<=0 & p3<=0]] | [[[p2<=0 | [p5<=0 | p9<=0]] & [p1<=0 | [p4<=0 | p8<=0]]] & [[p0<=0 | p7<=0] & [p3<=0 | [p6<=0 | p10<=0]]]]]]] & [AX [[1<=p0 & 1<=p7]] | [EG [[p10<=0 | [[p0<=0 & p1<=0] & [p2<=0 & p3<=0]]]] | AF [[[[p2<=0 | [p5<=0 | p9<=0]] & [p1<=0 | [p4<=0 | p8<=0]]] & [[p0<=0 | p7<=0] & [p3<=0 | [p6<=0 | p10<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [[[[[p6<=0 | p10<=0] | p3<=0] & [p0<=0 | p7<=0]] & [[[p4<=0 | p8<=0] | p1<=0] & [[p5<=0 | p9<=0] | p2<=0]]]]]] | EG [[[[p2<=0 & p3<=0] & [p0<=0 & p1<=0]] | p10<=0]]] | ~ [EX [~ [[1<=p0 & 1<=p7]]]]] & E [true U [[[[[[p6<=0 | p10<=0] | p3<=0] & [p0<=0 | p7<=0]] & [[[p4<=0 | p8<=0] | p1<=0] & [[p5<=0 | p9<=0] | p2<=0]]] | [[p2<=0 & p3<=0] & [p0<=0 & p1<=0]]] | [~ [E [true U ~ [[p0<=0 | p7<=0]]]] | ~ [EX [~ [[[[[1<=p6 & 1<=p10] & 1<=p3] | [1<=p0 & 1<=p7]] | [[[1<=p4 & 1<=p8] & 1<=p1] | [[1<=p5 & 1<=p9] & 1<=p2]]]]]]]]]]]]]
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p4)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
.abstracting: (p7<=0)
states: 9,635 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p2<=0)
states: 3,692 (3)
abstracting: (p2<=0)
states: 3,692 (3)
abstracting: (p9<=0)
states: 8,257 (3)
abstracting: (p5<=0)
states: 6,742 (3)
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p8<=0)
states: 8,844 (3)
abstracting: (p4<=0)
states: 3,692 (3)
abstracting: (p7<=0)
states: 9,635 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p10<=0)
states: 7,904 (3)
abstracting: (p6<=0)
states: 8,793 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
.abstracting: (p10<=0)
states: 7,904 (3)
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p2<=0)
states: 3,692 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,692 (3)
abstracting: (p9<=0)
states: 8,257 (3)
abstracting: (p5<=0)
states: 6,742 (3)
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p8<=0)
states: 8,844 (3)
abstracting: (p4<=0)
states: 3,692 (3)
abstracting: (p7<=0)
states: 9,635 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p10<=0)
states: 7,904 (3)
abstracting: (p6<=0)
states: 8,793 (3)
..
EG iterations: 2
-> the formula is FALSE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [~ [[[[AF [~ [[[[p2<=0 | [p5<=0 | p9<=0]] & [p1<=0 | [p4<=0 | p8<=0]]] & [[p0<=0 | p7<=0] & [p3<=0 | [p6<=0 | p10<=0]]]]]] | [[1<=p0 & [1<=p7 & [1<=p7 | [1<=p8 | 1<=p9]]]] | [1<=p2 & [1<=p5 & 1<=p9]]]] | [[[1<=p1 & [1<=p4 & 1<=p8]] | [1<=p0 & 1<=p7]] | [[1<=p3 & [1<=p6 & 1<=p10]] | [1<=p0 & 1<=p7]]]] & [~ [[1<=p0 & 1<=p7]] & ~ [[[1<=p0 | [1<=p1 | 1<=p2]] | [[1<=p3 | 1<=p7] | [1<=p8 | 1<=p9]]]]]]] U [~ [AG [AF [[[1<=p0 | 1<=p1] | [1<=p2 | 1<=p3]]]]] & ~ [[~ [EF [[[1<=p0 | 1<=p1] | [1<=p2 | 1<=p3]]]] | AF [[1<=p7 | [1<=p8 | 1<=p9]]]]]]]
normalized: E [~ [[[~ [[[[1<=p8 | 1<=p9] | [1<=p3 | 1<=p7]] | [[1<=p1 | 1<=p2] | 1<=p0]]] & ~ [[1<=p0 & 1<=p7]]] & [[[[1<=p0 & 1<=p7] | [[1<=p6 & 1<=p10] & 1<=p3]] | [[1<=p0 & 1<=p7] | [[1<=p4 & 1<=p8] & 1<=p1]]] | [[[[1<=p5 & 1<=p9] & 1<=p2] | [[[[1<=p8 | 1<=p9] | 1<=p7] & 1<=p7] & 1<=p0]] | ~ [EG [[[[[p6<=0 | p10<=0] | p3<=0] & [p0<=0 | p7<=0]] & [[[p4<=0 | p8<=0] | p1<=0] & [[p5<=0 | p9<=0] | p2<=0]]]]]]]]] U [~ [[~ [EG [~ [[[1<=p8 | 1<=p9] | 1<=p7]]]] | ~ [E [true U [[1<=p2 | 1<=p3] | [1<=p0 | 1<=p1]]]]]] & E [true U EG [~ [[[1<=p2 | 1<=p3] | [1<=p0 | 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,692 (3)
abstracting: (p9<=0)
states: 8,257 (3)
abstracting: (p5<=0)
states: 6,742 (3)
abstracting: (p1<=0)
states: 3,692 (3)
abstracting: (p8<=0)
states: 8,844 (3)
abstracting: (p4<=0)
states: 3,692 (3)
abstracting: (p7<=0)
states: 9,635 (3)
abstracting: (p0<=0)
states: 3,692 (3)
abstracting: (p3<=0)
states: 3,692 (3)
abstracting: (p10<=0)
states: 7,904 (3)
abstracting: (p6<=0)
states: 8,793 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p5)
states: 3,894 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p4)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p10)
states: 2,732 (3)
abstracting: (1<=p6)
states: 1,843 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p0)
states: 6,944 (3)
abstracting: (1<=p2)
states: 6,944 (3)
abstracting: (1<=p1)
states: 6,944 (3)
abstracting: (1<=p7)
states: 1,001 (3)
abstracting: (1<=p3)
states: 6,944 (3)
abstracting: (1<=p9)
states: 2,379 (3)
abstracting: (1<=p8)
states: 1,792 (3)
-> the formula is TRUE
FORMULA CryptoMiner-PT-D03N010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 12280 (1.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 53561 30730 84291
used/not used/entry size/cache size: 37996 67070868 16 1024MB
basic ops cache: hits/miss/sum: 27561 17238 44799
used/not used/entry size/cache size: 32333 16744883 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3253 1287 4540
used/not used/entry size/cache size: 1287 8387321 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67097110
1 11329
2 382
3 25
4 5
5 4
6 4
7 0
8 1
9 2
>= 10 2
Total processing time: 0m 4.426sec
BK_STOP 1680876392428
--------------------
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 CTLFireability -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:223 (18), effective:54 (4)
initing FirstDep: 0m 0.000sec
iterations count:32 (2), effective:10 (0)
iterations count:12 (1), effective:0 (0)
iterations count:18 (1), effective:3 (0)
iterations count:21 (1), effective:3 (0)
iterations count:28 (2), effective:8 (0)
iterations count:71 (5), effective:19 (1)
iterations count:18 (1), effective:3 (0)
iterations count:21 (1), effective:3 (0)
iterations count:28 (2), effective:8 (0)
iterations count:71 (5), effective:19 (1)
iterations count:18 (1), effective:3 (0)
iterations count:21 (1), effective:3 (0)
iterations count:28 (2), effective:8 (0)
iterations count:71 (5), effective:19 (1)
iterations count:42 (3), effective:10 (0)
iterations count:15 (1), effective:1 (0)
iterations count:18 (1), effective:3 (0)
iterations count:18 (1), effective:3 (0)
iterations count:12 (1), effective:0 (0)
iterations count:42 (3), effective:10 (0)
iterations count:12 (1), effective:0 (0)
iterations count:12 (1), effective:0 (0)
iterations count:338 (28), effective:110 (9)
iterations count:15 (1), effective:1 (0)
iterations count:18 (1), effective:3 (0)
iterations count:42 (3), effective:10 (0)
iterations count:375 (31), effective:119 (9)
iterations count:19 (1), effective:7 (0)
iterations count:12 (1), effective:0 (0)
iterations count:18 (1), effective:3 (0)
iterations count:46 (3), effective:13 (1)
iterations count:12 (1), effective:0 (0)
iterations count:333 (27), effective:108 (9)
iterations count:12 (1), effective:0 (0)
iterations count:31 (2), effective:9 (0)
iterations count:12 (1), effective:0 (0)
iterations count:15 (1), effective:1 (0)
iterations count:375 (31), effective:119 (9)
iterations count:21 (1), effective:3 (0)
iterations count:35 (2), effective:10 (0)
iterations count:21 (1), effective:3 (0)
iterations count:21 (1), effective:3 (0)
iterations count:21 (1), effective:3 (0)
iterations count:12 (1), effective:0 (0)
iterations count:338 (28), effective:110 (9)
iterations count:12 (1), effective:0 (0)
iterations count:18 (1), effective:3 (0)
iterations count:45 (3), effective:12 (1)
iterations count:66 (5), effective:18 (1)
iterations count:375 (31), effective:119 (9)
iterations count:12 (1), effective:0 (0)
iterations count:208 (17), effective:68 (5)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D03N010"
export BK_EXAMINATION="CTLFireability"
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-PT-D03N010, examination is CTLFireability"
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-167987247000154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D03N010.tgz
mv CryptoMiner-PT-D03N010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;