About the Execution of Marcie for Eratosthenes-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.796 | 4665.00 | 4060.00 | 0.00 | TTFFTFTTTFTTTFTT | 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.r161-tall-167838844800150.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 marcie
Input is Eratosthenes-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844800150
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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 Eratosthenes-PT-020-ReachabilityCardinality-00
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-01
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-02
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-03
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-04
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-05
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-06
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-07
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-08
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-09
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-10
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-11
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-12
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-13
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-14
FORMULA_NAME Eratosthenes-PT-020-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679420085351
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=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-020
Not applying reductions.
Model is PT
ReachabilityCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Eratosthenes_PT_020
(NrP: 19 NrTr: 27 NrArc: 81)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.924sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 19 (1.9e+01) #states 2,048 (3)
starting MCC model checker
--------------------------
checking: AG [p8<=1]
normalized: ~ [E [true U ~ [p8<=1]]]
abstracting: (p8<=1)
states: 2,048 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p15<=1]
normalized: ~ [E [true U ~ [p15<=1]]]
abstracting: (p15<=1)
states: 2,048 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [p14<=1]]
normalized: E [true U ~ [p14<=1]]
abstracting: (p14<=1)
states: 2,048 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[p11<=0 & ~ [[p4<=p13 | 1<=p2]]]]
normalized: E [true U [~ [[p4<=p13 | 1<=p2]] & p11<=0]]
abstracting: (p11<=0)
states: 0
abstracting: (1<=p2)
states: 2,048 (3)
abstracting: (p4<=p13)
states: 2,048 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[[p15<=p14 & ~ [p2<=0]] | [[[p17<=1 & [~ [1<=p10] | ~ [p2<=p14]]] & [[[p6<=1 | p13<=p13] | [p8<=0 & p14<=p12]] | ~ [[1<=p16 & 1<=p11]]]] | ~ [p10<=p5]]] | ~ [1<=p8]]]]
normalized: E [true U ~ [[~ [1<=p8] | [[~ [p10<=p5] | [[~ [[1<=p16 & 1<=p11]] | [[p8<=0 & p14<=p12] | [p6<=1 | p13<=p13]]] & [[~ [p2<=p14] | ~ [1<=p10]] & p17<=1]]] | [~ [p2<=0] & p15<=p14]]]]]
abstracting: (p15<=p14)
states: 1,536 (3)
abstracting: (p2<=0)
states: 0
abstracting: (p17<=1)
states: 2,048 (3)
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (p2<=p14)
states: 1,024 (3)
abstracting: (p13<=p13)
states: 2,048 (3)
abstracting: (p6<=1)
states: 2,048 (3)
abstracting: (p14<=p12)
states: 1,536 (3)
abstracting: (p8<=0)
states: 1,024 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p10<=p5)
states: 2,048 (3)
abstracting: (1<=p8)
states: 1,024 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[1<=p3 | [[[[[~ [p4<=0] & [p14<=p4 & [~ [p11<=p15] & 1<=p14]]] | ~ [p6<=0]] & [[~ [[[1<=p17 & p3<=p14] | [1<=p14 & 1<=p15]]] | p19<=p7] & 1<=p19]] & [1<=p17 | p4<=1]] | ~ [p18<=0]]]]
normalized: ~ [E [true U ~ [[[[[[[[[~ [p11<=p15] & 1<=p14] & p14<=p4] & ~ [p4<=0]] | ~ [p6<=0]] & [[~ [[[1<=p14 & 1<=p15] | [1<=p17 & p3<=p14]]] | p19<=p7] & 1<=p19]] & [1<=p17 | p4<=1]] | ~ [p18<=0]] | 1<=p3]]]]
abstracting: (1<=p3)
states: 2,048 (3)
abstracting: (p18<=0)
states: 1,024 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (p19<=p7)
states: 2,048 (3)
abstracting: (p3<=p14)
states: 1,024 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (1<=p15)
states: 1,024 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p6<=0)
states: 1,024 (3)
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (p14<=p4)
states: 1,536 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p11<=p15)
states: 1,024 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[p5<=1 & ~ [[[[[[p15<=p9 & [1<=p7 & p19<=0]] | [~ [1<=p19] | ~ [p19<=1]]] & ~ [p19<=1]] & [p5<=1 & [[p20<=p9 & [p18<=p5 | p20<=p17]] & ~ [p14<=1]]]] & [[~ [[[p6<=p16 & 1<=p9] | ~ [p4<=0]]] & p16<=p13] & ~ [1<=p3]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[[[1<=p7 & p19<=0] & p15<=p9] | [~ [p19<=1] | ~ [1<=p19]]] & ~ [p19<=1]] & [[~ [p14<=1] & [[p18<=p5 | p20<=p17] & p20<=p9]] & p5<=1]] & [[~ [[~ [p4<=0] | [p6<=p16 & 1<=p9]]] & p16<=p13] & ~ [1<=p3]]]] & p5<=1]]]]
abstracting: (p5<=1)
states: 2,048 (3)
abstracting: (1<=p3)
states: 2,048 (3)
abstracting: (p16<=p13)
states: 2,048 (3)
abstracting: (1<=p9)
states: 1,024 (3)
abstracting: (p6<=p16)
states: 1,536 (3)
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (p5<=1)
states: 2,048 (3)
abstracting: (p20<=p9)
states: 1,536 (3)
abstracting: (p20<=p17)
states: 2,048 (3)
abstracting: (p18<=p5)
states: 2,048 (3)
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (p19<=1)
states: 2,048 (3)
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (p19<=1)
states: 2,048 (3)
abstracting: (p15<=p9)
states: 1,536 (3)
abstracting: (p19<=0)
states: 0
abstracting: (1<=p7)
states: 2,048 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[~ [[[[~ [p11<=p6] & ~ [p3<=p2]] & ~ [[1<=p4 & p12<=p16]]] | p12<=p17]] & p16<=p18] & ~ [[[p5<=p20 | ~ [p6<=0]] & ~ [[[[[[1<=p11 & p15<=0] & p11<=p18] | [[1<=p18 & 1<=p6] & [1<=p5 & p16<=p3]]] & p5<=1] | 1<=p20]]]]]]
normalized: E [true U [~ [[~ [[[[[[1<=p18 & 1<=p6] & [1<=p5 & p16<=p3]] | [[1<=p11 & p15<=0] & p11<=p18]] & p5<=1] | 1<=p20]] & [~ [p6<=0] | p5<=p20]]] & [~ [[[~ [[1<=p4 & p12<=p16]] & [~ [p3<=p2] & ~ [p11<=p6]]] | p12<=p17]] & p16<=p18]]]
abstracting: (p16<=p18)
states: 1,536 (3)
abstracting: (p12<=p17)
states: 2,048 (3)
abstracting: (p11<=p6)
states: 1,024 (3)
abstracting: (p3<=p2)
states: 2,048 (3)
abstracting: (p12<=p16)
states: 1,536 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p5<=p20)
states: 1,024 (3)
abstracting: (p6<=0)
states: 1,024 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p5<=1)
states: 2,048 (3)
abstracting: (p11<=p18)
states: 1,024 (3)
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p16<=p3)
states: 2,048 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (1<=p18)
states: 1,024 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[p18<=1 & ~ [[p6<=p9 | [p5<=0 & [[[[p9<=p10 | p13<=0] | [p5<=1 & p15<=p10]] | p18<=p14] | [1<=p20 & [[p20<=p6 | p18<=1] & [1<=p6 | p17<=0]]]]]]]] | [[p5<=p13 | [[1<=p16 | 1<=p17] | [p11<=0 | [~ [[p8<=1 & [p10<=1 & 1<=p7]]] & ~ [[p16<=p14 & p2<=p9]]]]]] | 1<=p6]]]
normalized: ~ [E [true U ~ [[[~ [[[[[[[1<=p6 | p17<=0] & [p20<=p6 | p18<=1]] & 1<=p20] | [[[p5<=1 & p15<=p10] | [p9<=p10 | p13<=0]] | p18<=p14]] & p5<=0] | p6<=p9]] & p18<=1] | [[[[[~ [[p16<=p14 & p2<=p9]] & ~ [[[p10<=1 & 1<=p7] & p8<=1]]] | p11<=0] | [1<=p16 | 1<=p17]] | p5<=p13] | 1<=p6]]]]]
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (p5<=p13)
states: 2,048 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p11<=0)
states: 0
abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (p10<=1)
states: 2,048 (3)
abstracting: (p2<=p9)
states: 1,024 (3)
abstracting: (p16<=p14)
states: 1,536 (3)
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (p6<=p9)
states: 1,536 (3)
abstracting: (p5<=0)
states: 0
abstracting: (p18<=p14)
states: 1,536 (3)
abstracting: (p13<=0)
states: 0
abstracting: (p9<=p10)
states: 1,536 (3)
abstracting: (p15<=p10)
states: 1,536 (3)
abstracting: (p5<=1)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (p20<=p6)
states: 1,536 (3)
abstracting: (p17<=0)
states: 0
abstracting: (1<=p6)
states: 1,024 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[~ [[~ [[[p19<=0 & p19<=1] & [p2<=p20 & p13<=0]]] & ~ [[[~ [p14<=0] | p5<=p13] & [[~ [p17<=0] & [p3<=p20 | p18<=p3]] & p5<=p2]]]]] & ~ [[[[p10<=p19 | [[1<=p15 & 1<=p12] | 1<=p8]] & p4<=1] & [p9<=p11 & [[[p18<=p8 & p9<=p12] | [p15<=1 | p6<=1]] | p6<=p18]]]]]]]
normalized: ~ [E [true U [~ [[[[[[p15<=1 | p6<=1] | [p18<=p8 & p9<=p12]] | p6<=p18] & p9<=p11] & [[[[1<=p15 & 1<=p12] | 1<=p8] | p10<=p19] & p4<=1]]] & ~ [[~ [[[[[p3<=p20 | p18<=p3] & ~ [p17<=0]] & p5<=p2] & [~ [p14<=0] | p5<=p13]]] & ~ [[[p2<=p20 & p13<=0] & [p19<=0 & p19<=1]]]]]]]]
abstracting: (p19<=1)
states: 2,048 (3)
abstracting: (p19<=0)
states: 0
abstracting: (p13<=0)
states: 0
abstracting: (p2<=p20)
states: 1,024 (3)
abstracting: (p5<=p13)
states: 2,048 (3)
abstracting: (p14<=0)
states: 1,024 (3)
abstracting: (p5<=p2)
states: 2,048 (3)
abstracting: (p17<=0)
states: 0
abstracting: (p18<=p3)
states: 2,048 (3)
abstracting: (p3<=p20)
states: 1,024 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (p10<=p19)
states: 2,048 (3)
abstracting: (1<=p8)
states: 1,024 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (1<=p15)
states: 1,024 (3)
abstracting: (p9<=p11)
states: 2,048 (3)
abstracting: (p6<=p18)
states: 1,536 (3)
abstracting: (p9<=p12)
states: 1,536 (3)
abstracting: (p18<=p8)
states: 1,536 (3)
abstracting: (p6<=1)
states: 2,048 (3)
abstracting: (p15<=1)
states: 2,048 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[[1<=p10 | [p7<=p17 | [[[~ [p4<=p12] | ~ [p8<=0]] & ~ [[p9<=p13 & 1<=p7]]] | p20<=0]]] & [[~ [1<=p17] & [1<=p4 | 1<=p9]] & [~ [[[[1<=p4 | p12<=p9] & [p11<=p11 & 1<=p6]] | [[p14<=0 | p6<=1] & ~ [p16<=p20]]]] & ~ [[[[~ [1<=p19] & [p4<=1 & p19<=1]] | [~ [1<=p11] | [p8<=0 | 1<=p20]]] & [p15<=0 | [[1<=p4 | p7<=0] | 1<=p20]]]]]]]]]
normalized: ~ [E [true U [[[~ [[[[[1<=p4 | p7<=0] | 1<=p20] | p15<=0] & [[[p8<=0 | 1<=p20] | ~ [1<=p11]] | [[p4<=1 & p19<=1] & ~ [1<=p19]]]]] & ~ [[[~ [p16<=p20] & [p14<=0 | p6<=1]] | [[p11<=p11 & 1<=p6] & [1<=p4 | p12<=p9]]]]] & [[1<=p4 | 1<=p9] & ~ [1<=p17]]] & [[[[~ [[p9<=p13 & 1<=p7]] & [~ [p8<=0] | ~ [p4<=p12]]] | p20<=0] | p7<=p17] | 1<=p10]]]]
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (p7<=p17)
states: 2,048 (3)
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (p4<=p12)
states: 1,536 (3)
abstracting: (p8<=0)
states: 1,024 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (p9<=p13)
states: 2,048 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (1<=p9)
states: 1,024 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p12<=p9)
states: 1,536 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (p11<=p11)
states: 2,048 (3)
abstracting: (p6<=1)
states: 2,048 (3)
abstracting: (p14<=0)
states: 1,024 (3)
abstracting: (p16<=p20)
states: 1,536 (3)
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (p19<=1)
states: 2,048 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p8<=0)
states: 1,024 (3)
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p7<=0)
states: 0
abstracting: (1<=p4)
states: 1,024 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[[[~ [1<=p12] & [[[~ [[1<=p17 | 1<=p7]] | [~ [p19<=p12] | p3<=0]] & [~ [[p10<=0 | p5<=0]] & [~ [1<=p14] & [p14<=1 | p9<=1]]]] | ~ [[p13<=p7 | p15<=p16]]]] | [~ [1<=p18] & [~ [[[p14<=0 & 1<=p11] & [p8<=p15 | 1<=p13]]] | ~ [[~ [1<=p13] | [p3<=p2 & 1<=p14]]]]]] & [[[~ [1<=p7] | [[1<=p12 | [[1<=p12 | p16<=p12] & p10<=p17]] & ~ [p20<=1]]] & ~ [[[p12<=0 | p7<=0] | p13<=0]]] & ~ [p18<=p6]]]]]
normalized: ~ [E [true U [[~ [p18<=p6] & [~ [[[p12<=0 | p7<=0] | p13<=0]] & [[~ [p20<=1] & [[[1<=p12 | p16<=p12] & p10<=p17] | 1<=p12]] | ~ [1<=p7]]]] & [[[~ [[[p3<=p2 & 1<=p14] | ~ [1<=p13]]] | ~ [[[p8<=p15 | 1<=p13] & [p14<=0 & 1<=p11]]]] & ~ [1<=p18]] | [[~ [[p13<=p7 | p15<=p16]] | [[[[p14<=1 | p9<=1] & ~ [1<=p14]] & ~ [[p10<=0 | p5<=0]]] & [[~ [p19<=p12] | p3<=0] | ~ [[1<=p17 | 1<=p7]]]]] & ~ [1<=p12]]]]]]
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p3<=0)
states: 0
abstracting: (p19<=p12)
states: 1,024 (3)
abstracting: (p5<=0)
states: 0
abstracting: (p10<=0)
states: 1,024 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p9<=1)
states: 2,048 (3)
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (p15<=p16)
states: 1,536 (3)
abstracting: (p13<=p7)
states: 2,048 (3)
abstracting: (1<=p18)
states: 1,024 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p14<=0)
states: 1,024 (3)
abstracting: (1<=p13)
states: 2,048 (3)
abstracting: (p8<=p15)
states: 1,536 (3)
abstracting: (1<=p13)
states: 2,048 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p3<=p2)
states: 2,048 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (p10<=p17)
states: 2,048 (3)
abstracting: (p16<=p12)
states: 1,536 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (p20<=1)
states: 2,048 (3)
abstracting: (p13<=0)
states: 0
abstracting: (p7<=0)
states: 0
abstracting: (p12<=0)
states: 1,024 (3)
abstracting: (p18<=p6)
states: 1,536 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[[[~ [1<=p15] | [~ [[[[1<=p14 | p12<=p5] | ~ [1<=p3]] & ~ [[p20<=1 & p20<=0]]]] & [p12<=0 & p8<=1]]] & ~ [[[p9<=0 | [p11<=p9 | p9<=1]] & [[~ [1<=p12] & 1<=p2] | [~ [p12<=1] | [p4<=p18 | p5<=0]]]]]] & [~ [[[1<=p17 & [[[p16<=1 | 1<=p8] | p8<=p17] & 1<=p5]] | [[1<=p11 & [[p3<=1 & p2<=0] | [p11<=p19 | p20<=p16]]] & [~ [p4<=1] & [[p17<=p16 | 1<=p11] & [1<=p9 & p20<=0]]]]]] & [~ [[[[p14<=1 & p8<=p18] & [[p16<=p12 | p12<=1] & ~ [1<=p16]]] | [[p3<=1 | [p13<=p5 | p5<=0]] & [[p19<=p18 | p13<=p10] & [p4<=p19 & 1<=p6]]]]] & [p11<=0 | 1<=p11]]]] | 1<=p19]]
normalized: E [true U [[[[[p11<=0 | 1<=p11] & ~ [[[[[p4<=p19 & 1<=p6] & [p19<=p18 | p13<=p10]] & [[p13<=p5 | p5<=0] | p3<=1]] | [[~ [1<=p16] & [p16<=p12 | p12<=1]] & [p14<=1 & p8<=p18]]]]] & ~ [[[[[[1<=p9 & p20<=0] & [p17<=p16 | 1<=p11]] & ~ [p4<=1]] & [[[p11<=p19 | p20<=p16] | [p3<=1 & p2<=0]] & 1<=p11]] | [[[[p16<=1 | 1<=p8] | p8<=p17] & 1<=p5] & 1<=p17]]]] & [~ [[[[[p4<=p18 | p5<=0] | ~ [p12<=1]] | [~ [1<=p12] & 1<=p2]] & [[p11<=p9 | p9<=1] | p9<=0]]] & [[[p12<=0 & p8<=1] & ~ [[~ [[p20<=1 & p20<=0]] & [~ [1<=p3] | [1<=p14 | p12<=p5]]]]] | ~ [1<=p15]]]] | 1<=p19]]
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (1<=p15)
states: 1,024 (3)
abstracting: (p12<=p5)
states: 2,048 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p3)
states: 2,048 (3)
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (p20<=1)
states: 2,048 (3)
abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (p12<=0)
states: 1,024 (3)
abstracting: (p9<=0)
states: 1,024 (3)
abstracting: (p9<=1)
states: 2,048 (3)
abstracting: (p11<=p9)
states: 1,024 (3)
abstracting: (1<=p2)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (p12<=1)
states: 2,048 (3)
abstracting: (p5<=0)
states: 0
abstracting: (p4<=p18)
states: 1,536 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p8<=p17)
states: 2,048 (3)
abstracting: (1<=p8)
states: 1,024 (3)
abstracting: (p16<=1)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p2<=0)
states: 0
abstracting: (p3<=1)
states: 2,048 (3)
abstracting: (p20<=p16)
states: 1,536 (3)
abstracting: (p11<=p19)
states: 2,048 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p17<=p16)
states: 1,024 (3)
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (1<=p9)
states: 1,024 (3)
abstracting: (p8<=p18)
states: 1,536 (3)
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (p12<=1)
states: 2,048 (3)
abstracting: (p16<=p12)
states: 1,536 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p3<=1)
states: 2,048 (3)
abstracting: (p5<=0)
states: 0
abstracting: (p13<=p5)
states: 2,048 (3)
abstracting: (p13<=p10)
states: 1,024 (3)
abstracting: (p19<=p18)
states: 1,024 (3)
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (p4<=p19)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p11<=0)
states: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[[[1<=p14 | [~ [p9<=p7] & ~ [[~ [[p2<=0 & 1<=p8]] | [1<=p2 & p19<=p9]]]]] | [[[[[[p14<=p12 & 1<=p5] | 1<=p12] | [~ [1<=p11] & p3<=p12]] & p14<=1] | ~ [p11<=p10]] & [[~ [[[p5<=p9 | p9<=1] & ~ [p19<=1]]] | [p10<=1 | [[p12<=1 | 1<=p9] & [p2<=p3 & p19<=1]]]] | [p2<=0 | [[~ [p19<=p20] & [p10<=0 | p10<=p16]] | p4<=p12]]]]] | [[[[p17<=p14 | p15<=p18] & ~ [[1<=p10 & 1<=p17]]] & [~ [1<=p6] | [[p9<=p3 & [[1<=p4 & p9<=1] | [p19<=p14 & p8<=p19]]] | [[p8<=p14 & p6<=p19] | [~ [1<=p20] & p14<=1]]]]] & ~ [p3<=0]]] | p4<=p9]]
normalized: ~ [E [true U ~ [[[[~ [p3<=0] & [[[[[~ [1<=p20] & p14<=1] | [p8<=p14 & p6<=p19]] | [[[p19<=p14 & p8<=p19] | [1<=p4 & p9<=1]] & p9<=p3]] | ~ [1<=p6]] & [~ [[1<=p10 & 1<=p17]] & [p17<=p14 | p15<=p18]]]] | [[[[[[[p10<=0 | p10<=p16] & ~ [p19<=p20]] | p4<=p12] | p2<=0] | [[[[p2<=p3 & p19<=1] & [p12<=1 | 1<=p9]] | p10<=1] | ~ [[~ [p19<=1] & [p5<=p9 | p9<=1]]]]] & [~ [p11<=p10] | [[[~ [1<=p11] & p3<=p12] | [[p14<=p12 & 1<=p5] | 1<=p12]] & p14<=1]]] | [[~ [[[1<=p2 & p19<=p9] | ~ [[p2<=0 & 1<=p8]]]] & ~ [p9<=p7]] | 1<=p14]]] | p4<=p9]]]]
abstracting: (p4<=p9)
states: 1,536 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p9<=p7)
states: 2,048 (3)
abstracting: (1<=p8)
states: 1,024 (3)
abstracting: (p2<=0)
states: 0
abstracting: (p19<=p9)
states: 1,024 (3)
abstracting: (1<=p2)
states: 2,048 (3)
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p14<=p12)
states: 1,536 (3)
abstracting: (p3<=p12)
states: 1,024 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p11<=p10)
states: 1,024 (3)
abstracting: (p9<=1)
states: 2,048 (3)
abstracting: (p5<=p9)
states: 1,024 (3)
abstracting: (p19<=1)
states: 2,048 (3)
abstracting: (p10<=1)
states: 2,048 (3)
abstracting: (1<=p9)
states: 1,024 (3)
abstracting: (p12<=1)
states: 2,048 (3)
abstracting: (p19<=1)
states: 2,048 (3)
abstracting: (p2<=p3)
states: 2,048 (3)
abstracting: (p2<=0)
states: 0
abstracting: (p4<=p12)
states: 1,536 (3)
abstracting: (p19<=p20)
states: 1,024 (3)
abstracting: (p10<=p16)
states: 1,536 (3)
abstracting: (p10<=0)
states: 1,024 (3)
abstracting: (p15<=p18)
states: 1,536 (3)
abstracting: (p17<=p14)
states: 1,024 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (p9<=p3)
states: 2,048 (3)
abstracting: (p9<=1)
states: 2,048 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p8<=p19)
states: 2,048 (3)
abstracting: (p19<=p14)
states: 1,024 (3)
abstracting: (p6<=p19)
states: 2,048 (3)
abstracting: (p8<=p14)
states: 1,536 (3)
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p3<=0)
states: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[~ [[p3<=p3 & p20<=0]] & [[p9<=p12 | p10<=1] | [[1<=p5 | p11<=1] | p7<=0]]] & [[~ [[1<=p6 & ~ [[[p16<=1 & 1<=p5] | [1<=p8 | p6<=0]]]]] & ~ [[[[[p14<=0 & p2<=1] | ~ [p2<=p4]] | [[p20<=0 | p3<=p7] & ~ [1<=p8]]] & ~ [[[1<=p18 & p5<=1] | ~ [1<=p18]]]]]] | ~ [1<=p15]]] & [[[~ [[~ [[1<=p11 | p15<=p17]] | ~ [[[1<=p10 | 1<=p20] | ~ [p9<=0]]]]] & [~ [[[1<=p17 | [p5<=p11 | p7<=0]] & [[1<=p14 | p17<=1] | p16<=p15]]] & ~ [p19<=p18]]] & [[[[~ [p18<=p15] | ~ [1<=p11]] & [~ [p5<=p18] | ~ [[p18<=1 & p8<=1]]]] & ~ [[~ [[1<=p9 & 1<=p8]] | 1<=p11]]] & p2<=0]] | [[[[[[~ [p14<=p16] & ~ [1<=p5]] | ~ [[p2<=p13 | p14<=p4]]] & p4<=1] & 1<=p14] | p20<=0] & [~ [[[[[1<=p7 & 1<=p18] & [1<=p13 & 1<=p20]] & [~ [p18<=0] | p9<=p5]] & ~ [p20<=p15]]] & [[1<=p18 | ~ [[[p16<=0 & p3<=p12] & ~ [p3<=0]]]] & p17<=p7]]]]]]
normalized: E [true U [[[[~ [[~ [[~ [1<=p18] | [1<=p18 & p5<=1]]] & [[~ [1<=p8] & [p20<=0 | p3<=p7]] | [~ [p2<=p4] | [p14<=0 & p2<=1]]]]] & ~ [[~ [[[1<=p8 | p6<=0] | [p16<=1 & 1<=p5]]] & 1<=p6]]] | ~ [1<=p15]] & [[[[1<=p5 | p11<=1] | p7<=0] | [p9<=p12 | p10<=1]] & ~ [[p3<=p3 & p20<=0]]]] & [[[[[~ [[~ [p3<=0] & [p16<=0 & p3<=p12]]] | 1<=p18] & p17<=p7] & ~ [[~ [p20<=p15] & [[~ [p18<=0] | p9<=p5] & [[1<=p13 & 1<=p20] & [1<=p7 & 1<=p18]]]]]] & [[[[~ [[p2<=p13 | p14<=p4]] | [~ [1<=p5] & ~ [p14<=p16]]] & p4<=1] & 1<=p14] | p20<=0]] | [[[~ [[~ [[1<=p9 & 1<=p8]] | 1<=p11]] & [[~ [[p18<=1 & p8<=1]] | ~ [p5<=p18]] & [~ [1<=p11] | ~ [p18<=p15]]]] & p2<=0] & [[~ [p19<=p18] & ~ [[[[1<=p14 | p17<=1] | p16<=p15] & [[p5<=p11 | p7<=0] | 1<=p17]]]] & ~ [[~ [[~ [p9<=0] | [1<=p10 | 1<=p20]]] | ~ [[1<=p11 | p15<=p17]]]]]]]]]
abstracting: (p15<=p17)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (p9<=0)
states: 1,024 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p7<=0)
states: 0
abstracting: (p5<=p11)
states: 2,048 (3)
abstracting: (p16<=p15)
states: 1,536 (3)
abstracting: (p17<=1)
states: 2,048 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p19<=p18)
states: 1,024 (3)
abstracting: (p2<=0)
states: 0
abstracting: (p18<=p15)
states: 1,536 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p5<=p18)
states: 1,024 (3)
abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p8)
states: 1,024 (3)
abstracting: (1<=p9)
states: 1,024 (3)
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (p14<=p16)
states: 1,536 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p14<=p4)
states: 1,536 (3)
abstracting: (p2<=p13)
states: 2,048 (3)
abstracting: (1<=p18)
states: 1,024 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (1<=p13)
states: 2,048 (3)
abstracting: (p9<=p5)
states: 2,048 (3)
abstracting: (p18<=0)
states: 1,024 (3)
abstracting: (p20<=p15)
states: 1,536 (3)
abstracting: (p17<=p7)
states: 2,048 (3)
abstracting: (1<=p18)
states: 1,024 (3)
abstracting: (p3<=p12)
states: 1,024 (3)
abstracting: (p16<=0)
states: 1,024 (3)
abstracting: (p3<=0)
states: 0
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (p3<=p3)
states: 2,048 (3)
abstracting: (p10<=1)
states: 2,048 (3)
abstracting: (p9<=p12)
states: 1,536 (3)
abstracting: (p7<=0)
states: 0
abstracting: (p11<=1)
states: 2,048 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (1<=p15)
states: 1,024 (3)
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p16<=1)
states: 2,048 (3)
abstracting: (p6<=0)
states: 1,024 (3)
abstracting: (1<=p8)
states: 1,024 (3)
abstracting: (p2<=1)
states: 2,048 (3)
abstracting: (p14<=0)
states: 1,024 (3)
abstracting: (p2<=p4)
states: 1,024 (3)
abstracting: (p3<=p7)
states: 2,048 (3)
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (1<=p8)
states: 1,024 (3)
abstracting: (p5<=1)
states: 2,048 (3)
abstracting: (1<=p18)
states: 1,024 (3)
abstracting: (1<=p18)
states: 1,024 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[[[[[[[[1<=p2 | p17<=1] & [p14<=1 | 1<=p14]] | p4<=p4] | p4<=0] & [p6<=1 | p20<=1]] | [[[~ [[1<=p13 & p5<=p13]] | 1<=p12] & [~ [p20<=p13] | [1<=p20 & [p6<=p20 & p13<=p13]]]] & [[p9<=p15 & p8<=p18] | ~ [1<=p16]]]] | p15<=0] & [~ [[[1<=p12 & [[[p12<=p12 | 1<=p18] | ~ [p15<=p12]] & ~ [1<=p10]]] & 1<=p7]] | [1<=p17 & [p15<=1 & ~ [[[[p12<=0 & 1<=p13] | p17<=p12] & [p16<=0 & ~ [p7<=1]]]]]]]] | [[~ [[~ [[[[p8<=p5 & p9<=0] & [p17<=p3 & p6<=1]] & [[p9<=p2 | p6<=p18] & ~ [1<=p11]]]] | [[[[p4<=0 & p18<=p14] & p12<=p5] | [p10<=1 | 1<=p18]] & [~ [1<=p16] & ~ [[p18<=1 | p17<=0]]]]]] | p15<=p5] | [p16<=p4 | [[~ [p7<=p13] & ~ [[p16<=p11 | p11<=1]]] & ~ [[~ [p12<=p7] & [[p10<=0 | ~ [1<=p12]] & [~ [p19<=0] | [p14<=p14 & p12<=p4]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[[[p14<=p14 & p12<=p4] | ~ [p19<=0]] & [~ [1<=p12] | p10<=0]] & ~ [p12<=p7]]] & [~ [[p16<=p11 | p11<=1]] & ~ [p7<=p13]]] | p16<=p4] | [~ [[[[~ [[p18<=1 | p17<=0]] & ~ [1<=p16]] & [[p10<=1 | 1<=p18] | [[p4<=0 & p18<=p14] & p12<=p5]]] | ~ [[[~ [1<=p11] & [p9<=p2 | p6<=p18]] & [[p17<=p3 & p6<=1] & [p8<=p5 & p9<=0]]]]]] | p15<=p5]] | [[[[~ [[[~ [p7<=1] & p16<=0] & [[p12<=0 & 1<=p13] | p17<=p12]]] & p15<=1] & 1<=p17] | ~ [[[[~ [1<=p10] & [~ [p15<=p12] | [p12<=p12 | 1<=p18]]] & 1<=p12] & 1<=p7]]] & [[[[~ [1<=p16] | [p9<=p15 & p8<=p18]] & [[[[p6<=p20 & p13<=p13] & 1<=p20] | ~ [p20<=p13]] & [~ [[1<=p13 & p5<=p13]] | 1<=p12]]] | [[p6<=1 | p20<=1] & [p4<=0 | [[[p14<=1 | 1<=p14] & [1<=p2 | p17<=1]] | p4<=p4]]]] | p15<=0]]]]]]
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (p4<=p4)
states: 2,048 (3)
abstracting: (p17<=1)
states: 2,048 (3)
abstracting: (1<=p2)
states: 2,048 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (p20<=1)
states: 2,048 (3)
abstracting: (p6<=1)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (p5<=p13)
states: 2,048 (3)
abstracting: (1<=p13)
states: 2,048 (3)
abstracting: (p20<=p13)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p13<=p13)
states: 2,048 (3)
abstracting: (p6<=p20)
states: 1,536 (3)
abstracting: (p8<=p18)
states: 1,536 (3)
abstracting: (p9<=p15)
states: 1,536 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (1<=p18)
states: 1,024 (3)
abstracting: (p12<=p12)
states: 2,048 (3)
abstracting: (p15<=p12)
states: 1,536 (3)
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p15<=1)
states: 2,048 (3)
abstracting: (p17<=p12)
states: 1,024 (3)
abstracting: (1<=p13)
states: 2,048 (3)
abstracting: (p12<=0)
states: 1,024 (3)
abstracting: (p16<=0)
states: 1,024 (3)
abstracting: (p7<=1)
states: 2,048 (3)
abstracting: (p15<=p5)
states: 2,048 (3)
abstracting: (p9<=0)
states: 1,024 (3)
abstracting: (p8<=p5)
states: 2,048 (3)
abstracting: (p6<=1)
states: 2,048 (3)
abstracting: (p17<=p3)
states: 2,048 (3)
abstracting: (p6<=p18)
states: 1,536 (3)
abstracting: (p9<=p2)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p12<=p5)
states: 2,048 (3)
abstracting: (p18<=p14)
states: 1,536 (3)
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (1<=p18)
states: 1,024 (3)
abstracting: (p10<=1)
states: 2,048 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p17<=0)
states: 0
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (p16<=p4)
states: 1,536 (3)
abstracting: (p7<=p13)
states: 2,048 (3)
abstracting: (p11<=1)
states: 2,048 (3)
abstracting: (p16<=p11)
states: 2,048 (3)
abstracting: (p12<=p7)
states: 2,048 (3)
abstracting: (p10<=0)
states: 1,024 (3)
abstracting: (1<=p12)
states: 1,024 (3)
abstracting: (p19<=0)
states: 0
abstracting: (p12<=p4)
states: 1,536 (3)
abstracting: (p14<=p14)
states: 2,048 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 1496 (1.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 126 1444 1570
used/not used/entry size/cache size: 1698 67107166 16 1024MB
basic ops cache: hits/miss/sum: 588 3252 3840
used/not used/entry size/cache size: 6081 16771135 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: 389 313 702
used/not used/entry size/cache size: 313 8388295 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 67107446
1 1351
2 56
3 11
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.603sec
BK_STOP 1679420090016
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p19
p17
p13
p11
The net has transition(s) that can never fire:
check for constant places
p2
p3
p7
p5
p11
p13
p17
p19
found 8 constant places
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:153 (5), effective:11 (0)
initing FirstDep: 0m 0.000sec
iterations count:27 (1), effective:0 (0)
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="Eratosthenes-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is Eratosthenes-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r161-tall-167838844800150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-020.tgz
mv Eratosthenes-PT-020 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;