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.r106-tall-167814483300878.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 DNAwalker-PT-01track12Block1, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483300878
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.2K Feb 25 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 16 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 36K 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 DNAwalker-PT-01track12Block1-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-01track12Block1-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678498456059

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-01track12Block1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 01:34:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 01:34:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:34:17] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-11 01:34:17] [INFO ] Transformed 13 places.
[2023-03-11 01:34:17] [INFO ] Transformed 82 transitions.
[2023-03-11 01:34:17] [INFO ] Parsed PT model containing 13 places and 82 transitions and 241 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1206 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 203 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 198 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 266 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 252 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Probably explored full state space saw : 3795 states, properties seen :0
Probabilistic random walk after 16944 steps, saw 3795 distinct states, run finished after 133 ms. (steps per millisecond=127 ) properties seen :0
Explored full state space saw : 3795 states, properties seen :0
Exhaustive walk after 16944 steps, saw 3795 distinct states, run finished after 115 ms. (steps per millisecond=147 ) properties seen :0
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 1605 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DNAwalker_PT_01track12Block1
(NrP: 13 NrTr: 82 NrArc: 241)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.741sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 130 (1.3e+02) #states 3,795 (3)



starting MCC model checker
--------------------------

checking: AG [1<=A12]
normalized: ~ [E [true U ~ [1<=A12]]]

abstracting: (1<=A12)
states: 3,795 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [A4<=2]
normalized: ~ [E [true U ~ [A4<=2]]]

abstracting: (A4<=2)
states: 3,795 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [A8<=2]]
normalized: E [true U ~ [A8<=2]]

abstracting: (A8<=2)
states: 3,795 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [A11<=A9]]
normalized: ~ [E [true U A11<=A9]]

abstracting: (A11<=A9)
states: 2,520 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AG [[~ [2<=B5] | ~ [[[[[~ [[A7<=0 & A11<=A3]] & A10<=1] | A10<=0] & A1<=2] | A3<=1]]]]
normalized: ~ [E [true U ~ [[~ [[[[[~ [[A7<=0 & A11<=A3]] & A10<=1] | A10<=0] & A1<=2] | A3<=1]] | ~ [2<=B5]]]]]

abstracting: (2<=B5)
states: 0
abstracting: (A3<=1)
states: 3,487 (3)
abstracting: (A1<=2)
states: 3,795 (3)
abstracting: (A10<=0)
states: 1,856 (3)
abstracting: (A10<=1)
states: 3,481 (3)
abstracting: (A11<=A3)
states: 2,560 (3)
abstracting: (A7<=0)
states: 1,642 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[A8<=1 & [~ [[[~ [[[A9<=A2 | A9<=1] & [2<=A2 & A4<=0]]] | ~ [[A5<=1 | A2<=1]]] & 2<=A12]] | 2<=B5]]]
normalized: E [true U [[~ [[[~ [[A5<=1 | A2<=1]] | ~ [[[2<=A2 & A4<=0] & [A9<=A2 | A9<=1]]]] & 2<=A12]] | 2<=B5] & A8<=1]]

abstracting: (A8<=1)
states: 3,255 (3)
abstracting: (2<=B5)
states: 0
abstracting: (2<=A12)
states: 568
abstracting: (A9<=1)
states: 3,487 (3)
abstracting: (A9<=A2)
states: 2,742 (3)
abstracting: (A4<=0)
states: 1,997 (3)
abstracting: (2<=A2)
states: 289
abstracting: (A2<=1)
states: 3,506 (3)
abstracting: (A5<=1)
states: 3,580 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[[[A6<=2 & ~ [[[[A3<=0 & A6<=A1] | [B5<=A12 & 1<=A9]] | A12<=2]]] | [~ [A5<=A7] & ~ [A11<=A11]]] & [~ [[[B5<=A4 | ~ [[A7<=0 | A5<=A12]]] | [~ [A1<=2] | [A1<=2 & ~ [2<=A12]]]]] | 2<=A4]]]]
normalized: ~ [E [true U [[~ [[[[~ [2<=A12] & A1<=2] | ~ [A1<=2]] | [~ [[A7<=0 | A5<=A12]] | B5<=A4]]] | 2<=A4] & [[~ [A11<=A11] & ~ [A5<=A7]] | [~ [[[[B5<=A12 & 1<=A9] | [A3<=0 & A6<=A1]] | A12<=2]] & A6<=2]]]]]

abstracting: (A6<=2)
states: 3,795 (3)
abstracting: (A12<=2)
states: 3,795 (3)
abstracting: (A6<=A1)
states: 1,873 (3)
abstracting: (A3<=0)
states: 1,997 (3)
abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (B5<=A12)
states: 3,795 (3)
abstracting: (A5<=A7)
states: 3,127 (3)
abstracting: (A11<=A11)
states: 3,795 (3)
abstracting: (2<=A4)
states: 308
abstracting: (B5<=A4)
states: 3,201 (3)
abstracting: (A5<=A12)
states: 3,580 (3)
abstracting: (A7<=0)
states: 1,642 (3)
abstracting: (A1<=2)
states: 3,795 (3)
abstracting: (A1<=2)
states: 3,795 (3)
abstracting: (2<=A12)
states: 568
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [[A11<=2 & [[[[[A8<=1 & 2<=A4] & 1<=A5] | [[1<=A6 & A10<=1] | 1<=A4]] | [~ [A9<=0] | ~ [[A7<=A12 | A11<=A10]]]] | ~ [[[[A5<=A9 & A3<=1] & [2<=A4 & 1<=A1]] & A4<=0]]]]] & A11<=0] & [[A9<=0 & A10<=A8] & B5<=1]]]
normalized: E [true U [[[A9<=0 & A10<=A8] & B5<=1] & [~ [[[~ [[[[2<=A4 & 1<=A1] & [A5<=A9 & A3<=1]] & A4<=0]] | [[~ [[A7<=A12 | A11<=A10]] | ~ [A9<=0]] | [[[1<=A6 & A10<=1] | 1<=A4] | [[A8<=1 & 2<=A4] & 1<=A5]]]] & A11<=2]] & A11<=0]]]

abstracting: (A11<=0)
states: 1,629 (3)
abstracting: (A11<=2)
states: 3,795 (3)
abstracting: (1<=A5)
states: 1,289 (3)
abstracting: (2<=A4)
states: 308
abstracting: (A8<=1)
states: 3,255 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (A10<=1)
states: 3,481 (3)
abstracting: (1<=A6)
states: 1,925 (3)
abstracting: (A9<=0)
states: 2,037 (3)
abstracting: (A11<=A10)
states: 2,625 (3)
abstracting: (A7<=A12)
states: 3,481 (3)
abstracting: (A4<=0)
states: 1,997 (3)
abstracting: (A3<=1)
states: 3,487 (3)
abstracting: (A5<=A9)
states: 2,974 (3)
abstracting: (1<=A1)
states: 3
abstracting: (2<=A4)
states: 308
abstracting: (B5<=1)
states: 3,795 (3)
abstracting: (A10<=A8)
states: 3,481 (3)
abstracting: (A9<=0)
states: 2,037 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[1<=A11 & [[[[[[[1<=A8 & 2<=A12] | 1<=A5] & [[2<=A1 & 1<=A4] | A3<=A11]] & ~ [A11<=1]] | 1<=A7] & 1<=A9] & ~ [[[[A5<=0 | [~ [A11<=A11] & ~ [A1<=A9]]] | [A9<=2 | [[A4<=2 | A8<=B5] & [2<=A11 & A10<=A8]]]] | A8<=A11]]]] | A8<=2]]
normalized: ~ [E [true U ~ [[[[~ [[[[[[2<=A11 & A10<=A8] & [A4<=2 | A8<=B5]] | A9<=2] | [[~ [A1<=A9] & ~ [A11<=A11]] | A5<=0]] | A8<=A11]] & [[[~ [A11<=1] & [[[2<=A1 & 1<=A4] | A3<=A11] & [[1<=A8 & 2<=A12] | 1<=A5]]] | 1<=A7] & 1<=A9]] & 1<=A11] | A8<=2]]]]

abstracting: (A8<=2)
states: 3,795 (3)
abstracting: (1<=A11)
states: 2,166 (3)
abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (1<=A7)
states: 2,153 (3)
abstracting: (1<=A5)
states: 1,289 (3)
abstracting: (2<=A12)
states: 568
abstracting: (1<=A8)
states: 3,795 (3)
abstracting: (A3<=A11)
states: 2,893 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (2<=A1)
states: 3
abstracting: (A11<=1)
states: 3,481 (3)
abstracting: (A8<=A11)
states: 1,870 (3)
abstracting: (A5<=0)
states: 2,506 (3)
abstracting: (A11<=A11)
states: 3,795 (3)
abstracting: (A1<=A9)
states: 3,792 (3)
abstracting: (A9<=2)
states: 3,795 (3)
abstracting: (A8<=B5)
states: 926
abstracting: (A4<=2)
states: 3,795 (3)
abstracting: (A10<=A8)
states: 3,481 (3)
abstracting: (2<=A11)
states: 314
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [A12<=2] | [[B5<=A6 | [[[[[B5<=1 & A8<=2] & ~ [[A6<=A5 & A11<=A7]]] | [~ [[A12<=1 | 2<=A1]] | [B5<=A12 & 1<=A3]]] & A11<=0] & [~ [[[[A8<=0 | A1<=1] | [1<=A6 & A6<=2]] | [1<=A5 | [A9<=1 | A11<=A11]]]] | B5<=A4]]] & [A6<=A10 | B5<=2]]]]
normalized: E [true U [[[A6<=A10 | B5<=2] & [[[~ [[[[A9<=1 | A11<=A11] | 1<=A5] | [[1<=A6 & A6<=2] | [A8<=0 | A1<=1]]]] | B5<=A4] & [[[~ [[A12<=1 | 2<=A1]] | [B5<=A12 & 1<=A3]] | [~ [[A6<=A5 & A11<=A7]] & [B5<=1 & A8<=2]]] & A11<=0]] | B5<=A6]] | ~ [A12<=2]]]

abstracting: (A12<=2)
states: 3,795 (3)
abstracting: (B5<=A6)
states: 3,249 (3)
abstracting: (A11<=0)
states: 1,629 (3)
abstracting: (A8<=2)
states: 3,795 (3)
abstracting: (B5<=1)
states: 3,795 (3)
abstracting: (A11<=A7)
states: 2,671 (3)
abstracting: (A6<=A5)
states: 2,406 (3)
abstracting: (1<=A3)
states: 1,798 (3)
abstracting: (B5<=A12)
states: 3,795 (3)
abstracting: (2<=A1)
states: 3
abstracting: (A12<=1)
states: 3,227 (3)
abstracting: (B5<=A4)
states: 3,201 (3)
abstracting: (A1<=1)
states: 3,792 (3)
abstracting: (A8<=0)
states: 0
abstracting: (A6<=2)
states: 3,795 (3)
abstracting: (1<=A6)
states: 1,925 (3)
abstracting: (1<=A5)
states: 1,289 (3)
abstracting: (A11<=A11)
states: 3,795 (3)
abstracting: (A9<=1)
states: 3,487 (3)
abstracting: (B5<=2)
states: 3,795 (3)
abstracting: (A6<=A10)
states: 2,727 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [A4<=2] & [~ [[[A9<=2 | [[[B5<=1 | 1<=A10] | [1<=A4 | 2<=A9]] | ~ [1<=A5]]] & [[[[A9<=2 | 2<=A4] | [A12<=A7 & A9<=A1]] & ~ [[A4<=A5 | A9<=A8]]] | [[A1<=2 | ~ [A4<=0]] & A2<=A1]]]] & [[1<=A6 & ~ [[~ [1<=A11] & [[[1<=A6 & A12<=A6] & [1<=A1 & B5<=A6]] & [[A6<=A2 | 2<=A3] & ~ [2<=A11]]]]]] | 1<=A4]]]]
normalized: E [true U [[[[~ [[[[~ [2<=A11] & [A6<=A2 | 2<=A3]] & [[1<=A1 & B5<=A6] & [1<=A6 & A12<=A6]]] & ~ [1<=A11]]] & 1<=A6] | 1<=A4] & ~ [[[[[~ [A4<=0] | A1<=2] & A2<=A1] | [~ [[A4<=A5 | A9<=A8]] & [[A12<=A7 & A9<=A1] | [A9<=2 | 2<=A4]]]] & [A9<=2 | [~ [1<=A5] | [[1<=A4 | 2<=A9] | [B5<=1 | 1<=A10]]]]]]] & ~ [A4<=2]]]

abstracting: (A4<=2)
states: 3,795 (3)
abstracting: (1<=A10)
states: 1,939 (3)
abstracting: (B5<=1)
states: 3,795 (3)
abstracting: (2<=A9)
states: 308
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (1<=A5)
states: 1,289 (3)
abstracting: (A9<=2)
states: 3,795 (3)
abstracting: (2<=A4)
states: 308
abstracting: (A9<=2)
states: 3,795 (3)
abstracting: (A9<=A1)
states: 2,040 (3)
abstracting: (A12<=A7)
states: 1,842 (3)
abstracting: (A9<=A8)
states: 3,487 (3)
abstracting: (A4<=A5)
states: 2,477 (3)
abstracting: (A2<=A1)
states: 1,876 (3)
abstracting: (A1<=2)
states: 3,795 (3)
abstracting: (A4<=0)
states: 1,997 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (1<=A6)
states: 1,925 (3)
abstracting: (1<=A11)
states: 2,166 (3)
abstracting: (A12<=A6)
states: 1,655 (3)
abstracting: (1<=A6)
states: 1,925 (3)
abstracting: (B5<=A6)
states: 3,249 (3)
abstracting: (1<=A1)
states: 3
abstracting: (2<=A3)
states: 308
abstracting: (A6<=A2)
states: 2,700 (3)
abstracting: (2<=A11)
states: 314
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[1<=A8 & ~ [[[[[[[A7<=A7 & A8<=A2] & A12<=A2] & [[A4<=A1 & A10<=1] & [1<=A6 & A10<=1]]] & A2<=A2] | [[[~ [2<=A8] & [A9<=A9 & A1<=A2]] & ~ [[A3<=1 | A11<=2]]] | 1<=A4]] & A3<=2]]] | [[[A9<=A7 & ~ [[[~ [A3<=A9] & [A11<=1 & [A2<=0 & A11<=A8]]] | [A12<=A7 | ~ [[A11<=1 | A3<=A5]]]]]] & 2<=A6] & 1<=A9]]]
normalized: ~ [E [true U ~ [[[~ [[[[[[[A9<=A9 & A1<=A2] & ~ [2<=A8]] & ~ [[A3<=1 | A11<=2]]] | 1<=A4] | [[[[1<=A6 & A10<=1] & [A4<=A1 & A10<=1]] & [[A7<=A7 & A8<=A2] & A12<=A2]] & A2<=A2]] & A3<=2]] & 1<=A8] | [[[~ [[[~ [[A11<=1 | A3<=A5]] | A12<=A7] | [[[A2<=0 & A11<=A8] & A11<=1] & ~ [A3<=A9]]]] & A9<=A7] & 2<=A6] & 1<=A9]]]]]

abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (2<=A6)
states: 314
abstracting: (A9<=A7)
states: 2,906 (3)
abstracting: (A3<=A9)
states: 2,620 (3)
abstracting: (A11<=1)
states: 3,481 (3)
abstracting: (A11<=A8)
states: 3,481 (3)
abstracting: (A2<=0)
states: 1,873 (3)
abstracting: (A12<=A7)
states: 1,842 (3)
abstracting: (A3<=A5)
states: 2,477 (3)
abstracting: (A11<=1)
states: 3,481 (3)
abstracting: (1<=A8)
states: 3,795 (3)
abstracting: (A3<=2)
states: 3,795 (3)
abstracting: (A2<=A2)
states: 3,795 (3)
abstracting: (A12<=A2)
states: 1,651 (3)
abstracting: (A8<=A2)
states: 1,664 (3)
abstracting: (A7<=A7)
states: 3,795 (3)
abstracting: (A10<=1)
states: 3,481 (3)
abstracting: (A4<=A1)
states: 2,000 (3)
abstracting: (A10<=1)
states: 3,481 (3)
abstracting: (1<=A6)
states: 1,925 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (A11<=2)
states: 3,795 (3)
abstracting: (A3<=1)
states: 3,487 (3)
abstracting: (2<=A8)
states: 540
abstracting: (A1<=A2)
states: 3,792 (3)
abstracting: (A9<=A9)
states: 3,795 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [[~ [[~ [A6<=A8] & ~ [1<=A7]]] & [[~ [[~ [2<=A9] | [[A11<=1 | A12<=0] | [1<=A4 & 1<=A9]]]] & ~ [A9<=A11]] & A6<=1]]] | [~ [[[~ [[A3<=2 | [[1<=A12 & 1<=A12] | [A9<=A5 & A11<=0]]]] & ~ [[~ [[A9<=1 & A9<=A2]] & A7<=A6]]] & [~ [A10<=A9] & A11<=1]]] | [[A4<=A4 & ~ [[A6<=0 & ~ [A10<=A2]]]] | [~ [A3<=1] & [~ [[~ [A3<=A11] & 1<=A4]] & [~ [[A4<=1 & A3<=0]] & [~ [[A5<=2 & B5<=B5]] | ~ [B5<=A6]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [[[[A9<=A5 & A11<=0] | [1<=A12 & 1<=A12]] | A3<=2]] & ~ [[~ [[A9<=1 & A9<=A2]] & A7<=A6]]] & [~ [A10<=A9] & A11<=1]]] | [[[[[~ [B5<=A6] | ~ [[A5<=2 & B5<=B5]]] & ~ [[A4<=1 & A3<=0]]] & ~ [[~ [A3<=A11] & 1<=A4]]] & ~ [A3<=1]] | [~ [[~ [A10<=A2] & A6<=0]] & A4<=A4]]] | ~ [[[[~ [A9<=A11] & ~ [[[[1<=A4 & 1<=A9] | [A11<=1 | A12<=0]] | ~ [2<=A9]]]] & A6<=1] & ~ [[~ [1<=A7] & ~ [A6<=A8]]]]]]]]]

abstracting: (A6<=A8)
states: 3,481 (3)
abstracting: (1<=A7)
states: 2,153 (3)
abstracting: (A6<=1)
states: 3,481 (3)
abstracting: (2<=A9)
states: 308
abstracting: (A12<=0)
states: 0
abstracting: (A11<=1)
states: 3,481 (3)
abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (A9<=A11)
states: 2,893 (3)
abstracting: (A4<=A4)
states: 3,795 (3)
abstracting: (A6<=0)
states: 1,870 (3)
abstracting: (A10<=A2)
states: 2,692 (3)
abstracting: (A3<=1)
states: 3,487 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (A3<=A11)
states: 2,893 (3)
abstracting: (A3<=0)
states: 1,997 (3)
abstracting: (A4<=1)
states: 3,487 (3)
abstracting: (B5<=B5)
states: 3,795 (3)
abstracting: (A5<=2)
states: 3,795 (3)
abstracting: (B5<=A6)
states: 3,249 (3)
abstracting: (A11<=1)
states: 3,481 (3)
abstracting: (A10<=A9)
states: 2,576 (3)
abstracting: (A7<=A6)
states: 2,618 (3)
abstracting: (A9<=A2)
states: 2,742 (3)
abstracting: (A9<=1)
states: 3,487 (3)
abstracting: (A3<=2)
states: 3,795 (3)
abstracting: (1<=A12)
states: 3,795 (3)
abstracting: (1<=A12)
states: 3,795 (3)
abstracting: (A11<=0)
states: 1,629 (3)
abstracting: (A9<=A5)
states: 2,505 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[A10<=1 | [2<=A10 | [A6<=A10 | [[A1<=0 | 1<=A7] & ~ [1<=A3]]]]]] & ~ [[[[[[[A1<=A8 & A1<=A4] | [1<=A10 | ~ [2<=A12]]] & [[[A4<=0 | 1<=A3] | 2<=A5] & A10<=A4]] | A8<=1] & [A10<=0 & [[~ [[A5<=A12 & 1<=A3]] & [~ [A4<=1] | [1<=B5 | A7<=A2]]] | A10<=0]]] & ~ [[[[[[A10<=1 | A12<=A9] & [A8<=1 & 2<=A11]] | A2<=A2] & [2<=A6 | [[A3<=0 | 1<=A5] & [A7<=2 | A9<=0]]]] & A4<=A5]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[[[[A7<=2 | A9<=0] & [A3<=0 | 1<=A5]] | 2<=A6] & [[[A8<=1 & 2<=A11] & [A10<=1 | A12<=A9]] | A2<=A2]] & A4<=A5]] & [[[[[[1<=B5 | A7<=A2] | ~ [A4<=1]] & ~ [[A5<=A12 & 1<=A3]]] | A10<=0] & A10<=0] & [[[[[A4<=0 | 1<=A3] | 2<=A5] & A10<=A4] & [[~ [2<=A12] | 1<=A10] | [A1<=A8 & A1<=A4]]] | A8<=1]]]] & ~ [[[[[~ [1<=A3] & [A1<=0 | 1<=A7]] | A6<=A10] | 2<=A10] | A10<=1]]]]]]

abstracting: (A10<=1)
states: 3,481 (3)
abstracting: (2<=A10)
states: 314
abstracting: (A6<=A10)
states: 2,727 (3)
abstracting: (1<=A7)
states: 2,153 (3)
abstracting: (A1<=0)
states: 3,792 (3)
abstracting: (1<=A3)
states: 1,798 (3)
abstracting: (A8<=1)
states: 3,255 (3)
abstracting: (A1<=A4)
states: 3,792 (3)
abstracting: (A1<=A8)
states: 3,792 (3)
abstracting: (1<=A10)
states: 1,939 (3)
abstracting: (2<=A12)
states: 568
abstracting: (A10<=A4)
states: 2,616 (3)
abstracting: (2<=A5)
states: 215
abstracting: (1<=A3)
states: 1,798 (3)
abstracting: (A4<=0)
states: 1,997 (3)
abstracting: (A10<=0)
states: 1,856 (3)
abstracting: (A10<=0)
states: 1,856 (3)
abstracting: (1<=A3)
states: 1,798 (3)
abstracting: (A5<=A12)
states: 3,580 (3)
abstracting: (A4<=1)
states: 3,487 (3)
abstracting: (A7<=A2)
states: 2,594 (3)
abstracting: (1<=B5)
states: 1,074 (3)
abstracting: (A4<=A5)
states: 2,477 (3)
abstracting: (A2<=A2)
states: 3,795 (3)
abstracting: (A12<=A9)
states: 1,550 (3)
abstracting: (A10<=1)
states: 3,481 (3)
abstracting: (2<=A11)
states: 314
abstracting: (A8<=1)
states: 3,255 (3)
abstracting: (2<=A6)
states: 314
abstracting: (1<=A5)
states: 1,289 (3)
abstracting: (A3<=0)
states: 1,997 (3)
abstracting: (A9<=0)
states: 2,037 (3)
abstracting: (A7<=2)
states: 3,795 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[A8<=A4 | [[[[[[1<=A5 & A11<=0] & [A4<=2 & A4<=2]] & ~ [[1<=A10 & 2<=A8]]] & [[[A2<=A1 | A8<=1] & A2<=A7] | A9<=1]] & ~ [2<=A11]] & ~ [A10<=2]]] | ~ [[~ [B5<=B5] | [[[B5<=1 | 2<=A9] | ~ [2<=A12]] & 1<=A9]]]] | [[[~ [[~ [1<=A4] & [[A11<=1 & A6<=1] | [A8<=0 | 2<=A11]]]] | ~ [[2<=A1 | [[~ [A2<=A10] | [A1<=A2 | A1<=2]] | [A8<=A4 & 2<=A5]]]]] | A11<=2] | [[~ [[~ [2<=A12] & [[A8<=2 | 1<=A7] & [1<=A11 | A5<=0]]]] | B5<=1] & A3<=A3]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[[1<=A11 | A5<=0] & [A8<=2 | 1<=A7]] & ~ [2<=A12]]] | B5<=1] & A3<=A3] | [[~ [[[[A8<=A4 & 2<=A5] | [[A1<=A2 | A1<=2] | ~ [A2<=A10]]] | 2<=A1]] | ~ [[[[A8<=0 | 2<=A11] | [A11<=1 & A6<=1]] & ~ [1<=A4]]]] | A11<=2]] | [~ [[[[~ [2<=A12] | [B5<=1 | 2<=A9]] & 1<=A9] | ~ [B5<=B5]]] | [[~ [A10<=2] & [~ [2<=A11] & [[[[A2<=A1 | A8<=1] & A2<=A7] | A9<=1] & [~ [[1<=A10 & 2<=A8]] & [[A4<=2 & A4<=2] & [1<=A5 & A11<=0]]]]]] | A8<=A4]]]]]]

abstracting: (A8<=A4)
states: 1,562 (3)
abstracting: (A11<=0)
states: 1,629 (3)
abstracting: (1<=A5)
states: 1,289 (3)
abstracting: (A4<=2)
states: 3,795 (3)
abstracting: (A4<=2)
states: 3,795 (3)
abstracting: (2<=A8)
states: 540
abstracting: (1<=A10)
states: 1,939 (3)
abstracting: (A9<=1)
states: 3,487 (3)
abstracting: (A2<=A7)
states: 2,809 (3)
abstracting: (A8<=1)
states: 3,255 (3)
abstracting: (A2<=A1)
states: 1,876 (3)
abstracting: (2<=A11)
states: 314
abstracting: (A10<=2)
states: 3,795 (3)
abstracting: (B5<=B5)
states: 3,795 (3)
abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (2<=A9)
states: 308
abstracting: (B5<=1)
states: 3,795 (3)
abstracting: (2<=A12)
states: 568
abstracting: (A11<=2)
states: 3,795 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (A6<=1)
states: 3,481 (3)
abstracting: (A11<=1)
states: 3,481 (3)
abstracting: (2<=A11)
states: 314
abstracting: (A8<=0)
states: 0
abstracting: (2<=A1)
states: 3
abstracting: (A2<=A10)
states: 2,723 (3)
abstracting: (A1<=2)
states: 3,795 (3)
abstracting: (A1<=A2)
states: 3,792 (3)
abstracting: (2<=A5)
states: 215
abstracting: (A8<=A4)
states: 1,562 (3)
abstracting: (A3<=A3)
states: 3,795 (3)
abstracting: (B5<=1)
states: 3,795 (3)
abstracting: (2<=A12)
states: 568
abstracting: (1<=A7)
states: 2,153 (3)
abstracting: (A8<=2)
states: 3,795 (3)
abstracting: (A5<=0)
states: 2,506 (3)
abstracting: (1<=A11)
states: 2,166 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[~ [[[~ [[~ [A3<=B5] & [A12<=A1 & 2<=A12]]] | ~ [A11<=A8]] & 1<=B5]] & 2<=A11] & [[2<=A2 & [[~ [A4<=A4] | A4<=A9] | ~ [[~ [[A12<=A7 & A10<=2]] & A4<=2]]]] | A10<=B5]] & [[[[[~ [[A7<=A9 | 1<=A12]] & A3<=2] & 1<=A3] | [[~ [A3<=A8] | [1<=A6 & ~ [[A1<=1 & A4<=A12]]]] | [[[[2<=A6 & 2<=A5] & [A9<=A11 | 2<=A12]] & ~ [B5<=2]] | A3<=1]]] & ~ [[[[[[A4<=A6 | A12<=A3] & [A11<=0 & 1<=A9]] | [A6<=A9 & A9<=0]] & [[[A6<=A8 | 2<=A2] | [A6<=A12 & A12<=0]] | [[A6<=A5 | A2<=0] | [1<=A11 & 2<=A8]]]] | [[[[A9<=A2 | 2<=A5] | ~ [A5<=A4]] & 2<=A5] | ~ [[A5<=A5 | ~ [1<=A4]]]]]]] | ~ [[[~ [[A9<=2 | 2<=A8]] & [~ [2<=B5] & [A3<=A4 & A2<=0]]] & [A4<=A5 | ~ [1<=A9]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [[~ [[A12<=A7 & A10<=2]] & A4<=2]] | [~ [A4<=A4] | A4<=A9]] & 2<=A2] | A10<=B5] & [~ [[[~ [A11<=A8] | ~ [[[A12<=A1 & 2<=A12] & ~ [A3<=B5]]]] & 1<=B5]] & 2<=A11]] & [~ [[[~ [1<=A9] | A4<=A5] & [[[A3<=A4 & A2<=0] & ~ [2<=B5]] & ~ [[A9<=2 | 2<=A8]]]]] | [~ [[[~ [[~ [1<=A4] | A5<=A5]] | [[~ [A5<=A4] | [A9<=A2 | 2<=A5]] & 2<=A5]] | [[[[1<=A11 & 2<=A8] | [A6<=A5 | A2<=0]] | [[A6<=A12 & A12<=0] | [A6<=A8 | 2<=A2]]] & [[A6<=A9 & A9<=0] | [[A11<=0 & 1<=A9] & [A4<=A6 | A12<=A3]]]]]] & [[[[~ [B5<=2] & [[A9<=A11 | 2<=A12] & [2<=A6 & 2<=A5]]] | A3<=1] | [[~ [[A1<=1 & A4<=A12]] & 1<=A6] | ~ [A3<=A8]]] | [[~ [[A7<=A9 | 1<=A12]] & A3<=2] & 1<=A3]]]]]]]]

abstracting: (1<=A3)
states: 1,798 (3)
abstracting: (A3<=2)
states: 3,795 (3)
abstracting: (1<=A12)
states: 3,795 (3)
abstracting: (A7<=A9)
states: 2,546 (3)
abstracting: (A3<=A8)
states: 3,487 (3)
abstracting: (1<=A6)
states: 1,925 (3)
abstracting: (A4<=A12)
states: 3,487 (3)
abstracting: (A1<=1)
states: 3,792 (3)
abstracting: (A3<=1)
states: 3,487 (3)
abstracting: (2<=A5)
states: 215
abstracting: (2<=A6)
states: 314
abstracting: (2<=A12)
states: 568
abstracting: (A9<=A11)
states: 2,893 (3)
abstracting: (B5<=2)
states: 3,795 (3)
abstracting: (A12<=A3)
states: 1,550 (3)
abstracting: (A4<=A6)
states: 2,737 (3)
abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (A11<=0)
states: 1,629 (3)
abstracting: (A9<=0)
states: 2,037 (3)
abstracting: (A6<=A9)
states: 2,604 (3)
abstracting: (2<=A2)
states: 289
abstracting: (A6<=A8)
states: 3,481 (3)
abstracting: (A12<=0)
states: 0
abstracting: (A6<=A12)
states: 3,481 (3)
abstracting: (A2<=0)
states: 1,873 (3)
abstracting: (A6<=A5)
states: 2,406 (3)
abstracting: (2<=A8)
states: 540
abstracting: (1<=A11)
states: 2,166 (3)
abstracting: (2<=A5)
states: 215
abstracting: (2<=A5)
states: 215
abstracting: (A9<=A2)
states: 2,742 (3)
abstracting: (A5<=A4)
states: 2,986 (3)
abstracting: (A5<=A5)
states: 3,795 (3)
abstracting: (1<=A4)
states: 1,798 (3)
abstracting: (2<=A8)
states: 540
abstracting: (A9<=2)
states: 3,795 (3)
abstracting: (2<=B5)
states: 0
abstracting: (A2<=0)
states: 1,873 (3)
abstracting: (A3<=A4)
states: 2,636 (3)
abstracting: (A4<=A5)
states: 2,477 (3)
abstracting: (1<=A9)
states: 1,758 (3)
abstracting: (2<=A11)
states: 314
abstracting: (1<=B5)
states: 1,074 (3)
abstracting: (A3<=B5)
states: 2,384 (3)
abstracting: (2<=A12)
states: 568
abstracting: (A12<=A1)
states: 3
abstracting: (A11<=A8)
states: 3,481 (3)
abstracting: (A10<=B5)
states: 2,302 (3)
abstracting: (2<=A2)
states: 289
abstracting: (A4<=A9)
states: 2,620 (3)
abstracting: (A4<=A4)
states: 3,795 (3)
abstracting: (A4<=2)
states: 3,795 (3)
abstracting: (A10<=2)
states: 3,795 (3)
abstracting: (A12<=A7)
states: 1,842 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 30587 (3.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 105427 149463 254890
used/not used/entry size/cache size: 159383 66949481 16 1024MB
basic ops cache: hits/miss/sum: 37349 36351 73700
used/not used/entry size/cache size: 67022 16710194 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: 3059 2699 5758
used/not used/entry size/cache size: 2699 8385909 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 67081288
1 26019
2 911
3 346
4 76
5 82
6 68
7 35
8 24
9 10
>= 10 5

Total processing time: 0m 4.408sec


BK_STOP 1678498464561

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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:11258 (137), effective:553 (6)

initing FirstDep: 0m 0.000sec


iterations count:2023 (24), effective:67 (0)

iterations count:82 (1), effective:0 (0)

iterations count:83 (1), effective:1 (0)

iterations count:137 (1), effective:1 (0)

iterations count:82 (1), effective:0 (0)

iterations count:309 (3), effective:5 (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="DNAwalker-PT-01track12Block1"
export BK_EXAMINATION="ReachabilityCardinality"
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 DNAwalker-PT-01track12Block1, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483300878"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-01track12Block1.tgz
mv DNAwalker-PT-01track12Block1 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;