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.r138-smll-167819420700454.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 DoubleExponent-PT-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420700454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678840401873

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=DoubleExponent-PT-002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 00:33:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 00:33:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:33:25] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-15 00:33:25] [INFO ] Transformed 110 places.
[2023-03-15 00:33:25] [INFO ] Transformed 98 transitions.
[2023-03-15 00:33:25] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 331 resets, run finished after 861 ms. (steps per millisecond=11 ) properties (out of 14) seen :2
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 98 rows 110 cols
[2023-03-15 00:33:30] [INFO ] Computed 14 place invariants in 15 ms
[2023-03-15 00:33:30] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-15 00:33:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-15 00:33:30] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 9 ms returned sat
[2023-03-15 00:33:30] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :2
[2023-03-15 00:33:30] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 10 ms to minimize.
[2023-03-15 00:33:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 119 ms
[2023-03-15 00:33:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-15 00:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-15 00:33:31] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-15 00:33:31] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 24 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 88
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 95 transition count 82
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 89 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 32 place count 89 transition count 79
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 52 place count 79 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 79 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 78 transition count 71
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 61 place count 78 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 68 place count 71 transition count 64
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 74 place count 71 transition count 64
Applied a total of 74 rules in 59 ms. Remains 71 /110 variables (removed 39) and now considering 64/98 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 71/110 places, 64/98 transitions.
Incomplete random walk after 10000 steps, including 414 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 339 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 362 steps, run visited all 1 properties in 16 ms. (steps per millisecond=22 )
Probabilistic random walk after 362 steps, saw 189 distinct states, run finished after 16 ms. (steps per millisecond=22 ) properties seen :1
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 6170 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: DoubleExponent_PT_002
(NrP: 110 NrTr: 98 NrArc: 276)

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

net check time: 0m 0.000sec

init dd package: 0m 3.599sec


RS generation: 0m 0.529sec


-> reachability set: #nodes 3013 (3.0e+03) #states 3,708 (3)



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

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

abstracting: (p73<=1)
states: 3,708 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (p85<=1)
states: 3,708 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=p23]
normalized: E [true U 1<=p23]

abstracting: (1<=p23)
states: 2
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EF [[1<=p73 & [1<=p44 | 1<=p14]]]
normalized: E [true U [[1<=p44 | 1<=p14] & 1<=p73]]

abstracting: (1<=p73)
states: 16
abstracting: (1<=p14)
states: 2
abstracting: (1<=p44)
states: 43
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [p78<=p69] | [~ [1<=p40] & p31<=p94]]]
normalized: ~ [E [true U ~ [[[~ [1<=p40] & p31<=p94] | ~ [p78<=p69]]]]]

abstracting: (p78<=p69)
states: 3,708 (3)
abstracting: (p31<=p94)
states: 3,463 (3)
abstracting: (1<=p40)
states: 37
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.162sec

checking: EF [~ [[[[~ [[p101<=0 | 1<=p104]] | p23<=p82] | [p109<=1 | ~ [[[[[p105<=1 | p59<=0] & [p42<=1 & 1<=p5]] | [~ [1<=p49] | [p18<=1 & p7<=0]]] & [1<=p5 & 1<=p50]]]]] & p97<=1]]]
normalized: E [true U ~ [[[[~ [[[1<=p5 & 1<=p50] & [[[p18<=1 & p7<=0] | ~ [1<=p49]] | [[p42<=1 & 1<=p5] & [p105<=1 | p59<=0]]]]] | p109<=1] | [~ [[p101<=0 | 1<=p104]] | p23<=p82]] & p97<=1]]]

abstracting: (p97<=1)
states: 3,708 (3)
abstracting: (p23<=p82)
states: 3,706 (3)
abstracting: (1<=p104)
states: 1,715 (3)
abstracting: (p101<=0)
states: 3,563 (3)
abstracting: (p109<=1)
states: 196
abstracting: (p59<=0)
states: 2,220 (3)
abstracting: (p105<=1)
states: 3,708 (3)
abstracting: (1<=p5)
states: 1
abstracting: (p42<=1)
states: 3,708 (3)
abstracting: (1<=p49)
states: 6
abstracting: (p7<=0)
states: 3,707 (3)
abstracting: (p18<=1)
states: 3,708 (3)
abstracting: (1<=p50)
states: 184
abstracting: (1<=p5)
states: 1
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [[p28<=1 & [[~ [[p69<=1 | 1<=p110]] | p5<=0] | [[[~ [[[[1<=p60 | p67<=0] & p70<=p67] | p52<=p63]] | ~ [p91<=p24]] | p77<=1] | p5<=p106]]]]
normalized: ~ [E [true U ~ [[p28<=1 & [[p5<=p106 | [p77<=1 | [~ [p91<=p24] | ~ [[p52<=p63 | [p70<=p67 & [1<=p60 | p67<=0]]]]]]] | [p5<=0 | ~ [[p69<=1 | 1<=p110]]]]]]]]

abstracting: (1<=p110)
states: 3,552 (3)
abstracting: (p69<=1)
states: 3,708 (3)
abstracting: (p5<=0)
states: 3,707 (3)
abstracting: (p67<=0)
states: 3,692 (3)
abstracting: (1<=p60)
states: 1,800 (3)
abstracting: (p70<=p67)
states: 3,704 (3)
abstracting: (p52<=p63)
states: 3,524 (3)
abstracting: (p91<=p24)
states: 3,698 (3)
abstracting: (p77<=1)
states: 3,708 (3)
abstracting: (p5<=p106)
states: 3,707 (3)
abstracting: (p28<=1)
states: 3,708 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [[p106<=1 | ~ [[[p74<=0 | p102<=p19] & [[[[[[1<=p65 & 1<=p61] & [p66<=1 | p20<=p5]] & p64<=0] | [~ [1<=p37] | [~ [1<=p75] & [p103<=p13 | p99<=p91]]]] & p69<=0] | [~ [p9<=1] | ~ [[1<=p37 & 1<=p18]]]]]]]]
normalized: ~ [E [true U ~ [[p106<=1 | ~ [[[[~ [[1<=p37 & 1<=p18]] | ~ [p9<=1]] | [p69<=0 & [[[[p103<=p13 | p99<=p91] & ~ [1<=p75]] | ~ [1<=p37]] | [p64<=0 & [[p66<=1 | p20<=p5] & [1<=p65 & 1<=p61]]]]]] & [p74<=0 | p102<=p19]]]]]]]

abstracting: (p102<=p19)
states: 3,608 (3)
abstracting: (p74<=0)
states: 3,692 (3)
abstracting: (1<=p61)
states: 4
abstracting: (1<=p65)
states: 16
abstracting: (p20<=p5)
states: 3,704 (3)
abstracting: (p66<=1)
states: 3,708 (3)
abstracting: (p64<=0)
states: 3,692 (3)
abstracting: (1<=p37)
states: 37
abstracting: (1<=p75)
states: 16
abstracting: (p99<=p91)
states: 3,563 (3)
abstracting: (p103<=p13)
states: 3,708 (3)
abstracting: (p69<=0)
states: 948
abstracting: (p9<=1)
states: 3,129 (3)
abstracting: (1<=p18)
states: 4
abstracting: (1<=p37)
states: 37
abstracting: (p106<=1)
states: 3,708 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [~ [[1<=p28 | [[~ [p66<=p12] | [p15<=p30 | p75<=p86]] & [1<=p16 | [[[~ [[p58<=p8 & 1<=p37]] & [1<=p82 | [1<=p25 | p78<=p59]]] | ~ [[[p58<=1 | 1<=p57] | p23<=p77]]] & 1<=p34]]]]]]
normalized: E [true U ~ [[1<=p28 | [[1<=p16 | [1<=p34 & [~ [[p23<=p77 | [p58<=1 | 1<=p57]]] | [[1<=p82 | [1<=p25 | p78<=p59]] & ~ [[p58<=p8 & 1<=p37]]]]]] & [[p15<=p30 | p75<=p86] | ~ [p66<=p12]]]]]]

abstracting: (p66<=p12)
states: 3,692 (3)
abstracting: (p75<=p86)
states: 3,692 (3)
abstracting: (p15<=p30)
states: 3,706 (3)
abstracting: (1<=p37)
states: 37
abstracting: (p58<=p8)
states: 1,452 (3)
abstracting: (p78<=p59)
states: 3,692 (3)
abstracting: (1<=p25)
states: 1
abstracting: (1<=p82)
states: 40
abstracting: (1<=p57)
states: 3,654 (3)
abstracting: (p58<=1)
states: 1,411 (3)
abstracting: (p23<=p77)
states: 3,706 (3)
abstracting: (1<=p34)
states: 141
abstracting: (1<=p16)
states: 4
abstracting: (1<=p28)
states: 104
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: EF [[[1<=p77 & [~ [[~ [1<=p45] | [~ [[p99<=p59 & [p96<=1 & p18<=1]]] | [p69<=p102 & [[1<=p99 & 1<=p21] & [p6<=p29 & p47<=0]]]]]] | [p64<=p78 | ~ [p3<=p17]]]] & [1<=p17 & [p54<=p96 | ~ [1<=p41]]]]]
normalized: E [true U [[1<=p17 & [p54<=p96 | ~ [1<=p41]]] & [1<=p77 & [[p64<=p78 | ~ [p3<=p17]] | ~ [[[[p69<=p102 & [[p6<=p29 & p47<=0] & [1<=p99 & 1<=p21]]] | ~ [[p99<=p59 & [p96<=1 & p18<=1]]]] | ~ [1<=p45]]]]]]]

abstracting: (1<=p45)
states: 43
abstracting: (p18<=1)
states: 3,708 (3)
abstracting: (p96<=1)
states: 3,708 (3)
abstracting: (p99<=p59)
states: 3,627 (3)
abstracting: (1<=p21)
states: 4
abstracting: (1<=p99)
states: 145
abstracting: (p47<=0)
states: 3,665 (3)
abstracting: (p6<=p29)
states: 3,707 (3)
abstracting: (p69<=p102)
states: 1,028 (3)
abstracting: (p3<=p17)
states: 3,707 (3)
abstracting: (p64<=p78)
states: 3,692 (3)
abstracting: (1<=p77)
states: 12
abstracting: (1<=p41)
states: 31
abstracting: (p54<=p96)
states: 3,665 (3)
abstracting: (1<=p17)
states: 4
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EF [~ [[[p98<=p89 | ~ [1<=p78]] & [[[[[p59<=1 | [[p27<=1 | p61<=1] | [p66<=1 & p20<=0]]] | [[[p2<=p62 & p46<=p34] & p20<=0] & [[1<=p66 & p18<=0] | [1<=p40 & p14<=1]]]] & p104<=p104] | [~ [p1<=1] | [[[1<=p9 | 1<=p50] & [[p6<=0 & p15<=p63] & [1<=p61 | p37<=0]]] & p9<=1]]] & p69<=p8]]]]
normalized: E [true U ~ [[[p69<=p8 & [[[p9<=1 & [[[1<=p61 | p37<=0] & [p6<=0 & p15<=p63]] & [1<=p9 | 1<=p50]]] | ~ [p1<=1]] | [p104<=p104 & [[[[1<=p40 & p14<=1] | [1<=p66 & p18<=0]] & [p20<=0 & [p2<=p62 & p46<=p34]]] | [p59<=1 | [[p66<=1 & p20<=0] | [p27<=1 | p61<=1]]]]]]] & [p98<=p89 | ~ [1<=p78]]]]]

abstracting: (1<=p78)
states: 56
abstracting: (p98<=p89)
states: 3,628 (3)
abstracting: (p61<=1)
states: 3,708 (3)
abstracting: (p27<=1)
states: 3,708 (3)
abstracting: (p20<=0)
states: 3,704 (3)
abstracting: (p66<=1)
states: 3,708 (3)
abstracting: (p59<=1)
states: 3,052 (3)
abstracting: (p46<=p34)
states: 3,665 (3)
abstracting: (p2<=p62)
states: 3,707 (3)
abstracting: (p20<=0)
states: 3,704 (3)
abstracting: (p18<=0)
states: 3,704 (3)
abstracting: (1<=p66)
states: 16
abstracting: (p14<=1)
states: 3,708 (3)
abstracting: (1<=p40)
states: 37
abstracting: (p104<=p104)
states: 3,708 (3)
abstracting: (p1<=1)
states: 3,708 (3)
abstracting: (1<=p50)
states: 184
abstracting: (1<=p9)
states: 2,805 (3)
abstracting: (p15<=p63)
states: 3,706 (3)
abstracting: (p6<=0)
states: 3,707 (3)
abstracting: (p37<=0)
states: 3,671 (3)
abstracting: (1<=p61)
states: 4
abstracting: (p9<=1)
states: 3,129 (3)
abstracting: (p69<=p8)
states: 3,236 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: EF [[[[[[[[[p62<=p41 & [1<=p4 & p92<=p79]] | ~ [[p42<=0 | 1<=p100]]] & ~ [p82<=p20]] & p75<=1] | [~ [1<=p92] & p5<=p6]] | p51<=p22] & [1<=p13 & ~ [[p44<=1 | [[~ [[p83<=p90 | 1<=p93]] & ~ [[p59<=1 | p107<=1]]] & [[1<=p30 | p40<=p77] | [p105<=p55 & [p21<=p109 & 1<=p11]]]]]]]] & p45<=p91]]
normalized: E [true U [p45<=p91 & [[1<=p13 & ~ [[p44<=1 | [[[p105<=p55 & [p21<=p109 & 1<=p11]] | [1<=p30 | p40<=p77]] & [~ [[p59<=1 | p107<=1]] & ~ [[p83<=p90 | 1<=p93]]]]]]] & [p51<=p22 | [[p5<=p6 & ~ [1<=p92]] | [p75<=1 & [~ [p82<=p20] & [~ [[p42<=0 | 1<=p100]] | [p62<=p41 & [1<=p4 & p92<=p79]]]]]]]]]]

abstracting: (p92<=p79)
states: 3,698 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p62<=p41)
states: 3,704 (3)
abstracting: (1<=p100)
states: 145
abstracting: (p42<=0)
states: 3,677 (3)
abstracting: (p82<=p20)
states: 3,668 (3)
abstracting: (p75<=1)
states: 3,708 (3)
abstracting: (1<=p92)
states: 10
abstracting: (p5<=p6)
states: 3,707 (3)
abstracting: (p51<=p22)
states: 3,530 (3)
abstracting: (1<=p93)
states: 10
abstracting: (p83<=p90)
states: 1,240 (3)
abstracting: (p107<=1)
states: 3,708 (3)
abstracting: (p59<=1)
states: 3,052 (3)
abstracting: (p40<=p77)
states: 3,671 (3)
abstracting: (1<=p30)
states: 67
abstracting: (1<=p11)
states: 1,341 (3)
abstracting: (p21<=p109)
states: 3,704 (3)
abstracting: (p105<=p55)
states: 3,701 (3)
abstracting: (p44<=1)
states: 3,708 (3)
abstracting: (1<=p13)
states: 3,533 (3)
abstracting: (p45<=p91)
states: 3,665 (3)
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [[[~ [[~ [p17<=p59] & p6<=p5]] | [[~ [p54<=p103] & p75<=p14] & [[~ [[[[p97<=p10 | 1<=p63] | 1<=p95] & 1<=p35]] | p98<=p62] | p56<=1]]] | [[[~ [[~ [[p94<=1 & p41<=0]] & [[p72<=0 & p37<=0] & [1<=p48 & p34<=1]]]] & [p96<=0 | [p45<=1 | p98<=1]]] & [[~ [1<=p11] | [[[~ [1<=p16] | [p50<=1 & p106<=p60]] | [~ [p72<=0] & [p24<=0 & 1<=p98]]] & ~ [[~ [p31<=0] | p67<=0]]]] | 1<=p2]] & p47<=1]]]
normalized: E [true U [[p47<=1 & [[1<=p2 | [[~ [[p67<=0 | ~ [p31<=0]]] & [[[p24<=0 & 1<=p98] & ~ [p72<=0]] | [[p50<=1 & p106<=p60] | ~ [1<=p16]]]] | ~ [1<=p11]]] & [[p96<=0 | [p45<=1 | p98<=1]] & ~ [[[[1<=p48 & p34<=1] & [p72<=0 & p37<=0]] & ~ [[p94<=1 & p41<=0]]]]]]] | [[[p56<=1 | [p98<=p62 | ~ [[1<=p35 & [1<=p95 | [p97<=p10 | 1<=p63]]]]]] & [p75<=p14 & ~ [p54<=p103]]] | ~ [[p6<=p5 & ~ [p17<=p59]]]]]]

abstracting: (p17<=p59)
states: 3,704 (3)
abstracting: (p6<=p5)
states: 3,707 (3)
abstracting: (p54<=p103)
states: 3,665 (3)
abstracting: (p75<=p14)
states: 3,692 (3)
abstracting: (1<=p63)
states: 16
abstracting: (p97<=p10)
states: 3,708 (3)
abstracting: (1<=p95)
states: 617
abstracting: (1<=p35)
states: 141
abstracting: (p98<=p62)
states: 3,628 (3)
abstracting: (p56<=1)
states: 245
abstracting: (p41<=0)
states: 3,677 (3)
abstracting: (p94<=1)
states: 3,708 (3)
abstracting: (p37<=0)
states: 3,671 (3)
abstracting: (p72<=0)
states: 3,707 (3)
abstracting: (p34<=1)
states: 3,708 (3)
abstracting: (1<=p48)
states: 141
abstracting: (p98<=1)
states: 3,708 (3)
abstracting: (p45<=1)
states: 3,708 (3)
abstracting: (p96<=0)
states: 3,707 (3)
abstracting: (1<=p11)
states: 1,341 (3)
abstracting: (1<=p16)
states: 4
abstracting: (p106<=p60)
states: 3,383 (3)
abstracting: (p50<=1)
states: 3,708 (3)
abstracting: (p72<=0)
states: 3,707 (3)
abstracting: (1<=p98)
states: 80
abstracting: (p24<=0)
states: 3,671 (3)
abstracting: (p31<=0)
states: 3,463 (3)
abstracting: (p67<=0)
states: 3,692 (3)
abstracting: (1<=p2)
states: 1
abstracting: (p47<=1)
states: 3,708 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EF [~ [[~ [[[[~ [p62<=1] & [[[1<=p77 & p97<=p22] | p20<=1] & [~ [p23<=0] & [p6<=p97 | p78<=1]]]] | [p44<=p42 | [p65<=p49 | [[p43<=0 & 1<=p82] & p71<=0]]]] | [[p50<=0 | p74<=0] | p44<=p25]]] | ~ [[[~ [[[~ [1<=p18] | [p91<=p35 & 1<=p8]] | [[p41<=1 | p53<=0] | [1<=p31 & p16<=p6]]]] & [p63<=0 | ~ [[p13<=1 | p69<=p56]]]] & [p86<=p21 | [~ [[[p12<=p29 & 1<=p28] | ~ [p103<=1]]] | p109<=p74]]]]]]]
normalized: E [true U ~ [[~ [[[p86<=p21 | [p109<=p74 | ~ [[~ [p103<=1] | [p12<=p29 & 1<=p28]]]]] & [[p63<=0 | ~ [[p13<=1 | p69<=p56]]] & ~ [[[[1<=p31 & p16<=p6] | [p41<=1 | p53<=0]] | [[p91<=p35 & 1<=p8] | ~ [1<=p18]]]]]]] | ~ [[[p44<=p25 | [p50<=0 | p74<=0]] | [[p44<=p42 | [p65<=p49 | [p71<=0 & [p43<=0 & 1<=p82]]]] | [[[[p6<=p97 | p78<=1] & ~ [p23<=0]] & [p20<=1 | [1<=p77 & p97<=p22]]] & ~ [p62<=1]]]]]]]]

abstracting: (p62<=1)
states: 3,708 (3)
abstracting: (p97<=p22)
states: 3,628 (3)
abstracting: (1<=p77)
states: 12
abstracting: (p20<=1)
states: 3,708 (3)
abstracting: (p23<=0)
states: 3,706 (3)
abstracting: (p78<=1)
states: 3,708 (3)
abstracting: (p6<=p97)
states: 3,707 (3)
abstracting: (1<=p82)
states: 40
abstracting: (p43<=0)
states: 3,628 (3)
abstracting: (p71<=0)
states: 3,018 (3)
abstracting: (p65<=p49)
states: 3,692 (3)
abstracting: (p44<=p42)
states: 3,665 (3)
abstracting: (p74<=0)
states: 3,692 (3)
abstracting: (p50<=0)
states: 3,524 (3)
abstracting: (p44<=p25)
states: 3,665 (3)
abstracting: (1<=p18)
states: 4
abstracting: (1<=p8)
states: 3,060 (3)
abstracting: (p91<=p35)
states: 3,698 (3)
abstracting: (p53<=0)
states: 3,665 (3)
abstracting: (p41<=1)
states: 3,708 (3)
abstracting: (p16<=p6)
states: 3,704 (3)
abstracting: (1<=p31)
states: 245
abstracting: (p69<=p56)
states: 3,684 (3)
abstracting: (p13<=1)
states: 957
abstracting: (p63<=0)
states: 3,692 (3)
abstracting: (1<=p28)
states: 104
abstracting: (p12<=p29)
states: 2,800 (3)
abstracting: (p103<=1)
states: 3,708 (3)
abstracting: (p109<=p74)
states: 156
abstracting: (p86<=p21)
states: 3,704 (3)
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [[[[~ [[[~ [1<=p53] | p47<=1] | ~ [p68<=p103]]] | ~ [p45<=p10]] & [[[[[1<=p96 | [p94<=p82 | [p25<=p67 & p95<=p46]]] & p66<=p70] & p73<=p44] & p50<=p82] | [[[p70<=p55 & [[p93<=p27 | ~ [p78<=p110]] & ~ [[p7<=p71 & p86<=p85]]]] | 1<=p80] & 1<=p103]]] & [p105<=1 | [[[[~ [1<=p94] & p72<=1] & [[~ [1<=p25] | [[1<=p71 & p32<=p85] | [p84<=p24 | p30<=0]]] & [[p101<=1 | p29<=p8] & ~ [[1<=p105 & 1<=p28]]]]] & 1<=p44] | p81<=1]]]]
normalized: E [true U [[p105<=1 | [p81<=1 | [1<=p44 & [[[~ [[1<=p105 & 1<=p28]] & [p101<=1 | p29<=p8]] & [[[p84<=p24 | p30<=0] | [1<=p71 & p32<=p85]] | ~ [1<=p25]]] & [p72<=1 & ~ [1<=p94]]]]]] & [[[1<=p103 & [1<=p80 | [p70<=p55 & [~ [[p7<=p71 & p86<=p85]] & [p93<=p27 | ~ [p78<=p110]]]]]] | [p50<=p82 & [p73<=p44 & [p66<=p70 & [1<=p96 | [p94<=p82 | [p25<=p67 & p95<=p46]]]]]]] & [~ [p45<=p10] | ~ [[~ [p68<=p103] | [p47<=1 | ~ [1<=p53]]]]]]]]

abstracting: (1<=p53)
states: 43
abstracting: (p47<=1)
states: 3,708 (3)
abstracting: (p68<=p103)
states: 3,692 (3)
abstracting: (p45<=p10)
states: 3,708 (3)
abstracting: (p95<=p46)
states: 3,099 (3)
abstracting: (p25<=p67)
states: 3,707 (3)
abstracting: (p94<=p82)
states: 3,698 (3)
abstracting: (1<=p96)
states: 1
abstracting: (p66<=p70)
states: 3,692 (3)
abstracting: (p73<=p44)
states: 3,692 (3)
abstracting: (p50<=p82)
states: 3,524 (3)
abstracting: (p78<=p110)
states: 3,708 (3)
abstracting: (p93<=p27)
states: 3,698 (3)
abstracting: (p86<=p85)
states: 3,704 (3)
abstracting: (p7<=p71)
states: 3,707 (3)
abstracting: (p70<=p55)
states: 3,707 (3)
abstracting: (1<=p80)
states: 40
abstracting: (1<=p103)
states: 100
abstracting: (1<=p94)
states: 10
abstracting: (p72<=1)
states: 3,708 (3)
abstracting: (1<=p25)
states: 1
abstracting: (p32<=p85)
states: 3,567 (3)
abstracting: (1<=p71)
states: 690
abstracting: (p30<=0)
states: 3,641 (3)
abstracting: (p84<=p24)
states: 3,704 (3)
abstracting: (p29<=p8)
states: 3,692 (3)
abstracting: (p101<=1)
states: 3,708 (3)
abstracting: (1<=p28)
states: 104
abstracting: (1<=p105)
states: 35
abstracting: (1<=p44)
states: 43
abstracting: (p81<=1)
states: 3,708 (3)
abstracting: (p105<=1)
states: 3,708 (3)
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [[[~ [[[p87<=1 | [[~ [[1<=p51 & p66<=0]] & [[p35<=p97 | p98<=0] | ~ [p76<=1]]] | [p106<=p110 & [[1<=p72 | p40<=p8] & ~ [1<=p6]]]]] | [[~ [p110<=p41] | 1<=p84] | [p2<=p91 | [[[1<=p56 | p61<=0] & [p90<=1 | p31<=p3]] | ~ [p77<=p28]]]]]] & [p39<=1 | ~ [1<=p67]]] | [[~ [[~ [[[~ [1<=p22] & [1<=p81 | 1<=p81]] | [p71<=p85 & [p48<=p78 | p98<=1]]]] & p11<=p28]] | [p67<=1 & [[[1<=p52 | [[p44<=p89 & p63<=0] & [1<=p63 & 1<=p102]]] | [[~ [p102<=1] | 1<=p29] | 1<=p76]] | [[[p87<=0 & ~ [1<=p31]] | 1<=p69] | p40<=1]]]] | [[p60<=1 | ~ [[[~ [p67<=0] | [[p96<=p104 | p99<=1] | p94<=1]] & [1<=p110 & [[p60<=1 | p11<=p85] | [1<=p32 & p100<=0]]]]]] | [[[~ [p68<=1] & p12<=p57] | ~ [[p25<=p42 & ~ [1<=p92]]]] & ~ [[~ [1<=p20] | [[p93<=0 | 1<=p55] & [p68<=p73 | p91<=p14]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[[p68<=p73 | p91<=p14] & [p93<=0 | 1<=p55]] | ~ [1<=p20]]] & [~ [[p25<=p42 & ~ [1<=p92]]] | [p12<=p57 & ~ [p68<=1]]]] | [p60<=1 | ~ [[[1<=p110 & [[1<=p32 & p100<=0] | [p60<=1 | p11<=p85]]] & [[p94<=1 | [p96<=p104 | p99<=1]] | ~ [p67<=0]]]]]] | [[p67<=1 & [[p40<=1 | [1<=p69 | [p87<=0 & ~ [1<=p31]]]] | [[1<=p76 | [1<=p29 | ~ [p102<=1]]] | [1<=p52 | [[1<=p63 & 1<=p102] & [p44<=p89 & p63<=0]]]]]] | ~ [[p11<=p28 & ~ [[[p71<=p85 & [p48<=p78 | p98<=1]] | [[1<=p81 | 1<=p81] & ~ [1<=p22]]]]]]]] | [[p39<=1 | ~ [1<=p67]] & ~ [[[[p2<=p91 | [~ [p77<=p28] | [[p90<=1 | p31<=p3] & [1<=p56 | p61<=0]]]] | [1<=p84 | ~ [p110<=p41]]] | [p87<=1 | [[p106<=p110 & [~ [1<=p6] & [1<=p72 | p40<=p8]]] | [[~ [p76<=1] | [p35<=p97 | p98<=0]] & ~ [[1<=p51 & p66<=0]]]]]]]]]]]]

abstracting: (p66<=0)
states: 3,692 (3)
abstracting: (1<=p51)
states: 184
abstracting: (p98<=0)
states: 3,628 (3)
abstracting: (p35<=p97)
states: 3,567 (3)
abstracting: (p76<=1)
states: 3,708 (3)
abstracting: (p40<=p8)
states: 3,702 (3)
abstracting: (1<=p72)
states: 1
abstracting: (1<=p6)
states: 1
abstracting: (p106<=p110)
states: 3,708 (3)
abstracting: (p87<=1)
states: 3,708 (3)
abstracting: (p110<=p41)
states: 156
abstracting: (1<=p84)
states: 4
abstracting: (p61<=0)
states: 3,704 (3)
abstracting: (1<=p56)
states: 3,651 (3)
abstracting: (p31<=p3)
states: 3,463 (3)
abstracting: (p90<=1)
states: 3,708 (3)
abstracting: (p77<=p28)
states: 3,696 (3)
abstracting: (p2<=p91)
states: 3,707 (3)
abstracting: (1<=p67)
states: 16
abstracting: (p39<=1)
states: 3,708 (3)
abstracting: (1<=p22)
states: 74
abstracting: (1<=p81)
states: 40
abstracting: (1<=p81)
states: 40
abstracting: (p98<=1)
states: 3,708 (3)
abstracting: (p48<=p78)
states: 3,567 (3)
abstracting: (p71<=p85)
states: 3,022 (3)
abstracting: (p11<=p28)
states: 2,434 (3)
abstracting: (p63<=0)
states: 3,692 (3)
abstracting: (p44<=p89)
states: 3,665 (3)
abstracting: (1<=p102)
states: 100
abstracting: (1<=p63)
states: 16
abstracting: (1<=p52)
states: 184
abstracting: (p102<=1)
states: 3,708 (3)
abstracting: (1<=p29)
states: 67
abstracting: (1<=p76)
states: 12
abstracting: (1<=p31)
states: 245
abstracting: (p87<=0)
states: 3,704 (3)
abstracting: (1<=p69)
states: 2,760 (3)
abstracting: (p40<=1)
states: 3,708 (3)
abstracting: (p67<=1)
states: 3,708 (3)
abstracting: (p67<=0)
states: 3,692 (3)
abstracting: (p99<=1)
states: 3,708 (3)
abstracting: (p96<=p104)
states: 3,707 (3)
abstracting: (p94<=1)
states: 3,708 (3)
abstracting: (p11<=p85)
states: 2,367 (3)
abstracting: (p60<=1)
states: 2,928 (3)
abstracting: (p100<=0)
states: 3,563 (3)
abstracting: (1<=p32)
states: 141
abstracting: (1<=p110)
states: 3,552 (3)
abstracting: (p60<=1)
states: 2,928 (3)
abstracting: (p68<=1)
states: 3,708 (3)
abstracting: (p12<=p57)
states: 3,708 (3)
abstracting: (1<=p92)
states: 10
abstracting: (p25<=p42)
states: 3,707 (3)
abstracting: (1<=p20)
states: 4
abstracting: (1<=p55)
states: 2,974 (3)
abstracting: (p93<=0)
states: 3,698 (3)
abstracting: (p91<=p14)
states: 3,698 (3)
abstracting: (p68<=p73)
states: 3,692 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

totally nodes used: 292473 (2.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 738851 2102248 2841099
used/not used/entry size/cache size: 2285673 64823191 16 1024MB
basic ops cache: hits/miss/sum: 82043 593958 676001
used/not used/entry size/cache size: 799919 15977297 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 8965 47213 56178
used/not used/entry size/cache size: 47086 8341522 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 66852027
1 234644
2 19939
3 1810
4 209
5 74
6 20
7 6
8 7
9 8
>= 10 120

Total processing time: 0m 6.435sec


BK_STOP 1678840419036

--------------------
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:32471 (331), effective:3707 (37)

initing FirstDep: 0m 0.000sec


iterations count:711 (7), effective:49 (0)

iterations count:1622 (16), effective:118 (1)

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

iterations count:2396 (24), effective:200 (2)

iterations count:101 (1), effective:1 (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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r138-smll-167819420700454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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