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-167912650600670.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-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650600670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 17M 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-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679590247832

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-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 16:50:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 16:50:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:50:51] [INFO ] Load time of PNML (sax parser for PT used): 1354 ms
[2023-03-23 16:50:52] [INFO ] Transformed 128 places.
[2023-03-23 16:50:52] [INFO ] Transformed 18490 transitions.
[2023-03-23 16:50:52] [INFO ] Found NUPN structural information;
[2023-03-23 16:50:52] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1611 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1155 ms. (steps per millisecond=8 ) properties (out of 10) seen :8
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 16:50:54] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2023-03-23 16:50:54] [INFO ] Computed 10 place invariants in 46 ms
[2023-03-23 16:50:54] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 16:50:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-23 16:50:55] [INFO ] After 716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 16:50:55] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2023-03-23 16:50:56] [INFO ] After 820ms SMT Verify possible using 1066 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 16:50:57] [INFO ] Deduced a trap composed of 13 places in 732 ms of which 19 ms to minimize.
[2023-03-23 16:50:58] [INFO ] Deduced a trap composed of 12 places in 651 ms of which 2 ms to minimize.
[2023-03-23 16:50:59] [INFO ] Deduced a trap composed of 13 places in 519 ms of which 2 ms to minimize.
[2023-03-23 16:50:59] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 1 ms to minimize.
[2023-03-23 16:51:00] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 1 ms to minimize.
[2023-03-23 16:51:00] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2023-03-23 16:51:01] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 1 ms to minimize.
[2023-03-23 16:51:01] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-23 16:51:01] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 0 ms to minimize.
[2023-03-23 16:51:02] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-23 16:51:02] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 1 ms to minimize.
[2023-03-23 16:51:03] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2023-03-23 16:51:03] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2023-03-23 16:51:03] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2023-03-23 16:51:03] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-23 16:51:04] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-23 16:51:04] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-23 16:51:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7673 ms
[2023-03-23 16:51:04] [INFO ] After 8926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 565 ms.
[2023-03-23 16:51:05] [INFO ] After 10531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 11 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Graph (complete) has 424 edges and 128 vertex of which 121 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.24 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 121 transition count 1149
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 34 rules applied. Total rules applied 74 place count 108 transition count 1128
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 82 place count 100 transition count 1128
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 82 place count 100 transition count 1114
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 110 place count 86 transition count 1114
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 125 place count 71 transition count 1099
Iterating global reduction 3 with 15 rules applied. Total rules applied 140 place count 71 transition count 1099
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 153 place count 58 transition count 1085
Iterating global reduction 3 with 13 rules applied. Total rules applied 166 place count 58 transition count 1085
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 201 place count 58 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 202 place count 57 transition count 1049
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 57 transition count 1049
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 235 place count 57 transition count 1017
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 251 place count 49 transition count 1009
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 259 place count 41 transition count 1001
Iterating global reduction 5 with 8 rules applied. Total rules applied 267 place count 41 transition count 1001
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 274 place count 41 transition count 994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 40 transition count 993
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 277 place count 39 transition count 992
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 39 transition count 992
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 39 transition count 991
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 39 transition count 991
Applied a total of 280 rules in 1019 ms. Remains 39 /128 variables (removed 89) and now considering 991/1195 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 39/128 places, 991/1195 transitions.
Finished random walk after 6770 steps, including 2 resets, run visited all 2 properties in 665 ms. (steps per millisecond=10 )
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16473 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_09a
(NrP: 128 NrTr: 18490 NrArc: 329609)

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

net check time: 0m 0.053sec

init dd package: 0m 3.423sec


RS generation: 0m16.694sec


-> reachability set: #nodes 105036 (1.1e+05) #states 2,234,987 (6)



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

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

abstracting: (1<=p87)
states: 390,625 (5)
-> the formula is TRUE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.269sec

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

abstracting: (p87<=0)
states: 1,844,362 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.253sec

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

abstracting: (1<=p45)
states: 390,625 (5)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.374sec

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

abstracting: (p122<=0)
states: 2,234,986 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.145sec

checking: AG [[~ [p42<=0] | p30<=1]]
normalized: ~ [E [true U ~ [[p30<=1 | ~ [p42<=0]]]]]

abstracting: (p42<=0)
states: 2,228,426 (6)
abstracting: (p30<=1)
states: 2,234,987 (6)
-> the formula is TRUE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

checking: EF [~ [p95<=p20]]
normalized: E [true U ~ [p95<=p20]]

abstracting: (p95<=p20)
states: 2,234,986 (6)
-> the formula is TRUE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

checking: AG [p109<=p102]
normalized: ~ [E [true U ~ [p109<=p102]]]

abstracting: (p109<=p102)
states: 2,234,986 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.265sec

checking: AG [p46<=p34]
normalized: ~ [E [true U ~ [p46<=p34]]]

abstracting: (p46<=p34)
states: 1,844,362 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.497sec

checking: AG [[p2<=0 | ~ [p117<=p70]]]
normalized: ~ [E [true U ~ [[~ [p117<=p70] | p2<=0]]]]

abstracting: (p2<=0)
states: 1,844,362 (6)
abstracting: (p117<=p70)
states: 2,169,451 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.620sec

checking: AG [[1<=p82 | [p25<=1 | ~ [p46<=0]]]]
normalized: ~ [E [true U ~ [[[p25<=1 | ~ [p46<=0]] | 1<=p82]]]]

abstracting: (1<=p82)
states: 462,752 (5)
abstracting: (p46<=0)
states: 1,844,362 (6)
abstracting: (p25<=1)
states: 2,234,987 (6)
-> the formula is TRUE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: AG [[p84<=1 & [~ [p74<=0] | ~ [1<=p43]]]]
normalized: ~ [E [true U ~ [[[~ [1<=p43] | ~ [p74<=0]] & p84<=1]]]]

abstracting: (p84<=1)
states: 2,234,987 (6)
abstracting: (p74<=0)
states: 1,844,362 (6)
abstracting: (1<=p43)
states: 390,625 (5)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.523sec

checking: EF [~ [[[p48<=1 | 1<=p59] | [p2<=p127 | 1<=p12]]]]
normalized: E [true U ~ [[[p2<=p127 | 1<=p12] | [p48<=1 | 1<=p59]]]]

abstracting: (1<=p59)
states: 390,625 (5)
abstracting: (p48<=1)
states: 2,234,987 (6)
abstracting: (1<=p12)
states: 462,752 (5)
abstracting: (p2<=p127)
states: 2,234,987 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.203sec

checking: AG [[[[p90<=p15 & [1<=p12 & p44<=1]] | ~ [[~ [[1<=p12 & [~ [[p12<=0 & p96<=0]] & [1<=p116 | ~ [1<=p59]]]]] & 1<=p118]]] | p124<=1]]
normalized: ~ [E [true U ~ [[[~ [[~ [[[[~ [1<=p59] | 1<=p116] & ~ [[p12<=0 & p96<=0]]] & 1<=p12]] & 1<=p118]] | [[1<=p12 & p44<=1] & p90<=p15]] | p124<=1]]]]

abstracting: (p124<=1)
states: 2,234,987 (6)
abstracting: (p90<=p15)
states: 2,169,451 (6)
abstracting: (p44<=1)
states: 2,234,987 (6)
abstracting: (1<=p12)
states: 462,752 (5)
abstracting: (1<=p118)
states: 65,536 (4)
abstracting: (1<=p12)
states: 462,752 (5)
abstracting: (p96<=0)
states: 1,772,235 (6)
abstracting: (p12<=0)
states: 1,772,235 (6)
abstracting: (1<=p116)
states: 390,625 (5)
abstracting: (1<=p59)
states: 390,625 (5)
-> the formula is TRUE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.239sec

checking: EF [~ [[[p35<=p31 | [p30<=1 | p79<=0]] | ~ [[1<=p38 & [[1<=p125 | [p72<=0 | [[1<=p25 & 1<=p49] & [p27<=p79 & 1<=p8]]]] & 1<=p30]]]]]]
normalized: E [true U ~ [[~ [[[[[[[p27<=p79 & 1<=p8] & [1<=p25 & 1<=p49]] | p72<=0] | 1<=p125] & 1<=p30] & 1<=p38]] | [[p30<=1 | p79<=0] | p35<=p31]]]]

abstracting: (p35<=p31)
states: 2,169,451 (6)
abstracting: (p79<=0)
states: 2,234,986 (6)
abstracting: (p30<=1)
states: 2,234,987 (6)
abstracting: (1<=p38)
states: 1
abstracting: (1<=p30)
states: 390,625 (5)
abstracting: (1<=p125)
states: 6,561 (3)
abstracting: (p72<=0)
states: 1,844,362 (6)
abstracting: (1<=p49)
states: 65,536 (4)
abstracting: (1<=p25)
states: 1
abstracting: (1<=p8)
states: 1
abstracting: (p27<=p79)
states: 2,228,426 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.566sec

checking: EF [[[1<=p120 & p33<=p61] & [~ [1<=p126] | [[~ [p70<=p49] | p4<=1] & ~ [[[[1<=p81 & [1<=p67 & 1<=p92]] | [p54<=0 & 1<=p7]] & [p5<=0 | ~ [[p71<=p34 | p7<=1]]]]]]]]]
normalized: E [true U [[[~ [[[~ [[p71<=p34 | p7<=1]] | p5<=0] & [[p54<=0 & 1<=p7] | [[1<=p67 & 1<=p92] & 1<=p81]]]] & [~ [p70<=p49] | p4<=1]] | ~ [1<=p126]] & [1<=p120 & p33<=p61]]]

abstracting: (p33<=p61)
states: 2,185,835 (6)
abstracting: (1<=p120)
states: 1
abstracting: (1<=p126)
states: 6,561 (3)
abstracting: (p4<=1)
states: 2,234,987 (6)
abstracting: (p70<=p49)
states: 2,228,426 (6)
abstracting: (1<=p81)
states: 1
abstracting: (1<=p92)
states: 1
abstracting: (1<=p67)
states: 1
abstracting: (1<=p7)
states: 65,536 (4)
abstracting: (p54<=0)
states: 1,772,235 (6)
abstracting: (p5<=0)
states: 2,169,451 (6)
abstracting: (p7<=1)
states: 2,234,987 (6)
abstracting: (p71<=p34)
states: 1,844,362 (6)
-> the formula is TRUE

FORMULA StigmergyElection-PT-09a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.768sec

checking: EF [[[[[[~ [[~ [p36<=1] | [p7<=1 & p96<=p125]]] | [1<=p17 | p8<=p89]] & [[~ [p67<=1] | [[[p17<=p127 | p72<=1] & ~ [p39<=1]] & [[p58<=p21 | 1<=p56] | ~ [p111<=1]]]] & p50<=0]] & [p27<=0 | [~ [[[~ [p86<=1] & ~ [p23<=1]] & ~ [[1<=p53 & 1<=p37]]]] & [[~ [1<=p11] & ~ [p77<=0]] & [[1<=p65 & ~ [p32<=p62]] & p80<=p18]]]]] & ~ [p20<=p35]] & [[[[[1<=p48 | 1<=p0] | 1<=p112] & ~ [[[[p31<=1 | p124<=1] | [~ [p27<=0] | [1<=p16 | 1<=p45]]] | p108<=0]]] & [[[[~ [1<=p2] | [[1<=p39 | p127<=0] & [p98<=p61 | 1<=p83]]] & ~ [[~ [p0<=1] | ~ [p94<=p87]]]] | p47<=0] & [[p105<=p37 | [[[p93<=1 | p1<=p37] & ~ [p15<=p86]] | [~ [1<=p35] | 1<=p113]]] | [[[[p58<=1 | 1<=p7] | ~ [p24<=p106]] & ~ [[1<=p60 | p109<=p37]]] | [[[p71<=0 | p63<=0] & p69<=0] | [[1<=p53 & p25<=p115] | p20<=p55]]]]]] | ~ [[p11<=p52 | [[p75<=p113 | [[1<=p46 & p38<=p33] | p82<=p11]] | [[p122<=1 & [p63<=0 & p64<=0]] & ~ [[p70<=1 & 1<=p23]]]]]]]]]
normalized: E [true U [[~ [[[[~ [[p70<=1 & 1<=p23]] & [[p63<=0 & p64<=0] & p122<=1]] | [[[1<=p46 & p38<=p33] | p82<=p11] | p75<=p113]] | p11<=p52]] | [[[[[[[1<=p53 & p25<=p115] | p20<=p55] | [[p71<=0 | p63<=0] & p69<=0]] | [~ [[1<=p60 | p109<=p37]] & [~ [p24<=p106] | [p58<=1 | 1<=p7]]]] | [[[~ [1<=p35] | 1<=p113] | [~ [p15<=p86] & [p93<=1 | p1<=p37]]] | p105<=p37]] & [[~ [[~ [p94<=p87] | ~ [p0<=1]]] & [[[p98<=p61 | 1<=p83] & [1<=p39 | p127<=0]] | ~ [1<=p2]]] | p47<=0]] & [~ [[[[[1<=p16 | 1<=p45] | ~ [p27<=0]] | [p31<=1 | p124<=1]] | p108<=0]] & [[1<=p48 | 1<=p0] | 1<=p112]]]] & [~ [p20<=p35] & [[[[[[~ [p32<=p62] & 1<=p65] & p80<=p18] & [~ [p77<=0] & ~ [1<=p11]]] & ~ [[~ [[1<=p53 & 1<=p37]] & [~ [p23<=1] & ~ [p86<=1]]]]] | p27<=0] & [[[[[~ [p111<=1] | [p58<=p21 | 1<=p56]] & [~ [p39<=1] & [p17<=p127 | p72<=1]]] | ~ [p67<=1]] & p50<=0] & [[1<=p17 | p8<=p89] | ~ [[[p7<=1 & p96<=p125] | ~ [p36<=1]]]]]]]]]

abstracting: (p36<=1)
states: 2,234,987 (6)
abstracting: (p96<=p125)
states: 1,774,422 (6)
abstracting: (p7<=1)
states: 2,234,987 (6)
abstracting: (p8<=p89)
states: 2,234,986 (6)
abstracting: (1<=p17)
states: 390,625 (5)
abstracting: (p50<=0)
states: 2,234,986 (6)
abstracting: (p67<=1)
states: 2,234,987 (6)
abstracting: (p72<=1)
states: 2,234,987 (6)
abstracting: (p17<=p127)
states: 2,234,987 (6)
abstracting: (p39<=1)
states: 2,234,987 (6)
abstracting: (1<=p56)
states: 6,561 (3)
abstracting: (p58<=p21)
states: 1,844,362 (6)
abstracting: (p111<=1)
states: 2,234,987 (6)
abstracting: (p27<=0)
states: 2,228,426 (6)
abstracting: (p86<=1)
states: 2,234,987 (6)
abstracting: (p23<=1)
states: 2,234,987 (6)
abstracting: (1<=p37)
states: 1
abstracting: (1<=p53)
states: 1
abstracting: (1<=p11)
states: 1
abstracting: (p77<=0)
states: 2,169,451 (6)
abstracting: (p80<=p18)
states: 2,234,986 (6)
abstracting: (1<=p65)
states: 1
abstracting: (p32<=p62)
states: 1,844,362 (6)
abstracting: (p20<=p35)
states: 2,185,835 (6)
abstracting: (1<=p112)
states: 6,561 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p48)
states: 65,536 (4)
abstracting: (p108<=0)
states: 2,234,986 (6)
abstracting: (p124<=1)
states: 2,234,987 (6)
abstracting: (p31<=1)
states: 2,234,987 (6)
abstracting: (p27<=0)
states: 2,228,426 (6)
abstracting: (1<=p45)
states: 390,625 (5)
abstracting: (1<=p16)
states: 390,625 (5)
abstracting: (p47<=0)
states: 2,169,451 (6)
abstracting: (1<=p2)
states: 390,625 (5)
abstracting: (p127<=0)
states: 1
abstracting: (1<=p39)
states: 1
abstracting: (1<=p83)
states: 6,561 (3)
abstracting: (p98<=p61)
states: 2,228,426 (6)
abstracting: (p0<=1)
states: 2,234,987 (6)
abstracting: (p94<=p87)
states: 2,234,986 (6)
abstracting: (p105<=p37)
states: 2,169,451 (6)
abstracting: (p1<=p37)
states: 1,844,362 (6)
abstracting: (p93<=1)
states: 2,234,987 (6)
abstracting: (p15<=p86)
states: 1,922,487 (6)
abstracting: (1<=p113)
states: 390,625 (5)
abstracting: (1<=p35)
states: 65,536 (4)
abstracting: (1<=p7)
states: 65,536 (4)
abstracting: (p58<=1)
states: 2,234,987 (6)
abstracting: (p24<=p106)
states: 2,234,986 (6)
abstracting: (p109<=p37)
states: 2,234,986 (6)
abstracting: (1<=p60)
states: 390,625 (5)
abstracting: (p69<=0)
states: 2,228,426 (6)
abstracting: (p63<=0)
states: 2,169,451 (6)
abstracting: (p71<=0)
states: 1,844,362 (6)
abstracting: (p20<=p55)
states: 2,169,451 (6)
abstracting: (p25<=p115)
states: 2,234,986 (6)
abstracting: (1<=p53)
states: 1
abstracting: (p11<=p52)
states: 2,234,986 (6)
abstracting: (p75<=p113)
states: 2,169,451 (6)
abstracting: (p82<=p11)
states: 1,772,236 (6)
abstracting: (p38<=p33)
states: 2,234,986 (6)
abstracting: (1<=p46)
states: 390,625 (5)
abstracting: (p122<=1)
states: 2,234,987 (6)
abstracting: (p64<=0)
states: 2,234,986 (6)
abstracting: (p63<=0)
states: 2,169,451 (6)
abstracting: (1<=p23)
states: 1
abstracting: (p70<=1)
states: 2,234,987 (6)
-> the formula is FALSE

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

MC time: 0m 3.477sec

totally nodes used: 6591032 (6.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18573006 65516169 84089175
used/not used/entry size/cache size: 42328031 24780833 16 1024MB
basic ops cache: hits/miss/sum: 5151969 15026687 20178656
used/not used/entry size/cache size: 11940309 4836907 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: 169708 638081 807789
used/not used/entry size/cache size: 615550 7773058 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 61710307
1 4441396
2 761405
3 161881
4 28873
5 4395
6 541
7 58
8 8
9 0
>= 10 0

Total processing time: 0m59.910sec


BK_STOP 1679590328514

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

75235 75376 75642 75834 76011 76193 76380 76498 76719 76826 76978 77151 77487 77779 78125 78314 78646 78854 79007 79081 79615 79831 80537 81276 81307 81762 81989 82699 83022 83173 83602 84688 84995 85854 86554 86934 87731 88310 88724 89939 90022 91756 90156 91397 92719 93397 95931 96727 99056 98345 99970 100740 102956 102150 104603 104885 108598 105036
iterations count:5805383 (313), effective:1958 (0)

initing FirstDep: 0m 0.128sec

103471
iterations count:124100 (6), effective:109 (0)
103471
iterations count:124100 (6), effective:109 (0)
103471
iterations count:124138 (6), effective:109 (0)
103471
iterations count:124166 (6), effective:109 (0)
103471
iterations count:124172 (6), effective:109 (0)
103471
iterations count:124172 (6), effective:109 (0)
103471
iterations count:124027 (6), effective:109 (0)
103471
iterations count:123978 (6), effective:109 (0)
103471
iterations count:124121 (6), effective:110 (0)
103471
iterations count:124196 (6), effective:110 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-09a"
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-09a, 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-167912650600670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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