About the Execution of Marcie+red for PGCD-COL-D02N005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5475.039 | 70932.00 | 74032.00 | 879.50 | TTFFTFTTTTFTTTFF | normal |
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.r522-tall-167987247300382.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 PGCD-COL-D02N005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300382
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D02N005-ReachabilityCardinality-00
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-01
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-02
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-03
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-04
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-05
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-06
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-07
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-08
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-09
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-10
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-11
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-12
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-13
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-14
FORMULA_NAME PGCD-COL-D02N005-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1680810896658
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=PGCD-COL-D02N005
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 19:54:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 19:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 19:54:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-06 19:54:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-06 19:54:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 435 ms
[2023-04-06 19:54:58] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 19:54:58] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-06 19:54:58] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 10 formulas.
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
[2023-04-06 19:54:58] [INFO ] Flatten gal took : 13 ms
[2023-04-06 19:54:58] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-06 19:54:58] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 6 ms.
[2023-04-06 19:54:58] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :1
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 19:54:59] [INFO ] Computed 4 invariants in 6 ms
[2023-04-06 19:54:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-06 19:54:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 19:54:59] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-04-06 19:54:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-06 19:54:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-04-06 19:54:59] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1352 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
Unfolding complete |P|=9|T|=9|A|=42
Time for unfolding: 0m 0.235sec
Net: PGCD_COL_D02N005
(NrP: 9 NrTr: 9 NrArc: 42)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.843sec
RS generation: 0m 0.017sec
-> reachability set: #nodes 377 (3.8e+02) #states 8,484 (3)
starting MCC model checker
--------------------------
checking: EF [~ [17<=sum(p2_c2, p2_c1, p2_c0)]]
normalized: E [true U ~ [17<=sum(p2_c2, p2_c1, p2_c0)]]
abstracting: (17<=sum(p2_c2, p2_c1, p2_c0))
states: 190
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: EF [76<=sum(p1_c2, p1_c1, p1_c0)]
normalized: E [true U 76<=sum(p1_c2, p1_c1, p1_c0)]
abstracting: (76<=sum(p1_c2, p1_c1, p1_c0))
states: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AG [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)]
normalized: ~ [E [true U ~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)]
normalized: E [true U sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)]
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.627sec
checking: EF [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]
normalized: E [true U sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.062sec
checking: AG [[[82<=sum(p2_c2, p2_c1, p2_c0) & sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)] & ~ [87<=sum(p2_c2, p2_c1, p2_c0)]]]
normalized: ~ [E [true U ~ [[~ [87<=sum(p2_c2, p2_c1, p2_c0)] & [82<=sum(p2_c2, p2_c1, p2_c0) & sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]]]
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (82<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (87<=sum(p2_c2, p2_c1, p2_c0))
states: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.424sec
checking: EF [~ [[[sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) & sum(p1_c2, p1_c1, p1_c0)<=69] | ~ [38<=sum(p0_c2, p0_c1, p0_c0)]]]]
normalized: E [true U ~ [[~ [38<=sum(p0_c2, p0_c1, p0_c0)] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) & sum(p1_c2, p1_c1, p1_c0)<=69]]]]
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=69)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (38<=sum(p0_c2, p0_c1, p0_c0))
states: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: EF [[[7<=sum(p0_c2, p0_c1, p0_c0) & sum(p2_c2, p2_c1, p2_c0)<=28] | ~ [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0) & ~ [[sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0) | ~ [sum(p0_c2, p0_c1, p0_c0)<=16]]]] | 57<=sum(p1_c2, p1_c1, p1_c0)]]]]
normalized: E [true U [~ [[[~ [[~ [sum(p0_c2, p0_c1, p0_c0)<=16] | sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]] & sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] | 57<=sum(p1_c2, p1_c1, p1_c0)]] | [7<=sum(p0_c2, p0_c1, p0_c0) & sum(p2_c2, p2_c1, p2_c0)<=28]]]
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=28)
states: 8,484 (3)
abstracting: (7<=sum(p0_c2, p0_c1, p0_c0))
states: 6,223 (3)
abstracting: (57<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=16)
states: 8,294 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.096sec
checking: AG [[[~ [71<=sum(p0_c2, p0_c1, p0_c0)] & ~ [100<=sum(p1_c2, p1_c1, p1_c0)]] | [~ [[~ [[75<=sum(p2_c2, p2_c1, p2_c0) | [~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)] & [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p0_c2, p0_c1, p0_c0)<=9]]]] & ~ [sum(p1_c2, p1_c1, p1_c0)<=11]]] | 77<=sum(p2_c2, p2_c1, p2_c0)]]]
normalized: ~ [E [true U ~ [[[~ [[~ [sum(p1_c2, p1_c1, p1_c0)<=11] & ~ [[[[sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p0_c2, p0_c1, p0_c0)<=9] & ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | 75<=sum(p2_c2, p2_c1, p2_c0)]]]] | 77<=sum(p2_c2, p2_c1, p2_c0)] | [~ [100<=sum(p1_c2, p1_c1, p1_c0)] & ~ [71<=sum(p0_c2, p0_c1, p0_c0)]]]]]]
abstracting: (71<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (100<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (77<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (75<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=9)
states: 4,521 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=11)
states: 6,223 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.143sec
checking: AG [~ [[[[[~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] & [[sum(p0_c2, p0_c1, p0_c0)<=58 | ~ [[90<=sum(p2_c2, p2_c1, p2_c0) | sum(p2_c2, p2_c1, p2_c0)<=64]]] & [sum(p0_c2, p0_c1, p0_c0)<=16 | [sum(p2_c2, p2_c1, p2_c0)<=87 & ~ [sum(p2_c2, p2_c1, p2_c0)<=3]]]]] & 54<=sum(p1_c2, p1_c1, p1_c0)] | ~ [[sum(p1_c2, p1_c1, p1_c0)<=46 | [sum(p2_c2, p2_c1, p2_c0)<=13 | sum(p2_c2, p2_c1, p2_c0)<=64]]]] | sum(p1_c2, p1_c1, p1_c0)<=90]]]
normalized: ~ [E [true U [[~ [[[sum(p2_c2, p2_c1, p2_c0)<=13 | sum(p2_c2, p2_c1, p2_c0)<=64] | sum(p1_c2, p1_c1, p1_c0)<=46]] | [[[[[~ [sum(p2_c2, p2_c1, p2_c0)<=3] & sum(p2_c2, p2_c1, p2_c0)<=87] | sum(p0_c2, p0_c1, p0_c0)<=16] & [~ [[90<=sum(p2_c2, p2_c1, p2_c0) | sum(p2_c2, p2_c1, p2_c0)<=64]] | sum(p0_c2, p0_c1, p0_c0)<=58]] & ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]] & 54<=sum(p1_c2, p1_c1, p1_c0)]] | sum(p1_c2, p1_c1, p1_c0)<=90]]]
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=90)
states: 8,484 (3)
abstracting: (54<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=58)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=64)
states: 8,484 (3)
abstracting: (90<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=16)
states: 8,294 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=87)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=3)
states: 568
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=46)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=64)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=13)
states: 7,231 (3)
-> the formula is FALSE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.215sec
checking: EF [[~ [sum(p0_c2, p0_c1, p0_c0)<=53] | [~ [[~ [[[4<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=4] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) | 47<=sum(p0_c2, p0_c1, p0_c0)]]] | [~ [[[~ [94<=sum(p1_c2, p1_c1, p1_c0)] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) & sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | [[48<=sum(p2_c2, p2_c1, p2_c0) & 95<=sum(p1_c2, p1_c1, p1_c0)] | ~ [48<=sum(p2_c2, p2_c1, p2_c0)]]]] & 4<=sum(p1_c2, p1_c1, p1_c0)]]] | [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | ~ [22<=sum(p2_c2, p2_c1, p2_c0)]]]]]
normalized: E [true U [[~ [[[~ [[[~ [94<=sum(p1_c2, p1_c1, p1_c0)] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) & sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | [~ [48<=sum(p2_c2, p2_c1, p2_c0)] | [48<=sum(p2_c2, p2_c1, p2_c0) & 95<=sum(p1_c2, p1_c1, p1_c0)]]]] & 4<=sum(p1_c2, p1_c1, p1_c0)] | ~ [[[sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) | 47<=sum(p0_c2, p0_c1, p0_c0)] | [4<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=4]]]]] | [~ [22<=sum(p2_c2, p2_c1, p2_c0)] | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]] | ~ [sum(p0_c2, p0_c1, p0_c0)<=53]]]
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=53)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 4,738 (3)
abstracting: (22<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=4)
states: 1,253 (3)
abstracting: (4<=sum(p2_c2, p2_c1, p2_c0))
states: 7,916 (3)
abstracting: (47<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (4<=sum(p1_c2, p1_c1, p1_c0))
states: 7,699 (3)
abstracting: (95<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (48<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (48<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (94<=sum(p1_c2, p1_c1, p1_c0))
states: 0
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.922sec
checking: EF [[[~ [[37<=sum(p2_c2, p2_c1, p2_c0) & 3<=sum(p1_c2, p1_c1, p1_c0)]] & ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]] | ~ [[[66<=sum(p2_c2, p2_c1, p2_c0) | ~ [[[~ [[sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p2_c2, p2_c1, p2_c0)<=80]] & ~ [[sum(p0_c2, p0_c1, p0_c0)<=71 & sum(p2_c2, p2_c1, p2_c0)<=64]]] | ~ [[[sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0) & 96<=sum(p1_c2, p1_c1, p1_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0) & sum(p0_c2, p0_c1, p0_c0)<=31]]]]]] & ~ [[sum(p2_c2, p2_c1, p2_c0)<=70 & 71<=sum(p2_c2, p2_c1, p2_c0)]]]]]]
normalized: E [true U [~ [[~ [[sum(p2_c2, p2_c1, p2_c0)<=70 & 71<=sum(p2_c2, p2_c1, p2_c0)]] & [~ [[~ [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0) & sum(p0_c2, p0_c1, p0_c0)<=31] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0) & 96<=sum(p1_c2, p1_c1, p1_c0)]]] | [~ [[sum(p0_c2, p0_c1, p0_c0)<=71 & sum(p2_c2, p2_c1, p2_c0)<=64]] & ~ [[sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p2_c2, p2_c1, p2_c0)<=80]]]]] | 66<=sum(p2_c2, p2_c1, p2_c0)]]] | [~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] & ~ [[37<=sum(p2_c2, p2_c1, p2_c0) & 3<=sum(p1_c2, p1_c1, p1_c0)]]]]]
abstracting: (3<=sum(p1_c2, p1_c1, p1_c0))
states: 8,051 (3)
abstracting: (37<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 4,738 (3)
abstracting: (66<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=80)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 4,738 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=64)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=71)
states: 8,484 (3)
abstracting: (96<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=31)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (71<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=70)
states: 8,484 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.662sec
checking: EF [[~ [[sum(p1_c2, p1_c1, p1_c0)<=13 & [[~ [[[sum(p1_c2, p1_c1, p1_c0)<=97 | sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)] | ~ [[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=60]]]] | [[[~ [sum(p1_c2, p1_c1, p1_c0)<=61] & 8<=sum(p1_c2, p1_c1, p1_c0)] | [[89<=sum(p0_c2, p0_c1, p0_c0) | 10<=sum(p0_c2, p0_c1, p0_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) & 54<=sum(p2_c2, p2_c1, p2_c0)]]] | sum(p2_c2, p2_c1, p2_c0)<=59]] & sum(p1_c2, p1_c1, p1_c0)<=73]]] & [~ [sum(p0_c2, p0_c1, p0_c0)<=89] | [[~ [sum(p2_c2, p2_c1, p2_c0)<=40] | ~ [[52<=sum(p2_c2, p2_c1, p2_c0) & [[~ [4<=sum(p1_c2, p1_c1, p1_c0)] | sum(p1_c2, p1_c1, p1_c0)<=53] | [[88<=sum(p1_c2, p1_c1, p1_c0) & sum(p0_c2, p0_c1, p0_c0)<=94] | 72<=sum(p0_c2, p0_c1, p0_c0)]]]]] | ~ [sum(p1_c2, p1_c1, p1_c0)<=76]]]]]
normalized: E [true U [[[~ [sum(p1_c2, p1_c1, p1_c0)<=76] | [~ [[[[[88<=sum(p1_c2, p1_c1, p1_c0) & sum(p0_c2, p0_c1, p0_c0)<=94] | 72<=sum(p0_c2, p0_c1, p0_c0)] | [~ [4<=sum(p1_c2, p1_c1, p1_c0)] | sum(p1_c2, p1_c1, p1_c0)<=53]] & 52<=sum(p2_c2, p2_c1, p2_c0)]] | ~ [sum(p2_c2, p2_c1, p2_c0)<=40]]] | ~ [sum(p0_c2, p0_c1, p0_c0)<=89]] & ~ [[[[[[[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) & 54<=sum(p2_c2, p2_c1, p2_c0)] | [89<=sum(p0_c2, p0_c1, p0_c0) | 10<=sum(p0_c2, p0_c1, p0_c0)]] | [~ [sum(p1_c2, p1_c1, p1_c0)<=61] & 8<=sum(p1_c2, p1_c1, p1_c0)]] | sum(p2_c2, p2_c1, p2_c0)<=59] | ~ [[~ [[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=60]] | [sum(p1_c2, p1_c1, p1_c0)<=97 | sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]] & sum(p1_c2, p1_c1, p1_c0)<=73] & sum(p1_c2, p1_c1, p1_c0)<=13]]]]
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=13)
states: 7,448 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=73)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=97)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=60)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=59)
states: 8,484 (3)
abstracting: (8<=sum(p1_c2, p1_c1, p1_c0))
states: 5,286 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=61)
states: 8,484 (3)
abstracting: (10<=sum(p0_c2, p0_c1, p0_c0))
states: 3,963 (3)
abstracting: (89<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (54<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=89)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=40)
states: 8,484 (3)
abstracting: (52<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=53)
states: 8,484 (3)
abstracting: (4<=sum(p1_c2, p1_c1, p1_c0))
states: 7,699 (3)
abstracting: (72<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=94)
states: 8,484 (3)
abstracting: (88<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=76)
states: 8,484 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.423sec
checking: EF [[[[[~ [4<=sum(p1_c2, p1_c1, p1_c0)] & [~ [[sum(p0_c2, p0_c1, p0_c0)<=81 | [[80<=sum(p2_c2, p2_c1, p2_c0) | 65<=sum(p2_c2, p2_c1, p2_c0)] | [sum(p2_c2, p2_c1, p2_c0)<=85 | 65<=sum(p0_c2, p0_c1, p0_c0)]]]] & [[sum(p2_c2, p2_c1, p2_c0)<=4 & [38<=sum(p0_c2, p0_c1, p0_c0) & [sum(p2_c2, p2_c1, p2_c0)<=51 | 98<=sum(p1_c2, p1_c1, p1_c0)]]] | ~ [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | 5<=sum(p1_c2, p1_c1, p1_c0)] & 44<=sum(p2_c2, p2_c1, p2_c0)]]]]] | [99<=sum(p0_c2, p0_c1, p0_c0) & [88<=sum(p1_c2, p1_c1, p1_c0) & ~ [[[~ [33<=sum(p2_c2, p2_c1, p2_c0)] & [sum(p2_c2, p2_c1, p2_c0)<=14 | sum(p2_c2, p2_c1, p2_c0)<=33]] | sum(p1_c2, p1_c1, p1_c0)<=78]]]]] | [[64<=sum(p0_c2, p0_c1, p0_c0) & ~ [37<=sum(p1_c2, p1_c1, p1_c0)]] & ~ [[~ [sum(p1_c2, p1_c1, p1_c0)<=24] & sum(p2_c2, p2_c1, p2_c0)<=75]]]] & ~ [[sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0) | [~ [[45<=sum(p0_c2, p0_c1, p0_c0) & [sum(p1_c2, p1_c1, p1_c0)<=81 & [sum(p0_c2, p0_c1, p0_c0)<=16 | 76<=sum(p2_c2, p2_c1, p2_c0)]]]] & ~ [[[[[sum(p0_c2, p0_c1, p0_c0)<=8 | sum(p2_c2, p2_c1, p2_c0)<=87] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0) | 31<=sum(p2_c2, p2_c1, p2_c0)]] & [97<=sum(p1_c2, p1_c1, p1_c0) | ~ [28<=sum(p1_c2, p1_c1, p1_c0)]]] | 50<=sum(p0_c2, p0_c1, p0_c0)]]]]]]]
normalized: E [true U [[[[~ [37<=sum(p1_c2, p1_c1, p1_c0)] & 64<=sum(p0_c2, p0_c1, p0_c0)] & ~ [[~ [sum(p1_c2, p1_c1, p1_c0)<=24] & sum(p2_c2, p2_c1, p2_c0)<=75]]] | [[[~ [[[[sum(p2_c2, p2_c1, p2_c0)<=14 | sum(p2_c2, p2_c1, p2_c0)<=33] & ~ [33<=sum(p2_c2, p2_c1, p2_c0)]] | sum(p1_c2, p1_c1, p1_c0)<=78]] & 88<=sum(p1_c2, p1_c1, p1_c0)] & 99<=sum(p0_c2, p0_c1, p0_c0)] | [[[~ [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | 5<=sum(p1_c2, p1_c1, p1_c0)] & 44<=sum(p2_c2, p2_c1, p2_c0)]] | [[[sum(p2_c2, p2_c1, p2_c0)<=51 | 98<=sum(p1_c2, p1_c1, p1_c0)] & 38<=sum(p0_c2, p0_c1, p0_c0)] & sum(p2_c2, p2_c1, p2_c0)<=4]] & ~ [[sum(p0_c2, p0_c1, p0_c0)<=81 | [[sum(p2_c2, p2_c1, p2_c0)<=85 | 65<=sum(p0_c2, p0_c1, p0_c0)] | [80<=sum(p2_c2, p2_c1, p2_c0) | 65<=sum(p2_c2, p2_c1, p2_c0)]]]]] & ~ [4<=sum(p1_c2, p1_c1, p1_c0)]]]] & ~ [[[~ [[[[~ [28<=sum(p1_c2, p1_c1, p1_c0)] | 97<=sum(p1_c2, p1_c1, p1_c0)] & [[sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0) | 31<=sum(p2_c2, p2_c1, p2_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=8 | sum(p2_c2, p2_c1, p2_c0)<=87]]] | 50<=sum(p0_c2, p0_c1, p0_c0)]] & ~ [[[[sum(p0_c2, p0_c1, p0_c0)<=16 | 76<=sum(p2_c2, p2_c1, p2_c0)] & sum(p1_c2, p1_c1, p1_c0)<=81] & 45<=sum(p0_c2, p0_c1, p0_c0)]]] | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (45<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=81)
states: 8,484 (3)
abstracting: (76<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=16)
states: 8,294 (3)
abstracting: (50<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=87)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=8)
states: 3,746 (3)
abstracting: (31<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (97<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (28<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (4<=sum(p1_c2, p1_c1, p1_c0))
states: 7,699 (3)
abstracting: (65<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (80<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (65<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=85)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=81)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=4)
states: 1,036 (3)
abstracting: (38<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (98<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=51)
states: 8,484 (3)
abstracting: (44<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (5<=sum(p1_c2, p1_c1, p1_c0))
states: 7,231 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (99<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (88<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=78)
states: 8,484 (3)
abstracting: (33<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=33)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=14)
states: 7,699 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=75)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=24)
states: 8,484 (3)
abstracting: (64<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (37<=sum(p1_c2, p1_c1, p1_c0))
states: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.635sec
checking: AG [[~ [[[sum(p2_c2, p2_c1, p2_c0)<=11 | ~ [[sum(p2_c2, p2_c1, p2_c0)<=89 & sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]] | [[[~ [[~ [21<=sum(p1_c2, p1_c1, p1_c0)] & ~ [50<=sum(p2_c2, p2_c1, p2_c0)]]] & [[sum(p2_c2, p2_c1, p2_c0)<=91 | ~ [49<=sum(p0_c2, p0_c1, p0_c0)]] | [[38<=sum(p0_c2, p0_c1, p0_c0) & 21<=sum(p2_c2, p2_c1, p2_c0)] & [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) & 58<=sum(p1_c2, p1_c1, p1_c0)]]]] & ~ [sum(p1_c2, p1_c1, p1_c0)<=91]] & [~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p1_c2, p1_c1, p1_c0)<=10]]]]] & [[[~ [sum(p2_c2, p2_c1, p2_c0)<=28] | [64<=sum(p2_c2, p2_c1, p2_c0) & [[[~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] & [44<=sum(p0_c2, p0_c1, p0_c0) | sum(p0_c2, p0_c1, p0_c0)<=14]] & ~ [49<=sum(p0_c2, p0_c1, p0_c0)]] | ~ [sum(p0_c2, p0_c1, p0_c0)<=94]]]] & ~ [[[~ [[[43<=sum(p1_c2, p1_c1, p1_c0) | 28<=sum(p0_c2, p0_c1, p0_c0)] | 4<=sum(p0_c2, p0_c1, p0_c0)]] & [75<=sum(p0_c2, p0_c1, p0_c0) | [[sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0) & sum(p0_c2, p0_c1, p0_c0)<=92] & ~ [sum(p2_c2, p2_c1, p2_c0)<=14]]]] | [[[sum(p2_c2, p2_c1, p2_c0)<=47 & 3<=sum(p1_c2, p1_c1, p1_c0)] & ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)]] & [73<=sum(p2_c2, p2_c1, p2_c0) | ~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) | ~ [70<=sum(p0_c2, p0_c1, p0_c0)]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[[[~ [49<=sum(p0_c2, p0_c1, p0_c0)] | sum(p2_c2, p2_c1, p2_c0)<=91] | [[sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) & 58<=sum(p1_c2, p1_c1, p1_c0)] & [38<=sum(p0_c2, p0_c1, p0_c0) & 21<=sum(p2_c2, p2_c1, p2_c0)]]] & ~ [[~ [50<=sum(p2_c2, p2_c1, p2_c0)] & ~ [21<=sum(p1_c2, p1_c1, p1_c0)]]]] & ~ [sum(p1_c2, p1_c1, p1_c0)<=91]] & [[sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p1_c2, p1_c1, p1_c0)<=10] | ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]] | [~ [[sum(p2_c2, p2_c1, p2_c0)<=89 & sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | sum(p2_c2, p2_c1, p2_c0)<=11]]] & [[~ [70<=sum(p0_c2, p0_c1, p0_c0)] | sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)] | [~ [[[[~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)] | 73<=sum(p2_c2, p2_c1, p2_c0)] & [~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)] & [sum(p2_c2, p2_c1, p2_c0)<=47 & 3<=sum(p1_c2, p1_c1, p1_c0)]]] | [[[~ [sum(p2_c2, p2_c1, p2_c0)<=14] & [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0) & sum(p0_c2, p0_c1, p0_c0)<=92]] | 75<=sum(p0_c2, p0_c1, p0_c0)] & ~ [[[43<=sum(p1_c2, p1_c1, p1_c0) | 28<=sum(p0_c2, p0_c1, p0_c0)] | 4<=sum(p0_c2, p0_c1, p0_c0)]]]]] & [[[~ [sum(p0_c2, p0_c1, p0_c0)<=94] | [~ [49<=sum(p0_c2, p0_c1, p0_c0)] & [[44<=sum(p0_c2, p0_c1, p0_c0) | sum(p0_c2, p0_c1, p0_c0)<=14] & ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]] & 64<=sum(p2_c2, p2_c1, p2_c0)] | ~ [sum(p2_c2, p2_c1, p2_c0)<=28]]]]]]]]
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=28)
states: 8,484 (3)
abstracting: (64<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=14)
states: 7,699 (3)
abstracting: (44<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (49<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=94)
states: 8,484 (3)
abstracting: (4<=sum(p0_c2, p0_c1, p0_c0))
states: 7,916 (3)
abstracting: (28<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (43<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (75<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=92)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=14)
states: 7,699 (3)
abstracting: (3<=sum(p1_c2, p1_c1, p1_c0))
states: 8,051 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=47)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 8,484 (3)
abstracting: (73<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (70<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=11)
states: 6,006 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=89)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=10)
states: 5,503 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=91)
states: 8,484 (3)
abstracting: (21<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (50<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (21<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (38<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (58<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=91)
states: 8,484 (3)
abstracting: (49<=sum(p0_c2, p0_c1, p0_c0))
states: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.499sec
checking: EF [[[[[[sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0) | [[sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0) & ~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | sum(p0_c2, p0_c1, p0_c0)<=34]] & [sum(p1_c2, p1_c1, p1_c0)<=83 & ~ [sum(p1_c2, p1_c1, p1_c0)<=70]]] & [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) | [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p2_c2, p2_c1, p2_c0)<=3]]] & [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0) & [[[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] | sum(p0_c2, p0_c1, p0_c0)<=37] | 45<=sum(p0_c2, p0_c1, p0_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0) | [[sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) & 53<=sum(p2_c2, p2_c1, p2_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) & 58<=sum(p2_c2, p2_c1, p2_c0)]]]]] | [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) & [[5<=sum(p1_c2, p1_c1, p1_c0) | sum(p0_c2, p0_c1, p0_c0)<=19] & ~ [91<=sum(p0_c2, p0_c1, p0_c0)]]] & sum(p2_c2, p2_c1, p2_c0)<=57] & [[[[sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) & 23<=sum(p0_c2, p0_c1, p0_c0)] & [sum(p2_c2, p2_c1, p2_c0)<=55 & sum(p2_c2, p2_c1, p2_c0)<=33]] | [sum(p1_c2, p1_c1, p1_c0)<=100 | sum(p2_c2, p2_c1, p2_c0)<=5]] | ~ [sum(p1_c2, p1_c1, p1_c0)<=55]]]] & [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | [sum(p2_c2, p2_c1, p2_c0)<=27 & [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) | [38<=sum(p1_c2, p1_c1, p1_c0) | ~ [19<=sum(p2_c2, p2_c1, p2_c0)]]]]]]] | [~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | [[[[~ [12<=sum(p1_c2, p1_c1, p1_c0)] & [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0) | [[sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p0_c2, p0_c1, p0_c0)<=85] | 72<=sum(p2_c2, p2_c1, p2_c0)]]] & [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0) & [[sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) | ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | sum(p0_c2, p0_c1, p0_c0)<=0]]] | [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) & ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]]] & [~ [79<=sum(p2_c2, p2_c1, p2_c0)] & [sum(p1_c2, p1_c1, p1_c0)<=42 & ~ [[1<=sum(p1_c2, p1_c1, p1_c0) & [[31<=sum(p0_c2, p0_c1, p0_c0) & sum(p2_c2, p2_c1, p2_c0)<=93] & [sum(p2_c2, p2_c1, p2_c0)<=47 | 64<=sum(p1_c2, p1_c1, p1_c0)]]]]]]]]]]
normalized: E [true U [[[[[~ [[[[sum(p2_c2, p2_c1, p2_c0)<=47 | 64<=sum(p1_c2, p1_c1, p1_c0)] & [31<=sum(p0_c2, p0_c1, p0_c0) & sum(p2_c2, p2_c1, p2_c0)<=93]] & 1<=sum(p1_c2, p1_c1, p1_c0)]] & sum(p1_c2, p1_c1, p1_c0)<=42] & ~ [79<=sum(p2_c2, p2_c1, p2_c0)]] & [[~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] & sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)] | [[[[~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)] | sum(p0_c2, p0_c1, p0_c0)<=0] & sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] & [[[[sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p0_c2, p0_c1, p0_c0)<=85] | 72<=sum(p2_c2, p2_c1, p2_c0)] | sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)] & ~ [12<=sum(p1_c2, p1_c1, p1_c0)]]]]] | ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]] | [[[[[[~ [19<=sum(p2_c2, p2_c1, p2_c0)] | 38<=sum(p1_c2, p1_c1, p1_c0)] | sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0)] & sum(p2_c2, p2_c1, p2_c0)<=27] | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] & [[[~ [sum(p1_c2, p1_c1, p1_c0)<=55] | [[sum(p1_c2, p1_c1, p1_c0)<=100 | sum(p2_c2, p2_c1, p2_c0)<=5] | [[sum(p2_c2, p2_c1, p2_c0)<=55 & sum(p2_c2, p2_c1, p2_c0)<=33] & [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0) & 23<=sum(p0_c2, p0_c1, p0_c0)]]]] & [[[~ [91<=sum(p0_c2, p0_c1, p0_c0)] & [5<=sum(p1_c2, p1_c1, p1_c0) | sum(p0_c2, p0_c1, p0_c0)<=19]] & sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)] & sum(p2_c2, p2_c1, p2_c0)<=57]] | [[[[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) & 58<=sum(p2_c2, p2_c1, p2_c0)] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) & 53<=sum(p2_c2, p2_c1, p2_c0)]] | sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] | [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] | sum(p0_c2, p0_c1, p0_c0)<=37] | 45<=sum(p0_c2, p0_c1, p0_c0)]] & sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]] & [[[sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p2_c2, p2_c1, p2_c0)<=3] | sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0)] & [[~ [sum(p1_c2, p1_c1, p1_c0)<=70] & sum(p1_c2, p1_c1, p1_c0)<=83] & [[[~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)] & sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] | sum(p0_c2, p0_c1, p0_c0)<=34] | sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]]
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=34)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=83)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=70)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=3)
states: 568
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (45<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=37)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 4,738 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (53<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (58<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=57)
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=19)
states: 8,484 (3)
abstracting: (5<=sum(p1_c2, p1_c1, p1_c0))
states: 7,231 (3)
abstracting: (91<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (23<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=33)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=55)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=5)
states: 1,603 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=100)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=55)
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 4,738 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=27)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (38<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (19<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (12<=sum(p1_c2, p1_c1, p1_c0))
states: 2,261 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 8,484 (3)
abstracting: (72<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=85)
states: 8,484 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 4,521 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=0)
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 4,738 (3)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 8,484 (3)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
states: 4,738 (3)
abstracting: (79<=sum(p2_c2, p2_c1, p2_c0))
states: 0
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=42)
states: 8,484 (3)
abstracting: (1<=sum(p1_c2, p1_c1, p1_c0))
states: 8,429 (3)
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=93)
states: 8,484 (3)
abstracting: (31<=sum(p0_c2, p0_c1, p0_c0))
states: 0
abstracting: (64<=sum(p1_c2, p1_c1, p1_c0))
states: 0
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=47)
states: 8,484 (3)
-> the formula is TRUE
FORMULA PGCD-COL-D02N005-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.616sec
totally nodes used: 10136 (1.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 68817 25673 94490
used/not used/entry size/cache size: 31823 67077041 16 1024MB
basic ops cache: hits/miss/sum: 57530 45254 102784
used/not used/entry size/cache size: 61059 16716157 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 13648046 13648046
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 7003 2890 9893
used/not used/entry size/cache size: 2890 8385718 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 67099707
1 8729
2 214
3 92
4 51
5 35
6 15
7 7
8 7
9 1
>= 10 6
Total processing time: 1m 6.098sec
BK_STOP 1680810967590
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:486 (54), effective:159 (17)
initing FirstDep: 0m 0.000sec
iterations count:41 (4), effective:9 (1)
iterations count:117 (13), effective:33 (3)
iterations count:120 (13), effective:37 (4)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:127 (14), effective:36 (4)
iterations count:165 (18), effective:48 (5)
iterations count:98 (10), effective:27 (3)
iterations count:9 (1), effective:0 (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="PGCD-COL-D02N005"
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 PGCD-COL-D02N005, 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 r522-tall-167987247300382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N005.tgz
mv PGCD-COL-D02N005 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 ;