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.r170-tall-167838857300454.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 FlexibleBarrier-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 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 69K 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 FlexibleBarrier-PT-04b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678550057162

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=FlexibleBarrier-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 15:54:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 15:54:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:54:19] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-11 15:54:19] [INFO ] Transformed 268 places.
[2023-03-11 15:54:19] [INFO ] Transformed 305 transitions.
[2023-03-11 15:54:19] [INFO ] Found NUPN structural information;
[2023-03-11 15:54:19] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 235 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 9) seen :4
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 305 rows 268 cols
[2023-03-11 15:54:19] [INFO ] Computed 6 place invariants in 24 ms
[2023-03-11 15:54:20] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 15:54:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-11 15:54:20] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 15:54:20] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 8 ms to minimize.
[2023-03-11 15:54:20] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2023-03-11 15:54:20] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2023-03-11 15:54:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2023-03-11 15:54:20] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 0 ms to minimize.
[2023-03-11 15:54:21] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2023-03-11 15:54:21] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2023-03-11 15:54:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2023-03-11 15:54:21] [INFO ] After 919ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-11 15:54:21] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 15 ms.
Support contains 44 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 159 edges and 268 vertex of which 6 / 268 are part of one of the 1 SCC in 13 ms
Free SCC test removed 5 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 263 transition count 256
Reduce places removed 43 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 52 rules applied. Total rules applied 96 place count 220 transition count 247
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 105 place count 211 transition count 247
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 105 place count 211 transition count 233
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 133 place count 197 transition count 233
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 187 place count 143 transition count 179
Iterating global reduction 3 with 54 rules applied. Total rules applied 241 place count 143 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 241 place count 143 transition count 177
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 245 place count 141 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 248 place count 138 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 138 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 138 transition count 172
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 301 place count 114 transition count 148
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 114 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 306 place count 112 transition count 152
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 112 transition count 151
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 323 place count 112 transition count 135
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 339 place count 96 transition count 135
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 342 place count 96 transition count 132
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 344 place count 96 transition count 132
Applied a total of 344 rules in 123 ms. Remains 96 /268 variables (removed 172) and now considering 132/305 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 96/268 places, 132/305 transitions.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1647895 steps, run visited all 2 properties in 2227 ms. (steps per millisecond=739 )
Probabilistic random walk after 1647895 steps, saw 465080 distinct states, run finished after 2227 ms. (steps per millisecond=739 ) properties seen :2
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 4838 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: FlexibleBarrier_PT_04b
(NrP: 268 NrTr: 305 NrArc: 743)

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

net check time: 0m 0.000sec

init dd package: 0m 2.927sec


RS generation: 20m18.475sec


-> reachability set: #nodes 784460 (7.8e+05) #states 791,372,373 (8)



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

checking: AG [p97<=0]
normalized: ~ [E [true U ~ [p97<=0]]]

abstracting: (p97<=0)
states: 779,584,066 (8)

before gc: list nodes free: 804612

after gc: idd nodes used:1078654, unused:62921346; list nodes free:290989057
MC time: 2m29.009sec

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

abstracting: (p26<=1)
states: 791,372,373 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.110sec

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

abstracting: (1<=p226)
states: 10,011,239 (7)

before gc: list nodes free: 16222317

after gc: idd nodes used:1223458, unused:62776542; list nodes free:290386772
MC time: 2m29.072sec

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

abstracting: (p59<=1)
states: 791,372,373 (8)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.075sec

checking: EF [~ [p89<=0]]
normalized: E [true U ~ [p89<=0]]

abstracting: (p89<=0)
states: 772,743,143 (8)

before gc: list nodes free: 15237603

after gc: idd nodes used:1257004, unused:62742996; list nodes free:290168894
MC time: 2m29.025sec

checking: EF [~ [[1<=p226 | [p134<=0 & ~ [[[~ [[p31<=0 | 1<=p55]] | 1<=p135] & ~ [[[p54<=1 & p94<=p243] & ~ [p151<=p264]]]]]]]]]
normalized: E [true U ~ [[1<=p226 | [p134<=0 & ~ [[~ [[~ [p151<=p264] & [p54<=1 & p94<=p243]]] & [1<=p135 | ~ [[p31<=0 | 1<=p55]]]]]]]]]

abstracting: (1<=p55)
states: 9,332,616 (6)
abstracting: (p31<=0)
states: 774,840,015 (8)
abstracting: (1<=p135)
states: 16,535,284 (7)
abstracting: (p94<=p243)
states: 772,033,008 (8)
abstracting: (p54<=1)
states: 791,372,373 (8)
abstracting: (p151<=p264)
states: 775,081,822 (8)
abstracting: (p134<=0)
states: 780,467,086 (8)
abstracting: (1<=p226)
states: 10,011,239 (7)
MC time: 2m18.055sec

checking: EF [~ [[[~ [[p38<=p220 & p128<=0]] | [[[~ [p133<=p96] | ~ [[[1<=p189 & p91<=1] | [p48<=p21 | 1<=p0]]]] | p235<=0] | [[[p118<=0 | ~ [[1<=p246 | 1<=p259]]] | 1<=p261] | p219<=1]]] | 1<=p178]]]
normalized: E [true U ~ [[1<=p178 | [[[p219<=1 | [1<=p261 | [p118<=0 | ~ [[1<=p246 | 1<=p259]]]]] | [p235<=0 | [~ [[[p48<=p21 | 1<=p0] | [1<=p189 & p91<=1]]] | ~ [p133<=p96]]]] | ~ [[p38<=p220 & p128<=0]]]]]]

abstracting: (p128<=0)
states: 771,597,993 (8)
abstracting: (p38<=p220)
states: 769,915,495 (8)
abstracting: (p133<=p96)
states: 771,463,891 (8)
abstracting: (p91<=1)
states: 791,372,373 (8)
abstracting: (1<=p189)
states: 21,565,812 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p48<=p21)
states: 775,692,334 (8)
abstracting: (p235<=0)
states: 779,388,948 (8)
abstracting: (1<=p259)
states: 8,739,517 (6)
abstracting: (1<=p246)
states: 13,233,873 (7)
abstracting: (p118<=0)
states: 779,427,148 (8)
abstracting: (1<=p261)
states: 37,227,816 (7)
abstracting: (p219<=1)
states: 791,372,373 (8)
abstracting: (1<=p178)
states: 22,005,018 (7)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.635sec

checking: AG [[~ [[~ [p115<=p138] | ~ [[p207<=1 & p257<=1]]]] | [[[[[[~ [[p65<=p30 | 1<=p133]] | [1<=p128 | p219<=p19]] & ~ [[[p155<=1 & p82<=1] & p34<=0]]] & ~ [[p89<=p253 | ~ [[1<=p198 & 1<=p73]]]]] | p228<=0] & p2<=1] & ~ [p247<=p74]]]]
normalized: ~ [E [true U ~ [[[~ [p247<=p74] & [p2<=1 & [p228<=0 | [~ [[p89<=p253 | ~ [[1<=p198 & 1<=p73]]]] & [~ [[p34<=0 & [p155<=1 & p82<=1]]] & [[1<=p128 | p219<=p19] | ~ [[p65<=p30 | 1<=p133]]]]]]]] | ~ [[~ [[p207<=1 & p257<=1]] | ~ [p115<=p138]]]]]]]

abstracting: (p115<=p138)
states: 780,386,708 (8)
abstracting: (p257<=1)
states: 791,372,373 (8)
abstracting: (p207<=1)
states: 791,372,373 (8)
abstracting: (1<=p133)
states: 20,416,872 (7)
abstracting: (p65<=p30)
states: 780,542,593 (8)
abstracting: (p219<=p19)
states: 760,615,383 (8)
abstracting: (1<=p128)
states: 19,774,380 (7)
abstracting: (p82<=1)
states: 791,372,373 (8)
abstracting: (p155<=1)
states: 791,372,373 (8)
abstracting: (p34<=0)
states: 777,738,472 (8)
abstracting: (1<=p73)
states: 19,770,116 (7)
abstracting: (1<=p198)
states: 21,244,843 (7)
abstracting: (p89<=p253)
states: 773,349,242 (8)
abstracting: (p228<=0)
states: 782,328,417 (8)
abstracting: (p2<=1)
states: 791,372,373 (8)
abstracting: (p247<=p74)
states: 778,393,308 (8)

before gc: list nodes free: 12725010

after gc: idd nodes used:4011709, unused:59988291; list nodes free:277919836
MC time: 2m18.005sec

checking: EF [~ [[~ [1<=p247] | [[[[p19<=p34 & [[1<=p201 | [1<=p117 | p30<=p47]] & ~ [p236<=0]]] | [p111<=p147 | [[[p135<=p138 & 1<=p117] & [p79<=1 | 1<=p70]] | [~ [p37<=p228] | ~ [p58<=p230]]]]] & p98<=p61] | [~ [1<=p21] & 1<=p43]]]]]
normalized: E [true U ~ [[[[1<=p43 & ~ [1<=p21]] | [p98<=p61 & [[p111<=p147 | [[~ [p58<=p230] | ~ [p37<=p228]] | [[p79<=1 | 1<=p70] & [p135<=p138 & 1<=p117]]]] | [p19<=p34 & [~ [p236<=0] & [1<=p201 | [1<=p117 | p30<=p47]]]]]]] | ~ [1<=p247]]]]

abstracting: (1<=p247)
states: 13,233,873 (7)
abstracting: (p30<=p47)
states: 780,469,290 (8)
abstracting: (1<=p117)
states: 10,985,665 (7)
abstracting: (1<=p201)
states: 21,244,843 (7)
abstracting: (p236<=0)
states: 778,143,337 (8)
abstracting: (p19<=p34)
states: 771,602,257 (8)
abstracting: (1<=p117)
states: 10,985,665 (7)
abstracting: (p135<=p138)
states: 774,837,089 (8)
abstracting: (1<=p70)
states: 11,315,630 (7)
abstracting: (p79<=1)
states: 791,372,373 (8)
abstracting: (p37<=p228)
states: 773,053,473 (8)
abstracting: (p58<=p230)
states: 780,386,708 (8)
abstracting: (p111<=p147)
states: 780,386,708 (8)
abstracting: (p98<=p61)
states: 779,584,066 (8)
abstracting: (1<=p21)
states: 19,770,116 (7)
abstracting: (1<=p43)
states: 19,770,116 (7)
MC time: 2m 7.003sec

checking: AG [[[~ [[~ [p167<=p172] & [[[~ [p210<=1] & p19<=1] & ~ [[[p36<=p237 & 1<=p182] & [p8<=1 & p44<=p62]]]] | [[[[1<=p35 & p260<=0] & ~ [p212<=0]] | [[p244<=p201 & 1<=p234] | ~ [p162<=p147]]] & ~ [p184<=1]]]]] | [p49<=1 | ~ [[~ [p236<=p178] | ~ [[[[1<=p102 | 1<=p167] | 1<=p137] & ~ [p95<=p208]]]]]]] | [1<=p214 | p170<=0]]]
normalized: ~ [E [true U ~ [[[1<=p214 | p170<=0] | [[p49<=1 | ~ [[~ [[~ [p95<=p208] & [1<=p137 | [1<=p102 | 1<=p167]]]] | ~ [p236<=p178]]]] | ~ [[[[~ [p184<=1] & [[~ [p162<=p147] | [p244<=p201 & 1<=p234]] | [~ [p212<=0] & [1<=p35 & p260<=0]]]] | [~ [[[p8<=1 & p44<=p62] & [p36<=p237 & 1<=p182]]] & [p19<=1 & ~ [p210<=1]]]] & ~ [p167<=p172]]]]]]]]

abstracting: (p167<=p172)
states: 770,127,530 (8)
abstracting: (p210<=1)
states: 791,372,373 (8)
abstracting: (p19<=1)
states: 791,372,373 (8)
abstracting: (1<=p182)
states: 17,720,991 (7)
abstracting: (p36<=p237)
states: 780,469,290 (8)
abstracting: (p44<=p62)
states: 771,872,967 (8)
abstracting: (p8<=1)
states: 791,372,373 (8)
abstracting: (p260<=0)
states: 782,632,856 (8)
abstracting: (1<=p35)
states: 10,903,083 (7)
abstracting: (p212<=0)
states: 781,361,134 (8)
abstracting: (1<=p234)
states: 31,413,296 (7)
abstracting: (p244<=p201)
states: 760,734,542 (8)
abstracting: (p162<=p147)
states: 776,997,065 (8)
abstracting: (p184<=1)
states: 791,372,373 (8)
abstracting: (p236<=p178)
states: 778,612,374 (8)
abstracting: (1<=p167)
states: 21,244,843 (7)
abstracting: (1<=p102)
states: 11,942,280 (7)
abstracting: (1<=p137)
states: 10,162,175 (7)
abstracting: (p95<=p208)
states: 771,923,376 (8)
abstracting: (p49<=1)
states: 791,372,373 (8)
abstracting: (p170<=0)
states: 776,615,909 (8)
abstracting: (1<=p214)
states: 31,413,296 (7)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.594sec

checking: AG [[~ [[[~ [[[[[p257<=p40 & p206<=1] | p107<=1] | p264<=0] & ~ [[1<=p232 | [p262<=1 | p151<=0]]]]] & 1<=p32] & 1<=p18]] | [p261<=0 & [[p128<=p47 | 1<=p229] & [[[[[[p49<=0 & 1<=p76] | [1<=p78 & p12<=1]] | 1<=p118] & ~ [[~ [p93<=p69] | p141<=1]]] | [~ [[p45<=1 & [1<=p74 & 1<=p208]]] & p181<=p223]] & [~ [1<=p190] | p258<=0]]]]]]
normalized: ~ [E [true U ~ [[[p261<=0 & [[[p258<=0 | ~ [1<=p190]] & [[p181<=p223 & ~ [[p45<=1 & [1<=p74 & 1<=p208]]]] | [~ [[p141<=1 | ~ [p93<=p69]]] & [1<=p118 | [[1<=p78 & p12<=1] | [p49<=0 & 1<=p76]]]]]] & [p128<=p47 | 1<=p229]]] | ~ [[1<=p18 & [1<=p32 & ~ [[~ [[1<=p232 | [p262<=1 | p151<=0]]] & [p264<=0 | [p107<=1 | [p257<=p40 & p206<=1]]]]]]]]]]]]

abstracting: (p206<=1)
states: 791,372,373 (8)
abstracting: (p257<=p40)
states: 675,514,646 (8)
abstracting: (p107<=1)
states: 791,372,373 (8)
abstracting: (p264<=0)
states: 647,271,773 (8)
abstracting: (p151<=0)
states: 771,597,993 (8)
abstracting: (p262<=1)
states: 791,372,373 (8)
abstracting: (1<=p232)
states: 10,011,239 (7)
abstracting: (1<=p32)
states: 16,532,358 (7)
abstracting: (1<=p18)
states: 11,315,630 (7)
abstracting: (1<=p229)
states: 31,413,296 (7)
abstracting: (p128<=p47)
states: 772,093,671 (8)
abstracting: (1<=p76)
states: 19,770,116 (7)
abstracting: (p49<=0)
states: 775,692,334 (8)
abstracting: (p12<=1)
states: 791,372,373 (8)
abstracting: (1<=p78)
states: 16,037,543 (7)
abstracting: (1<=p118)
states: 11,945,225 (7)
abstracting: (p93<=p69)
states: 771,602,257 (8)
abstracting: (p141<=1)
states: 791,372,373 (8)
abstracting: (1<=p208)
states: 9,043,956 (6)
abstracting: (1<=p74)
states: 11,315,630 (7)
abstracting: (p45<=1)
states: 791,372,373 (8)
abstracting: (p181<=p223)
states: 773,845,350 (8)
abstracting: (1<=p190)
states: 21,565,812 (7)
abstracting: (p258<=0)
states: 652,729,807 (8)
abstracting: (p261<=0)
states: 754,144,557 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.664sec

checking: AG [[~ [[[~ [[[[[p235<=1 & 1<=p174] | [1<=p133 | p217<=p49]] & ~ [1<=p8]] & [[~ [p111<=p228] & [p74<=1 & 1<=p200]] | [~ [1<=p121] & [p29<=0 | p14<=0]]]]] & ~ [[1<=p235 & [[[1<=p192 & p246<=0] | 1<=p212] | [[p123<=p214 & 1<=p172] & p110<=p220]]]]] & ~ [p183<=1]]] | [p33<=p240 | [~ [p71<=p94] | [p157<=1 & p224<=p49]]]]]
normalized: ~ [E [true U ~ [[[p33<=p240 | [[p157<=1 & p224<=p49] | ~ [p71<=p94]]] | ~ [[~ [p183<=1] & [~ [[1<=p235 & [[p110<=p220 & [p123<=p214 & 1<=p172]] | [1<=p212 | [1<=p192 & p246<=0]]]]] & ~ [[[[[p29<=0 | p14<=0] & ~ [1<=p121]] | [[p74<=1 & 1<=p200] & ~ [p111<=p228]]] & [~ [1<=p8] & [[1<=p133 | p217<=p49] | [p235<=1 & 1<=p174]]]]]]]]]]]]

abstracting: (1<=p174)
states: 21,244,843 (7)
abstracting: (p235<=1)
states: 791,372,373 (8)
abstracting: (p217<=p49)
states: 781,692,419 (8)
abstracting: (1<=p133)
states: 20,416,872 (7)
abstracting: (1<=p8)
states: 10,985,665 (7)
abstracting: (p111<=p228)
states: 780,386,708 (8)
abstracting: (1<=p200)
states: 21,244,843 (7)
abstracting: (p74<=1)
states: 791,372,373 (8)
abstracting: (1<=p121)
states: 19,774,380 (7)
abstracting: (p14<=0)
states: 779,430,093 (8)
abstracting: (p29<=0)
states: 770,959,219 (8)
abstracting: (p246<=0)
states: 778,138,500 (8)
abstracting: (1<=p192)
states: 21,244,843 (7)
abstracting: (1<=p212)
states: 10,011,239 (7)
abstracting: (1<=p172)
states: 14,756,464 (7)
abstracting: (p123<=p214)
states: 772,254,541 (8)
abstracting: (p110<=p220)
states: 780,386,708 (8)
abstracting: (1<=p235)
states: 11,983,425 (7)
abstracting: (p183<=1)
states: 791,372,373 (8)
abstracting: (p71<=p94)
states: 771,602,257 (8)
abstracting: (p224<=p49)
states: 760,586,432 (8)
abstracting: (p157<=1)
states: 791,372,373 (8)
abstracting: (p33<=p240)
states: 781,425,571 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.958sec

checking: EF [[[[~ [[p177<=p132 | ~ [1<=p138]]] & [~ [[[[p148<=p116 & p27<=1] & [[p147<=1 | p168<=p64] & p177<=0]] | [~ [[p216<=1 | p76<=1]] | [[p85<=p239 & p83<=p253] & p204<=1]]]] & p224<=p53]] & p166<=p92] & [[p207<=0 & [[p218<=1 & [~ [[1<=p125 | [1<=p222 | 1<=p24]]] & [[p91<=0 | [p82<=p199 & p247<=1]] & ~ [[p77<=p118 & 1<=p209]]]]] & p76<=1]] & p217<=p146]]]
normalized: E [true U [[p217<=p146 & [p207<=0 & [p76<=1 & [p218<=1 & [[~ [[p77<=p118 & 1<=p209]] & [p91<=0 | [p82<=p199 & p247<=1]]] & ~ [[1<=p125 | [1<=p222 | 1<=p24]]]]]]]] & [p166<=p92 & [[p224<=p53 & ~ [[[[p204<=1 & [p85<=p239 & p83<=p253]] | ~ [[p216<=1 | p76<=1]]] | [[p177<=0 & [p147<=1 | p168<=p64]] & [p148<=p116 & p27<=1]]]]] & ~ [[p177<=p132 | ~ [1<=p138]]]]]]]

abstracting: (1<=p138)
states: 13,636,645 (7)
abstracting: (p177<=p132)
states: 774,941,981 (8)
abstracting: (p27<=1)
states: 791,372,373 (8)
abstracting: (p148<=p116)
states: 771,597,993 (8)
abstracting: (p168<=p64)
states: 776,809,292 (8)
abstracting: (p147<=1)
states: 791,372,373 (8)
abstracting: (p177<=0)
states: 774,439,083 (8)
abstracting: (p76<=1)
states: 791,372,373 (8)
abstracting: (p216<=1)
states: 791,372,373 (8)
abstracting: (p83<=p253)
states: 775,399,061 (8)
abstracting: (p85<=p239)
states: 781,757,707 (8)

before gc: list nodes free: 12855366

after gc: idd nodes used:10506285, unused:53493715; list nodes free:248779742
abstracting: (p204<=1)
states: 791,372,373 (8)
abstracting: (p224<=p53)
states: 760,615,383 (8)
abstracting: (p166<=p92)
states: 777,009,276 (8)
abstracting: (1<=p24)
states: 19,770,116 (7)
abstracting: (1<=p222)
states: 10,011,239 (7)
abstracting: (1<=p125)
states: 19,774,380 (7)
abstracting: (p247<=1)
states: 791,372,373 (8)
abstracting: (p82<=p199)
states: 780,751,398 (8)
abstracting: (p91<=0)
states: 770,959,219 (8)
abstracting: (1<=p209)
states: 31,413,296 (7)
abstracting: (p77<=p118)
states: 775,549,724 (8)
abstracting: (p218<=1)
states: 791,372,373 (8)
abstracting: (p76<=1)
states: 791,372,373 (8)
abstracting: (p207<=0)
states: 781,361,134 (8)
abstracting: (p217<=p146)
states: 781,564,633 (8)
MC time: 2m29.067sec

checking: AG [~ [[~ [[[[[~ [p24<=1] | ~ [p156<=p237]] & [1<=p139 & [1<=p8 | p31<=0]]] & [1<=p215 | [[p257<=p134 | 1<=p9] | [p71<=1 & p235<=p215]]]] | p160<=1]] & ~ [[[[~ [[p175<=1 | p222<=p61]] & 1<=p230] | [[[p157<=p65 & p153<=1] & [p96<=1 & p31<=p239]] & p60<=1]] & [[[p160<=0 & p256<=p261] | [[p198<=0 | 1<=p155] | [p258<=0 | p12<=0]]] | [~ [[p256<=p218 & p91<=p167]] & ~ [1<=p246]]]]]]]]
normalized: ~ [E [true U [~ [[[[~ [1<=p246] & ~ [[p256<=p218 & p91<=p167]]] | [[[p258<=0 | p12<=0] | [p198<=0 | 1<=p155]] | [p160<=0 & p256<=p261]]] & [[p60<=1 & [[p96<=1 & p31<=p239] & [p157<=p65 & p153<=1]]] | [1<=p230 & ~ [[p175<=1 | p222<=p61]]]]]] & ~ [[p160<=1 | [[1<=p215 | [[p71<=1 & p235<=p215] | [p257<=p134 | 1<=p9]]] & [[1<=p139 & [1<=p8 | p31<=0]] & [~ [p156<=p237] | ~ [p24<=1]]]]]]]]]

abstracting: (p24<=1)
states: 791,372,373 (8)
abstracting: (p156<=p237)
states: 771,874,131 (8)
abstracting: (p31<=0)
states: 774,840,015 (8)
abstracting: (1<=p8)
states: 10,985,665 (7)
abstracting: (1<=p139)
states: 10,905,287 (7)
abstracting: (1<=p9)
states: 10,985,665 (7)
abstracting: (p257<=p134)
states: 674,691,576 (8)
abstracting: (p235<=p215)
states: 779,388,948 (8)
abstracting: (p71<=1)
states: 791,372,373 (8)
abstracting: (1<=p215)
states: 9,043,956 (6)
abstracting: (p160<=1)
states: 791,372,373 (8)
abstracting: (p222<=p61)
states: 781,361,134 (8)
abstracting: (p175<=1)
states: 791,372,373 (8)
abstracting: (1<=p230)
states: 9,043,956 (6)
abstracting: (p153<=1)
states: 791,372,373 (8)
abstracting: (p157<=p65)
states: 771,918,253 (8)
abstracting: (p31<=p239)
states: 775,399,061 (8)
abstracting: (p96<=1)
states: 791,372,373 (8)
abstracting: (p60<=1)
states: 791,372,373 (8)
abstracting: (p256<=p261)
states: 766,790,679 (8)
abstracting: (p160<=0)
states: 779,112,671 (8)
abstracting: (1<=p155)
states: 11,945,225 (7)
abstracting: (p198<=0)
states: 770,127,530 (8)
abstracting: (p12<=0)
states: 780,386,708 (8)
abstracting: (p258<=0)
states: 652,729,807 (8)
abstracting: (p91<=p167)
states: 771,501,738 (8)
abstracting: (p256<=p218)
states: 767,048,799 (8)
abstracting: (1<=p246)
states: 13,233,873 (7)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.715sec

checking: EF [[[[[~ [[[p97<=p93 & [~ [p89<=1] & [p122<=1 | p257<=0]]] | [[~ [p150<=1] | p49<=p185] | [1<=p253 | p224<=1]]]] | p58<=0] & ~ [1<=p191]] & ~ [[[[~ [[p94<=1 & 1<=p189]] | ~ [[[1<=p209 & p237<=1] & [p119<=0 & p60<=0]]]] | p226<=1] & p15<=p183]]] & ~ [[~ [[~ [[[p262<=p190 & p20<=p160] | [p170<=1 & 1<=p159]]] & p205<=p254]] | [[[~ [[1<=p242 | 1<=p19]] | ~ [[p10<=p44 & 1<=p170]]] & [[[p245<=p239 | p21<=p7] | [p189<=1 | p31<=1]] | [[1<=p229 & 1<=p101] | [1<=p167 & 1<=p38]]]] & [[[~ [p116<=1] & ~ [p248<=0]] & [~ [p48<=p50] | [1<=p11 | p217<=0]]] | 1<=p165]]]]]]
normalized: E [true U [~ [[[[1<=p165 | [[[1<=p11 | p217<=0] | ~ [p48<=p50]] & [~ [p248<=0] & ~ [p116<=1]]]] & [[[[1<=p167 & 1<=p38] | [1<=p229 & 1<=p101]] | [[p189<=1 | p31<=1] | [p245<=p239 | p21<=p7]]] & [~ [[p10<=p44 & 1<=p170]] | ~ [[1<=p242 | 1<=p19]]]]] | ~ [[p205<=p254 & ~ [[[p170<=1 & 1<=p159] | [p262<=p190 & p20<=p160]]]]]]] & [~ [[p15<=p183 & [p226<=1 | [~ [[[p119<=0 & p60<=0] & [1<=p209 & p237<=1]]] | ~ [[p94<=1 & 1<=p189]]]]]] & [~ [1<=p191] & [p58<=0 | ~ [[[[1<=p253 | p224<=1] | [p49<=p185 | ~ [p150<=1]]] | [p97<=p93 & [[p122<=1 | p257<=0] & ~ [p89<=1]]]]]]]]]]

abstracting: (p89<=1)
states: 791,372,373 (8)
abstracting: (p257<=0)
states: 673,098,007 (8)
abstracting: (p122<=1)
states: 791,372,373 (8)
abstracting: (p97<=p93)
states: 779,584,066 (8)
abstracting: (p150<=1)
states: 791,372,373 (8)
abstracting: (p49<=p185)
states: 775,934,489 (8)
abstracting: (p224<=1)
states: 791,372,373 (8)
abstracting: (1<=p253)
states: 31,413,296 (7)
abstracting: (p58<=0)
states: 780,386,708 (8)
abstracting: (1<=p191)
states: 21,244,843 (7)
abstracting: (1<=p189)
states: 21,565,812 (7)
abstracting: (p94<=1)
states: 791,372,373 (8)
abstracting: (p237<=1)
states: 791,372,373 (8)
abstracting: (1<=p209)
states: 31,413,296 (7)
abstracting: (p60<=0)
states: 780,386,708 (8)
abstracting: (p119<=0)
states: 779,427,148 (8)
abstracting: (p226<=1)
states: 791,372,373 (8)
abstracting: (p15<=p183)
states: 779,604,342 (8)
abstracting: (p20<=p160)
states: 780,245,418 (8)
abstracting: (p262<=p190)
states: 736,234,727 (8)
abstracting: (1<=p159)
states: 9,335,568 (6)
abstracting: (p170<=1)
states: 791,372,373 (8)
abstracting: (p205<=p254)
states: 782,328,417 (8)
abstracting: (1<=p19)
states: 19,770,116 (7)
abstracting: (1<=p242)
states: 13,229,036 (7)
abstracting: (1<=p170)
states: 14,756,464 (7)
abstracting: (p10<=p44)
states: 780,386,708 (8)
abstracting: (p21<=p7)
states: 771,602,257 (8)
abstracting: (p245<=p239)
states: 779,384,592 (8)
abstracting: (p31<=1)
states: 791,372,373 (8)
abstracting: (p189<=1)
states: 791,372,373 (8)
abstracting: (1<=p101)
states: 15,680,039 (7)
abstracting: (1<=p229)
states: 31,413,296 (7)
abstracting: (1<=p38)
states: 21,655,148 (7)
abstracting: (1<=p167)
states: 21,244,843 (7)
abstracting: (p116<=1)
states: 791,372,373 (8)
abstracting: (p248<=0)
states: 779,384,592 (8)
abstracting: (p48<=p50)
states: 775,692,334 (8)
abstracting: (p217<=0)
states: 781,361,134 (8)
abstracting: (1<=p11)
states: 10,985,665 (7)
abstracting: (1<=p165)
states: 21,244,843 (7)

before gc: list nodes free: 13885968

after gc: idd nodes used:14423178, unused:49576822; list nodes free:231186921
MC time: 2m28.001sec

checking: EF [[[~ [1<=p201] & ~ [[~ [1<=p91] | [1<=p9 | p71<=1]]]] | [[[p197<=p185 | ~ [[[p147<=p9 | ~ [p203<=p103]] & ~ [1<=p239]]]] | [[~ [p25<=0] & [[[~ [1<=p206] | [p58<=p253 & p117<=p65]] | [p177<=1 & p68<=0]] | [[~ [p103<=p56] & 1<=p10] | p86<=p79]]] | [1<=p177 & [~ [p50<=0] & [[[1<=p77 & p3<=0] & [p232<=p127 & 1<=p23]] & [[1<=p150 | 1<=p39] & ~ [p84<=1]]]]]]] & ~ [[~ [[[[[1<=p88 | 1<=p131] & ~ [1<=p144]] | p23<=p5] | [[~ [p250<=1] | p28<=1] | [~ [p86<=p49] & [1<=p260 | p135<=p193]]]]] | [p228<=1 | ~ [[1<=p108 | ~ [[p259<=p1 | p52<=0]]]]]]]]]]
normalized: E [true U [[~ [[[p228<=1 | ~ [[1<=p108 | ~ [[p259<=p1 | p52<=0]]]]] | ~ [[[[[1<=p260 | p135<=p193] & ~ [p86<=p49]] | [p28<=1 | ~ [p250<=1]]] | [p23<=p5 | [~ [1<=p144] & [1<=p88 | 1<=p131]]]]]]] & [[[1<=p177 & [[[~ [p84<=1] & [1<=p150 | 1<=p39]] & [[p232<=p127 & 1<=p23] & [1<=p77 & p3<=0]]] & ~ [p50<=0]]] | [[[p86<=p79 | [1<=p10 & ~ [p103<=p56]]] | [[p177<=1 & p68<=0] | [[p58<=p253 & p117<=p65] | ~ [1<=p206]]]] & ~ [p25<=0]]] | [p197<=p185 | ~ [[~ [1<=p239] & [p147<=p9 | ~ [p203<=p103]]]]]]] | [~ [[[1<=p9 | p71<=1] | ~ [1<=p91]]] & ~ [1<=p201]]]]

abstracting: (1<=p201)
states: 21,244,843 (7)
abstracting: (1<=p91)
states: 20,413,154 (7)
abstracting: (p71<=1)
states: 791,372,373 (8)
abstracting: (1<=p9)
states: 10,985,665 (7)
abstracting: (p203<=p103)
states: 791,294,225 (8)
abstracting: (p147<=p9)
states: 771,868,703 (8)
abstracting: (1<=p239)
states: 31,413,296 (7)
abstracting: (p197<=p185)
states: 770,127,530 (8)
abstracting: (p25<=0)
states: 775,334,830 (8)
abstracting: (1<=p206)
states: 10,011,239 (7)
abstracting: (p117<=p65)
states: 780,386,708 (8)
abstracting: (p58<=p253)
states: 780,917,795 (8)
abstracting: (p68<=0)
states: 780,056,743 (8)
abstracting: (p177<=1)
states: 791,372,373 (8)
abstracting: (p103<=p56)
states: 779,430,093 (8)
abstracting: (1<=p10)
states: 10,985,665 (7)
abstracting: (p86<=p79)
states: 777,738,472 (8)
abstracting: (p50<=0)
states: 779,430,093 (8)
abstracting: (p3<=0)
states: 791,234,789 (8)
abstracting: (1<=p77)
states: 16,037,543 (7)
abstracting: (1<=p23)
states: 19,770,116 (7)
abstracting: (p232<=p127)
states: 781,748,683 (8)
abstracting: (1<=p39)
states: 20,413,154 (7)
abstracting: (1<=p150)
states: 11,791,345 (7)
abstracting: (p84<=1)
states: 791,372,373 (8)
abstracting: (1<=p177)
states: 16,933,290 (7)
abstracting: (1<=p131)
states: 16,040,262 (7)
abstracting: (1<=p88)
states: 10,903,083 (7)
abstracting: (1<=p144)
states: 20,416,872 (7)
abstracting: (p23<=p5)
states: 771,602,257 (8)
abstracting: (p250<=1)
states: 791,372,373 (8)
abstracting: (p28<=1)
states: 791,372,373 (8)
abstracting: (p86<=p49)
states: 778,001,025 (8)
abstracting: (p135<=p193)
states: 775,244,175 (8)
abstracting: (1<=p260)
states: 8,739,517 (6)
abstracting: (p52<=0)
states: 771,602,257 (8)
abstracting: (p259<=p1)
states: 782,632,856 (8)
abstracting: (1<=p108)
states: 9,335,568 (6)
abstracting: (p228<=1)
states: 791,372,373 (8)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5876244 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101984 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.001sec

69714 85832 95654 119133 208719 205212 288759 291393 358024 373228 411567 470360 523169 647668 609610 621153 685589 760055 750926 827229 813093
iterations count:2170482 (7116), effective:86406 (283)

initing FirstDep: 0m 0.000sec


sat_reach.icc:155: Timeout: after 148 sec


sat_reach.icc:155: Timeout: after 148 sec


sat_reach.icc:155: Timeout: after 148 sec


sat_reach.icc:155: Timeout: after 137 sec


sat_reach.icc:155: Timeout: after 137 sec


sat_reach.icc:155: Timeout: after 126 sec


sat_reach.icc:155: Timeout: after 148 sec


sat_reach.icc:155: Timeout: after 147 sec

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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r170-tall-167838857300454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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