Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863541200606.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Peterson-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200606
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679188733900

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=Peterson-PT-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 01:18:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 01:18:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:18:57] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-19 01:18:57] [INFO ] Transformed 102 places.
[2023-03-19 01:18:57] [INFO ] Transformed 126 transitions.
[2023-03-19 01:18:57] [INFO ] Found NUPN structural information;
[2023-03-19 01:18:57] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-2-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 943 ms. (steps per millisecond=10 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 12) seen :1
FORMULA Peterson-PT-2-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Probably explored full state space saw : 20754 states, properties seen :2
Probabilistic random walk after 83016 steps, saw 20754 distinct states, run finished after 994 ms. (steps per millisecond=83 ) properties seen :2
FORMULA Peterson-PT-2-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 20754 states, properties seen :0
Exhaustive walk after 83016 steps, saw 20754 distinct states, run finished after 980 ms. (steps per millisecond=84 ) properties seen :0
FORMULA Peterson-PT-2-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Peterson-PT-2-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 5295 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: Peterson_PT_2
(NrP: 102 NrTr: 126 NrArc: 384)

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

net check time: 0m 0.000sec

init dd package: 0m 3.481sec


RS generation: 0m 0.267sec


-> reachability set: #nodes 3632 (3.6e+03) #states 20,754 (4)



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

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

abstracting: (TestIdentity_2_0_1<=1)
states: 20,754 (4)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=TestAlone_1_1_2)
states: 196
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.395sec

checking: AG [IsEndLoop_2_0_1<=Turn_1_0]
normalized: ~ [E [true U ~ [IsEndLoop_2_0_1<=Turn_1_0]]]

abstracting: (IsEndLoop_2_0_1<=Turn_1_0)
states: 20,344 (4)
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: AG [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=52]
normalized: ~ [E [true U ~ [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=52]]]

abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=52)
states: 20,754 (4)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AG [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=75]
normalized: ~ [E [true U ~ [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=75]]]

abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=75)
states: 20,754 (4)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=48]
normalized: ~ [E [true U ~ [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=48]]]

abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=48)
states: 20,754 (4)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: AG [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=66]
normalized: ~ [E [true U ~ [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=66]]]

abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=66)
states: 20,754 (4)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [12<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]
normalized: E [true U 12<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]

abstracting: (12<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 0
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.624sec

checking: EF [95<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]
normalized: E [true U 95<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]

abstracting: (95<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 0
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.629sec

checking: AG [[[~ [[[~ [[[[1<=TestIdentity_2_0_1 | TestIdentity_2_0_0<=IsEndLoop_0_1_1] & [1<=BeginLoop_2_0_1 & 1<=BeginLoop_0_0_2]] & WantSection_2_F<=0]] | ~ [[~ [1<=TestIdentity_0_1_2] | ~ [1<=BeginLoop_1_0_0]]]] | BeginLoop_0_0_2<=0]] | [~ [[TestAlone_2_0_1<=AskForSection_1_1 & TestIdentity_2_0_0<=TestAlone_0_0_2]] & [~ [[~ [[1<=TestIdentity_0_0_2 | 1<=WantSection_1_T]] & [TestIdentity_1_1_1<=BeginLoop_2_0_0 | [Turn_1_2<=1 & BeginLoop_2_1_1<=IsEndLoop_1_0_1]]]] & EndTurn_0_1<=EndTurn_1_0]]] | [TestIdentity_2_0_2<=TestIdentity_0_1_0 | AskForSection_1_1<=1]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [[~ [1<=BeginLoop_1_0_0] | ~ [1<=TestIdentity_0_1_2]]] | ~ [[[[1<=BeginLoop_2_0_1 & 1<=BeginLoop_0_0_2] & [1<=TestIdentity_2_0_1 | TestIdentity_2_0_0<=IsEndLoop_0_1_1]] & WantSection_2_F<=0]]] | BeginLoop_0_0_2<=0]] | [[~ [[[[Turn_1_2<=1 & BeginLoop_2_1_1<=IsEndLoop_1_0_1] | TestIdentity_1_1_1<=BeginLoop_2_0_0] & ~ [[1<=TestIdentity_0_0_2 | 1<=WantSection_1_T]]]] & EndTurn_0_1<=EndTurn_1_0] & ~ [[TestAlone_2_0_1<=AskForSection_1_1 & TestIdentity_2_0_0<=TestAlone_0_0_2]]]] | [TestIdentity_2_0_2<=TestIdentity_0_1_0 | AskForSection_1_1<=1]]]]]

abstracting: (AskForSection_1_1<=1)
states: 20,754 (4)
abstracting: (TestIdentity_2_0_2<=TestIdentity_0_1_0)
states: 20,129 (4)
abstracting: (TestIdentity_2_0_0<=TestAlone_0_0_2)
states: 18,908 (4)
abstracting: (TestAlone_2_0_1<=AskForSection_1_1)
states: 19,949 (4)
abstracting: (EndTurn_0_1<=EndTurn_1_0)
states: 20,658 (4)
abstracting: (1<=WantSection_1_T)
states: 19,678 (4)
abstracting: (1<=TestIdentity_0_0_2)
states: 484
abstracting: (TestIdentity_1_1_1<=BeginLoop_2_0_0)
states: 20,583 (4)
abstracting: (BeginLoop_2_1_1<=IsEndLoop_1_0_1)
states: 20,516 (4)
abstracting: (Turn_1_2<=1)
states: 20,754 (4)
abstracting: (BeginLoop_0_0_2<=0)
states: 20,270 (4)
abstracting: (WantSection_2_F<=0)
states: 19,902 (4)
abstracting: (TestIdentity_2_0_0<=IsEndLoop_0_1_1)
states: 18,878 (4)
abstracting: (1<=TestIdentity_2_0_1)
states: 832
abstracting: (1<=BeginLoop_0_0_2)
states: 484
abstracting: (1<=BeginLoop_2_0_1)
states: 832
abstracting: (1<=TestIdentity_0_1_2)
states: 100
abstracting: (1<=BeginLoop_1_0_0)
states: 1,986 (3)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [[[~ [1<=EndTurn_2_1] | ~ [[~ [1<=TestIdentity_1_1_0] | ~ [TestAlone_1_0_0<=IsEndLoop_2_1_1]]]] | [TestAlone_1_1_2<=IsEndLoop_1_0_2 & [[[BeginLoop_1_1_1<=1 & ~ [[[[1<=Idle_1 | IsEndLoop_2_0_2<=TestAlone_1_0_2] | ~ [WantSection_0_T<=0]] | ~ [[TestIdentity_1_0_2<=1 | EndTurn_1_1<=1]]]]] & [[1<=BeginLoop_0_1_1 | [BeginLoop_1_1_2<=TestAlone_0_1_1 | [[TestIdentity_2_1_2<=WantSection_2_F | 1<=TestIdentity_0_1_1] | [1<=EndTurn_0_1 & TestIdentity_1_0_2<=0]]]] | ~ [1<=WantSection_1_F]]] | [AskForSection_1_0<=1 & [[[[~ [1<=TestTurn_1_1] | TestIdentity_2_0_1<=1] & ~ [[1<=TestTurn_2_1 | EndTurn_2_0<=0]]] & [TestIdentity_2_0_1<=0 & 1<=TestIdentity_1_1_0]] | [TestTurn_2_0<=0 | [~ [1<=BeginLoop_2_1_1] | [[1<=TestIdentity_0_1_0 | 1<=TestAlone_1_0_2] | ~ [IsEndLoop_2_0_0<=CS_0]]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [1<=TestIdentity_1_1_0] | ~ [TestAlone_1_0_0<=IsEndLoop_2_1_1]]] | ~ [1<=EndTurn_2_1]] | [TestAlone_1_1_2<=IsEndLoop_1_0_2 & [[AskForSection_1_0<=1 & [[[~ [[1<=TestTurn_2_1 | EndTurn_2_0<=0]] & [TestIdentity_2_0_1<=1 | ~ [1<=TestTurn_1_1]]] & [TestIdentity_2_0_1<=0 & 1<=TestIdentity_1_1_0]] | [TestTurn_2_0<=0 | [[~ [IsEndLoop_2_0_0<=CS_0] | [1<=TestIdentity_0_1_0 | 1<=TestAlone_1_0_2]] | ~ [1<=BeginLoop_2_1_1]]]]] | [[~ [1<=WantSection_1_F] | [1<=BeginLoop_0_1_1 | [BeginLoop_1_1_2<=TestAlone_0_1_1 | [[1<=EndTurn_0_1 & TestIdentity_1_0_2<=0] | [TestIdentity_2_1_2<=WantSection_2_F | 1<=TestIdentity_0_1_1]]]]] & [BeginLoop_1_1_1<=1 & ~ [[[~ [WantSection_0_T<=0] | [1<=Idle_1 | IsEndLoop_2_0_2<=TestAlone_1_0_2]] | ~ [[TestIdentity_1_0_2<=1 | EndTurn_1_1<=1]]]]]]]]]]]]

abstracting: (EndTurn_1_1<=1)
states: 20,754 (4)
abstracting: (TestIdentity_1_0_2<=1)
states: 20,754 (4)
abstracting: (IsEndLoop_2_0_2<=TestAlone_1_0_2)
states: 20,152 (4)
abstracting: (1<=Idle_1)
states: 1,076 (3)
abstracting: (WantSection_0_T<=0)
states: 1,300 (3)
abstracting: (BeginLoop_1_1_1<=1)
states: 20,754 (4)
abstracting: (1<=TestIdentity_0_1_1)
states: 276
abstracting: (TestIdentity_2_1_2<=WantSection_2_F)
states: 20,507 (4)
abstracting: (TestIdentity_1_0_2<=0)
states: 20,012 (4)
abstracting: (1<=EndTurn_0_1)
states: 100
abstracting: (BeginLoop_1_1_2<=TestAlone_0_1_1)
states: 20,562 (4)
abstracting: (1<=BeginLoop_0_1_1)
states: 276
abstracting: (1<=WantSection_1_F)
states: 1,076 (3)
abstracting: (1<=BeginLoop_2_1_1)
states: 247
abstracting: (1<=TestAlone_1_0_2)
states: 742
abstracting: (1<=TestIdentity_0_1_0)
states: 276
abstracting: (IsEndLoop_2_0_0<=CS_0)
states: 19,922 (4)
abstracting: (TestTurn_2_0<=0)
states: 18,862 (4)
abstracting: (1<=TestIdentity_1_1_0)
states: 398
abstracting: (TestIdentity_2_0_1<=0)
states: 19,922 (4)
abstracting: (1<=TestTurn_1_1)
states: 398
abstracting: (TestIdentity_2_0_1<=1)
states: 20,754 (4)
abstracting: (EndTurn_2_0<=0)
states: 19,994 (4)
abstracting: (1<=TestTurn_2_1)
states: 412
abstracting: (AskForSection_1_0<=1)
states: 20,754 (4)
abstracting: (TestAlone_1_1_2<=IsEndLoop_1_0_2)
states: 20,558 (4)
abstracting: (1<=EndTurn_2_1)
states: 247
abstracting: (TestAlone_1_0_0<=IsEndLoop_2_1_1)
states: 18,797 (4)
abstracting: (1<=TestIdentity_1_1_0)
states: 398
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [[~ [1<=BeginLoop_2_1_2] | [~ [[[[CS_0<=1 & [[1<=IsEndLoop_1_1_0 | IsEndLoop_0_0_1<=1] | [TestIdentity_0_0_1<=TestTurn_0_0 & TestIdentity_1_1_1<=0]]] & [[[1<=WantSection_1_F & TestIdentity_1_0_1<=0] | [TestIdentity_0_0_0<=1 & IsEndLoop_0_1_0<=TestIdentity_2_1_1]] & 1<=TestIdentity_1_0_2]] & TestAlone_2_1_0<=BeginLoop_0_0_1]] | [[[[~ [[IsEndLoop_0_0_0<=TestIdentity_0_1_0 | IsEndLoop_1_1_0<=WantSection_1_F]] & IsEndLoop_0_1_0<=0] | 1<=TestTurn_1_0] | [[Turn_1_1<=BeginLoop_1_1_1 & [[[1<=TestIdentity_2_1_0 | 1<=TestAlone_2_0_0] | [AskForSection_2_1<=BeginLoop_1_0_2 | Turn_1_0<=0]] | [~ [AskForSection_2_1<=TestIdentity_1_0_0] | 1<=Turn_1_1]]] | [1<=TestIdentity_1_0_2 | [EndTurn_0_1<=1 & ~ [IsEndLoop_1_1_1<=0]]]]] | [~ [[[[1<=TestIdentity_0_1_0 | [1<=AskForSection_2_0 & IsEndLoop_1_0_1<=TestIdentity_2_1_0]] & 1<=BeginLoop_0_0_0] & ~ [[[TestAlone_0_0_2<=1 | Turn_0_1<=1] & [TestIdentity_0_1_0<=TestTurn_0_0 & 1<=BeginLoop_2_0_1]]]]] | TestTurn_0_0<=1]]]]]
normalized: ~ [E [true U ~ [[[[[TestTurn_0_0<=1 | ~ [[~ [[[TestIdentity_0_1_0<=TestTurn_0_0 & 1<=BeginLoop_2_0_1] & [TestAlone_0_0_2<=1 | Turn_0_1<=1]]] & [1<=BeginLoop_0_0_0 & [1<=TestIdentity_0_1_0 | [1<=AskForSection_2_0 & IsEndLoop_1_0_1<=TestIdentity_2_1_0]]]]]] | [[[1<=TestIdentity_1_0_2 | [EndTurn_0_1<=1 & ~ [IsEndLoop_1_1_1<=0]]] | [Turn_1_1<=BeginLoop_1_1_1 & [[1<=Turn_1_1 | ~ [AskForSection_2_1<=TestIdentity_1_0_0]] | [[AskForSection_2_1<=BeginLoop_1_0_2 | Turn_1_0<=0] | [1<=TestIdentity_2_1_0 | 1<=TestAlone_2_0_0]]]]] | [1<=TestTurn_1_0 | [IsEndLoop_0_1_0<=0 & ~ [[IsEndLoop_0_0_0<=TestIdentity_0_1_0 | IsEndLoop_1_1_0<=WantSection_1_F]]]]]] | ~ [[TestAlone_2_1_0<=BeginLoop_0_0_1 & [[1<=TestIdentity_1_0_2 & [[TestIdentity_0_0_0<=1 & IsEndLoop_0_1_0<=TestIdentity_2_1_1] | [1<=WantSection_1_F & TestIdentity_1_0_1<=0]]] & [CS_0<=1 & [[TestIdentity_0_0_1<=TestTurn_0_0 & TestIdentity_1_1_1<=0] | [1<=IsEndLoop_1_1_0 | IsEndLoop_0_0_1<=1]]]]]]] | ~ [1<=BeginLoop_2_1_2]]]]]

abstracting: (1<=BeginLoop_2_1_2)
states: 247
abstracting: (IsEndLoop_0_0_1<=1)
states: 20,754 (4)
abstracting: (1<=IsEndLoop_1_1_0)
states: 196
abstracting: (TestIdentity_1_1_1<=0)
states: 20,558 (4)
abstracting: (TestIdentity_0_0_1<=TestTurn_0_0)
states: 18,992 (4)
abstracting: (CS_0<=1)
states: 20,754 (4)
abstracting: (TestIdentity_1_0_1<=0)
states: 20,012 (4)
abstracting: (1<=WantSection_1_F)
states: 1,076 (3)
abstracting: (IsEndLoop_0_1_0<=TestIdentity_2_1_1)
states: 20,482 (4)
abstracting: (TestIdentity_0_0_0<=1)
states: 20,754 (4)
abstracting: (1<=TestIdentity_1_0_2)
states: 742
abstracting: (TestAlone_2_1_0<=BeginLoop_0_0_1)
states: 20,380 (4)
abstracting: (IsEndLoop_1_1_0<=WantSection_1_F)
states: 20,558 (4)
abstracting: (IsEndLoop_0_0_0<=TestIdentity_0_1_0)
states: 18,992 (4)
abstracting: (IsEndLoop_0_1_0<=0)
states: 20,478 (4)
abstracting: (1<=TestTurn_1_0)
states: 1,986 (3)
abstracting: (1<=TestAlone_2_0_0)
states: 1,892 (3)
abstracting: (1<=TestIdentity_2_1_0)
states: 412
abstracting: (Turn_1_0<=0)
states: 14,414 (4)
abstracting: (AskForSection_2_1<=BeginLoop_1_0_2)
states: 20,021 (4)
abstracting: (AskForSection_2_1<=TestIdentity_1_0_0)
states: 20,077 (4)
abstracting: (1<=Turn_1_1)
states: 6,924 (3)
abstracting: (Turn_1_1<=BeginLoop_1_1_1)
states: 13,970 (4)
abstracting: (IsEndLoop_1_1_1<=0)
states: 20,558 (4)
abstracting: (EndTurn_0_1<=1)
states: 20,754 (4)
abstracting: (1<=TestIdentity_1_0_2)
states: 742
abstracting: (IsEndLoop_1_0_1<=TestIdentity_2_1_0)
states: 20,021 (4)
abstracting: (1<=AskForSection_2_0)
states: 852
abstracting: (1<=TestIdentity_0_1_0)
states: 276
abstracting: (1<=BeginLoop_0_0_0)
states: 1,762 (3)
abstracting: (Turn_0_1<=1)
states: 20,754 (4)
abstracting: (TestAlone_0_0_2<=1)
states: 20,754 (4)
abstracting: (1<=BeginLoop_2_0_1)
states: 832
abstracting: (TestIdentity_0_1_0<=TestTurn_0_0)
states: 20,478 (4)
abstracting: (TestTurn_0_0<=1)
states: 20,754 (4)
-> the formula is TRUE

FORMULA Peterson-PT-2-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EF [~ [[[[~ [[~ [1<=EndTurn_0_0] & TestTurn_2_0<=TestIdentity_2_1_0]] | [[[[1<=TestAlone_1_0_2 & IsEndLoop_2_0_1<=Turn_0_0] & [TestAlone_0_0_1<=1 | 1<=IsEndLoop_1_0_1]] | [[IsEndLoop_2_1_1<=0 & IsEndLoop_0_1_0<=1] | [1<=TestIdentity_0_0_0 | 1<=TestTurn_1_1]]] & [~ [EndTurn_0_0<=AskForSection_0_0] | [[EndTurn_1_1<=1 | WantSection_1_T<=BeginLoop_0_0_2] & [BeginLoop_2_1_1<=BeginLoop_0_0_1 & TestIdentity_0_0_2<=EndTurn_0_0]]]]] | TestAlone_2_1_1<=TestTurn_2_1] | [[[~ [[[IsEndLoop_2_1_0<=TestAlone_2_0_0 & 1<=Idle_1] & ~ [TestTurn_0_0<=1]]] | ~ [1<=TestIdentity_2_1_2]] | [~ [[[1<=WantSection_2_T | 1<=TestIdentity_0_1_1] & [1<=Turn_0_1 & 1<=Idle_0]]] & Turn_1_2<=1]] | [[[~ [[1<=IsEndLoop_0_0_2 | TestAlone_1_1_2<=IsEndLoop_2_0_2]] & ~ [1<=TestAlone_2_0_1]] & [[~ [EndTurn_2_0<=IsEndLoop_1_0_2] | [TestIdentity_1_1_1<=Idle_2 & TestIdentity_2_0_1<=1]] & ~ [IsEndLoop_1_0_0<=IsEndLoop_1_1_0]]] | [BeginLoop_0_1_2<=Turn_0_0 & [1<=Turn_1_1 | IsEndLoop_2_1_0<=BeginLoop_2_1_0]]]]]]]
normalized: E [true U ~ [[[[[BeginLoop_0_1_2<=Turn_0_0 & [1<=Turn_1_1 | IsEndLoop_2_1_0<=BeginLoop_2_1_0]] | [[~ [IsEndLoop_1_0_0<=IsEndLoop_1_1_0] & [[TestIdentity_1_1_1<=Idle_2 & TestIdentity_2_0_1<=1] | ~ [EndTurn_2_0<=IsEndLoop_1_0_2]]] & [~ [1<=TestAlone_2_0_1] & ~ [[1<=IsEndLoop_0_0_2 | TestAlone_1_1_2<=IsEndLoop_2_0_2]]]]] | [[Turn_1_2<=1 & ~ [[[1<=Turn_0_1 & 1<=Idle_0] & [1<=WantSection_2_T | 1<=TestIdentity_0_1_1]]]] | [~ [1<=TestIdentity_2_1_2] | ~ [[~ [TestTurn_0_0<=1] & [IsEndLoop_2_1_0<=TestAlone_2_0_0 & 1<=Idle_1]]]]]] | [TestAlone_2_1_1<=TestTurn_2_1 | [[[[[BeginLoop_2_1_1<=BeginLoop_0_0_1 & TestIdentity_0_0_2<=EndTurn_0_0] & [EndTurn_1_1<=1 | WantSection_1_T<=BeginLoop_0_0_2]] | ~ [EndTurn_0_0<=AskForSection_0_0]] & [[[1<=TestIdentity_0_0_0 | 1<=TestTurn_1_1] | [IsEndLoop_2_1_1<=0 & IsEndLoop_0_1_0<=1]] | [[TestAlone_0_0_1<=1 | 1<=IsEndLoop_1_0_1] & [1<=TestAlone_1_0_2 & IsEndLoop_2_0_1<=Turn_0_0]]]] | ~ [[TestTurn_2_0<=TestIdentity_2_1_0 & ~ [1<=EndTurn_0_0]]]]]]]]

abstracting: (1<=EndTurn_0_0)
states: 508
abstracting: (TestTurn_2_0<=TestIdentity_2_1_0)
states: 18,862 (4)
abstracting: (IsEndLoop_2_0_1<=Turn_0_0)
states: 20,492 (4)
abstracting: (1<=TestAlone_1_0_2)
states: 742
abstracting: (1<=IsEndLoop_1_0_1)
states: 742
abstracting: (TestAlone_0_0_1<=1)
states: 20,754 (4)
abstracting: (IsEndLoop_0_1_0<=1)
states: 20,754 (4)
abstracting: (IsEndLoop_2_1_1<=0)
states: 20,507 (4)
abstracting: (1<=TestTurn_1_1)
states: 398
abstracting: (1<=TestIdentity_0_0_0)
states: 1,762 (3)
abstracting: (EndTurn_0_0<=AskForSection_0_0)
states: 20,246 (4)
abstracting: (WantSection_1_T<=BeginLoop_0_0_2)
states: 1,486 (3)
abstracting: (EndTurn_1_1<=1)
states: 20,754 (4)
abstracting: (TestIdentity_0_0_2<=EndTurn_0_0)
states: 20,270 (4)
abstracting: (BeginLoop_2_1_1<=BeginLoop_0_0_1)
states: 20,530 (4)
abstracting: (TestAlone_2_1_1<=TestTurn_2_1)
states: 20,507 (4)
abstracting: (1<=Idle_1)
states: 1,076 (3)
abstracting: (IsEndLoop_2_1_0<=TestAlone_2_0_0)
states: 20,507 (4)
abstracting: (TestTurn_0_0<=1)
states: 20,754 (4)
abstracting: (1<=TestIdentity_2_1_2)
states: 247
abstracting: (1<=TestIdentity_0_1_1)
states: 276
abstracting: (1<=WantSection_2_T)
states: 19,902 (4)
abstracting: (1<=Idle_0)
states: 1,300 (3)
abstracting: (1<=Turn_0_1)
states: 6,088 (3)
abstracting: (Turn_1_2<=1)
states: 20,754 (4)
abstracting: (TestAlone_1_1_2<=IsEndLoop_2_0_2)
states: 20,558 (4)
abstracting: (1<=IsEndLoop_0_0_2)
states: 236
abstracting: (1<=TestAlone_2_0_1)
states: 832
abstracting: (EndTurn_2_0<=IsEndLoop_1_0_2)
states: 20,015 (4)
abstracting: (TestIdentity_2_0_1<=1)
states: 20,754 (4)
abstracting: (TestIdentity_1_1_1<=Idle_2)
states: 20,567 (4)
abstracting: (IsEndLoop_1_0_0<=IsEndLoop_1_1_0)
states: 20,012 (4)
abstracting: (IsEndLoop_2_1_0<=BeginLoop_2_1_0)
states: 20,507 (4)
abstracting: (1<=Turn_1_1)
states: 6,924 (3)
abstracting: (BeginLoop_0_1_2<=Turn_0_0)
states: 20,658 (4)
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AG [[[[[[1<=TestAlone_2_1_1 | [[~ [[IsEndLoop_0_1_2<=BeginLoop_2_0_2 | WantSection_2_T<=TestIdentity_1_0_1]] & ~ [BeginLoop_1_0_0<=IsEndLoop_2_1_2]] & ~ [[1<=TestIdentity_1_0_1 & 1<=TestIdentity_0_0_1]]]] | [IsEndLoop_0_0_0<=BeginLoop_0_1_2 | ~ [IsEndLoop_0_1_0<=0]]] | [IsEndLoop_1_1_1<=TestTurn_2_0 & CS_1<=1]] & [[1<=IsEndLoop_1_1_2 | BeginLoop_0_1_1<=AskForSection_1_1] | [[~ [[[[1<=BeginLoop_1_0_0 | EndTurn_2_0<=0] & ~ [1<=TestIdentity_2_1_0]] | [IsEndLoop_1_1_1<=1 | TestAlone_0_1_1<=0]]] | [~ [CS_0<=0] | ~ [[AskForSection_0_1<=TestTurn_2_0 & [1<=IsEndLoop_2_0_1 & 1<=IsEndLoop_2_0_0]]]]] | [[[[~ [TestTurn_0_1<=Idle_0] | Turn_1_0<=WantSection_0_F] & [TestAlone_0_0_1<=TestAlone_1_1_0 | ~ [1<=BeginLoop_1_1_2]]] & [[[IsEndLoop_2_1_1<=0 & 1<=IsEndLoop_0_1_2] & [EndTurn_0_0<=WantSection_2_F | TestAlone_0_1_1<=1]] & [IsEndLoop_0_0_1<=TestTurn_0_0 & ~ [WantSection_2_F<=AskForSection_0_0]]]] | [EndTurn_2_1<=TestAlone_0_0_2 & [~ [[TestIdentity_1_1_1<=IsEndLoop_1_0_1 & IsEndLoop_1_0_0<=BeginLoop_1_1_2]] | [[Turn_1_2<=BeginLoop_2_0_0 | IsEndLoop_0_0_2<=WantSection_2_T] | IsEndLoop_2_1_1<=1]]]]]]] | ~ [[1<=EndTurn_2_1 | ~ [[[[[EndTurn_2_0<=BeginLoop_0_0_0 | 1<=BeginLoop_1_0_0] & [TestTurn_1_1<=BeginLoop_1_0_1 & IsEndLoop_2_0_2<=1]] & ~ [[AskForSection_1_0<=TestAlone_1_1_0 & 1<=BeginLoop_1_1_1]]] | ~ [[BeginLoop_1_1_0<=0 & BeginLoop_2_1_0<=EndTurn_2_0]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[1<=EndTurn_2_1 | ~ [[~ [[BeginLoop_1_1_0<=0 & BeginLoop_2_1_0<=EndTurn_2_0]] | [[[EndTurn_2_0<=BeginLoop_0_0_0 | 1<=BeginLoop_1_0_0] & [TestTurn_1_1<=BeginLoop_1_0_1 & IsEndLoop_2_0_2<=1]] & ~ [[AskForSection_1_0<=TestAlone_1_1_0 & 1<=BeginLoop_1_1_1]]]]]]] | [[[[1<=TestAlone_2_1_1 | [~ [[1<=TestIdentity_1_0_1 & 1<=TestIdentity_0_0_1]] & [~ [[IsEndLoop_0_1_2<=BeginLoop_2_0_2 | WantSection_2_T<=TestIdentity_1_0_1]] & ~ [BeginLoop_1_0_0<=IsEndLoop_2_1_2]]]] | [IsEndLoop_0_0_0<=BeginLoop_0_1_2 | ~ [IsEndLoop_0_1_0<=0]]] | [IsEndLoop_1_1_1<=TestTurn_2_0 & CS_1<=1]] & [[[[[[IsEndLoop_0_0_1<=TestTurn_0_0 & ~ [WantSection_2_F<=AskForSection_0_0]] & [[EndTurn_0_0<=WantSection_2_F | TestAlone_0_1_1<=1] & [IsEndLoop_2_1_1<=0 & 1<=IsEndLoop_0_1_2]]] & [[Turn_1_0<=WantSection_0_F | ~ [TestTurn_0_1<=Idle_0]] & [TestAlone_0_0_1<=TestAlone_1_1_0 | ~ [1<=BeginLoop_1_1_2]]]] | [EndTurn_2_1<=TestAlone_0_0_2 & [~ [[TestIdentity_1_1_1<=IsEndLoop_1_0_1 & IsEndLoop_1_0_0<=BeginLoop_1_1_2]] | [IsEndLoop_2_1_1<=1 | [Turn_1_2<=BeginLoop_2_0_0 | IsEndLoop_0_0_2<=WantSection_2_T]]]]] | [[~ [CS_0<=0] | ~ [[AskForSection_0_1<=TestTurn_2_0 & [1<=IsEndLoop_2_0_1 & 1<=IsEndLoop_2_0_0]]]] | ~ [[[[1<=BeginLoop_1_0_0 | EndTurn_2_0<=0] & ~ [1<=TestIdentity_2_1_0]] | [IsEndLoop_1_1_1<=1 | TestAlone_0_1_1<=0]]]]] | [1<=IsEndLoop_1_1_2 | BeginLoop_0_1_1<=AskForSection_1_1]]]]]]]

abstracting: (BeginLoop_0_1_1<=AskForSection_1_1)
states: 20,482 (4)
abstracting: (1<=IsEndLoop_1_1_2)
states: 196
abstracting: (TestAlone_0_1_1<=0)
states: 20,478 (4)
abstracting: (IsEndLoop_1_1_1<=1)
states: 20,754 (4)
abstracting: (1<=TestIdentity_2_1_0)
states: 412
abstracting: (EndTurn_2_0<=0)
states: 19,994 (4)
abstracting: (1<=BeginLoop_1_0_0)
states: 1,986 (3)
abstracting: (1<=IsEndLoop_2_0_0)
states: 832
abstracting: (1<=IsEndLoop_2_0_1)
states: 629
abstracting: (AskForSection_0_1<=TestTurn_2_0)
states: 20,320 (4)
abstracting: (CS_0<=0)
states: 20,654 (4)
abstracting: (IsEndLoop_0_0_2<=WantSection_2_T)
states: 20,736 (4)
abstracting: (Turn_1_2<=BeginLoop_2_0_0)
states: 13,678 (4)
abstracting: (IsEndLoop_2_1_1<=1)
states: 20,754 (4)
abstracting: (IsEndLoop_1_0_0<=BeginLoop_1_1_2)
states: 20,012 (4)
abstracting: (TestIdentity_1_1_1<=IsEndLoop_1_0_1)
states: 20,558 (4)
abstracting: (EndTurn_2_1<=TestAlone_0_0_2)
states: 20,513 (4)
abstracting: (1<=BeginLoop_1_1_2)
states: 196
abstracting: (TestAlone_0_0_1<=TestAlone_1_1_0)
states: 19,030 (4)
abstracting: (TestTurn_0_1<=Idle_0)
states: 20,478 (4)
abstracting: (Turn_1_0<=WantSection_0_F)
states: 14,740 (4)
abstracting: (1<=IsEndLoop_0_1_2)
states: 100
abstracting: (IsEndLoop_2_1_1<=0)
states: 20,507 (4)
abstracting: (TestAlone_0_1_1<=1)
states: 20,754 (4)
abstracting: (EndTurn_0_0<=WantSection_2_F)
states: 20,264 (4)
abstracting: (WantSection_2_F<=AskForSection_0_0)
states: 19,964 (4)
abstracting: (IsEndLoop_0_0_1<=TestTurn_0_0)
states: 20,270 (4)
abstracting: (CS_1<=1)
states: 20,754 (4)
abstracting: (IsEndLoop_1_1_1<=TestTurn_2_0)
states: 20,583 (4)
abstracting: (IsEndLoop_0_1_0<=0)
states: 20,478 (4)
abstracting: (IsEndLoop_0_0_0<=BeginLoop_0_1_2)
states: 18,992 (4)
abstracting: (BeginLoop_1_0_0<=IsEndLoop_2_1_2)
states: 18,797 (4)
abstracting: (WantSection_2_T<=TestIdentity_1_0_1)
states: 1,567 (3)
abstracting: (IsEndLoop_0_1_2<=BeginLoop_2_0_2)
states: 20,654 (4)
abstracting: (1<=TestIdentity_0_0_1)
states: 1,762 (3)
abstracting: (1<=TestIdentity_1_0_1)
states: 742
abstracting: (1<=TestAlone_2_1_1)
states: 247
abstracting: (1<=BeginLoop_1_1_1)
states: 196
abstracting: (AskForSection_1_0<=TestAlone_1_1_0)
states: 19,678 (4)
abstracting: (IsEndLoop_2_0_2<=1)
states: 20,754 (4)
abstracting: (TestTurn_1_1<=BeginLoop_1_0_1)
states: 20,356 (4)
abstracting: (1<=BeginLoop_1_0_0)
states: 1,986 (3)
abstracting: (EndTurn_2_0<=BeginLoop_0_0_0)
states: 20,068 (4)
abstracting: (BeginLoop_2_1_0<=EndTurn_2_0)
states: 20,342 (4)
abstracting: (BeginLoop_1_1_0<=0)
states: 20,356 (4)
abstracting: (1<=EndTurn_2_1)
states: 247
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: EF [~ [[[sum(Idle_1, Idle_2, Idle_0)<=28 | [~ [[[sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=98 & sum(CS_2, CS_1, CS_0)<=66] | ~ [sum(Idle_1, Idle_2, Idle_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]] | [[[86<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & sum(Idle_1, Idle_2, Idle_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] | [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=92 | 95<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]] | [[31<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | 7<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)] | 31<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]] | [[~ [[98<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]] & ~ [[67<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | 1<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]]] & [[[[100<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & 36<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] | ~ [8<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]] | [[47<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)] | ~ [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=65]]] | ~ [57<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]]]]]
normalized: E [true U ~ [[[[~ [57<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] | [[~ [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=65] | [47<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)]] | [~ [8<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)] | [100<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & 36<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]]]] & [~ [[67<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | 1<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]] & ~ [[98<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)]]]] | [sum(Idle_1, Idle_2, Idle_0)<=28 | [[[31<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) | [31<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0) | 7<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)]] | [[sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=92 | 95<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] | [86<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0) & sum(Idle_1, Idle_2, Idle_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]] | ~ [[~ [sum(Idle_1, Idle_2, Idle_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)] | [sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=98 & sum(CS_2, CS_1, CS_0)<=66]]]]]]]]

abstracting: (sum(CS_2, CS_1, CS_0)<=66)
states: 20,754 (4)
abstracting: (sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)<=98)
states: 20,754 (4)
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 18,849 (4)
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 20,754 (4)
abstracting: (86<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 0
abstracting: (95<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 0
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=92)
states: 20,754 (4)
abstracting: (7<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 0
abstracting: (31<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
abstracting: (31<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 0
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=28)
states: 20,754 (4)
abstracting: (sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 20,754 (4)
abstracting: (98<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 0
abstracting: (1<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0))
states: 6,060 (3)
abstracting: (67<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 0
abstracting: (36<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
abstracting: (100<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 0
abstracting: (8<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 16,335 (4)
abstracting: (47<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=65)
states: 20,754 (4)
abstracting: (57<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 0
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.021sec

checking: EF [~ [[[sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=79 & [[11<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) & [[~ [[sum(CS_2, CS_1, CS_0)<=28 & sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]] & sum(CS_2, CS_1, CS_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)] & ~ [sum(Idle_1, Idle_2, Idle_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]]] | ~ [[74<=sum(Idle_1, Idle_2, Idle_0) | [[[74<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=75] | 27<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0)] & sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)]]]]] & [~ [[[[[sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(Idle_1, Idle_2, Idle_0) | sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)] & [[55<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & 83<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] & sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=24]] | 73<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)] | [86<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & ~ [[[sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=100] | [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(CS_2, CS_1, CS_0) | sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=44]]]]]] | [~ [[~ [[~ [40<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)] & [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=7 & sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)]]] & ~ [[62<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=52]]]] & ~ [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=55]]]]]]
normalized: E [true U ~ [[[[~ [[~ [[62<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0) | sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=52]] & ~ [[[sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=7 & sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)] & ~ [40<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)]]]]] & ~ [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=55]] | ~ [[[73<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) | [[sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=24 & [55<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & 83<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)]] & [sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(Idle_1, Idle_2, Idle_0) | sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)]]] | [86<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & ~ [[[sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(CS_2, CS_1, CS_0) | sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=44] | [sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0) & sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=100]]]]]]] & [sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=79 & [[11<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T) & [~ [sum(Idle_1, Idle_2, Idle_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)] & [sum(CS_2, CS_1, CS_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0) & ~ [[sum(CS_2, CS_1, CS_0)<=28 & sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0)]]]]] | ~ [[74<=sum(Idle_1, Idle_2, Idle_0) | [sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0) & [27<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0) | [74<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1) & sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=75]]]]]]]]]]

abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=75)
states: 20,754 (4)
abstracting: (74<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
abstracting: (27<=sum(BeginLoop_2_1_2, BeginLoop_2_0_2, BeginLoop_1_0_2, BeginLoop_1_1_2, BeginLoop_0_1_2, BeginLoop_1_1_1, BeginLoop_0_1_1, BeginLoop_0_0_2, BeginLoop_2_1_1, BeginLoop_0_0_1, BeginLoop_2_1_0, BeginLoop_2_0_1, BeginLoop_1_0_1, BeginLoop_0_1_0, BeginLoop_1_1_0, BeginLoop_1_0_0, BeginLoop_2_0_0, BeginLoop_0_0_0))
states: 0
abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0))
states: 14,760 (4)
abstracting: (74<=sum(Idle_1, Idle_2, Idle_0))
states: 0
abstracting: (sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T)<=sum(Turn_1_1, Turn_0_2, Turn_1_0, Turn_0_1, Turn_1_2, Turn_0_0))
states: 0
abstracting: (sum(CS_2, CS_1, CS_0)<=28)
states: 20,754 (4)
abstracting: (sum(CS_2, CS_1, CS_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0))
states: 20,358 (4)
abstracting: (sum(Idle_1, Idle_2, Idle_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0))
states: 18,225 (4)
abstracting: (11<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 0
abstracting: (sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=79)
states: 20,754 (4)
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=100)
states: 20,754 (4)
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0))
states: 15,258 (4)
abstracting: (sum(IsEndLoop_2_1_2, IsEndLoop_0_1_2, IsEndLoop_1_1_2, IsEndLoop_1_0_2, IsEndLoop_2_0_2, IsEndLoop_0_0_2, IsEndLoop_2_1_1, IsEndLoop_1_1_1, IsEndLoop_0_1_1, IsEndLoop_2_0_1, IsEndLoop_1_0_1, IsEndLoop_0_0_1, IsEndLoop_2_1_0, IsEndLoop_1_1_0, IsEndLoop_0_1_0, IsEndLoop_2_0_0, IsEndLoop_1_0_0, IsEndLoop_0_0_0)<=44)
states: 20,754 (4)
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(CS_2, CS_1, CS_0))
states: 16,011 (4)
abstracting: (86<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=sum(WantSection_0_F, WantSection_1_F, WantSection_2_F, WantSection_0_T, WantSection_2_T, WantSection_1_T))
states: 20,754 (4)
abstracting: (sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1)<=sum(Idle_1, Idle_2, Idle_0))
states: 16,401 (4)
abstracting: (83<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
abstracting: (55<=sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0))
states: 0
abstracting: (sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0)<=24)
states: 20,754 (4)
abstracting: (73<=sum(AskForSection_1_0, AskForSection_0_0, AskForSection_0_1, AskForSection_2_0, AskForSection_2_1, AskForSection_1_1))
states: 0
abstracting: (sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0)<=55)
states: 20,754 (4)
abstracting: (40<=sum(TestIdentity_1_0_2, TestIdentity_2_0_2, TestIdentity_2_1_1, TestIdentity_0_0_2, TestIdentity_2_1_2, TestIdentity_0_1_2, TestIdentity_1_1_2, TestIdentity_0_0_1, TestIdentity_2_1_0, TestIdentity_1_1_0, TestIdentity_0_1_0, TestIdentity_1_1_1, TestIdentity_0_1_1, TestIdentity_2_0_1, TestIdentity_1_0_1, TestIdentity_2_0_0, TestIdentity_1_0_0, TestIdentity_0_0_0))
states: 0
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0))
states: 20,754 (4)
abstracting: (sum(TestTurn_1_1, TestTurn_0_1, TestTurn_2_0, TestTurn_1_0, TestTurn_2_1, TestTurn_0_0)<=7)
states: 20,754 (4)
abstracting: (sum(EndTurn_2_1, EndTurn_0_1, EndTurn_1_1, EndTurn_1_0, EndTurn_2_0, EndTurn_0_0)<=52)
states: 20,754 (4)
abstracting: (62<=sum(TestAlone_1_0_2, TestAlone_0_1_2, TestAlone_1_1_2, TestAlone_2_0_1, TestAlone_0_1_1, TestAlone_2_1_1, TestAlone_0_0_2, TestAlone_2_0_0, TestAlone_1_1_0, TestAlone_2_1_0, TestAlone_0_0_1, TestAlone_1_0_0))
states: 0
-> the formula is FALSE

FORMULA Peterson-PT-2-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 12m59.839sec

totally nodes used: 332347 (3.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 668243 2171563 2839806
used/not used/entry size/cache size: 2340060 64768804 16 1024MB
basic ops cache: hits/miss/sum: 204786 755502 960288
used/not used/entry size/cache size: 1120624 15656592 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 1078771498 1078771498
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 25671 73040 98711
used/not used/entry size/cache size: 72816 8315792 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 66799359
1 288700
2 18930
3 1719
4 151
5 4
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 13m16.534sec


BK_STOP 1679189540069

--------------------
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:9670 (76), effective:632 (5)

initing FirstDep: 0m 0.000sec


iterations count:7067 (56), effective:368 (2)

iterations count:3094 (24), effective:199 (1)

iterations count:7774 (61), effective:405 (3)

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="Peterson-PT-2"
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 Peterson-PT-2, 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 r266-smll-167863541200606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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