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.r458-smll-167912650500598.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 StigmergyElection-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.8K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 203K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679555179103

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=StigmergyElection-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 07:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:06:22] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2023-03-23 07:06:22] [INFO ] Transformed 563 places.
[2023-03-23 07:06:22] [INFO ] Transformed 780 transitions.
[2023-03-23 07:06:22] [INFO ] Found NUPN structural information;
[2023-03-23 07:06:22] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 136 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 13) seen :5
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 780 rows 563 cols
[2023-03-23 07:06:24] [INFO ] Computed 5 place invariants in 24 ms
[2023-03-23 07:06:25] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 07:06:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2023-03-23 07:06:27] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-23 07:06:28] [INFO ] Deduced a trap composed of 189 places in 506 ms of which 13 ms to minimize.
[2023-03-23 07:06:28] [INFO ] Deduced a trap composed of 190 places in 343 ms of which 2 ms to minimize.
[2023-03-23 07:06:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1023 ms
[2023-03-23 07:06:29] [INFO ] Deduced a trap composed of 191 places in 415 ms of which 2 ms to minimize.
[2023-03-23 07:06:30] [INFO ] Deduced a trap composed of 192 places in 338 ms of which 2 ms to minimize.
[2023-03-23 07:06:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 902 ms
[2023-03-23 07:06:30] [INFO ] Deduced a trap composed of 189 places in 232 ms of which 0 ms to minimize.
[2023-03-23 07:06:30] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 1 ms to minimize.
[2023-03-23 07:06:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2023-03-23 07:06:31] [INFO ] Deduced a trap composed of 189 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-23 07:06:31] [INFO ] After 4336ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-23 07:06:31] [INFO ] After 6229ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 154 ms.
Support contains 67 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 452 edges and 563 vertex of which 31 / 563 are part of one of the 6 SCC in 16 ms
Free SCC test removed 25 places
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 913 edges and 538 vertex of which 532 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 266 rules applied. Total rules applied 268 place count 532 transition count 479
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 270 rules applied. Total rules applied 538 place count 268 transition count 473
Reduce places removed 3 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 41 rules applied. Total rules applied 579 place count 265 transition count 435
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 42 rules applied. Total rules applied 621 place count 227 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 623 place count 225 transition count 431
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 623 place count 225 transition count 421
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 643 place count 215 transition count 421
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 669 place count 189 transition count 395
Iterating global reduction 5 with 26 rules applied. Total rules applied 695 place count 189 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 696 place count 189 transition count 394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 696 place count 189 transition count 392
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 700 place count 187 transition count 392
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 707 place count 180 transition count 274
Iterating global reduction 6 with 7 rules applied. Total rules applied 714 place count 180 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 716 place count 180 transition count 272
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 754 place count 161 transition count 253
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 755 place count 161 transition count 252
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 763 place count 157 transition count 254
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 771 place count 157 transition count 246
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 795 place count 157 transition count 222
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 819 place count 133 transition count 222
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 821 place count 133 transition count 220
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 824 place count 133 transition count 220
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 825 place count 133 transition count 219
Applied a total of 825 rules in 208 ms. Remains 133 /563 variables (removed 430) and now considering 219/780 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 133/563 places, 219/780 transitions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :4
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 1322 steps, including 10 resets, run visited all 1 properties in 3 ms. (steps per millisecond=440 )
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 9720 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: StigmergyElection_PT_04b
(NrP: 563 NrTr: 780 NrArc: 2680)

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

net check time: 0m 0.000sec

init dd package: 0m 3.471sec


RS generation: 1m 3.419sec


-> reachability set: #nodes 31043 (3.1e+04) #states 1,460,670,308 (9)



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

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

abstracting: (1<=p15)
states: 6,847,995 (6)
-> the formula is FALSE

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

MC time: 1m37.708sec

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

abstracting: (p23<=1)
states: 1,460,670,308 (9)
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

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

abstracting: (1<=p71)
states: 6,078,360 (6)
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.110sec

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

abstracting: (1<=p80)
states: 18,287,915 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.917sec

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

abstracting: (p329<=0)
states: 1,454,591,948 (9)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m37.671sec

checking: EF [[[p257<=0 | ~ [p85<=0]] & ~ [p343<=p399]]]
normalized: E [true U [~ [p343<=p399] & [p257<=0 | ~ [p85<=0]]]]

abstracting: (p85<=0)
states: 1,453,889,484 (9)
abstracting: (p257<=0)
states: 1,442,382,393 (9)
abstracting: (p343<=p399)
states: 1,453,889,484 (9)
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.841sec

checking: AG [~ [[1<=p184 | [~ [[~ [1<=p417] | ~ [[~ [[1<=p388 & p38<=1]] & ~ [1<=p456]]]]] & p163<=p184]]]]
normalized: ~ [E [true U [1<=p184 | [p163<=p184 & ~ [[~ [[~ [1<=p456] & ~ [[1<=p388 & p38<=1]]]] | ~ [1<=p417]]]]]]]

abstracting: (1<=p417)
states: 6,847,995 (6)
abstracting: (p38<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p388)
states: 6,321,474 (6)
abstracting: (1<=p456)
states: 7,550,459 (6)
abstracting: (p163<=p184)
states: 1,442,382,393 (9)
abstracting: (1<=p184)
states: 18,287,915 (7)

before gc: list nodes free: 659449

after gc: idd nodes used:101814, unused:63898186; list nodes free:288941886
-> the formula is FALSE

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

MC time: 1m41.536sec

checking: AG [~ [[~ [p86<=1] & [[1<=p462 & [~ [[[[p97<=p145 | p369<=p39] | ~ [p352<=1]] | ~ [[1<=p0 & p491<=1]]]] & ~ [1<=p543]]] | p333<=p239]]]]
normalized: ~ [E [true U [[p333<=p239 | [1<=p462 & [~ [1<=p543] & ~ [[~ [[1<=p0 & p491<=1]] | [~ [p352<=1] | [p97<=p145 | p369<=p39]]]]]]] & ~ [p86<=1]]]]

abstracting: (p86<=1)
states: 1,460,670,308 (9)
abstracting: (p369<=p39)
states: 1,442,598,394 (9)
abstracting: (p97<=p145)
states: 1,453,889,484 (9)
abstracting: (p352<=1)
states: 1,460,670,308 (9)
abstracting: (p491<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p543)
states: 5,222,326 (6)
abstracting: (1<=p462)
states: 6,078,360 (6)
abstracting: (p333<=p239)
states: 1,454,591,948 (9)
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

checking: AG [~ [[1<=p516 & ~ [[~ [[~ [[p407<=p478 & p171<=0]] | [1<=p389 | [[p13<=p277 & 1<=p149] & [p20<=0 & p561<=1]]]]] | ~ [[~ [[p448<=p342 & 1<=p80]] & [~ [1<=p243] | [p14<=1 & p388<=1]]]]]]]]]
normalized: ~ [E [true U [1<=p516 & ~ [[~ [[[[p14<=1 & p388<=1] | ~ [1<=p243]] & ~ [[p448<=p342 & 1<=p80]]]] | ~ [[[1<=p389 | [[p20<=0 & p561<=1] & [p13<=p277 & 1<=p149]]] | ~ [[p407<=p478 & p171<=0]]]]]]]]]

abstracting: (p171<=0)
states: 1,442,382,393 (9)
abstracting: (p407<=p478)
states: 1,455,447,996 (9)
abstracting: (1<=p149)
states: 6,847,995 (6)
abstracting: (p13<=p277)
states: 1,453,911,248 (9)
abstracting: (p561<=1)
states: 1,460,670,308 (9)
abstracting: (p20<=0)
states: 1,453,822,313 (9)
abstracting: (1<=p389)
states: 6,321,474 (6)
abstracting: (1<=p80)
states: 18,287,915 (7)
abstracting: (p448<=p342)
states: 1,442,463,415 (9)
abstracting: (1<=p243)
states: 5,010,754 (6)
abstracting: (p388<=1)
states: 1,460,670,308 (9)
abstracting: (p14<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p516)
states: 5,010,754 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m38.143sec

checking: AG [[[~ [p249<=p72] | [p486<=p399 & p318<=0]] & [1<=p501 | [~ [p187<=p234] | [[~ [1<=p340] | [1<=p543 | ~ [[[1<=p540 | 1<=p515] | [1<=p206 | p249<=0]]]]] & [1<=p374 | [[[p440<=p458 | [1<=p470 | p396<=p34]] & ~ [1<=p434]] | ~ [1<=p433]]]]]]]]
normalized: ~ [E [true U ~ [[[1<=p501 | [[[1<=p374 | [~ [1<=p433] | [~ [1<=p434] & [p440<=p458 | [1<=p470 | p396<=p34]]]]] & [[1<=p543 | ~ [[[1<=p206 | p249<=0] | [1<=p540 | 1<=p515]]]] | ~ [1<=p340]]] | ~ [p187<=p234]]] & [[p486<=p399 & p318<=0] | ~ [p249<=p72]]]]]]

abstracting: (p249<=p72)
states: 1,454,348,834 (9)
abstracting: (p318<=0)
states: 1,442,381,291 (9)
abstracting: (p486<=p399)
states: 1,442,457,193 (9)
abstracting: (p187<=p234)
states: 1,442,382,393 (9)
abstracting: (1<=p340)
states: 6,078,360 (6)
abstracting: (1<=p515)
states: 5,010,754 (6)
abstracting: (1<=p540)
states: 5,222,326 (6)
abstracting: (p249<=0)
states: 1,454,348,834 (9)
abstracting: (1<=p206)
states: 6,078,360 (6)
abstracting: (1<=p543)
states: 5,222,326 (6)
abstracting: (p396<=p34)
states: 1,455,523,898 (9)
abstracting: (1<=p470)
states: 6,078,360 (6)
abstracting: (p440<=p458)
states: 1,442,381,275 (9)
abstracting: (1<=p434)
states: 18,289,033 (7)
abstracting: (1<=p433)
states: 18,289,033 (7)
abstracting: (1<=p374)
states: 6,321,474 (6)
abstracting: (1<=p501)
states: 18,289,033 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m58.116sec

checking: EF [[[1<=p178 & [~ [[p258<=p452 | [~ [[[1<=p488 | p519<=0] & p227<=1]] & p70<=0]]] | [~ [1<=p251] & [~ [[[p26<=0 | p256<=0] | p494<=p371]] & [1<=p187 | [~ [1<=p556] & [[p396<=p98 | 1<=p153] | p543<=0]]]]]]] & ~ [[[p101<=p529 & p18<=p464] & ~ [1<=p132]]]]]
normalized: E [true U [~ [[~ [1<=p132] & [p101<=p529 & p18<=p464]]] & [1<=p178 & [[[[1<=p187 | [[p543<=0 | [p396<=p98 | 1<=p153]] & ~ [1<=p556]]] & ~ [[p494<=p371 | [p26<=0 | p256<=0]]]] & ~ [1<=p251]] | ~ [[p258<=p452 | [p70<=0 & ~ [[p227<=1 & [1<=p488 | p519<=0]]]]]]]]]]

abstracting: (p519<=0)
states: 1,454,348,834 (9)
abstracting: (1<=p488)
states: 18,289,033 (7)
abstracting: (p227<=1)
states: 1,460,670,308 (9)
abstracting: (p70<=0)
states: 1,454,591,948 (9)
abstracting: (p258<=p452)
states: 1,455,518,220 (9)
abstracting: (1<=p251)
states: 6,321,474 (6)
abstracting: (p256<=0)
states: 1,454,348,834 (9)
abstracting: (p26<=0)
states: 1,453,119,849 (9)
abstracting: (p494<=p371)
states: 1,442,598,394 (9)
abstracting: (1<=p556)
states: 91,288,402 (7)
abstracting: (1<=p153)
states: 6,847,995 (6)
abstracting: (p396<=p98)
states: 1,455,447,996 (9)
abstracting: (p543<=0)
states: 1,455,447,982 (9)
abstracting: (1<=p187)
states: 18,287,915 (7)
abstracting: (1<=p178)
states: 18,287,915 (7)
abstracting: (p18<=p464)
states: 1,453,822,313 (9)
abstracting: (p101<=p529)
states: 1,442,458,295 (9)
abstracting: (1<=p132)
states: 5,221,240 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.368sec

checking: AG [[p276<=p251 & [1<=p222 | [[[1<=p363 | [[[[p163<=p283 & 1<=p30] & [1<=p437 | p517<=1]] | [p99<=p152 | ~ [1<=p47]]] | p501<=p339]] | p180<=0] | [[~ [[~ [1<=p75] | [1<=p431 & p224<=0]]] | [~ [[p260<=0 | 1<=p35]] & [~ [1<=p484] & 1<=p303]]] & [p60<=1 | [[p72<=0 | ~ [p417<=1]] & [[p63<=1 | ~ [p534<=p272]] & ~ [1<=p54]]]]]]]]]
normalized: ~ [E [true U ~ [[p276<=p251 & [1<=p222 | [[[p60<=1 | [[~ [1<=p54] & [p63<=1 | ~ [p534<=p272]]] & [p72<=0 | ~ [p417<=1]]]] & [[[1<=p303 & ~ [1<=p484]] & ~ [[p260<=0 | 1<=p35]]] | ~ [[[1<=p431 & p224<=0] | ~ [1<=p75]]]]] | [p180<=0 | [1<=p363 | [p501<=p339 | [[p99<=p152 | ~ [1<=p47]] | [[1<=p437 | p517<=1] & [p163<=p283 & 1<=p30]]]]]]]]]]]]

abstracting: (1<=p30)
states: 18,287,915 (7)
abstracting: (p163<=p283)
states: 1,442,471,328 (9)
abstracting: (p517<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p437)
states: 18,289,033 (7)
abstracting: (1<=p47)
states: 18,287,915 (7)
abstracting: (p99<=p152)
states: 1,442,471,328 (9)
abstracting: (p501<=p339)
states: 1,442,463,415 (9)
abstracting: (1<=p363)
states: 18,289,017 (7)
abstracting: (p180<=0)
states: 1,442,382,393 (9)
abstracting: (1<=p75)
states: 18,287,915 (7)
abstracting: (p224<=0)
states: 1,442,382,393 (9)
abstracting: (1<=p431)
states: 7,550,459 (6)
abstracting: (1<=p35)
states: 18,287,915 (7)
abstracting: (p260<=0)
states: 1,456,071,182 (9)
abstracting: (1<=p484)
states: 18,289,033 (7)
abstracting: (1<=p303)
states: 18,289,017 (7)
abstracting: (p417<=1)
states: 1,460,670,308 (9)
abstracting: (p72<=0)
states: 1,454,591,948 (9)
abstracting: (p534<=p272)
states: 1,455,523,434 (9)
abstracting: (p63<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p54)
states: 18,287,915 (7)
abstracting: (p60<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p222)
states: 18,287,915 (7)
abstracting: (p276<=p251)
states: 1,453,822,313 (9)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m33.290sec

checking: AG [[[[[~ [[[[1<=p403 | p383<=0] | ~ [p229<=1]] & [~ [1<=p46] | [1<=p113 & p70<=p83]]]] | 1<=p216] & [[[[p358<=1 | [[p553<=0 | p184<=0] & ~ [1<=p191]]] | ~ [[p495<=0 | p54<=0]]] & [~ [[[p557<=p513 & 1<=p3] & [p55<=0 | 1<=p59]]] & [p39<=1 | [[1<=p458 & 1<=p235] | [1<=p445 & p172<=1]]]]] | ~ [[~ [[1<=p213 & 1<=p180]] | [~ [p519<=0] | p437<=1]]]]] & [[1<=p31 & ~ [[1<=p244 | 1<=p420]]] | p318<=p202]] | p234<=1]]
normalized: ~ [E [true U ~ [[p234<=1 | [[p318<=p202 | [1<=p31 & ~ [[1<=p244 | 1<=p420]]]] & [[~ [[[p437<=1 | ~ [p519<=0]] | ~ [[1<=p213 & 1<=p180]]]] | [[[p39<=1 | [[1<=p445 & p172<=1] | [1<=p458 & 1<=p235]]] & ~ [[[p55<=0 | 1<=p59] & [p557<=p513 & 1<=p3]]]] & [~ [[p495<=0 | p54<=0]] | [p358<=1 | [~ [1<=p191] & [p553<=0 | p184<=0]]]]]] & [1<=p216 | ~ [[[[1<=p113 & p70<=p83] | ~ [1<=p46]] & [~ [p229<=1] | [1<=p403 | p383<=0]]]]]]]]]]]

abstracting: (p383<=0)
states: 1,454,348,834 (9)
abstracting: (1<=p403)
states: 5,222,312 (6)
abstracting: (p229<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p46)
states: 18,287,915 (7)
abstracting: (p70<=p83)
states: 1,454,591,948 (9)
abstracting: (1<=p113)
states: 6,321,474 (6)
abstracting: (1<=p216)
states: 18,287,915 (7)
abstracting: (p184<=0)
states: 1,442,382,393 (9)
abstracting: (p553<=0)
states: 1,393,376,707 (9)
abstracting: (1<=p191)
states: 6,078,360 (6)
abstracting: (p358<=1)
states: 1,460,670,308 (9)
abstracting: (p54<=0)
states: 1,442,382,393 (9)
abstracting: (p495<=0)
states: 1,442,381,275 (9)
abstracting: (1<=p3)
states: 75,452 (4)
abstracting: (p557<=p513)
states: 1,369,739,817 (9)
abstracting: (1<=p59)
states: 6,078,360 (6)
abstracting: (p55<=0)
states: 1,454,591,948 (9)
abstracting: (1<=p235)
states: 18,287,915 (7)
abstracting: (1<=p458)
states: 18,289,033 (7)
abstracting: (p172<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p445)
states: 18,289,033 (7)
abstracting: (p39<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p180)
states: 18,287,915 (7)
abstracting: (1<=p213)
states: 18,287,915 (7)
abstracting: (p519<=0)
states: 1,454,348,834 (9)
abstracting: (p437<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p420)
states: 6,847,995 (6)
abstracting: (1<=p244)
states: 5,010,754 (6)
abstracting: (1<=p31)
states: 18,287,915 (7)
abstracting: (p318<=p202)
states: 1,442,463,431 (9)
abstracting: (p234<=1)
states: 1,460,670,308 (9)
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.477sec

checking: AG [[~ [1<=p482] & [[~ [[[[[p309<=0 & ~ [1<=p495]] | [p442<=0 | ~ [p359<=p447]]] | ~ [1<=p469]] & ~ [[~ [[p315<=0 & 1<=p247]] | [[p97<=p111 & p208<=0] & p157<=p131]]]]] & [p52<=p214 | ~ [p382<=p339]]] & ~ [[~ [p279<=0] & [[[[[p372<=p239 & p138<=p110] & [p480<=p52 | p99<=p37]] & [~ [1<=p3] & [1<=p481 & p522<=1]]] | [[1<=p516 | 1<=p170] | [p70<=0 | [1<=p269 & p228<=p399]]]] | 1<=p391]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[1<=p391 | [[[p70<=0 | [1<=p269 & p228<=p399]] | [1<=p516 | 1<=p170]] | [[[1<=p481 & p522<=1] & ~ [1<=p3]] & [[p480<=p52 | p99<=p37] & [p372<=p239 & p138<=p110]]]]] & ~ [p279<=0]]] & [[p52<=p214 | ~ [p382<=p339]] & ~ [[~ [[[p157<=p131 & [p97<=p111 & p208<=0]] | ~ [[p315<=0 & 1<=p247]]]] & [~ [1<=p469] | [[p442<=0 | ~ [p359<=p447]] | [p309<=0 & ~ [1<=p495]]]]]]]] & ~ [1<=p482]]]]]

abstracting: (1<=p482)
states: 18,289,033 (7)
abstracting: (1<=p495)
states: 18,289,033 (7)
abstracting: (p309<=0)
states: 1,442,381,291 (9)
abstracting: (p359<=p447)
states: 1,442,598,410 (9)
abstracting: (p442<=0)
states: 1,442,381,275 (9)
abstracting: (1<=p469)
states: 6,078,360 (6)
abstracting: (1<=p247)
states: 5,010,754 (6)
abstracting: (p315<=0)
states: 1,442,381,291 (9)
abstracting: (p208<=0)
states: 1,453,889,484 (9)
abstracting: (p97<=p111)
states: 1,453,889,484 (9)
abstracting: (p157<=p131)
states: 1,453,822,313 (9)
abstracting: (p382<=p339)
states: 1,455,659,554 (9)
abstracting: (p52<=p214)
states: 1,442,599,496 (9)
abstracting: (p279<=0)
states: 1,453,822,313 (9)
abstracting: (p138<=p110)
states: 1,455,449,068 (9)
abstracting: (p372<=p239)
states: 1,454,439,888 (9)
abstracting: (p99<=p37)
states: 1,442,382,393 (9)
abstracting: (p480<=p52)
states: 1,442,598,378 (9)
abstracting: (1<=p3)
states: 75,452 (4)
abstracting: (p522<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p481)
states: 18,289,033 (7)
abstracting: (1<=p170)
states: 18,287,915 (7)
abstracting: (1<=p516)
states: 5,010,754 (6)
abstracting: (p228<=p399)
states: 1,442,458,295 (9)
abstracting: (1<=p269)
states: 5,221,240 (6)
abstracting: (p70<=0)
states: 1,454,591,948 (9)
abstracting: (1<=p391)
states: 6,321,474 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.405sec

checking: AG [[1<=p129 | [[[[[[[[1<=p184 & p202<=p446] | ~ [p22<=p169]] & [[p47<=1 | p104<=p50] | [p98<=0 & p343<=p148]]] & [1<=p101 & p456<=p9]] & [[[~ [p465<=p336] | ~ [p415<=0]] | [[1<=p158 | p393<=1] & ~ [p213<=p137]]] | ~ [[[p54<=1 & p58<=p502] | [1<=p522 & p110<=0]]]]] | [p313<=p502 | ~ [[[p312<=p3 | p524<=1] & p48<=0]]]] & [p338<=p304 & [~ [1<=p396] | [~ [[[1<=p345 & 1<=p185] & p149<=p415]] | p541<=p476]]]] | 1<=p143]]]
normalized: ~ [E [true U ~ [[1<=p129 | [1<=p143 | [[p338<=p304 & [[p541<=p476 | ~ [[p149<=p415 & [1<=p345 & 1<=p185]]]] | ~ [1<=p396]]] & [[p313<=p502 | ~ [[p48<=0 & [p312<=p3 | p524<=1]]]] | [[~ [[[1<=p522 & p110<=0] | [p54<=1 & p58<=p502]]] | [[~ [p213<=p137] & [1<=p158 | p393<=1]] | [~ [p415<=0] | ~ [p465<=p336]]]] & [[1<=p101 & p456<=p9] & [[[p98<=0 & p343<=p148] | [p47<=1 | p104<=p50]] & [~ [p22<=p169] | [1<=p184 & p202<=p446]]]]]]]]]]]]

abstracting: (p202<=p446)
states: 1,454,674,088 (9)
abstracting: (1<=p184)
states: 18,287,915 (7)
abstracting: (p22<=p169)
states: 1,453,911,248 (9)
abstracting: (p104<=p50)
states: 1,454,348,834 (9)
abstracting: (p47<=1)
states: 1,460,670,308 (9)
abstracting: (p343<=p148)
states: 1,453,889,484 (9)
abstracting: (p98<=0)
states: 1,453,889,484 (9)
abstracting: (p456<=p9)
states: 1,453,208,784 (9)
abstracting: (1<=p101)
states: 18,287,915 (7)
abstracting: (p465<=p336)
states: 1,454,674,088 (9)
abstracting: (p415<=0)
states: 1,453,822,313 (9)
abstracting: (p393<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p158)
states: 6,847,995 (6)
abstracting: (p213<=p137)
states: 1,442,458,295 (9)
abstracting: (p58<=p502)
states: 1,454,674,088 (9)
abstracting: (p54<=1)
states: 1,460,670,308 (9)
abstracting: (p110<=0)
states: 1,455,659,554 (9)
abstracting: (1<=p522)
states: 6,321,474 (6)
abstracting: (p524<=1)
states: 1,460,670,308 (9)
abstracting: (p312<=p3)
states: 1,442,382,393 (9)
abstracting: (p48<=0)
states: 1,442,382,393 (9)
abstracting: (p313<=p502)
states: 1,442,475,975 (9)
abstracting: (1<=p396)
states: 5,222,312 (6)
abstracting: (1<=p185)
states: 7,550,459 (6)
abstracting: (1<=p345)
states: 18,289,017 (7)
abstracting: (p149<=p415)
states: 1,453,911,248 (9)
abstracting: (p541<=p476)
states: 1,455,447,982 (9)
abstracting: (p338<=p304)
states: 1,454,591,948 (9)
abstracting: (1<=p143)
states: 6,847,995 (6)
abstracting: (1<=p129)
states: 5,221,240 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.023sec

checking: AG [~ [[[1<=p402 | [~ [[1<=p494 & [[~ [1<=p331] | p202<=0] & 1<=p111]]] | ~ [[p292<=1 & [[[p148<=1 | p500<=1] & [p252<=p297 | 1<=p117]] | 1<=p27]]]]] & ~ [[[[~ [[p379<=p226 & ~ [p70<=0]]] & [p229<=p114 & p128<=p427]] | [~ [[[p422<=0 | p284<=0] & [p296<=p105 & 1<=p65]]] | ~ [p291<=1]]] | [[[[~ [p422<=p316] | [p209<=p191 | p518<=1]] & [[p250<=p103 & p514<=p368] & ~ [p24<=p102]]] & [~ [[p317<=1 & 1<=p273]] & ~ [[p342<=p64 | p227<=0]]]] | ~ [p298<=p53]]]]]]]
normalized: ~ [E [true U [~ [[[~ [p298<=p53] | [[~ [[p342<=p64 | p227<=0]] & ~ [[p317<=1 & 1<=p273]]] & [[~ [p24<=p102] & [p250<=p103 & p514<=p368]] & [[p209<=p191 | p518<=1] | ~ [p422<=p316]]]]] | [[~ [p291<=1] | ~ [[[p296<=p105 & 1<=p65] & [p422<=0 | p284<=0]]]] | [[p229<=p114 & p128<=p427] & ~ [[p379<=p226 & ~ [p70<=0]]]]]]] & [1<=p402 | [~ [[p292<=1 & [1<=p27 | [[p252<=p297 | 1<=p117] & [p148<=1 | p500<=1]]]]] | ~ [[1<=p494 & [1<=p111 & [p202<=0 | ~ [1<=p331]]]]]]]]]]

abstracting: (1<=p331)
states: 6,078,360 (6)
abstracting: (p202<=0)
states: 1,454,591,948 (9)
abstracting: (1<=p111)
states: 5,010,754 (6)
abstracting: (1<=p494)
states: 18,289,033 (7)
abstracting: (p500<=1)
states: 1,460,670,308 (9)
abstracting: (p148<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p117)
states: 6,321,474 (6)
abstracting: (p252<=p297)
states: 1,454,439,888 (9)
abstracting: (1<=p27)
states: 18,287,915 (7)
abstracting: (p292<=1)
states: 1,460,670,308 (9)
abstracting: (1<=p402)
states: 5,222,312 (6)
abstracting: (p70<=0)
states: 1,454,591,948 (9)
abstracting: (p379<=p226)
states: 1,455,730,128 (9)
abstracting: (p128<=p427)
states: 1,455,449,068 (9)
abstracting: (p229<=p114)
states: 1,442,473,447 (9)
abstracting: (p284<=0)
states: 1,453,822,313 (9)
abstracting: (p422<=0)
states: 1,453,822,313 (9)
abstracting: (1<=p65)
states: 6,078,360 (6)
abstracting: (p296<=p105)
states: 1,453,119,849 (9)
abstracting: (p291<=1)
states: 1,460,670,308 (9)
abstracting: (p422<=p316)
states: 1,453,911,248 (9)
abstracting: (p518<=1)
states: 1,460,670,308 (9)
abstracting: (p209<=p191)
states: 1,442,382,393 (9)
abstracting: (p514<=p368)
states: 1,455,659,554 (9)
abstracting: (p250<=p103)
states: 1,454,439,888 (9)
abstracting: (p24<=p102)
states: 1,453,822,313 (9)
abstracting: (1<=p273)
states: 5,221,240 (6)
abstracting: (p317<=1)
states: 1,460,670,308 (9)
abstracting: (p227<=0)
states: 1,442,382,393 (9)
abstracting: (p342<=p64)
states: 1,454,674,088 (9)
abstracting: (p298<=p53)
states: 1,442,598,394 (9)

before gc: list nodes free: 906732

after gc: idd nodes used:760269, unused:63239731; list nodes free:285858584
-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 5.310sec

totally nodes used: 142742817 (1.4e+08)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 948444831 2478888608 3427333439
used/not used/entry size/cache size: 65103137 2005727 16 1024MB
basic ops cache: hits/miss/sum: 78248865 150690399 228939264
used/not used/entry size/cache size: 13377500 3399716 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: 307242 766836 1074078
used/not used/entry size/cache size: 0 8388608 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 54817270
1 9680733
2 2039736
3 461024
4 91823
5 15664
6 2310
7 282
8 21
9 1
>= 10 0

Total processing time: 18m45.296sec


BK_STOP 1679556319928

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

25904 28158 26795 28254 26536 31660 33716 33649 35189 34805 32387 36549 35692 37518
iterations count:1476067 (1892), effective:51375 (65)

initing FirstDep: 0m 0.004sec

46068 46869 47782 48327 54530 62445 60657 64623 63345 64404 62082 62023
iterations count:1211872 (1553), effective:29502 (37)
55134 55617 56743 57714 58636 61696 63774 63895 64614 64280 63888 61837
iterations count:1248723 (1600), effective:30954 (39)
46486 49465 50035 48448 61672 61675 61418 62166 58721 57607
iterations count:1004823 (1288), effective:24853 (31)
55586 55348 56715 57484 57252 58069 63642 61928 62577 64501 63446 62060
iterations count:1245032 (1596), effective:30316 (38)
51741 53570 55171 55192 54949 56006 61754 59979 60757 63064 62496 61999
iterations count:1248487 (1600), effective:31059 (39)
49090 52477 48858 57261 61092 62374 61919 58979 58860
iterations count:923620 (1184), effective:23149 (29)
51407 51154 50975 51240 52753 65121 67018 68392 67403 67511 63764 68317 65239
iterations count:1302721 (1670), effective:31502 (40)
49642 49624 47719 57220 54356 55028 54282
iterations count:728046 (933), effective:18600 (23)
46107 45471 48260 48251 57654 61358 62240 62619 63482 62615 62013 59945
iterations count:1206752 (1547), effective:30099 (38)
55496 53413 60666 60301 59323 56201
iterations count:600758 (770), effective:15036 (19)
45621 47292 48379 47527 61063 60258 58642 59685 57390 56776
iterations count:1011643 (1296), effective:24982 (32)
56303 55694 60439 57208 59062 63910 67081 67668 66165 65863 61550 65840 62079
iterations count:1302395 (1669), effective:31740 (40)

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="StigmergyElection-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 StigmergyElection-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 r458-smll-167912650500598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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