About the Execution of Marcie+red for CANConstruction-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5487.371 | 12959.00 | 21480.00 | 82.80 | TTTTTTTFTFTFFFTF | normal |
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.r042-tajo-167813696000614.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 marciexred
Input is CANConstruction-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000614
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-005-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678736024981
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=CANConstruction-PT-005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:33:46] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-13 19:33:46] [INFO ] Transformed 112 places.
[2023-03-13 19:33:46] [INFO ] Transformed 140 transitions.
[2023-03-13 19:33:46] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 128 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 15) seen :4
FORMULA CANConstruction-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 140 rows 112 cols
[2023-03-13 19:33:48] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-13 19:33:48] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-13 19:33:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-13 19:33:48] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-13 19:33:49] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-13 19:33:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 19:33:49] [INFO ] After 68ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :9 sat :2
[2023-03-13 19:33:49] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-13 19:33:49] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
FORMULA CANConstruction-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-005-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 66 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 140/140 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 139
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 6 place count 111 transition count 135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10 place count 107 transition count 135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 107 transition count 134
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 106 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 105 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 105 transition count 132
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 105 transition count 132
Applied a total of 16 rules in 27 ms. Remains 105 /112 variables (removed 7) and now considering 132/140 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 105/112 places, 132/140 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :1
FORMULA CANConstruction-PT-005-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 132 rows 105 cols
[2023-03-13 19:33:49] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-13 19:33:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:33:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-13 19:33:49] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-13 19:33:49] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:33:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 19:33:49] [INFO ] After 21ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:33:49] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 19:33:49] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 132/132 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 125
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 98 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 96 transition count 123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 96 transition count 121
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 94 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 91 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 91 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 89 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 87 transition count 113
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 87 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 42 place count 84 transition count 110
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 47 place count 84 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 83 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 83 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 83 transition count 108
Applied a total of 50 rules in 25 ms. Remains 83 /105 variables (removed 22) and now considering 108/132 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 83/105 places, 108/132 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 27049 states, properties seen :0
Probabilistic random walk after 141810 steps, saw 27049 distinct states, run finished after 187 ms. (steps per millisecond=758 ) properties seen :0
Explored full state space saw : 27049 states, properties seen :0
Exhaustive walk after 141810 steps, saw 27049 distinct states, run finished after 115 ms. (steps per millisecond=1233 ) properties seen :0
FORMULA CANConstruction-PT-005-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 3227 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: 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.483sec
RS generation: 0m 0.319sec
-> reachability set: #nodes 10009 (1.0e+04) #states 97,527 (4)
starting MCC model checker
--------------------------
checking: AG [Node1Bootstrap<=1]
normalized: ~ [E [true U ~ [Node1Bootstrap<=1]]]
abstracting: (Node1Bootstrap<=1)
states: 97,527 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [Node2IsNonInsertedNode<=1]
normalized: ~ [E [true U ~ [Node2IsNonInsertedNode<=1]]]
abstracting: (Node2IsNonInsertedNode<=1)
states: 97,527 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[1<=Node0Request & Node3OKshare<=Node0GiveAnswer4]]
normalized: ~ [E [true U ~ [[1<=Node0Request & Node3OKshare<=Node0GiveAnswer4]]]]
abstracting: (Node3OKshare<=Node0GiveAnswer4)
states: 91,276 (4)
abstracting: (1<=Node0Request)
states: 6,399 (3)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.247sec
checking: AG [~ [[[[[[Node4Request<=0 & [1<=Node4requestsent0 & [~ [Node1requestsent4<=Node1ID2] & [Node1requestsent2<=1 | Node0ID<=0]]]] | 1<=Node1DHTinfo] & 1<=Node4GiveAnswer3] & 1<=Node4requestsent3] & 1<=Node4GiveAnswer0]]]
normalized: ~ [E [true U [1<=Node4GiveAnswer0 & [1<=Node4requestsent3 & [1<=Node4GiveAnswer3 & [1<=Node1DHTinfo | [Node4Request<=0 & [1<=Node4requestsent0 & [[Node1requestsent2<=1 | Node0ID<=0] & ~ [Node1requestsent4<=Node1ID2]]]]]]]]]]
abstracting: (Node1requestsent4<=Node1ID2)
states: 95,643 (4)
abstracting: (Node0ID<=0)
states: 97,526 (4)
abstracting: (Node1requestsent2<=1)
states: 97,527 (4)
abstracting: (1<=Node4requestsent0)
states: 1,884 (3)
abstracting: (Node4Request<=0)
states: 91,128 (4)
abstracting: (1<=Node1DHTinfo)
states: 1
abstracting: (1<=Node4GiveAnswer3)
states: 1,884 (3)
abstracting: (1<=Node4requestsent3)
states: 1,884 (3)
abstracting: (1<=Node4GiveAnswer0)
states: 1,884 (3)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: EF [[[~ [Node3Request<=Node2DHTinfo2] | ~ [[[Node3requestsent2<=0 & [[Node0GiveAnswer2<=Node1DHTinfo | [~ [Node0ReadyToInsert<=Node3GiveAnswer2] & [1<=Node2IsNonInsertedNode & Node2JoinMsg<=Node3Request]]] | ~ [Node1Bootstrap<=Node4requestsent0]]] | Node0GiveAnswer1<=0]]] & ~ [Node2requestsent0<=0]]]
normalized: E [true U [~ [Node2requestsent0<=0] & [~ [Node3Request<=Node2DHTinfo2] | ~ [[Node0GiveAnswer1<=0 | [Node3requestsent2<=0 & [[Node0GiveAnswer2<=Node1DHTinfo | [[1<=Node2IsNonInsertedNode & Node2JoinMsg<=Node3Request] & ~ [Node0ReadyToInsert<=Node3GiveAnswer2]]] | ~ [Node1Bootstrap<=Node4requestsent0]]]]]]]]
abstracting: (Node1Bootstrap<=Node4requestsent0)
states: 91,276 (4)
abstracting: (Node0ReadyToInsert<=Node3GiveAnswer2)
states: 91,263 (4)
abstracting: (Node2JoinMsg<=Node3Request)
states: 91,531 (4)
abstracting: (1<=Node2IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node0GiveAnswer2<=Node1DHTinfo)
states: 95,643 (4)
abstracting: (Node3requestsent2<=0)
states: 95,643 (4)
abstracting: (Node0GiveAnswer1<=0)
states: 95,643 (4)
abstracting: (Node3Request<=Node2DHTinfo2)
states: 91,531 (4)
abstracting: (Node2requestsent0<=0)
states: 95,643 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.103sec
checking: EF [~ [[[1<=Node3IsInserted | [~ [[1<=Node1ReadyToInsert | [1<=Node3NOshare | 1<=Node3DHTinfo]]] | [[1<=Node0requestsent1 & [Node4DHTinfo<=1 | Node3DHTinfo<=1]] | [[1<=Node1IsNonInsertedNode & 1<=Node2ReadyToInsert] | Node1requestsent2<=Node4GiveAnswer3]]]] & ~ [[~ [[[1<=Node2Bootstrap | Node4GiveAnswer1<=0] | Node2GiveAnswer3<=Node0IsInserted]] & ~ [Node3requestsent1<=0]]]]]]
normalized: E [true U ~ [[[1<=Node3IsInserted | [~ [[1<=Node1ReadyToInsert | [1<=Node3NOshare | 1<=Node3DHTinfo]]] | [[1<=Node0requestsent1 & [Node4DHTinfo<=1 | Node3DHTinfo<=1]] | [Node1requestsent2<=Node4GiveAnswer3 | [1<=Node1IsNonInsertedNode & 1<=Node2ReadyToInsert]]]]] & ~ [[~ [[Node2GiveAnswer3<=Node0IsInserted | [1<=Node2Bootstrap | Node4GiveAnswer1<=0]]] & ~ [Node3requestsent1<=0]]]]]]
abstracting: (Node3requestsent1<=0)
states: 95,643 (4)
abstracting: (Node4GiveAnswer1<=0)
states: 95,643 (4)
abstracting: (1<=Node2Bootstrap)
states: 6,399 (3)
abstracting: (Node2GiveAnswer3<=Node0IsInserted)
states: 95,843 (4)
abstracting: (1<=Node2ReadyToInsert)
states: 6,412 (3)
abstracting: (1<=Node1IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node1requestsent2<=Node4GiveAnswer3)
states: 95,657 (4)
abstracting: (Node3DHTinfo<=1)
states: 97,527 (4)
abstracting: (Node4DHTinfo<=1)
states: 97,527 (4)
abstracting: (1<=Node0requestsent1)
states: 1,884 (3)
abstracting: (1<=Node3DHTinfo)
states: 1
abstracting: (1<=Node3NOshare)
states: 6,399 (3)
abstracting: (1<=Node1ReadyToInsert)
states: 6,412 (3)
abstracting: (1<=Node3IsInserted)
states: 24,848 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.171sec
checking: AG [[[1<=Node2GiveAnswer4 & ~ [Node4ReadyToInsert<=Node0Bootstrap]] | [[[[~ [1<=Node4OKshare] & 1<=Node0JoinMsg] | [1<=Node4requestsent3 | [[~ [1<=Node4NOshare] & [~ [1<=Node4requestsent2] | [Node3GiveAnswer4<=Node3ID & 1<=Node1IsInserted]]] & [[Node4DHTinfo<=0 | Node3IsInserted<=1] | ~ [[1<=Node0requestsent4 & Node0requestsent1<=Node3WaitAnswer]]]]]] | Node0GiveAnswer4<=Node2GiveAnswer3] & Node4GiveAnswer2<=1]]]
normalized: ~ [E [true U ~ [[[1<=Node2GiveAnswer4 & ~ [Node4ReadyToInsert<=Node0Bootstrap]] | [Node4GiveAnswer2<=1 & [Node0GiveAnswer4<=Node2GiveAnswer3 | [[1<=Node0JoinMsg & ~ [1<=Node4OKshare]] | [1<=Node4requestsent3 | [[[Node4DHTinfo<=0 | Node3IsInserted<=1] | ~ [[1<=Node0requestsent4 & Node0requestsent1<=Node3WaitAnswer]]] & [~ [1<=Node4NOshare] & [[Node3GiveAnswer4<=Node3ID & 1<=Node1IsInserted] | ~ [1<=Node4requestsent2]]]]]]]]]]]]
abstracting: (1<=Node4requestsent2)
states: 1,884 (3)
abstracting: (1<=Node1IsInserted)
states: 24,848 (4)
abstracting: (Node3GiveAnswer4<=Node3ID)
states: 95,643 (4)
abstracting: (1<=Node4NOshare)
states: 6,399 (3)
abstracting: (Node0requestsent1<=Node3WaitAnswer)
states: 96,439 (4)
abstracting: (1<=Node0requestsent4)
states: 1,884 (3)
abstracting: (Node3IsInserted<=1)
states: 97,527 (4)
abstracting: (Node4DHTinfo<=0)
states: 97,526 (4)
abstracting: (1<=Node4requestsent3)
states: 1,884 (3)
abstracting: (1<=Node4OKshare)
states: 6,399 (3)
abstracting: (1<=Node0JoinMsg)
states: 6,399 (3)
abstracting: (Node0GiveAnswer4<=Node2GiveAnswer3)
states: 95,657 (4)
abstracting: (Node4GiveAnswer2<=1)
states: 97,527 (4)
abstracting: (Node4ReadyToInsert<=Node0Bootstrap)
states: 91,518 (4)
abstracting: (1<=Node2GiveAnswer4)
states: 1,884 (3)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: AG [[[[~ [[~ [Node0NOshare<=Node4GiveAnswer3] & [~ [Node4requestsent2<=Node4GiveAnswer2] & [[[1<=Node4WaitAnswer | Node1requestsent4<=Node2ResZone] & 1<=Node1ReadyToInsert] & Node3requestsent4<=0]]]] | Node1GiveAnswer4<=0] | ~ [[~ [[Node0ID2<=1 & [[[Node3GiveAnswer4<=0 & Node1NOshare<=1] & [Node0GiveAnswer4<=Node1requestsent2 & Node3IsNonInsertedNode<=Node2DHTinfo2]] & [[Node1ResZone<=Node4IsNonInsertedNode | Node2requestsent4<=1] | 1<=Node1ID2]]]] & ~ [[1<=Node2requestsent1 | Node3requestsent4<=1]]]]] | 1<=Node2DHTinfo2]]
normalized: ~ [E [true U ~ [[1<=Node2DHTinfo2 | [~ [[~ [[1<=Node2requestsent1 | Node3requestsent4<=1]] & ~ [[Node0ID2<=1 & [[1<=Node1ID2 | [Node1ResZone<=Node4IsNonInsertedNode | Node2requestsent4<=1]] & [[Node0GiveAnswer4<=Node1requestsent2 & Node3IsNonInsertedNode<=Node2DHTinfo2] & [Node3GiveAnswer4<=0 & Node1NOshare<=1]]]]]]] | [Node1GiveAnswer4<=0 | ~ [[[[Node3requestsent4<=0 & [1<=Node1ReadyToInsert & [1<=Node4WaitAnswer | Node1requestsent4<=Node2ResZone]]] & ~ [Node4requestsent2<=Node4GiveAnswer2]] & ~ [Node0NOshare<=Node4GiveAnswer3]]]]]]]]]
abstracting: (Node0NOshare<=Node4GiveAnswer3)
states: 91,276 (4)
abstracting: (Node4requestsent2<=Node4GiveAnswer2)
states: 95,643 (4)
abstracting: (Node1requestsent4<=Node2ResZone)
states: 95,643 (4)
abstracting: (1<=Node4WaitAnswer)
states: 34,269 (4)
abstracting: (1<=Node1ReadyToInsert)
states: 6,412 (3)
abstracting: (Node3requestsent4<=0)
states: 95,643 (4)
abstracting: (Node1GiveAnswer4<=0)
states: 95,643 (4)
abstracting: (Node1NOshare<=1)
states: 97,527 (4)
abstracting: (Node3GiveAnswer4<=0)
states: 95,643 (4)
abstracting: (Node3IsNonInsertedNode<=Node2DHTinfo2)
states: 91,531 (4)
abstracting: (Node0GiveAnswer4<=Node1requestsent2)
states: 95,657 (4)
abstracting: (Node2requestsent4<=1)
states: 97,527 (4)
abstracting: (Node1ResZone<=Node4IsNonInsertedNode)
states: 97,526 (4)
abstracting: (1<=Node1ID2)
states: 6,399 (3)
abstracting: (Node0ID2<=1)
states: 97,527 (4)
abstracting: (Node3requestsent4<=1)
states: 97,527 (4)
abstracting: (1<=Node2requestsent1)
states: 1,884 (3)
abstracting: (1<=Node2DHTinfo2)
states: 6,399 (3)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: AG [~ [[~ [[[Node4IsNonInsertedNode<=0 & Node2OKshare<=1] | [~ [[Node2ID<=Node0Bootstrap & 1<=Node2requestsent0]] & ~ [[Node1ResZone<=1 | [Node4ID<=Node2GiveAnswer4 | ~ [Node2GiveAnswer0<=Node0JoinMsg]]]]]]] & [[[[~ [Node4ID<=Node1requestsent2] | ~ [[Node3requestsent4<=0 | Node3IsInserted<=1]]] & ~ [[[Node4JoinMsg<=0 & [1<=Node2Request | Node0OKshare<=Node4ResZone]] & [1<=Node3Bootstrap & ~ [Node3Request<=1]]]]] | [1<=Node2ID | ~ [[1<=Node1ReadyToInsert | [1<=Node1ID2 | 1<=Node1requestsent3]]]]] & 1<=Node1GiveAnswer3]]]]
normalized: ~ [E [true U [[1<=Node1GiveAnswer3 & [[1<=Node2ID | ~ [[1<=Node1ReadyToInsert | [1<=Node1ID2 | 1<=Node1requestsent3]]]] | [~ [[[1<=Node3Bootstrap & ~ [Node3Request<=1]] & [Node4JoinMsg<=0 & [1<=Node2Request | Node0OKshare<=Node4ResZone]]]] & [~ [[Node3requestsent4<=0 | Node3IsInserted<=1]] | ~ [Node4ID<=Node1requestsent2]]]]] & ~ [[[~ [[Node1ResZone<=1 | [Node4ID<=Node2GiveAnswer4 | ~ [Node2GiveAnswer0<=Node0JoinMsg]]]] & ~ [[Node2ID<=Node0Bootstrap & 1<=Node2requestsent0]]] | [Node4IsNonInsertedNode<=0 & Node2OKshare<=1]]]]]]
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node4IsNonInsertedNode<=0)
states: 91,128 (4)
abstracting: (1<=Node2requestsent0)
states: 1,884 (3)
abstracting: (Node2ID<=Node0Bootstrap)
states: 97,526 (4)
abstracting: (Node2GiveAnswer0<=Node0JoinMsg)
states: 95,643 (4)
abstracting: (Node4ID<=Node2GiveAnswer4)
states: 97,526 (4)
abstracting: (Node1ResZone<=1)
states: 97,527 (4)
abstracting: (Node4ID<=Node1requestsent2)
states: 97,526 (4)
abstracting: (Node3IsInserted<=1)
states: 97,527 (4)
abstracting: (Node3requestsent4<=0)
states: 95,643 (4)
abstracting: (Node0OKshare<=Node4ResZone)
states: 91,128 (4)
abstracting: (1<=Node2Request)
states: 6,399 (3)
abstracting: (Node4JoinMsg<=0)
states: 91,128 (4)
abstracting: (Node3Request<=1)
states: 97,527 (4)
abstracting: (1<=Node3Bootstrap)
states: 6,399 (3)
abstracting: (1<=Node1requestsent3)
states: 1,884 (3)
abstracting: (1<=Node1ID2)
states: 6,399 (3)
abstracting: (1<=Node1ReadyToInsert)
states: 6,412 (3)
abstracting: (1<=Node2ID)
states: 1
abstracting: (1<=Node1GiveAnswer3)
states: 1,884 (3)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.134sec
checking: AG [[~ [[~ [[[[Node1OKshare<=Node3requestsent4 & Node2ResZone<=0] & [[[1<=Node4ID & 1<=Node2ID] & ~ [1<=Node0GiveAnswer1]] | Node1OKshare<=Node1WaitAnswer]] & [Node3requestsent1<=Node2requestsent4 | 1<=Node4IsNonInsertedNode]]] | [[~ [Node2JoinMsg<=Node1Bootstrap] | [~ [[[Node2ID<=1 & 1<=Node3IsNonInsertedNode] | [Node2requestsent0<=Node1OKshare | 1<=Node4IsNonInsertedNode]]] & ~ [[[Node2IsNonInsertedNode<=Node4ResZone & Node0GiveAnswer2<=0] & ~ [1<=Node2IsInserted]]]]] | Node1ID2<=Node3IsInserted]]] | [Node1requestsent2<=Node4requestsent3 | Node0requestsent1<=Node4requestsent2]]]
normalized: ~ [E [true U ~ [[~ [[[Node1ID2<=Node3IsInserted | [[~ [[[Node2requestsent0<=Node1OKshare | 1<=Node4IsNonInsertedNode] | [Node2ID<=1 & 1<=Node3IsNonInsertedNode]]] & ~ [[[Node2IsNonInsertedNode<=Node4ResZone & Node0GiveAnswer2<=0] & ~ [1<=Node2IsInserted]]]] | ~ [Node2JoinMsg<=Node1Bootstrap]]] | ~ [[[[Node1OKshare<=Node3requestsent4 & Node2ResZone<=0] & [Node1OKshare<=Node1WaitAnswer | [~ [1<=Node0GiveAnswer1] & [1<=Node4ID & 1<=Node2ID]]]] & [Node3requestsent1<=Node2requestsent4 | 1<=Node4IsNonInsertedNode]]]]] | [Node1requestsent2<=Node4requestsent3 | Node0requestsent1<=Node4requestsent2]]]]]
abstracting: (Node0requestsent1<=Node4requestsent2)
states: 95,657 (4)
abstracting: (Node1requestsent2<=Node4requestsent3)
states: 95,657 (4)
abstracting: (1<=Node4IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node3requestsent1<=Node2requestsent4)
states: 95,657 (4)
abstracting: (1<=Node2ID)
states: 1
abstracting: (1<=Node4ID)
states: 1
abstracting: (1<=Node0GiveAnswer1)
states: 1,884 (3)
abstracting: (Node1OKshare<=Node1WaitAnswer)
states: 97,527 (4)
abstracting: (Node2ResZone<=0)
states: 97,526 (4)
abstracting: (Node1OKshare<=Node3requestsent4)
states: 91,276 (4)
abstracting: (Node2JoinMsg<=Node1Bootstrap)
states: 91,531 (4)
abstracting: (1<=Node2IsInserted)
states: 24,848 (4)
abstracting: (Node0GiveAnswer2<=0)
states: 95,643 (4)
abstracting: (Node2IsNonInsertedNode<=Node4ResZone)
states: 91,128 (4)
abstracting: (1<=Node3IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node2ID<=1)
states: 97,527 (4)
abstracting: (1<=Node4IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node2requestsent0<=Node1OKshare)
states: 95,791 (4)
abstracting: (Node1ID2<=Node3IsInserted)
states: 93,012 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.062sec
checking: EF [[~ [[Node1GiveAnswer2<=Node2DHTinfo | ~ [[1<=Node4requestsent2 & 1<=Node2JoinMsg]]]] | [~ [[Node3IsInserted<=Node1IsInserted | Node3requestsent2<=Node3ID2]] & [[~ [[~ [Node0GiveAnswer3<=0] & [[[1<=Node4IsNonInsertedNode | 1<=Node0GiveAnswer2] | [Node4IsInserted<=0 | Node2DHTinfo<=0]] & [[Node2OKshare<=0 & Node2GiveAnswer0<=0] & 1<=Node0GiveAnswer1]]]] & [~ [1<=Node1GiveAnswer3] | ~ [[~ [[1<=Node1GiveAnswer0 & Node3Bootstrap<=Node0Bootstrap]] | [[Node0IsInserted<=0 | Node2ReadyToInsert<=Node1DHTinfo] & 1<=Node4Request]]]]] & [~ [Node3GiveAnswer1<=Node0IsInserted] | [[Node0ID<=0 & Node3Bootstrap<=Node3Request] & ~ [[Node4WaitAnswer<=1 & 1<=Node4DHTinfo]]]]]]]]
normalized: E [true U [[[[[~ [[Node4WaitAnswer<=1 & 1<=Node4DHTinfo]] & [Node0ID<=0 & Node3Bootstrap<=Node3Request]] | ~ [Node3GiveAnswer1<=Node0IsInserted]] & [[~ [[[1<=Node4Request & [Node0IsInserted<=0 | Node2ReadyToInsert<=Node1DHTinfo]] | ~ [[1<=Node1GiveAnswer0 & Node3Bootstrap<=Node0Bootstrap]]]] | ~ [1<=Node1GiveAnswer3]] & ~ [[[[1<=Node0GiveAnswer1 & [Node2OKshare<=0 & Node2GiveAnswer0<=0]] & [[Node4IsInserted<=0 | Node2DHTinfo<=0] | [1<=Node4IsNonInsertedNode | 1<=Node0GiveAnswer2]]] & ~ [Node0GiveAnswer3<=0]]]]] & ~ [[Node3IsInserted<=Node1IsInserted | Node3requestsent2<=Node3ID2]]] | ~ [[Node1GiveAnswer2<=Node2DHTinfo | ~ [[1<=Node4requestsent2 & 1<=Node2JoinMsg]]]]]]
abstracting: (1<=Node2JoinMsg)
states: 6,399 (3)
abstracting: (1<=Node4requestsent2)
states: 1,884 (3)
abstracting: (Node1GiveAnswer2<=Node2DHTinfo)
states: 95,643 (4)
abstracting: (Node3requestsent2<=Node3ID2)
states: 95,643 (4)
abstracting: (Node3IsInserted<=Node1IsInserted)
states: 75,603 (4)
abstracting: (Node0GiveAnswer3<=0)
states: 95,643 (4)
abstracting: (1<=Node0GiveAnswer2)
states: 1,884 (3)
abstracting: (1<=Node4IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node2DHTinfo<=0)
states: 97,526 (4)
abstracting: (Node4IsInserted<=0)
states: 72,679 (4)
abstracting: (Node2GiveAnswer0<=0)
states: 95,643 (4)
abstracting: (Node2OKshare<=0)
states: 91,128 (4)
abstracting: (1<=Node0GiveAnswer1)
states: 1,884 (3)
abstracting: (1<=Node1GiveAnswer3)
states: 1,884 (3)
abstracting: (Node3Bootstrap<=Node0Bootstrap)
states: 91,531 (4)
abstracting: (1<=Node1GiveAnswer0)
states: 1,884 (3)
abstracting: (Node2ReadyToInsert<=Node1DHTinfo)
states: 91,116 (4)
abstracting: (Node0IsInserted<=0)
states: 72,679 (4)
abstracting: (1<=Node4Request)
states: 6,399 (3)
abstracting: (Node3GiveAnswer1<=Node0IsInserted)
states: 95,843 (4)
abstracting: (Node3Bootstrap<=Node3Request)
states: 91,128 (4)
abstracting: (Node0ID<=0)
states: 97,526 (4)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node4WaitAnswer<=1)
states: 97,527 (4)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: EF [~ [[[[[1<=Node2GiveAnswer0 & [[[[Node2ID2<=Node1NOshare & 1<=Node1GiveAnswer4] | [Node1requestsent0<=Node2GiveAnswer1 & Node4ID2<=Node4GiveAnswer0]] & [[Node3ResZone<=Node4Request | Node4GiveAnswer2<=Node0IsNonInsertedNode] & ~ [Node2ReadyToInsert<=InsertedCount]]] | [~ [[1<=Node0DHTinfo & Node1JoinMsg<=1]] | [~ [Node3GiveAnswer2<=Node0requestsent1] | 1<=Node4Request]]]] | [[~ [[1<=Node0requestsent4 | [Node3WaitAnswer<=1 & Node0ID2<=0]]] | Node4Bootstrap<=Node3WaitAnswer] & [Node3requestsent1<=1 & ~ [Node0GiveAnswer4<=1]]]] | 1<=Node0GiveAnswer2] | ~ [[~ [[Node2ResZone<=Node2OKshare | ~ [Node3GiveAnswer4<=Node1ID]]] & 1<=Node4JoinMsg]]]]]
normalized: E [true U ~ [[~ [[1<=Node4JoinMsg & ~ [[Node2ResZone<=Node2OKshare | ~ [Node3GiveAnswer4<=Node1ID]]]]] | [1<=Node0GiveAnswer2 | [[[Node3requestsent1<=1 & ~ [Node0GiveAnswer4<=1]] & [Node4Bootstrap<=Node3WaitAnswer | ~ [[1<=Node0requestsent4 | [Node3WaitAnswer<=1 & Node0ID2<=0]]]]] | [1<=Node2GiveAnswer0 & [[[1<=Node4Request | ~ [Node3GiveAnswer2<=Node0requestsent1]] | ~ [[1<=Node0DHTinfo & Node1JoinMsg<=1]]] | [[~ [Node2ReadyToInsert<=InsertedCount] & [Node3ResZone<=Node4Request | Node4GiveAnswer2<=Node0IsNonInsertedNode]] & [[Node1requestsent0<=Node2GiveAnswer1 & Node4ID2<=Node4GiveAnswer0] | [Node2ID2<=Node1NOshare & 1<=Node1GiveAnswer4]]]]]]]]]]
abstracting: (1<=Node1GiveAnswer4)
states: 1,884 (3)
abstracting: (Node2ID2<=Node1NOshare)
states: 91,531 (4)
abstracting: (Node4ID2<=Node4GiveAnswer0)
states: 91,128 (4)
abstracting: (Node1requestsent0<=Node2GiveAnswer1)
states: 95,643 (4)
abstracting: (Node4GiveAnswer2<=Node0IsNonInsertedNode)
states: 95,791 (4)
abstracting: (Node3ResZone<=Node4Request)
states: 97,526 (4)
abstracting: (Node2ReadyToInsert<=InsertedCount)
states: 97,514 (4)
abstracting: (Node1JoinMsg<=1)
states: 97,527 (4)
abstracting: (1<=Node0DHTinfo)
states: 1
abstracting: (Node3GiveAnswer2<=Node0requestsent1)
states: 95,657 (4)
abstracting: (1<=Node4Request)
states: 6,399 (3)
abstracting: (1<=Node2GiveAnswer0)
states: 1,884 (3)
abstracting: (Node0ID2<=0)
states: 91,128 (4)
abstracting: (Node3WaitAnswer<=1)
states: 97,527 (4)
abstracting: (1<=Node0requestsent4)
states: 1,884 (3)
abstracting: (Node4Bootstrap<=Node3WaitAnswer)
states: 93,225 (4)
abstracting: (Node0GiveAnswer4<=1)
states: 97,527 (4)
abstracting: (Node3requestsent1<=1)
states: 97,527 (4)
abstracting: (1<=Node0GiveAnswer2)
states: 1,884 (3)
abstracting: (Node3GiveAnswer4<=Node1ID)
states: 95,643 (4)
abstracting: (Node2ResZone<=Node2OKshare)
states: 97,526 (4)
abstracting: (1<=Node4JoinMsg)
states: 6,399 (3)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: AG [[[Node0ID<=Node2Bootstrap | [~ [1<=Node2NOshare] & Node0GiveAnswer3<=Node0NOshare]] | [[[[[Node3IsInserted<=0 & ~ [[[Node2GiveAnswer0<=EmptyCAN & Node1IsNonInsertedNode<=Node1requestsent3] & [Node3Bootstrap<=1 & 1<=Node3NOshare]]]] & [[[[Node2GiveAnswer3<=Node3JoinMsg | 1<=Node1requestsent4] & 1<=Node4WaitAnswer] & [Node2Bootstrap<=1 | [Node0ResZone<=0 & Node2DHTinfo<=Node0IsInserted]]] | ~ [[[Node4Bootstrap<=Node1Request | 1<=Node2ReadyToInsert] & 1<=Node1NOshare]]]] | [[~ [Node3IsNonInsertedNode<=1] | [[1<=Node1requestsent2 | ~ [Node3ResZone<=1]] & ~ [1<=Node3GiveAnswer2]]] | Node0IsInserted<=0]] & ~ [Node0IsNonInsertedNode<=Node1requestsent3]] | [[Node2IsInserted<=Node1ResZone | Node1requestsent4<=Node0requestsent3] & [Node0GiveAnswer2<=Node1NOshare | [Node3JoinMsg<=Node2ReadyToInsert & ~ [[~ [[Node4NOshare<=1 | Node2OKshare<=1]] & [~ [Node3ID<=Node3requestsent4] | [1<=Node3GiveAnswer0 & Node2OKshare<=1]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[Node0GiveAnswer2<=Node1NOshare | [Node3JoinMsg<=Node2ReadyToInsert & ~ [[[[1<=Node3GiveAnswer0 & Node2OKshare<=1] | ~ [Node3ID<=Node3requestsent4]] & ~ [[Node4NOshare<=1 | Node2OKshare<=1]]]]]] & [Node2IsInserted<=Node1ResZone | Node1requestsent4<=Node0requestsent3]] | [~ [Node0IsNonInsertedNode<=Node1requestsent3] & [[Node0IsInserted<=0 | [[~ [1<=Node3GiveAnswer2] & [1<=Node1requestsent2 | ~ [Node3ResZone<=1]]] | ~ [Node3IsNonInsertedNode<=1]]] | [[~ [[1<=Node1NOshare & [Node4Bootstrap<=Node1Request | 1<=Node2ReadyToInsert]]] | [[Node2Bootstrap<=1 | [Node0ResZone<=0 & Node2DHTinfo<=Node0IsInserted]] & [1<=Node4WaitAnswer & [Node2GiveAnswer3<=Node3JoinMsg | 1<=Node1requestsent4]]]] & [Node3IsInserted<=0 & ~ [[[Node3Bootstrap<=1 & 1<=Node3NOshare] & [Node2GiveAnswer0<=EmptyCAN & Node1IsNonInsertedNode<=Node1requestsent3]]]]]]]] | [Node0ID<=Node2Bootstrap | [Node0GiveAnswer3<=Node0NOshare & ~ [1<=Node2NOshare]]]]]]]
abstracting: (1<=Node2NOshare)
states: 6,399 (3)
abstracting: (Node0GiveAnswer3<=Node0NOshare)
states: 95,643 (4)
abstracting: (Node0ID<=Node2Bootstrap)
states: 97,526 (4)
abstracting: (Node1IsNonInsertedNode<=Node1requestsent3)
states: 91,128 (4)
abstracting: (Node2GiveAnswer0<=EmptyCAN)
states: 95,643 (4)
abstracting: (1<=Node3NOshare)
states: 6,399 (3)
abstracting: (Node3Bootstrap<=1)
states: 97,527 (4)
abstracting: (Node3IsInserted<=0)
states: 72,679 (4)
abstracting: (1<=Node1requestsent4)
states: 1,884 (3)
abstracting: (Node2GiveAnswer3<=Node3JoinMsg)
states: 95,643 (4)
abstracting: (1<=Node4WaitAnswer)
states: 34,269 (4)
abstracting: (Node2DHTinfo<=Node0IsInserted)
states: 97,526 (4)
abstracting: (Node0ResZone<=0)
states: 97,526 (4)
abstracting: (Node2Bootstrap<=1)
states: 97,527 (4)
abstracting: (1<=Node2ReadyToInsert)
states: 6,412 (3)
abstracting: (Node4Bootstrap<=Node1Request)
states: 91,531 (4)
abstracting: (1<=Node1NOshare)
states: 6,399 (3)
abstracting: (Node3IsNonInsertedNode<=1)
states: 97,527 (4)
abstracting: (Node3ResZone<=1)
states: 97,527 (4)
abstracting: (1<=Node1requestsent2)
states: 1,884 (3)
abstracting: (1<=Node3GiveAnswer2)
states: 1,884 (3)
abstracting: (Node0IsInserted<=0)
states: 72,679 (4)
abstracting: (Node0IsNonInsertedNode<=Node1requestsent3)
states: 91,276 (4)
abstracting: (Node1requestsent4<=Node0requestsent3)
states: 95,657 (4)
abstracting: (Node2IsInserted<=Node1ResZone)
states: 72,679 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node4NOshare<=1)
states: 97,527 (4)
abstracting: (Node3ID<=Node3requestsent4)
states: 97,526 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (1<=Node3GiveAnswer0)
states: 1,884 (3)
abstracting: (Node3JoinMsg<=Node2ReadyToInsert)
states: 91,531 (4)
abstracting: (Node0GiveAnswer2<=Node1NOshare)
states: 95,791 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: AG [[~ [[~ [Node1ID2<=InsertedCount] & [~ [[[[1<=Node2NOshare & Node3ResZone<=Node4GiveAnswer3] | ~ [Node0requestsent1<=0]] | [[1<=Node2DHTinfo2 & 1<=Node4IsNonInsertedNode] & ~ [1<=Node4requestsent3]]]] & [Node0IsInserted<=Node2GiveAnswer3 | [~ [[1<=InsertedCount | Node1GiveAnswer4<=Node0ReadyToInsert]] | [~ [Node1requestsent2<=1] & ~ [Node4requestsent2<=Node1requestsent0]]]]]]] & [~ [1<=Node1requestsent2] | [[Node3ID<=Node0GiveAnswer3 | ~ [[~ [Node4ID<=Node3Bootstrap] | [Node1Bootstrap<=Node3NOshare & [~ [1<=Node2IsInserted] | [1<=Node3NOshare & 1<=Node4requestsent1]]]]]] & [[~ [[[[Node2OKshare<=1 | Node3ID2<=1] | Node0OKshare<=Node1ResZone] & [[Node2NOshare<=1 & Node4requestsent1<=Node2requestsent3] | [Node2ID2<=Node0IsInserted & 1<=Node0ID]]]] | Node0requestsent2<=Node2NOshare] & ~ [[[[[Node3requestsent4<=Node2ID & Node4GiveAnswer1<=Node3GiveAnswer2] | ~ [Node3NOshare<=1]] | Node4Request<=0] & 1<=Node1ID]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [Node1ID2<=InsertedCount] & [~ [[[~ [1<=Node4requestsent3] & [1<=Node2DHTinfo2 & 1<=Node4IsNonInsertedNode]] | [[1<=Node2NOshare & Node3ResZone<=Node4GiveAnswer3] | ~ [Node0requestsent1<=0]]]] & [Node0IsInserted<=Node2GiveAnswer3 | [[~ [Node1requestsent2<=1] & ~ [Node4requestsent2<=Node1requestsent0]] | ~ [[1<=InsertedCount | Node1GiveAnswer4<=Node0ReadyToInsert]]]]]]] & [[[Node3ID<=Node0GiveAnswer3 | ~ [[[Node1Bootstrap<=Node3NOshare & [~ [1<=Node2IsInserted] | [1<=Node3NOshare & 1<=Node4requestsent1]]] | ~ [Node4ID<=Node3Bootstrap]]]] & [~ [[1<=Node1ID & [Node4Request<=0 | [[Node3requestsent4<=Node2ID & Node4GiveAnswer1<=Node3GiveAnswer2] | ~ [Node3NOshare<=1]]]]] & [Node0requestsent2<=Node2NOshare | ~ [[[[Node2NOshare<=1 & Node4requestsent1<=Node2requestsent3] | [Node2ID2<=Node0IsInserted & 1<=Node0ID]] & [Node0OKshare<=Node1ResZone | [Node2OKshare<=1 | Node3ID2<=1]]]]]]] | ~ [1<=Node1requestsent2]]]]]]
abstracting: (1<=Node1requestsent2)
states: 1,884 (3)
abstracting: (Node3ID2<=1)
states: 97,527 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node0OKshare<=Node1ResZone)
states: 91,128 (4)
abstracting: (1<=Node0ID)
states: 1
abstracting: (Node2ID2<=Node0IsInserted)
states: 93,012 (4)
abstracting: (Node4requestsent1<=Node2requestsent3)
states: 95,657 (4)
abstracting: (Node2NOshare<=1)
states: 97,527 (4)
abstracting: (Node0requestsent2<=Node2NOshare)
states: 95,643 (4)
abstracting: (Node3NOshare<=1)
states: 97,527 (4)
abstracting: (Node4GiveAnswer1<=Node3GiveAnswer2)
states: 95,657 (4)
abstracting: (Node3requestsent4<=Node2ID)
states: 95,643 (4)
abstracting: (Node4Request<=0)
states: 91,128 (4)
abstracting: (1<=Node1ID)
states: 1
abstracting: (Node4ID<=Node3Bootstrap)
states: 97,526 (4)
abstracting: (1<=Node4requestsent1)
states: 1,884 (3)
abstracting: (1<=Node3NOshare)
states: 6,399 (3)
abstracting: (1<=Node2IsInserted)
states: 24,848 (4)
abstracting: (Node1Bootstrap<=Node3NOshare)
states: 91,531 (4)
abstracting: (Node3ID<=Node0GiveAnswer3)
states: 97,526 (4)
abstracting: (Node1GiveAnswer4<=Node0ReadyToInsert)
states: 95,791 (4)
abstracting: (1<=InsertedCount)
states: 97,511 (4)
abstracting: (Node4requestsent2<=Node1requestsent0)
states: 95,657 (4)
abstracting: (Node1requestsent2<=1)
states: 97,527 (4)
abstracting: (Node0IsInserted<=Node2GiveAnswer3)
states: 72,879 (4)
abstracting: (Node0requestsent1<=0)
states: 95,643 (4)
abstracting: (Node3ResZone<=Node4GiveAnswer3)
states: 97,526 (4)
abstracting: (1<=Node2NOshare)
states: 6,399 (3)
abstracting: (1<=Node4IsNonInsertedNode)
states: 6,399 (3)
abstracting: (1<=Node2DHTinfo2)
states: 6,399 (3)
abstracting: (1<=Node4requestsent3)
states: 1,884 (3)
abstracting: (Node1ID2<=InsertedCount)
states: 97,527 (4)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.118sec
checking: AG [[[[[[Node0GiveAnswer2<=1 & [[[~ [1<=Node4requestsent2] & ~ [Node4DHTinfo<=0]] & [[Node4ReadyToInsert<=1 | 1<=Node2IsInserted] | [Node3requestsent4<=Node1ReadyToInsert | Node2Bootstrap<=Node4NOshare]]] & [~ [Node1requestsent3<=Node3JoinMsg] & [[1<=Node2GiveAnswer3 | 1<=Node3requestsent0] & [Node1Bootstrap<=Node1Bootstrap & Node2GiveAnswer4<=1]]]]] | ~ [[Node0NOshare<=Node2WaitAnswer | [1<=Node4DHTinfo2 | [[Node0requestsent1<=1 | Node2OKshare<=1] & ~ [Node4IsNonInsertedNode<=0]]]]]] | [~ [EmptyCAN<=1] | Node2GiveAnswer1<=Node0OKshare]] | [Node0GiveAnswer3<=Node4GiveAnswer1 | [[~ [[1<=Node3WaitAnswer | 1<=Node4ReadyToInsert]] | [[[[Node4ResZone<=Node2IsNonInsertedNode | Node3IsNonInsertedNode<=1] & [1<=Node3OKshare & Node0GiveAnswer4<=Node1requestsent3]] & [[Node4Bootstrap<=Node0OKshare | Node2IsInserted<=1] | [Node0GiveAnswer1<=0 & 1<=Node2IsInserted]]] | [[~ [Node4OKshare<=1] | ~ [Node3ID2<=0]] & [[Node1Bootstrap<=Node3requestsent4 | 1<=Node2IsNonInsertedNode] & ~ [Node1IsInserted<=0]]]]] & [[~ [[[1<=Node2NOshare & Node3ReadyToInsert<=1] & [Node0GiveAnswer4<=Node2Bootstrap | Node4ID<=Node1DHTinfo]]] & [Node1GiveAnswer0<=Node1IsNonInsertedNode | Node4ID<=1]] | 1<=Node0DHTinfo]]]] | 1<=Node4DHTinfo2]]
normalized: ~ [E [true U ~ [[1<=Node4DHTinfo2 | [[Node0GiveAnswer3<=Node4GiveAnswer1 | [[[[[~ [Node3ID2<=0] | ~ [Node4OKshare<=1]] & [~ [Node1IsInserted<=0] & [Node1Bootstrap<=Node3requestsent4 | 1<=Node2IsNonInsertedNode]]] | [[[Node4Bootstrap<=Node0OKshare | Node2IsInserted<=1] | [Node0GiveAnswer1<=0 & 1<=Node2IsInserted]] & [[Node4ResZone<=Node2IsNonInsertedNode | Node3IsNonInsertedNode<=1] & [1<=Node3OKshare & Node0GiveAnswer4<=Node1requestsent3]]]] | ~ [[1<=Node3WaitAnswer | 1<=Node4ReadyToInsert]]] & [1<=Node0DHTinfo | [~ [[[1<=Node2NOshare & Node3ReadyToInsert<=1] & [Node0GiveAnswer4<=Node2Bootstrap | Node4ID<=Node1DHTinfo]]] & [Node1GiveAnswer0<=Node1IsNonInsertedNode | Node4ID<=1]]]]] | [[~ [[Node0NOshare<=Node2WaitAnswer | [1<=Node4DHTinfo2 | [~ [Node4IsNonInsertedNode<=0] & [Node0requestsent1<=1 | Node2OKshare<=1]]]]] | [Node0GiveAnswer2<=1 & [[[[1<=Node2GiveAnswer3 | 1<=Node3requestsent0] & [Node1Bootstrap<=Node1Bootstrap & Node2GiveAnswer4<=1]] & ~ [Node1requestsent3<=Node3JoinMsg]] & [[~ [Node4DHTinfo<=0] & ~ [1<=Node4requestsent2]] & [[Node4ReadyToInsert<=1 | 1<=Node2IsInserted] | [Node3requestsent4<=Node1ReadyToInsert | Node2Bootstrap<=Node4NOshare]]]]]] | [Node2GiveAnswer1<=Node0OKshare | ~ [EmptyCAN<=1]]]]]]]]
abstracting: (EmptyCAN<=1)
states: 97,527 (4)
abstracting: (Node2GiveAnswer1<=Node0OKshare)
states: 95,791 (4)
abstracting: (Node2Bootstrap<=Node4NOshare)
states: 91,531 (4)
abstracting: (Node3requestsent4<=Node1ReadyToInsert)
states: 95,791 (4)
abstracting: (1<=Node2IsInserted)
states: 24,848 (4)
abstracting: (Node4ReadyToInsert<=1)
states: 97,527 (4)
abstracting: (1<=Node4requestsent2)
states: 1,884 (3)
abstracting: (Node4DHTinfo<=0)
states: 97,526 (4)
abstracting: (Node1requestsent3<=Node3JoinMsg)
states: 95,643 (4)
abstracting: (Node2GiveAnswer4<=1)
states: 97,527 (4)
abstracting: (Node1Bootstrap<=Node1Bootstrap)
states: 97,527 (4)
abstracting: (1<=Node3requestsent0)
states: 1,884 (3)
abstracting: (1<=Node2GiveAnswer3)
states: 1,884 (3)
abstracting: (Node0GiveAnswer2<=1)
states: 97,527 (4)
abstracting: (Node2OKshare<=1)
states: 97,527 (4)
abstracting: (Node0requestsent1<=1)
states: 97,527 (4)
abstracting: (Node4IsNonInsertedNode<=0)
states: 91,128 (4)
abstracting: (1<=Node4DHTinfo2)
states: 6,399 (3)
abstracting: (Node0NOshare<=Node2WaitAnswer)
states: 93,225 (4)
abstracting: (Node4ID<=1)
states: 97,527 (4)
abstracting: (Node1GiveAnswer0<=Node1IsNonInsertedNode)
states: 95,643 (4)
abstracting: (Node4ID<=Node1DHTinfo)
states: 97,526 (4)
abstracting: (Node0GiveAnswer4<=Node2Bootstrap)
states: 95,791 (4)
abstracting: (Node3ReadyToInsert<=1)
states: 97,527 (4)
abstracting: (1<=Node2NOshare)
states: 6,399 (3)
abstracting: (1<=Node0DHTinfo)
states: 1
abstracting: (1<=Node4ReadyToInsert)
states: 6,412 (3)
abstracting: (1<=Node3WaitAnswer)
states: 34,269 (4)
abstracting: (Node0GiveAnswer4<=Node1requestsent3)
states: 95,657 (4)
abstracting: (1<=Node3OKshare)
states: 6,399 (3)
abstracting: (Node3IsNonInsertedNode<=1)
states: 97,527 (4)
abstracting: (Node4ResZone<=Node2IsNonInsertedNode)
states: 97,526 (4)
abstracting: (1<=Node2IsInserted)
states: 24,848 (4)
abstracting: (Node0GiveAnswer1<=0)
states: 95,643 (4)
abstracting: (Node2IsInserted<=1)
states: 97,527 (4)
abstracting: (Node4Bootstrap<=Node0OKshare)
states: 91,531 (4)
abstracting: (1<=Node2IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node1Bootstrap<=Node3requestsent4)
states: 91,276 (4)
abstracting: (Node1IsInserted<=0)
states: 72,679 (4)
abstracting: (Node4OKshare<=1)
states: 97,527 (4)
abstracting: (Node3ID2<=0)
states: 91,128 (4)
abstracting: (Node0GiveAnswer3<=Node4GiveAnswer1)
states: 95,657 (4)
abstracting: (1<=Node4DHTinfo2)
states: 6,399 (3)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.135sec
checking: AG [[~ [[[[~ [[[[Node2ReadyToInsert<=Node2NOshare & 1<=Node2GiveAnswer4] | [Node2Request<=0 & Node4requestsent1<=0]] & [[1<=Node3Bootstrap & 1<=Node4ResZone] | 1<=Node1Bootstrap]]] | [~ [1<=Node4GiveAnswer0] & [[[Node1GiveAnswer3<=0 & Node3requestsent4<=Node4Bootstrap] & 1<=Node0Request] | [[Node2GiveAnswer3<=0 & Node1requestsent4<=Node2JoinMsg] | [Node2ResZone<=Node4NOshare & Node1requestsent3<=Node4requestsent0]]]]] & [~ [Node0DHTinfo2<=1] & [[~ [[Node0OKshare<=0 & Node2GiveAnswer4<=Node2Bootstrap]] | [~ [Node4requestsent0<=1] | [Node0NOshare<=1 & 1<=Node1GiveAnswer2]]] & Node1requestsent0<=1]]] | ~ [[~ [[~ [Node3IsInserted<=1] & [Node4requestsent0<=1 & Node4ID2<=0]]] | Node4WaitAnswer<=0]]]] & [[[[[[[~ [1<=Node3IsInserted] & [1<=Node2requestsent1 & Node1requestsent2<=1]] & Node4requestsent0<=Node4ID] | [Node1ID2<=Node4ID2 | Node4ReadyToInsert<=Node2requestsent1]] | Node4requestsent0<=Node4ID2] | Node2GiveAnswer0<=1] | ~ [[[[~ [Node3Bootstrap<=Node1ResZone] | ~ [[1<=Node3OKshare | Node4GiveAnswer1<=1]]] & ~ [Node1GiveAnswer2<=Node2ID2]] | ~ [[Node0IsInserted<=Node0ID2 & [Node4GiveAnswer3<=Node4Request & Node0GiveAnswer2<=1]]]]]] | [[[Node2GiveAnswer0<=1 & Node2requestsent3<=Node3JoinMsg] & [[1<=Node4OKshare | 1<=Node2ID2] | [[[[1<=Node1IsNonInsertedNode & Node1DHTinfo2<=0] & ~ [Node2requestsent1<=Node1OKshare]] | Node3ResZone<=0] & [1<=Node2requestsent0 | [[Node1NOshare<=Node3DHTinfo2 | Node4IsInserted<=Node0ResZone] | ~ [1<=Node1ID2]]]]]] & ~ [[[Node2GiveAnswer3<=1 & ~ [[~ [1<=Node0ResZone] & [Node1ReadyToInsert<=0 | Node1ID<=0]]]] & ~ [Node1ResZone<=Node0OKshare]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [Node1ResZone<=Node0OKshare] & [Node2GiveAnswer3<=1 & ~ [[[Node1ReadyToInsert<=0 | Node1ID<=0] & ~ [1<=Node0ResZone]]]]]] & [[[[1<=Node2requestsent0 | [~ [1<=Node1ID2] | [Node1NOshare<=Node3DHTinfo2 | Node4IsInserted<=Node0ResZone]]] & [Node3ResZone<=0 | [~ [Node2requestsent1<=Node1OKshare] & [1<=Node1IsNonInsertedNode & Node1DHTinfo2<=0]]]] | [1<=Node4OKshare | 1<=Node2ID2]] & [Node2GiveAnswer0<=1 & Node2requestsent3<=Node3JoinMsg]]] | [~ [[~ [[Node0IsInserted<=Node0ID2 & [Node4GiveAnswer3<=Node4Request & Node0GiveAnswer2<=1]]] | [~ [Node1GiveAnswer2<=Node2ID2] & [~ [[1<=Node3OKshare | Node4GiveAnswer1<=1]] | ~ [Node3Bootstrap<=Node1ResZone]]]]] | [Node2GiveAnswer0<=1 | [Node4requestsent0<=Node4ID2 | [[Node1ID2<=Node4ID2 | Node4ReadyToInsert<=Node2requestsent1] | [Node4requestsent0<=Node4ID & [[1<=Node2requestsent1 & Node1requestsent2<=1] & ~ [1<=Node3IsInserted]]]]]]]] & ~ [[~ [[Node4WaitAnswer<=0 | ~ [[[Node4requestsent0<=1 & Node4ID2<=0] & ~ [Node3IsInserted<=1]]]]] | [[[Node1requestsent0<=1 & [[[Node0NOshare<=1 & 1<=Node1GiveAnswer2] | ~ [Node4requestsent0<=1]] | ~ [[Node0OKshare<=0 & Node2GiveAnswer4<=Node2Bootstrap]]]] & ~ [Node0DHTinfo2<=1]] & [[[[[Node2ResZone<=Node4NOshare & Node1requestsent3<=Node4requestsent0] | [Node2GiveAnswer3<=0 & Node1requestsent4<=Node2JoinMsg]] | [1<=Node0Request & [Node1GiveAnswer3<=0 & Node3requestsent4<=Node4Bootstrap]]] & ~ [1<=Node4GiveAnswer0]] | ~ [[[1<=Node1Bootstrap | [1<=Node3Bootstrap & 1<=Node4ResZone]] & [[Node2Request<=0 & Node4requestsent1<=0] | [Node2ReadyToInsert<=Node2NOshare & 1<=Node2GiveAnswer4]]]]]]]]]]]]
abstracting: (1<=Node2GiveAnswer4)
states: 1,884 (3)
abstracting: (Node2ReadyToInsert<=Node2NOshare)
states: 91,115 (4)
abstracting: (Node4requestsent1<=0)
states: 95,643 (4)
abstracting: (Node2Request<=0)
states: 91,128 (4)
abstracting: (1<=Node4ResZone)
states: 1
abstracting: (1<=Node3Bootstrap)
states: 6,399 (3)
abstracting: (1<=Node1Bootstrap)
states: 6,399 (3)
abstracting: (1<=Node4GiveAnswer0)
states: 1,884 (3)
abstracting: (Node3requestsent4<=Node4Bootstrap)
states: 95,643 (4)
abstracting: (Node1GiveAnswer3<=0)
states: 95,643 (4)
abstracting: (1<=Node0Request)
states: 6,399 (3)
abstracting: (Node1requestsent4<=Node2JoinMsg)
states: 95,791 (4)
abstracting: (Node2GiveAnswer3<=0)
states: 95,643 (4)
abstracting: (Node1requestsent3<=Node4requestsent0)
states: 95,657 (4)
abstracting: (Node2ResZone<=Node4NOshare)
states: 97,526 (4)
abstracting: (Node0DHTinfo2<=1)
states: 97,527 (4)
abstracting: (Node2GiveAnswer4<=Node2Bootstrap)
states: 95,643 (4)
abstracting: (Node0OKshare<=0)
states: 91,128 (4)
abstracting: (Node4requestsent0<=1)
states: 97,527 (4)
abstracting: (1<=Node1GiveAnswer2)
states: 1,884 (3)
abstracting: (Node0NOshare<=1)
states: 97,527 (4)
abstracting: (Node1requestsent0<=1)
states: 97,527 (4)
abstracting: (Node3IsInserted<=1)
states: 97,527 (4)
abstracting: (Node4ID2<=0)
states: 91,128 (4)
abstracting: (Node4requestsent0<=1)
states: 97,527 (4)
abstracting: (Node4WaitAnswer<=0)
states: 63,258 (4)
abstracting: (1<=Node3IsInserted)
states: 24,848 (4)
abstracting: (Node1requestsent2<=1)
states: 97,527 (4)
abstracting: (1<=Node2requestsent1)
states: 1,884 (3)
abstracting: (Node4requestsent0<=Node4ID)
states: 95,643 (4)
abstracting: (Node4ReadyToInsert<=Node2requestsent1)
states: 91,263 (4)
abstracting: (Node1ID2<=Node4ID2)
states: 91,531 (4)
abstracting: (Node4requestsent0<=Node4ID2)
states: 95,643 (4)
abstracting: (Node2GiveAnswer0<=1)
states: 97,527 (4)
abstracting: (Node3Bootstrap<=Node1ResZone)
states: 91,128 (4)
abstracting: (Node4GiveAnswer1<=1)
states: 97,527 (4)
abstracting: (1<=Node3OKshare)
states: 6,399 (3)
abstracting: (Node1GiveAnswer2<=Node2ID2)
states: 95,643 (4)
abstracting: (Node0GiveAnswer2<=1)
states: 97,527 (4)
abstracting: (Node4GiveAnswer3<=Node4Request)
states: 95,643 (4)
abstracting: (Node0IsInserted<=Node0ID2)
states: 72,679 (4)
abstracting: (Node2requestsent3<=Node3JoinMsg)
states: 95,643 (4)
abstracting: (Node2GiveAnswer0<=1)
states: 97,527 (4)
abstracting: (1<=Node2ID2)
states: 6,399 (3)
abstracting: (1<=Node4OKshare)
states: 6,399 (3)
abstracting: (Node1DHTinfo2<=0)
states: 91,128 (4)
abstracting: (1<=Node1IsNonInsertedNode)
states: 6,399 (3)
abstracting: (Node2requestsent1<=Node1OKshare)
states: 95,643 (4)
abstracting: (Node3ResZone<=0)
states: 97,526 (4)
abstracting: (Node4IsInserted<=Node0ResZone)
states: 72,679 (4)
abstracting: (Node1NOshare<=Node3DHTinfo2)
states: 91,531 (4)
abstracting: (1<=Node1ID2)
states: 6,399 (3)
abstracting: (1<=Node2requestsent0)
states: 1,884 (3)
abstracting: (1<=Node0ResZone)
states: 1
abstracting: (Node1ID<=0)
states: 97,526 (4)
abstracting: (Node1ReadyToInsert<=0)
states: 91,115 (4)
abstracting: (Node2GiveAnswer3<=1)
states: 97,527 (4)
abstracting: (Node1ResZone<=Node0OKshare)
states: 97,526 (4)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.100sec
totally nodes used: 536180 (5.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 787320 3768027 4555347
used/not used/entry size/cache size: 3930479 63178385 16 1024MB
basic ops cache: hits/miss/sum: 378080 1847709 2225789
used/not used/entry size/cache size: 2349750 14427466 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: 44119 176796 220915
used/not used/entry size/cache size: 175175 8213433 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 66640613
1 409861
2 49982
3 7394
4 909
5 93
6 12
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.585sec
BK_STOP 1678736037940
--------------------
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:7211 (51), effective:289 (2)
initing FirstDep: 0m 0.000sec
iterations count:1042 (7), effective:29 (0)
iterations count:1403 (10), effective:60 (0)
iterations count:2213 (15), effective:93 (0)
iterations count:1535 (10), effective:65 (0)
iterations count:1422 (10), effective:57 (0)
iterations count:2181 (15), effective:85 (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="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 CANConstruction-PT-005, 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 r042-tajo-167813696000614"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;