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.r353-smll-167891800400009.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 RobotManipulation-PT-00002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800400009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 05:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 5 18:23 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 RobotManipulation-PT-00002-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678948350232

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00002
Not applying reductions.
Model is PT
CTLCardinality 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RobotManipulation_PT_00002
(NrP: 15 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 4.885sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 301 (3.0e+02) #states 1,430 (3)



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

checking: EX [EF [EX [moved<=3]]]
normalized: EX [E [true U EX [moved<=3]]]

abstracting: (moved<=3)
states: 1,428 (3)
..-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [r_moving<=p_i1]
normalized: E [true U r_moving<=p_i1]

abstracting: (r_moving<=p_i1)
states: 1,218 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [r_moving<=access]
normalized: E [true U r_moving<=access]

abstracting: (r_moving<=access)
states: 1,310 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [AX [EG [EG [EG [moved<=r_stopped]]]]]
normalized: EX [~ [EG [EG [EG [moved<=r_stopped]]]]]

abstracting: (moved<=r_stopped)
states: 1,120 (3)
...........
EG iterations: 11
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AF [EG [EX [~ [EF [p_rdy<=3]]]]] & AX [EG [AF [off<=move]]]]
normalized: [~ [EX [~ [EG [~ [EG [~ [off<=move]]]]]]] & ~ [EG [~ [EG [EX [~ [E [true U p_rdy<=3]]]]]]]]

abstracting: (p_rdy<=3)
states: 1,428 (3)
..
EG iterations: 1

EG iterations: 0
abstracting: (off<=move)
states: 946
....
EG iterations: 4
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [EF [A [AF [[initialize<=3 | p_rel<=initialized]] U ~ [r_stopped<=r_active]]]]
normalized: ~ [E [true U ~ [E [true U [~ [EG [r_stopped<=r_active]] & ~ [E [r_stopped<=r_active U [r_stopped<=r_active & EG [~ [[initialize<=3 | p_rel<=initialized]]]]]]]]]]]

abstracting: (p_rel<=initialized)
states: 1,082 (3)
abstracting: (initialize<=3)
states: 1,392 (3)
.....
EG iterations: 5
abstracting: (r_stopped<=r_active)
states: 1,347 (3)
abstracting: (r_stopped<=r_active)
states: 1,347 (3)
abstracting: (r_stopped<=r_active)
states: 1,347 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [[~ [EF [[EF [EF [r_stopped<=p_m]] | A [A [4<=move U p_i1<=5] U EF [5<=off]]]]] & ~ [EF [[2<=p_sc | AX [initialize<=4]]]]]]
normalized: ~ [[~ [E [true U [[~ [EG [~ [E [true U 5<=off]]]] & ~ [E [~ [E [true U 5<=off]] U [~ [E [true U 5<=off]] & ~ [[~ [EG [~ [p_i1<=5]]] & ~ [E [~ [p_i1<=5] U [~ [4<=move] & ~ [p_i1<=5]]]]]]]]]] | E [true U E [true U r_stopped<=p_m]]]]] & ~ [E [true U [~ [EX [~ [initialize<=4]]] | 2<=p_sc]]]]]

abstracting: (2<=p_sc)
states: 110
abstracting: (initialize<=4)
states: 1,425 (3)
.abstracting: (r_stopped<=p_m)
states: 1,128 (3)
abstracting: (p_i1<=5)
states: 1,430 (3)
abstracting: (4<=move)
states: 2
abstracting: (p_i1<=5)
states: 1,430 (3)
abstracting: (p_i1<=5)
states: 1,430 (3)
.
EG iterations: 1
abstracting: (5<=off)
states: 0
abstracting: (5<=off)
states: 0
abstracting: (5<=off)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [~ [E [[3<=p_m & [EX [r_active<=1] | E [4<=r_moving U initialized<=4]]] U [EX [A [initialize<=access U 1<=r_moving]] & p_rel<=0]]]]
normalized: EX [~ [E [[[E [4<=r_moving U initialized<=4] | EX [r_active<=1]] & 3<=p_m] U [EX [[~ [EG [~ [1<=r_moving]]] & ~ [E [~ [1<=r_moving] U [~ [initialize<=access] & ~ [1<=r_moving]]]]]] & p_rel<=0]]]]

abstracting: (p_rel<=0)
states: 990
abstracting: (1<=r_moving)
states: 440
abstracting: (initialize<=access)
states: 1,220 (3)
abstracting: (1<=r_moving)
states: 440
abstracting: (1<=r_moving)
states: 440
.......
EG iterations: 7
.abstracting: (3<=p_m)
states: 170
abstracting: (r_active<=1)
states: 122
.abstracting: (initialized<=4)
states: 1,430 (3)
abstracting: (4<=r_moving)
states: 2
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[1<=p_sc & ~ [AF [[[[2<=p_i1 & initialize<=p_rel] & p_rel<=p_rdy] | AF [p_i2<=p_m]]]]]]
normalized: E [true U [EG [~ [[~ [EG [~ [p_i2<=p_m]]] | [[2<=p_i1 & initialize<=p_rel] & p_rel<=p_rdy]]]] & 1<=p_sc]]

abstracting: (1<=p_sc)
states: 440
abstracting: (p_rel<=p_rdy)
states: 1,082 (3)
abstracting: (initialize<=p_rel)
states: 677
abstracting: (2<=p_i1)
states: 440
abstracting: (p_i2<=p_m)
states: 795
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[E [EF [initialize<=p_i1] U AF [AG [initialize<=4]]] | [p_rdy<=r_moving & ~ [[EF [r_stopped<=p_m] | ~ [3<=initialized]]]]]]
normalized: EX [[[~ [[~ [3<=initialized] | E [true U r_stopped<=p_m]]] & p_rdy<=r_moving] | E [E [true U initialize<=p_i1] U ~ [EG [E [true U ~ [initialize<=4]]]]]]]

abstracting: (initialize<=4)
states: 1,425 (3)

EG iterations: 0
abstracting: (initialize<=p_i1)
states: 813
abstracting: (p_rdy<=r_moving)
states: 1,082 (3)
abstracting: (r_stopped<=p_m)
states: 1,128 (3)
abstracting: (3<=initialized)
states: 20
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [AF [~ [[[[[p_rel<=initialize & r_moving<=initialize] | EF [r_active<=3]] & [~ [p_sc<=2] & 3<=initialize]] & r_stopped<=p_sc]]]]
normalized: E [true U ~ [EG [[[[~ [p_sc<=2] & 3<=initialize] & [E [true U r_active<=3] | [p_rel<=initialize & r_moving<=initialize]]] & r_stopped<=p_sc]]]]

abstracting: (r_stopped<=p_sc)
states: 946
abstracting: (r_moving<=initialize)
states: 1,218 (3)
abstracting: (p_rel<=initialize)
states: 1,218 (3)
abstracting: (r_active<=3)
states: 890
abstracting: (3<=initialize)
states: 155
abstracting: (p_sc<=2)
states: 1,410 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [EX [[[~ [p_i1<=initialized] & E [A [move<=1 U 4<=p_i1] U [[p_i1<=2 & 1<=r_stopped] & AF [p_rdy<=r_moving]]]] | [EF [AX [3<=initialize]] & [initialized<=0 & moved<=4]]]] | [EF [AF [[AF [4<=p_sc] | ~ [[2<=moved & p_rel<=4]]]]] & EX [[EX [AG [r_active<=off]] | EX [EG [5<=p_i1]]]]]]
normalized: [[EX [[EX [EG [5<=p_i1]] | EX [~ [E [true U ~ [r_active<=off]]]]]] & E [true U ~ [EG [~ [[~ [[2<=moved & p_rel<=4]] | ~ [EG [~ [4<=p_sc]]]]]]]]] | EX [[[[initialized<=0 & moved<=4] & E [true U ~ [EX [~ [3<=initialize]]]]] | [E [[~ [EG [~ [4<=p_i1]]] & ~ [E [~ [4<=p_i1] U [~ [move<=1] & ~ [4<=p_i1]]]]] U [~ [EG [~ [p_rdy<=r_moving]]] & [p_i1<=2 & 1<=r_stopped]]] & ~ [p_i1<=initialized]]]]]

abstracting: (p_i1<=initialized)
states: 677
abstracting: (1<=r_stopped)
states: 605
abstracting: (p_i1<=2)
states: 1,275 (3)
abstracting: (p_rdy<=r_moving)
states: 1,082 (3)
......
EG iterations: 6
abstracting: (4<=p_i1)
states: 38
abstracting: (move<=1)
states: 1,320 (3)
abstracting: (4<=p_i1)
states: 38
abstracting: (4<=p_i1)
states: 38
.
EG iterations: 1
abstracting: (3<=initialize)
states: 155
.abstracting: (moved<=4)
states: 1,430 (3)
abstracting: (initialized<=0)
states: 990
.abstracting: (4<=p_sc)
states: 2
.
EG iterations: 1
abstracting: (p_rel<=4)
states: 1,430 (3)
abstracting: (2<=moved)
states: 110
.
EG iterations: 1
abstracting: (r_active<=off)
states: 70
.abstracting: (5<=p_i1)
states: 5
......
EG iterations: 6
..-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: E [[[EF [~ [AX [access<=p_i2]]] | ~ [[[~ [[p_rel<=1 & p_rel<=3]] & AG [2<=initialized]] | p_rdy<=initialize]]] | A [[EG [[2<=p_i1 | 4<=p_rdy]] & [AG [initialize<=0] & [[3<=p_rdy & r_moving<=5] | [p_i1<=3 & 2<=moved]]]] U AF [[p_i1<=3 | AX [r_active<=3]]]]] U [~ [EX [[[EX [2<=p_rdy] & ~ [r_moving<=moved]] | p_i2<=5]]] | EF [moved<=3]]]
normalized: E [[[~ [EG [EG [~ [[~ [EX [~ [r_active<=3]]] | p_i1<=3]]]]] & ~ [E [EG [~ [[~ [EX [~ [r_active<=3]]] | p_i1<=3]]] U [~ [[[[[p_i1<=3 & 2<=moved] | [3<=p_rdy & r_moving<=5]] & ~ [E [true U ~ [initialize<=0]]]] & EG [[2<=p_i1 | 4<=p_rdy]]]] & EG [~ [[~ [EX [~ [r_active<=3]]] | p_i1<=3]]]]]]] | [~ [[[~ [E [true U ~ [2<=initialized]]] & ~ [[p_rel<=1 & p_rel<=3]]] | p_rdy<=initialize]] | E [true U EX [~ [access<=p_i2]]]]] U [E [true U moved<=3] | ~ [EX [[[~ [r_moving<=moved] & EX [2<=p_rdy]] | p_i2<=5]]]]]

abstracting: (p_i2<=5)
states: 1,430 (3)
abstracting: (2<=p_rdy)
states: 110
.abstracting: (r_moving<=moved)
states: 1,082 (3)
.abstracting: (moved<=3)
states: 1,428 (3)
abstracting: (access<=p_i2)
states: 780
.abstracting: (p_rdy<=initialize)
states: 1,218 (3)
abstracting: (p_rel<=3)
states: 1,428 (3)
abstracting: (p_rel<=1)
states: 1,320 (3)
abstracting: (2<=initialized)
states: 110
abstracting: (p_i1<=3)
states: 1,392 (3)
abstracting: (r_active<=3)
states: 890
..
EG iterations: 1
abstracting: (4<=p_rdy)
states: 2
abstracting: (2<=p_i1)
states: 440
..
EG iterations: 2
abstracting: (initialize<=0)
states: 495
abstracting: (r_moving<=5)
states: 1,430 (3)
abstracting: (3<=p_rdy)
states: 20
abstracting: (2<=moved)
states: 110
abstracting: (p_i1<=3)
states: 1,392 (3)
abstracting: (p_i1<=3)
states: 1,392 (3)
abstracting: (r_active<=3)
states: 890
..
EG iterations: 1
abstracting: (p_i1<=3)
states: 1,392 (3)
abstracting: (r_active<=3)
states: 890
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AX [~ [AF [A [AF [5<=p_rel] U AG [1<=p_i1]]]]] | ~ [E [[[[[initialize<=0 & ~ [initialize<=2]] & [[initialize<=p_i1 & 1<=move] & r_moving<=5]] & ~ [E [off<=2 U 5<=p_i1]]] | [moved<=1 & [[[3<=p_sc & access<=move] | [initialized<=p_rdy & 2<=initialized]] | 3<=off]]] U EF [[AX [r_stopped<=p_m] & AG [move<=initialized]]]]]]
normalized: [~ [E [[[moved<=1 & [3<=off | [[initialized<=p_rdy & 2<=initialized] | [3<=p_sc & access<=move]]]] | [~ [E [off<=2 U 5<=p_i1]] & [[r_moving<=5 & [initialize<=p_i1 & 1<=move]] & [initialize<=0 & ~ [initialize<=2]]]]] U E [true U [~ [E [true U ~ [move<=initialized]]] & ~ [EX [~ [r_stopped<=p_m]]]]]]] | ~ [EX [~ [EG [~ [[~ [EG [E [true U ~ [1<=p_i1]]]] & ~ [E [E [true U ~ [1<=p_i1]] U [EG [~ [5<=p_rel]] & E [true U ~ [1<=p_i1]]]]]]]]]]]]

abstracting: (1<=p_i1)
states: 935
abstracting: (5<=p_rel)
states: 0

EG iterations: 0
abstracting: (1<=p_i1)
states: 935
abstracting: (1<=p_i1)
states: 935

EG iterations: 0

EG iterations: 0
.abstracting: (r_stopped<=p_m)
states: 1,128 (3)
.abstracting: (move<=initialized)
states: 1,082 (3)
abstracting: (initialize<=2)
states: 1,275 (3)
abstracting: (initialize<=0)
states: 495
abstracting: (1<=move)
states: 440
abstracting: (initialize<=p_i1)
states: 813
abstracting: (r_moving<=5)
states: 1,430 (3)
abstracting: (5<=p_i1)
states: 5
abstracting: (off<=2)
states: 1,383 (3)
abstracting: (access<=move)
states: 320
abstracting: (3<=p_sc)
states: 20
abstracting: (2<=initialized)
states: 110
abstracting: (initialized<=p_rdy)
states: 1,082 (3)
abstracting: (3<=off)
states: 47
abstracting: (moved<=1)
states: 1,320 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AG [~ [AF [[AG [r_moving<=initialize] | [move<=initialized | r_moving<=p_m]]]]] | [A [[[[[[p_i1<=1 & move<=off] & off<=p_sc] | [5<=p_rel & [5<=p_i1 & access<=p_i2]]] | [E [move<=p_i2 U access<=move] & EG [3<=r_stopped]]] & E [[EF [4<=p_i1] & EG [p_i1<=off]] U EX [p_i1<=0]]] U AG [[~ [off<=2] | r_active<=p_rel]]] | EG [EF [p_i2<=p_i2]]]]
normalized: [~ [E [true U ~ [EG [~ [[[move<=initialized | r_moving<=p_m] | ~ [E [true U ~ [r_moving<=initialize]]]]]]]]] | [EG [E [true U p_i2<=p_i2]] | [~ [EG [E [true U ~ [[r_active<=p_rel | ~ [off<=2]]]]]] & ~ [E [E [true U ~ [[r_active<=p_rel | ~ [off<=2]]]] U [~ [[E [[EG [p_i1<=off] & E [true U 4<=p_i1]] U EX [p_i1<=0]] & [[EG [3<=r_stopped] & E [move<=p_i2 U access<=move]] | [[5<=p_rel & [5<=p_i1 & access<=p_i2]] | [off<=p_sc & [p_i1<=1 & move<=off]]]]]] & E [true U ~ [[r_active<=p_rel | ~ [off<=2]]]]]]]]]]

abstracting: (off<=2)
states: 1,383 (3)
abstracting: (r_active<=p_rel)
states: 50
abstracting: (move<=off)
states: 1,120 (3)
abstracting: (p_i1<=1)
states: 990
abstracting: (off<=p_sc)
states: 946
abstracting: (access<=p_i2)
states: 780
abstracting: (5<=p_i1)
states: 5
abstracting: (5<=p_rel)
states: 0
abstracting: (access<=move)
states: 320
abstracting: (move<=p_i2)
states: 1,263 (3)
abstracting: (3<=r_stopped)
states: 47
.
EG iterations: 1
abstracting: (p_i1<=0)
states: 495
.abstracting: (4<=p_i1)
states: 38
abstracting: (p_i1<=off)
states: 715
.
EG iterations: 1
abstracting: (off<=2)
states: 1,383 (3)
abstracting: (r_active<=p_rel)
states: 50
abstracting: (off<=2)
states: 1,383 (3)
abstracting: (r_active<=p_rel)
states: 50

EG iterations: 0
abstracting: (p_i2<=p_i2)
states: 1,430 (3)

EG iterations: 0
abstracting: (r_moving<=initialize)
states: 1,218 (3)
abstracting: (r_moving<=p_m)
states: 1,430 (3)
abstracting: (move<=initialized)
states: 1,082 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: A [[~ [AF [[[AG [5<=p_rdy] | [p_sc<=0 & p_m<=4]] & EX [p_sc<=r_stopped]]]] & [EG [[AG [5<=r_stopped] | ~ [initialized<=4]]] & [[EF [p_rel<=4] | ~ [[~ [initialize<=moved] | p_rdy<=moved]]] & EF [[A [initialized<=0 U p_rdy<=off] | ~ [r_moving<=off]]]]]] U [[[~ [EG [[r_stopped<=p_i2 | p_rdy<=0]]] & [AG [[2<=initialize | r_active<=r_moving]] | EF [~ [r_active<=r_stopped]]]] & [A [EF [r_moving<=1] U ~ [p_i2<=2]] & [AX [EX [4<=p_sc]] | ~ [access<=r_active]]]] & p_i2<=initialized]]
normalized: [~ [EG [~ [[p_i2<=initialized & [[[~ [access<=r_active] | ~ [EX [~ [EX [4<=p_sc]]]]] & [~ [EG [p_i2<=2]] & ~ [E [p_i2<=2 U [p_i2<=2 & ~ [E [true U r_moving<=1]]]]]]] & [[E [true U ~ [r_active<=r_stopped]] | ~ [E [true U ~ [[2<=initialize | r_active<=r_moving]]]]] & ~ [EG [[r_stopped<=p_i2 | p_rdy<=0]]]]]]]]] & ~ [E [~ [[p_i2<=initialized & [[[~ [access<=r_active] | ~ [EX [~ [EX [4<=p_sc]]]]] & [~ [EG [p_i2<=2]] & ~ [E [p_i2<=2 U [p_i2<=2 & ~ [E [true U r_moving<=1]]]]]]] & [[E [true U ~ [r_active<=r_stopped]] | ~ [E [true U ~ [[2<=initialize | r_active<=r_moving]]]]] & ~ [EG [[r_stopped<=p_i2 | p_rdy<=0]]]]]]] U [~ [[[[[~ [[p_rdy<=moved | ~ [initialize<=moved]]] | E [true U p_rel<=4]] & E [true U [[~ [EG [~ [p_rdy<=off]]] & ~ [E [~ [p_rdy<=off] U [~ [initialized<=0] & ~ [p_rdy<=off]]]]] | ~ [r_moving<=off]]]] & EG [[~ [initialized<=4] | ~ [E [true U ~ [5<=r_stopped]]]]]] & EG [~ [[EX [p_sc<=r_stopped] & [[p_sc<=0 & p_m<=4] | ~ [E [true U ~ [5<=p_rdy]]]]]]]]] & ~ [[p_i2<=initialized & [[[~ [access<=r_active] | ~ [EX [~ [EX [4<=p_sc]]]]] & [~ [EG [p_i2<=2]] & ~ [E [p_i2<=2 U [p_i2<=2 & ~ [E [true U r_moving<=1]]]]]]] & [[E [true U ~ [r_active<=r_stopped]] | ~ [E [true U ~ [[2<=initialize | r_active<=r_moving]]]]] & ~ [EG [[r_stopped<=p_i2 | p_rdy<=0]]]]]]]]]]]

abstracting: (p_rdy<=0)
states: 990
abstracting: (r_stopped<=p_i2)
states: 1,256 (3)
.
EG iterations: 1
abstracting: (r_active<=r_moving)
states: 150
abstracting: (2<=initialize)
states: 440
abstracting: (r_active<=r_stopped)
states: 227
abstracting: (r_moving<=1)
states: 1,320 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
.
EG iterations: 1
abstracting: (4<=p_sc)
states: 2
..abstracting: (access<=r_active)
states: 1,195 (3)
abstracting: (p_i2<=initialized)
states: 495
abstracting: (5<=p_rdy)
states: 0
abstracting: (p_m<=4)
states: 1,430 (3)
abstracting: (p_sc<=0)
states: 990
abstracting: (p_sc<=r_stopped)
states: 1,120 (3)
..
EG iterations: 1
abstracting: (5<=r_stopped)
states: 0
abstracting: (initialized<=4)
states: 1,430 (3)
.
EG iterations: 1
abstracting: (r_moving<=off)
states: 1,120 (3)
abstracting: (p_rdy<=off)
states: 1,120 (3)
abstracting: (initialized<=0)
states: 990
abstracting: (p_rdy<=off)
states: 1,120 (3)
abstracting: (p_rdy<=off)
states: 1,120 (3)
.
EG iterations: 1
abstracting: (p_rel<=4)
states: 1,430 (3)
abstracting: (initialize<=moved)
states: 677
abstracting: (p_rdy<=moved)
states: 1,082 (3)
abstracting: (p_rdy<=0)
states: 990
abstracting: (r_stopped<=p_i2)
states: 1,256 (3)
.
EG iterations: 1
abstracting: (r_active<=r_moving)
states: 150
abstracting: (2<=initialize)
states: 440
abstracting: (r_active<=r_stopped)
states: 227
abstracting: (r_moving<=1)
states: 1,320 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
.
EG iterations: 1
abstracting: (4<=p_sc)
states: 2
..abstracting: (access<=r_active)
states: 1,195 (3)
abstracting: (p_i2<=initialized)
states: 495
abstracting: (p_rdy<=0)
states: 990
abstracting: (r_stopped<=p_i2)
states: 1,256 (3)
.
EG iterations: 1
abstracting: (r_active<=r_moving)
states: 150
abstracting: (2<=initialize)
states: 440
abstracting: (r_active<=r_stopped)
states: 227
abstracting: (r_moving<=1)
states: 1,320 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (p_i2<=2)
states: 1,140 (3)
.
EG iterations: 1
abstracting: (4<=p_sc)
states: 2
..abstracting: (access<=r_active)
states: 1,195 (3)
abstracting: (p_i2<=initialized)
states: 495

EG iterations: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

totally nodes used: 24416 (2.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 57268 71789 129057
used/not used/entry size/cache size: 89976 67018888 16 1024MB
basic ops cache: hits/miss/sum: 26121 43783 69904
used/not used/entry size/cache size: 71004 16706212 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: 4565 5411 9976
used/not used/entry size/cache size: 5411 8383197 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 67087221
1 20481
2 704
3 217
4 58
5 59
6 34
7 21
8 9
9 10
>= 10 50

Total processing time: 0m 6.748sec


BK_STOP 1678948357071

--------------------
content from stderr:

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:181 (16), effective:41 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:19 (1), effective:4 (0)

iterations count:19 (1), effective:4 (0)

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

iterations count:132 (12), effective:24 (2)

iterations count:30 (2), effective:6 (0)

iterations count:35 (3), effective:8 (0)

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

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

iterations count:53 (4), effective:13 (1)

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

iterations count:55 (5), effective:9 (0)

iterations count:92 (8), effective:20 (1)

iterations count:161 (14), effective:33 (3)

iterations count:74 (6), effective:15 (1)

iterations count:35 (3), effective:8 (0)

iterations count:47 (4), effective:7 (0)

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

iterations count:95 (8), effective:18 (1)

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

iterations count:101 (9), effective:22 (2)

iterations count:41 (3), effective:3 (0)

iterations count:22 (2), effective:4 (0)

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

iterations count:60 (5), effective:11 (1)

iterations count:23 (2), effective:3 (0)

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

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

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

iterations count:21 (1), effective:5 (0)

iterations count:21 (1), effective:5 (0)

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

iterations count:21 (1), effective:5 (0)

iterations count:65 (5), effective:12 (1)

iterations count:191 (17), effective:39 (3)

iterations count:29 (2), effective:6 (0)

iterations count:75 (6), effective:20 (1)

iterations count:156 (14), effective:32 (2)

iterations count:17 (1), effective:3 (0)

iterations count:29 (2), effective:6 (0)

iterations count:78 (7), effective:15 (1)

iterations count:29 (2), effective:6 (0)

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

iterations count:119 (10), effective:27 (2)

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

iterations count:47 (4), effective:12 (1)

iterations count:33 (3), effective:8 (0)

iterations count:17 (1), effective:3 (0)

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

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

iterations count:78 (7), effective:14 (1)

iterations count:23 (2), effective:4 (0)

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

iterations count:47 (4), effective:12 (1)

iterations count:33 (3), effective:8 (0)

iterations count:17 (1), effective:3 (0)

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

iterations count:47 (4), effective:12 (1)

iterations count:33 (3), effective:8 (0)

iterations count:17 (1), effective:3 (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="RobotManipulation-PT-00002"
export BK_EXAMINATION="CTLCardinality"
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 RobotManipulation-PT-00002, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r353-smll-167891800400009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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