Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r033-tajo-167813686200609.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is CANConstruction-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r033-tajo-167813686200609
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K Feb 25 21:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 21:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 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 167K 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 CANConstruction-PT-005-CTLCardinality-00
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-01
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-02
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-03
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-04
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-05
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-06
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-07
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-08
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-09
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-10
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-11
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-12
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-13
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-14
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678306763391

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=CANConstruction-PT-005
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: CANConstruction_PT_005
(NrP: 112 NrTr: 140 NrArc: 400)

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

net check time: 0m 0.000sec

init dd package: 0m 3.559sec


RS generation: 0m 0.390sec


-> reachability set: #nodes 10009 (1.0e+04) #states 97,527 (4)



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

checking: EG [EX [[EG [Node4OKshare<=1] | EX [1<=Node4ResZone]]]]
normalized: EG [EX [[EG [Node4OKshare<=1] | EX [1<=Node4ResZone]]]]

abstracting: (1<=Node4ResZone)
states: 1
.abstracting: (Node4OKshare<=1)
states: 97,527 (4)

EG iterations: 0
......
EG iterations: 5
-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.357sec

checking: ~ [AF [~ [AX [Node2requestsent4<=Node4GiveAnswer0]]]]
normalized: EG [~ [EX [~ [Node2requestsent4<=Node4GiveAnswer0]]]]

abstracting: (Node2requestsent4<=Node4GiveAnswer0)
states: 95,791 (4)
...........
EG iterations: 10
-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: ~ [AF [EX [[AX [EG [Node3GiveAnswer0<=0]] & E [EX [Node1DHTinfo2<=1] U AF [Node2ResZone<=1]]]]]]
normalized: EG [~ [EX [[E [EX [Node1DHTinfo2<=1] U ~ [EG [~ [Node2ResZone<=1]]]] & ~ [EX [~ [EG [Node3GiveAnswer0<=0]]]]]]]]

abstracting: (Node3GiveAnswer0<=0)
states: 95,643 (4)
.....
EG iterations: 5
.abstracting: (Node2ResZone<=1)
states: 97,527 (4)
.
EG iterations: 1
abstracting: (Node1DHTinfo2<=1)
states: 97,527 (4)
.......
EG iterations: 5
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.314sec

checking: AF [~ [[~ [EG [~ [Node4ID2<=0]]] & EX [AF [~ [Node3IsInserted<=Node2requestsent0]]]]]]
normalized: ~ [EG [[EX [~ [EG [Node3IsInserted<=Node2requestsent0]]] & ~ [EG [~ [Node4ID2<=0]]]]]]

abstracting: (Node4ID2<=0)
states: 91,128 (4)
.....
EG iterations: 5
abstracting: (Node3IsInserted<=Node2requestsent0)
states: 72,879 (4)
.....
EG iterations: 5
.......
EG iterations: 6
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.306sec

checking: ~ [EX [EF [A [[Node0requestsent2<=0 | ~ [1<=Node2OKshare]] U [AX [Node1Bootstrap<=Node0ReadyToInsert] & ~ [Node0IsInserted<=1]]]]]]
normalized: ~ [EX [E [true U [~ [EG [~ [[~ [EX [~ [Node1Bootstrap<=Node0ReadyToInsert]]] & ~ [Node0IsInserted<=1]]]]] & ~ [E [~ [[~ [EX [~ [Node1Bootstrap<=Node0ReadyToInsert]]] & ~ [Node0IsInserted<=1]]] U [~ [[Node0requestsent2<=0 | ~ [1<=Node2OKshare]]] & ~ [[~ [EX [~ [Node1Bootstrap<=Node0ReadyToInsert]]] & ~ [Node0IsInserted<=1]]]]]]]]]]

abstracting: (Node0IsInserted<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=Node0ReadyToInsert)
states: 91,531 (4)
.abstracting: (1<=Node2OKshare)
states: 6,399 (3)
abstracting: (Node0requestsent2<=0)
states: 95,643 (4)
abstracting: (Node0IsInserted<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=Node0ReadyToInsert)
states: 91,531 (4)
.abstracting: (Node0IsInserted<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=Node0ReadyToInsert)
states: 91,531 (4)
.
EG iterations: 0
.-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: AF [~ [[AX [E [A [1<=Node3NOshare U Node2requestsent0<=Node2GiveAnswer4] U [Node2requestsent1<=0 & Node1GiveAnswer4<=1]]] | [Node3requestsent0<=1 | EX [[1<=Node2NOshare | 1<=Node2JoinMsg]]]]]]
normalized: ~ [EG [[[Node3requestsent0<=1 | EX [[1<=Node2NOshare | 1<=Node2JoinMsg]]] | ~ [EX [~ [E [[~ [EG [~ [Node2requestsent0<=Node2GiveAnswer4]]] & ~ [E [~ [Node2requestsent0<=Node2GiveAnswer4] U [~ [1<=Node3NOshare] & ~ [Node2requestsent0<=Node2GiveAnswer4]]]]] U [Node2requestsent1<=0 & Node1GiveAnswer4<=1]]]]]]]]

abstracting: (Node1GiveAnswer4<=1)
states: 97,527 (4)
abstracting: (Node2requestsent1<=0)
states: 95,643 (4)
abstracting: (Node2requestsent0<=Node2GiveAnswer4)
states: 95,643 (4)
abstracting: (1<=Node3NOshare)
states: 6,399 (3)
abstracting: (Node2requestsent0<=Node2GiveAnswer4)
states: 95,643 (4)
abstracting: (Node2requestsent0<=Node2GiveAnswer4)
states: 95,643 (4)
.....
EG iterations: 5
.abstracting: (1<=Node2JoinMsg)
states: 6,399 (3)
abstracting: (1<=Node2NOshare)
states: 6,399 (3)
.abstracting: (Node3requestsent0<=1)
states: 97,527 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: [EG [[EG [1<=Node0WaitAnswer] | E [Node1requestsent0<=0 U EF [[Node0ReadyToInsert<=Node4ID & Node2DHTinfo<=0]]]]] & AX [A [[EX [Node4GiveAnswer1<=0] | ~ [1<=Node3requestsent1]] U 1<=Node0ResZone]]]
normalized: [~ [EX [~ [[~ [EG [~ [1<=Node0ResZone]]] & ~ [E [~ [1<=Node0ResZone] U [~ [[~ [1<=Node3requestsent1] | EX [Node4GiveAnswer1<=0]]] & ~ [1<=Node0ResZone]]]]]]]] & EG [[E [Node1requestsent0<=0 U E [true U [Node0ReadyToInsert<=Node4ID & Node2DHTinfo<=0]]] | EG [1<=Node0WaitAnswer]]]]

abstracting: (1<=Node0WaitAnswer)
states: 34,269 (4)
........
EG iterations: 8
abstracting: (Node2DHTinfo<=0)
states: 97,526 (4)
abstracting: (Node0ReadyToInsert<=Node4ID)
states: 91,116 (4)
abstracting: (Node1requestsent0<=0)
states: 95,643 (4)

EG iterations: 0
abstracting: (1<=Node0ResZone)
states: 1
abstracting: (Node4GiveAnswer1<=0)
states: 95,643 (4)
.abstracting: (1<=Node3requestsent1)
states: 1,884 (3)
abstracting: (1<=Node0ResZone)
states: 1
abstracting: (1<=Node0ResZone)
states: 1
...
EG iterations: 3
.-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.265sec

checking: ~ [[[EX [E [AG [EmptyCAN<=1] U EF [Node3requestsent1<=0]]] & A [[Node0IsInserted<=Node0NOshare & [Node1JoinMsg<=Node4NOshare & EX [Node1ReadyToInsert<=0]]] U EX [EG [Node2DHTinfo2<=1]]]] | EF [~ [Node1IsNonInsertedNode<=Node3GiveAnswer0]]]]
normalized: ~ [[E [true U ~ [Node1IsNonInsertedNode<=Node3GiveAnswer0]] | [[~ [EG [~ [EX [EG [Node2DHTinfo2<=1]]]]] & ~ [E [~ [EX [EG [Node2DHTinfo2<=1]]] U [~ [[Node0IsInserted<=Node0NOshare & [Node1JoinMsg<=Node4NOshare & EX [Node1ReadyToInsert<=0]]]] & ~ [EX [EG [Node2DHTinfo2<=1]]]]]]] & EX [E [~ [E [true U ~ [EmptyCAN<=1]]] U E [true U Node3requestsent1<=0]]]]]]

abstracting: (Node3requestsent1<=0)
states: 95,643 (4)
abstracting: (EmptyCAN<=1)
states: 97,527 (4)
.abstracting: (Node2DHTinfo2<=1)
states: 97,527 (4)

EG iterations: 0
.abstracting: (Node1ReadyToInsert<=0)
states: 91,115 (4)
.abstracting: (Node1JoinMsg<=Node4NOshare)
states: 91,531 (4)
abstracting: (Node0IsInserted<=Node0NOshare)
states: 72,679 (4)
abstracting: (Node2DHTinfo2<=1)
states: 97,527 (4)

EG iterations: 0
.abstracting: (Node2DHTinfo2<=1)
states: 97,527 (4)

EG iterations: 0
..
EG iterations: 1
abstracting: (Node1IsNonInsertedNode<=Node3GiveAnswer0)
states: 91,276 (4)
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.738sec

checking: A [~ [AG [[[AF [Node3DHTinfo2<=1] | E [1<=Node2IsNonInsertedNode U 1<=Node1DHTinfo2]] | ~ [[AG [1<=Node1GiveAnswer3] | ~ [Node0GiveAnswer4<=Node2DHTinfo]]]]]] U [~ [EX [Node2GiveAnswer0<=0]] & AX [~ [[[[Node2OKshare<=1 | Node3IsNonInsertedNode<=1] | AF [Node2GiveAnswer4<=Node4ReadyToInsert]] | ~ [EF [Node4GiveAnswer0<=Node2ID2]]]]]]]
normalized: [~ [EG [~ [[~ [EX [[~ [E [true U Node4GiveAnswer0<=Node2ID2]] | [~ [EG [~ [Node2GiveAnswer4<=Node4ReadyToInsert]]] | [Node2OKshare<=1 | Node3IsNonInsertedNode<=1]]]]] & ~ [EX [Node2GiveAnswer0<=0]]]]]] & ~ [E [~ [[~ [EX [[~ [E [true U Node4GiveAnswer0<=Node2ID2]] | [~ [EG [~ [Node2GiveAnswer4<=Node4ReadyToInsert]]] | [Node2OKshare<=1 | Node3IsNonInsertedNode<=1]]]]] & ~ [EX [Node2GiveAnswer0<=0]]]] U [~ [E [true U ~ [[~ [[~ [Node0GiveAnswer4<=Node2DHTinfo] | ~ [E [true U ~ [1<=Node1GiveAnswer3]]]]] | [E [1<=Node2IsNonInsertedNode U 1<=Node1DHTinfo2] | ~ [EG [~ [Node3DHTinfo2<=1]]]]]]]] & ~ [[~ [EX [[~ [E [true U Node4GiveAnswer0<=Node2ID2]] | [~ [EG [~ [Node2GiveAnswer4<=Node4ReadyToInsert]]] | [Node2OKshare<=1 | Node3IsNonInsertedNode<=1]]]]] & ~ [EX [Node2GiveAnswer0<=0]]]]]]]]

abstracting: (Node2GiveAnswer0<=0)
states: 95,643 (4)
.abstracting: (Node3IsNonInsertedNode<=1)
states: 97,527 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node2GiveAnswer4<=Node4ReadyToInsert)
states: 95,643 (4)
.....
EG iterations: 5
abstracting: (Node4GiveAnswer0<=Node2ID2)
states: 95,791 (4)
.abstracting: (Node3DHTinfo2<=1)
states: 97,527 (4)
.
EG iterations: 1
abstracting: (1<=Node1DHTinfo2)
states: 6,399 (3)
abstracting: (1<=Node2IsNonInsertedNode)
states: 6,399 (3)
abstracting: (1<=Node1GiveAnswer3)
states: 1,884 (3)
abstracting: (Node0GiveAnswer4<=Node2DHTinfo)
states: 95,643 (4)
abstracting: (Node2GiveAnswer0<=0)
states: 95,643 (4)
.abstracting: (Node3IsNonInsertedNode<=1)
states: 97,527 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node2GiveAnswer4<=Node4ReadyToInsert)
states: 95,643 (4)
.....
EG iterations: 5
abstracting: (Node4GiveAnswer0<=Node2ID2)
states: 95,791 (4)
.abstracting: (Node2GiveAnswer0<=0)
states: 95,643 (4)
.abstracting: (Node3IsNonInsertedNode<=1)
states: 97,527 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node2GiveAnswer4<=Node4ReadyToInsert)
states: 95,643 (4)
.....
EG iterations: 5
abstracting: (Node4GiveAnswer0<=Node2ID2)
states: 95,791 (4)
......
EG iterations: 5
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.297sec

checking: ~ [AX [[[~ [Node4IsInserted<=0] | [~ [EX [Node1OKshare<=Node2requestsent1]] & ~ [[EG [Node4ResZone<=0] | Node2IsInserted<=Node0ID2]]]] | [A [AF [Node3ReadyToInsert<=1] U [~ [Node3IsInserted<=1] & E [Node1Bootstrap<=0 U Node4DHTinfo2<=1]]] | ~ [[[A [Node2OKshare<=0 U 1<=Node2requestsent1] | Node3ResZone<=0] | ~ [Node4IsInserted<=0]]]]]]]
normalized: EX [~ [[[[~ [[Node2IsInserted<=Node0ID2 | EG [Node4ResZone<=0]]] & ~ [EX [Node1OKshare<=Node2requestsent1]]] | ~ [Node4IsInserted<=0]] | [[~ [EG [~ [[~ [Node3IsInserted<=1] & E [Node1Bootstrap<=0 U Node4DHTinfo2<=1]]]]] & ~ [E [~ [[~ [Node3IsInserted<=1] & E [Node1Bootstrap<=0 U Node4DHTinfo2<=1]]] U [~ [[~ [Node3IsInserted<=1] & E [Node1Bootstrap<=0 U Node4DHTinfo2<=1]]] & EG [~ [Node3ReadyToInsert<=1]]]]]] | ~ [[[Node3ResZone<=0 | [~ [EG [~ [1<=Node2requestsent1]]] & ~ [E [~ [1<=Node2requestsent1] U [~ [1<=Node2requestsent1] & ~ [Node2OKshare<=0]]]]]] | ~ [Node4IsInserted<=0]]]]]]]

abstracting: (Node4IsInserted<=0)
states: 72,679 (4)
abstracting: (Node2OKshare<=0)
states: 91,128 (4)
abstracting: (1<=Node2requestsent1)
states: 1,884 (3)
abstracting: (1<=Node2requestsent1)
states: 1,884 (3)
abstracting: (1<=Node2requestsent1)
states: 1,884 (3)
.
EG iterations: 1
abstracting: (Node3ResZone<=0)
states: 97,526 (4)
abstracting: (Node3ReadyToInsert<=1)
states: 97,527 (4)
.
EG iterations: 1
abstracting: (Node4DHTinfo2<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=0)
states: 91,128 (4)
abstracting: (Node3IsInserted<=1)
states: 97,527 (4)
abstracting: (Node4DHTinfo2<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=0)
states: 91,128 (4)
abstracting: (Node3IsInserted<=1)
states: 97,527 (4)
abstracting: (Node4DHTinfo2<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=0)
states: 91,128 (4)
abstracting: (Node3IsInserted<=1)
states: 97,527 (4)

EG iterations: 0
abstracting: (Node4IsInserted<=0)
states: 72,679 (4)
abstracting: (Node1OKshare<=Node2requestsent1)
states: 91,128 (4)
.abstracting: (Node4ResZone<=0)
states: 97,526 (4)
...
EG iterations: 3
abstracting: (Node2IsInserted<=Node0ID2)
states: 74,563 (4)
.-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.365sec

checking: AG [~ [EG [[[[[Node3Request<=Node2NOshare & Node3OKshare<=0] | [1<=Node2GiveAnswer4 | Node2OKshare<=Node0ID]] | ~ [[Node1DHTinfo<=Node3requestsent0 & 1<=Node4IsNonInsertedNode]]] & [[[1<=Node0IsInserted & Node2ResZone<=Node1ID] | [1<=Node3requestsent1 | 1<=Node2ID]] | Node2NOshare<=Node0GiveAnswer1]]]]]
normalized: ~ [E [true U EG [[[Node2NOshare<=Node0GiveAnswer1 | [[1<=Node3requestsent1 | 1<=Node2ID] | [1<=Node0IsInserted & Node2ResZone<=Node1ID]]] & [~ [[Node1DHTinfo<=Node3requestsent0 & 1<=Node4IsNonInsertedNode]] | [[1<=Node2GiveAnswer4 | Node2OKshare<=Node0ID] | [Node3Request<=Node2NOshare & Node3OKshare<=0]]]]]]]

abstracting: (Node3OKshare<=0)
states: 91,128 (4)
abstracting: (Node3Request<=Node2NOshare)
states: 91,531 (4)
abstracting: (Node2OKshare<=Node0ID)
states: 91,128 (4)
abstracting: (1<=Node2GiveAnswer4)
states: 1,884 (3)
abstracting: (1<=Node4IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node1DHTinfo<=Node3requestsent0)
states: 97,526 (4)
abstracting: (Node2ResZone<=Node1ID)
states: 97,526 (4)
abstracting: (1<=Node0IsInserted)
states: 24,848 (4)
abstracting: (1<=Node2ID)
states: 1
abstracting: (1<=Node3requestsent1)
states: 1,884 (3)
abstracting: (Node2NOshare<=Node0GiveAnswer1)
states: 91,276 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

checking: E [[~ [[Node4WaitAnswer<=0 & [EX [AG [1<=Node4GiveAnswer1]] & [[[Node2requestsent3<=0 & Node3JoinMsg<=0] & ~ [Node3WaitAnswer<=0]] | [EG [1<=Node1GiveAnswer2] & ~ [Node1ResZone<=EmptyCAN]]]]]] | [Node1WaitAnswer<=Node3ResZone & [Node4GiveAnswer2<=1 & Node0ResZone<=0]]] U ~ [[EX [AF [[1<=Node1DHTinfo & Node0ID2<=1]]] | ~ [EF [EF [Node3Request<=Node3OKshare]]]]]]
normalized: E [[[Node1WaitAnswer<=Node3ResZone & [Node4GiveAnswer2<=1 & Node0ResZone<=0]] | ~ [[Node4WaitAnswer<=0 & [[[~ [Node1ResZone<=EmptyCAN] & EG [1<=Node1GiveAnswer2]] | [~ [Node3WaitAnswer<=0] & [Node2requestsent3<=0 & Node3JoinMsg<=0]]] & EX [~ [E [true U ~ [1<=Node4GiveAnswer1]]]]]]]] U ~ [[~ [E [true U E [true U Node3Request<=Node3OKshare]]] | EX [~ [EG [~ [[1<=Node1DHTinfo & Node0ID2<=1]]]]]]]]

abstracting: (Node0ID2<=1)
states: 97,527 (4)
abstracting: (1<=Node1DHTinfo)
states: 1
.
EG iterations: 1
.abstracting: (Node3Request<=Node3OKshare)
states: 91,128 (4)
abstracting: (1<=Node4GiveAnswer1)
states: 1,884 (3)
.abstracting: (Node3JoinMsg<=0)
states: 91,128 (4)
abstracting: (Node2requestsent3<=0)
states: 95,643 (4)
abstracting: (Node3WaitAnswer<=0)
states: 63,258 (4)
abstracting: (1<=Node1GiveAnswer2)
states: 1,884 (3)
.....
EG iterations: 5
abstracting: (Node1ResZone<=EmptyCAN)
states: 97,526 (4)
abstracting: (Node4WaitAnswer<=0)
states: 63,258 (4)
abstracting: (Node0ResZone<=0)
states: 97,526 (4)
abstracting: (Node4GiveAnswer2<=1)
states: 97,527 (4)
abstracting: (Node1WaitAnswer<=Node3ResZone)
states: 63,258 (4)
-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: E [EX [Node2ID2<=Node3ReadyToInsert] U [E [A [[EF [Node2DHTinfo2<=Node1ReadyToInsert] & [Node2ReadyToInsert<=Node3GiveAnswer4 & Node1requestsent0<=1]] U [E [1<=Node1requestsent3 U Node0GiveAnswer3<=1] | EX [Node3IsNonInsertedNode<=Node0ID2]]] U ~ [AF [1<=Node4ResZone]]] | EF [[~ [A [Node1requestsent2<=Node3ResZone U Node4requestsent1<=Node2ResZone]] & ~ [[Node1ResZone<=1 | [1<=Node4requestsent3 & Node3WaitAnswer<=Node2requestsent0]]]]]]]
normalized: E [EX [Node2ID2<=Node3ReadyToInsert] U [E [true U [~ [[Node1ResZone<=1 | [1<=Node4requestsent3 & Node3WaitAnswer<=Node2requestsent0]]] & ~ [[~ [EG [~ [Node4requestsent1<=Node2ResZone]]] & ~ [E [~ [Node4requestsent1<=Node2ResZone] U [~ [Node1requestsent2<=Node3ResZone] & ~ [Node4requestsent1<=Node2ResZone]]]]]]]] | E [[~ [EG [~ [[EX [Node3IsNonInsertedNode<=Node0ID2] | E [1<=Node1requestsent3 U Node0GiveAnswer3<=1]]]]] & ~ [E [~ [[EX [Node3IsNonInsertedNode<=Node0ID2] | E [1<=Node1requestsent3 U Node0GiveAnswer3<=1]]] U [~ [[[Node2ReadyToInsert<=Node3GiveAnswer4 & Node1requestsent0<=1] & E [true U Node2DHTinfo2<=Node1ReadyToInsert]]] & ~ [[EX [Node3IsNonInsertedNode<=Node0ID2] | E [1<=Node1requestsent3 U Node0GiveAnswer3<=1]]]]]]] U EG [~ [1<=Node4ResZone]]]]]

abstracting: (1<=Node4ResZone)
states: 1
...
EG iterations: 3
abstracting: (Node0GiveAnswer3<=1)
states: 97,527 (4)
abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (Node3IsNonInsertedNode<=Node0ID2)
states: 91,531 (4)
.abstracting: (Node2DHTinfo2<=Node1ReadyToInsert)
states: 91,531 (4)
abstracting: (Node1requestsent0<=1)
states: 97,527 (4)
abstracting: (Node2ReadyToInsert<=Node3GiveAnswer4)
states: 91,263 (4)
abstracting: (Node0GiveAnswer3<=1)
states: 97,527 (4)
abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (Node3IsNonInsertedNode<=Node0ID2)
states: 91,531 (4)
.abstracting: (Node0GiveAnswer3<=1)
states: 97,527 (4)
abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (Node3IsNonInsertedNode<=Node0ID2)
states: 91,531 (4)
..
EG iterations: 1
abstracting: (Node4requestsent1<=Node2ResZone)
states: 95,643 (4)
abstracting: (Node1requestsent2<=Node3ResZone)
states: 95,643 (4)
abstracting: (Node4requestsent1<=Node2ResZone)
states: 95,643 (4)
abstracting: (Node4requestsent1<=Node2ResZone)
states: 95,643 (4)
.....
EG iterations: 5
abstracting: (Node3WaitAnswer<=Node2requestsent0)
states: 64,054 (4)
abstracting: (1<=Node4requestsent3)
states: 1,884 (3)
abstracting: (Node1ResZone<=1)
states: 97,527 (4)
abstracting: (Node2ID2<=Node3ReadyToInsert)
states: 91,531 (4)
.-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.329sec

checking: [AX [~ [AX [AF [AG [Node3JoinMsg<=Node0DHTinfo]]]]] & A [Node1WaitAnswer<=1 U [[EG [[[Node0GiveAnswer4<=1 & Node4GiveAnswer2<=0] | EF [InsertedCount<=Node0requestsent3]]] & EF [AF [Node4WaitAnswer<=Node0ReadyToInsert]]] & [E [[[Node3requestsent4<=0 | 1<=Node1requestsent3] | E [Node1DHTinfo2<=Node3ResZone U Node4IsInserted<=1]] U AX [Node4requestsent1<=Node4requestsent2]] | [[[Node3requestsent4<=Node3GiveAnswer0 & EF [Node4ResZone<=0]] & ~ [Node3Bootstrap<=1]] & AX [[Node1DHTinfo2<=Node1ID & 1<=Node0DHTinfo2]]]]]]]
normalized: [[~ [EG [~ [[[[~ [EX [~ [[Node1DHTinfo2<=Node1ID & 1<=Node0DHTinfo2]]]] & [~ [Node3Bootstrap<=1] & [Node3requestsent4<=Node3GiveAnswer0 & E [true U Node4ResZone<=0]]]] | E [[E [Node1DHTinfo2<=Node3ResZone U Node4IsInserted<=1] | [Node3requestsent4<=0 | 1<=Node1requestsent3]] U ~ [EX [~ [Node4requestsent1<=Node4requestsent2]]]]] & [E [true U ~ [EG [~ [Node4WaitAnswer<=Node0ReadyToInsert]]]] & EG [[E [true U InsertedCount<=Node0requestsent3] | [Node0GiveAnswer4<=1 & Node4GiveAnswer2<=0]]]]]]]] & ~ [E [~ [[[[~ [EX [~ [[Node1DHTinfo2<=Node1ID & 1<=Node0DHTinfo2]]]] & [~ [Node3Bootstrap<=1] & [Node3requestsent4<=Node3GiveAnswer0 & E [true U Node4ResZone<=0]]]] | E [[E [Node1DHTinfo2<=Node3ResZone U Node4IsInserted<=1] | [Node3requestsent4<=0 | 1<=Node1requestsent3]] U ~ [EX [~ [Node4requestsent1<=Node4requestsent2]]]]] & [E [true U ~ [EG [~ [Node4WaitAnswer<=Node0ReadyToInsert]]]] & EG [[E [true U InsertedCount<=Node0requestsent3] | [Node0GiveAnswer4<=1 & Node4GiveAnswer2<=0]]]]]] U [~ [Node1WaitAnswer<=1] & ~ [[[[~ [EX [~ [[Node1DHTinfo2<=Node1ID & 1<=Node0DHTinfo2]]]] & [~ [Node3Bootstrap<=1] & [Node3requestsent4<=Node3GiveAnswer0 & E [true U Node4ResZone<=0]]]] | E [[E [Node1DHTinfo2<=Node3ResZone U Node4IsInserted<=1] | [Node3requestsent4<=0 | 1<=Node1requestsent3]] U ~ [EX [~ [Node4requestsent1<=Node4requestsent2]]]]] & [E [true U ~ [EG [~ [Node4WaitAnswer<=Node0ReadyToInsert]]]] & EG [[E [true U InsertedCount<=Node0requestsent3] | [Node0GiveAnswer4<=1 & Node4GiveAnswer2<=0]]]]]]]]]] & ~ [EX [~ [EX [EG [E [true U ~ [Node3JoinMsg<=Node0DHTinfo]]]]]]]]

abstracting: (Node3JoinMsg<=Node0DHTinfo)
states: 91,128 (4)
.
EG iterations: 1
..abstracting: (Node4GiveAnswer2<=0)
states: 95,643 (4)
abstracting: (Node0GiveAnswer4<=1)
states: 97,527 (4)
abstracting: (InsertedCount<=Node0requestsent3)
states: 1,347 (3)
.....
EG iterations: 5
abstracting: (Node4WaitAnswer<=Node0ReadyToInsert)
states: 65,355 (4)
........
EG iterations: 8
abstracting: (Node4requestsent1<=Node4requestsent2)
states: 95,643 (4)
.abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (Node3requestsent4<=0)
states: 95,643 (4)
abstracting: (Node4IsInserted<=1)
states: 97,527 (4)
abstracting: (Node1DHTinfo2<=Node3ResZone)
states: 91,128 (4)
abstracting: (Node4ResZone<=0)
states: 97,526 (4)
abstracting: (Node3requestsent4<=Node3GiveAnswer0)
states: 95,643 (4)
abstracting: (Node3Bootstrap<=1)
states: 97,527 (4)
abstracting: (1<=Node0DHTinfo2)
states: 6,399 (3)
abstracting: (Node1DHTinfo2<=Node1ID)
states: 91,128 (4)
.abstracting: (Node1WaitAnswer<=1)
states: 97,527 (4)
abstracting: (Node4GiveAnswer2<=0)
states: 95,643 (4)
abstracting: (Node0GiveAnswer4<=1)
states: 97,527 (4)
abstracting: (InsertedCount<=Node0requestsent3)
states: 1,347 (3)
.....
EG iterations: 5
abstracting: (Node4WaitAnswer<=Node0ReadyToInsert)
states: 65,355 (4)
........
EG iterations: 8
abstracting: (Node4requestsent1<=Node4requestsent2)
states: 95,643 (4)
.abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (Node3requestsent4<=0)
states: 95,643 (4)
abstracting: (Node4IsInserted<=1)
states: 97,527 (4)
abstracting: (Node1DHTinfo2<=Node3ResZone)
states: 91,128 (4)
abstracting: (Node4ResZone<=0)
states: 97,526 (4)
abstracting: (Node3requestsent4<=Node3GiveAnswer0)
states: 95,643 (4)
abstracting: (Node3Bootstrap<=1)
states: 97,527 (4)
abstracting: (1<=Node0DHTinfo2)
states: 6,399 (3)
abstracting: (Node1DHTinfo2<=Node1ID)
states: 91,128 (4)
.abstracting: (Node4GiveAnswer2<=0)
states: 95,643 (4)
abstracting: (Node0GiveAnswer4<=1)
states: 97,527 (4)
abstracting: (InsertedCount<=Node0requestsent3)
states: 1,347 (3)
.....
EG iterations: 5
abstracting: (Node4WaitAnswer<=Node0ReadyToInsert)
states: 65,355 (4)
........
EG iterations: 8
abstracting: (Node4requestsent1<=Node4requestsent2)
states: 95,643 (4)
.abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (Node3requestsent4<=0)
states: 95,643 (4)
abstracting: (Node4IsInserted<=1)
states: 97,527 (4)
abstracting: (Node1DHTinfo2<=Node3ResZone)
states: 91,128 (4)
abstracting: (Node4ResZone<=0)
states: 97,526 (4)
abstracting: (Node3requestsent4<=Node3GiveAnswer0)
states: 95,643 (4)
abstracting: (Node3Bootstrap<=1)
states: 97,527 (4)
abstracting: (1<=Node0DHTinfo2)
states: 6,399 (3)
abstracting: (Node1DHTinfo2<=Node1ID)
states: 91,128 (4)
.......
EG iterations: 6
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.873sec

checking: [[EF [A [AX [AF [Node3DHTinfo2<=1]] U [[[1<=Node4GiveAnswer1 & Node2ID2<=1] & ~ [1<=Node2requestsent4]] & A [1<=Node0GiveAnswer4 U Node1DHTinfo2<=0]]]] & A [[E [[Node0NOshare<=1 & 1<=Node1ReadyToInsert] U [AX [Node3OKshare<=Node2Request] | EG [Node3ID<=EmptyCAN]]] | EG [~ [[Node0WaitAnswer<=0 & Node1JoinMsg<=1]]]] U [EG [~ [Node0Bootstrap<=Node4ID2]] & AF [EG [Node4DHTinfo<=1]]]]] & E [~ [[Node4IsNonInsertedNode<=0 & Node4requestsent3<=Node3WaitAnswer]] U EF [[EG [1<=Node1JoinMsg] | ~ [[AX [1<=Node1ReadyToInsert] & EF [Node2ResZone<=0]]]]]]]
normalized: [[E [true U [~ [EG [~ [[[~ [EG [~ [Node1DHTinfo2<=0]]] & ~ [E [~ [Node1DHTinfo2<=0] U [~ [1<=Node0GiveAnswer4] & ~ [Node1DHTinfo2<=0]]]]] & [~ [1<=Node2requestsent4] & [1<=Node4GiveAnswer1 & Node2ID2<=1]]]]]] & ~ [E [~ [[[~ [EG [~ [Node1DHTinfo2<=0]]] & ~ [E [~ [Node1DHTinfo2<=0] U [~ [1<=Node0GiveAnswer4] & ~ [Node1DHTinfo2<=0]]]]] & [~ [1<=Node2requestsent4] & [1<=Node4GiveAnswer1 & Node2ID2<=1]]]] U [~ [[[~ [EG [~ [Node1DHTinfo2<=0]]] & ~ [E [~ [Node1DHTinfo2<=0] U [~ [1<=Node0GiveAnswer4] & ~ [Node1DHTinfo2<=0]]]]] & [~ [1<=Node2requestsent4] & [1<=Node4GiveAnswer1 & Node2ID2<=1]]]] & EX [EG [~ [Node3DHTinfo2<=1]]]]]]]] & [~ [EG [~ [[~ [EG [~ [EG [Node4DHTinfo<=1]]]] & EG [~ [Node0Bootstrap<=Node4ID2]]]]]] & ~ [E [~ [[~ [EG [~ [EG [Node4DHTinfo<=1]]]] & EG [~ [Node0Bootstrap<=Node4ID2]]]] U [~ [[EG [~ [[Node0WaitAnswer<=0 & Node1JoinMsg<=1]]] | E [[Node0NOshare<=1 & 1<=Node1ReadyToInsert] U [EG [Node3ID<=EmptyCAN] | ~ [EX [~ [Node3OKshare<=Node2Request]]]]]]] & ~ [[~ [EG [~ [EG [Node4DHTinfo<=1]]]] & EG [~ [Node0Bootstrap<=Node4ID2]]]]]]]]] & E [~ [[Node4IsNonInsertedNode<=0 & Node4requestsent3<=Node3WaitAnswer]] U E [true U [EG [1<=Node1JoinMsg] | ~ [[E [true U Node2ResZone<=0] & ~ [EX [~ [1<=Node1ReadyToInsert]]]]]]]]]

abstracting: (1<=Node1ReadyToInsert)
states: 6,412 (3)
.abstracting: (Node2ResZone<=0)
states: 97,526 (4)
abstracting: (1<=Node1JoinMsg)
states: 6,399 (3)
.....
EG iterations: 5
abstracting: (Node4requestsent3<=Node3WaitAnswer)
states: 95,643 (4)
abstracting: (Node4IsNonInsertedNode<=0)
states: 91,128 (4)
abstracting: (Node0Bootstrap<=Node4ID2)
states: 91,531 (4)
...........
EG iterations: 11
abstracting: (Node4DHTinfo<=1)
states: 97,527 (4)

EG iterations: 0
.
EG iterations: 1
abstracting: (Node3OKshare<=Node2Request)
states: 91,531 (4)
.abstracting: (Node3ID<=EmptyCAN)
states: 97,526 (4)
..
EG iterations: 2
abstracting: (1<=Node1ReadyToInsert)
states: 6,412 (3)
abstracting: (Node0NOshare<=1)
states: 97,527 (4)
abstracting: (Node1JoinMsg<=1)
states: 97,527 (4)
abstracting: (Node0WaitAnswer<=0)
states: 63,258 (4)
........
EG iterations: 8
abstracting: (Node0Bootstrap<=Node4ID2)
states: 91,531 (4)
...........
EG iterations: 11
abstracting: (Node4DHTinfo<=1)
states: 97,527 (4)

EG iterations: 0
.
EG iterations: 1
abstracting: (Node0Bootstrap<=Node4ID2)
states: 91,531 (4)
...........
EG iterations: 11
abstracting: (Node4DHTinfo<=1)
states: 97,527 (4)

EG iterations: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Node3DHTinfo2<=1)
states: 97,527 (4)
.
EG iterations: 1
.abstracting: (Node2ID2<=1)
states: 97,527 (4)
abstracting: (1<=Node4GiveAnswer1)
states: 1,884 (3)
abstracting: (1<=Node2requestsent4)
states: 1,884 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (1<=Node0GiveAnswer4)
states: 1,884 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
.....
EG iterations: 5
abstracting: (Node2ID2<=1)
states: 97,527 (4)
abstracting: (1<=Node4GiveAnswer1)
states: 1,884 (3)
abstracting: (1<=Node2requestsent4)
states: 1,884 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (1<=Node0GiveAnswer4)
states: 1,884 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
.....
EG iterations: 5
abstracting: (Node2ID2<=1)
states: 97,527 (4)
abstracting: (1<=Node4GiveAnswer1)
states: 1,884 (3)
abstracting: (1<=Node2requestsent4)
states: 1,884 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (1<=Node0GiveAnswer4)
states: 1,884 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
.....
EG iterations: 5
.....
EG iterations: 5
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.950sec

checking: AG [[[1<=InsertedCount & A [[Node3ID2<=Node1requestsent4 & A [1<=Node4DHTinfo U Node0requestsent2<=Node2GiveAnswer4]] U A [[Node0requestsent2<=Node1ID2 & 1<=Node2WaitAnswer] U [Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]]]] | [E [[EG [1<=Node2ID] & A [1<=Node4NOshare U Node3ReadyToInsert<=Node1requestsent3]] U Node4GiveAnswer0<=Node3GiveAnswer1] & [[~ [[1<=Node1DHTinfo | EF [1<=Node3requestsent0]]] & [[AF [Node0requestsent2<=1] & ~ [Node2IsInserted<=Node2OKshare]] | Node4ID2<=Node0Request]] | Node0NOshare<=Node0OKshare]]]]
normalized: ~ [E [true U ~ [[[[Node0NOshare<=Node0OKshare | [[Node4ID2<=Node0Request | [~ [Node2IsInserted<=Node2OKshare] & ~ [EG [~ [Node0requestsent2<=1]]]]] & ~ [[1<=Node1DHTinfo | E [true U 1<=Node3requestsent0]]]]] & E [[[~ [EG [~ [Node3ReadyToInsert<=Node1requestsent3]]] & ~ [E [~ [Node3ReadyToInsert<=Node1requestsent3] U [~ [Node3ReadyToInsert<=Node1requestsent3] & ~ [1<=Node4NOshare]]]]] & EG [1<=Node2ID]] U Node4GiveAnswer0<=Node3GiveAnswer1]] | [1<=InsertedCount & [~ [EG [~ [[~ [EG [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]]]] & ~ [E [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]] U [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]] & ~ [[Node0requestsent2<=Node1ID2 & 1<=Node2WaitAnswer]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]]]] & ~ [E [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]] U [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]] & ~ [[Node0requestsent2<=Node1ID2 & 1<=Node2WaitAnswer]]]]]]] U [~ [[~ [EG [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]]]] & ~ [E [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]] U [~ [[Node4Request<=Node1DHTinfo | 1<=Node4DHTinfo]] & ~ [[Node0requestsent2<=Node1ID2 & 1<=Node2WaitAnswer]]]]]]] & ~ [[Node3ID2<=Node1requestsent4 & [~ [EG [~ [Node0requestsent2<=Node2GiveAnswer4]]] & ~ [E [~ [Node0requestsent2<=Node2GiveAnswer4] U [~ [Node0requestsent2<=Node2GiveAnswer4] & ~ [1<=Node4DHTinfo]]]]]]]]]]]]]]]]

abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node0requestsent2<=Node2GiveAnswer4)
states: 95,791 (4)
abstracting: (Node0requestsent2<=Node2GiveAnswer4)
states: 95,791 (4)
abstracting: (Node0requestsent2<=Node2GiveAnswer4)
states: 95,791 (4)
.....
EG iterations: 5
abstracting: (Node3ID2<=Node1requestsent4)
states: 91,276 (4)
abstracting: (1<=Node2WaitAnswer)
states: 34,269 (4)
abstracting: (Node0requestsent2<=Node1ID2)
states: 95,791 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
.....
EG iterations: 5
abstracting: (1<=Node2WaitAnswer)
states: 34,269 (4)
abstracting: (Node0requestsent2<=Node1ID2)
states: 95,791 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
.....
EG iterations: 5
abstracting: (1<=Node2WaitAnswer)
states: 34,269 (4)
abstracting: (Node0requestsent2<=Node1ID2)
states: 95,791 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4Request<=Node1DHTinfo)
states: 91,128 (4)
.....
EG iterations: 5
.....
EG iterations: 5
abstracting: (1<=InsertedCount)
states: 97,511 (4)
abstracting: (Node4GiveAnswer0<=Node3GiveAnswer1)
states: 95,657 (4)
abstracting: (1<=Node2ID)
states: 1
..
EG iterations: 2
abstracting: (1<=Node4NOshare)
states: 6,399 (3)
abstracting: (Node3ReadyToInsert<=Node1requestsent3)
states: 91,115 (4)
abstracting: (Node3ReadyToInsert<=Node1requestsent3)
states: 91,115 (4)
abstracting: (Node3ReadyToInsert<=Node1requestsent3)
states: 91,115 (4)
.....
EG iterations: 5
abstracting: (1<=Node3requestsent0)
states: 1,884 (3)
abstracting: (1<=Node1DHTinfo)
states: 1
abstracting: (Node0requestsent2<=1)
states: 97,527 (4)
.
EG iterations: 1
abstracting: (Node2IsInserted<=Node2OKshare)
states: 72,679 (4)
abstracting: (Node4ID2<=Node0Request)
states: 91,531 (4)
abstracting: (Node0NOshare<=Node0OKshare)
states: 91,128 (4)
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.573sec

totally nodes used: 2366951 (2.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3351955 13472117 16824072
used/not used/entry size/cache size: 14191172 52917692 16 1024MB
basic ops cache: hits/miss/sum: 483323 2059362 2542685
used/not used/entry size/cache size: 2958264 13818952 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: 29584 119660 149244
used/not used/entry size/cache size: 118846 8269762 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 65076030
1 1753932
2 230979
3 41419
4 5795
5 635
6 70
7 3
8 1
9 0
>= 10 0

Total processing time: 0m12.619sec


BK_STOP 1678306776082

--------------------
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:7211 (51), effective:289 (2)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:490 (3), effective:13 (0)

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

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

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

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

iterations count:1593 (11), effective:54 (0)

iterations count:443 (3), effective:18 (0)

iterations count:726 (5), effective:23 (0)

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

iterations count:443 (3), effective:18 (0)

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

iterations count:443 (3), effective:18 (0)

iterations count:1299 (9), effective:63 (0)

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

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

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

iterations count:175 (1), effective:2 (0)

iterations count:1452 (10), effective:42 (0)

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

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

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

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

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

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

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

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

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

iterations count:2666 (19), effective:93 (0)

iterations count:319 (2), effective:9 (0)

iterations count:2650 (18), effective:126 (0)

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

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

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

iterations count:319 (2), effective:9 (0)

iterations count:2650 (18), effective:126 (0)

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

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

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

iterations count:319 (2), effective:9 (0)

iterations count:2650 (18), effective:126 (0)

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

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

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

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

iterations count:437 (3), effective:12 (0)

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

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

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

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

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

iterations count:2621 (18), effective:118 (0)

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

iterations count:411 (2), effective:11 (0)

iterations count:411 (2), effective:11 (0)

iterations count:1678 (11), effective:70 (0)

iterations count:411 (2), effective:11 (0)

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

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

iterations count:2060 (14), effective:76 (0)

iterations count:1028 (7), effective:40 (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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r033-tajo-167813686200609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 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 ;