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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 5.4K Feb 26 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 5.4M 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 StigmergyCommit-PT-07a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679473392533

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=StigmergyCommit-PT-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 08:23:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 08:23:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:23:17] [INFO ] Load time of PNML (sax parser for PT used): 793 ms
[2023-03-22 08:23:17] [INFO ] Transformed 292 places.
[2023-03-22 08:23:17] [INFO ] Transformed 7108 transitions.
[2023-03-22 08:23:17] [INFO ] Found NUPN structural information;
[2023-03-22 08:23:17] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 1016 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 12) seen :4
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 08:23:19] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2023-03-22 08:23:19] [INFO ] Computed 9 place invariants in 25 ms
[2023-03-22 08:23:20] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 08:23:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-22 08:23:21] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-22 08:23:21] [INFO ] State equation strengthened by 621 read => feed constraints.
[2023-03-22 08:23:22] [INFO ] After 1135ms SMT Verify possible using 621 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-22 08:23:23] [INFO ] Deduced a trap composed of 17 places in 616 ms of which 12 ms to minimize.
[2023-03-22 08:23:23] [INFO ] Deduced a trap composed of 18 places in 472 ms of which 2 ms to minimize.
[2023-03-22 08:23:24] [INFO ] Deduced a trap composed of 19 places in 469 ms of which 2 ms to minimize.
[2023-03-22 08:23:24] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 3 ms to minimize.
[2023-03-22 08:23:25] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 2 ms to minimize.
[2023-03-22 08:23:25] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 0 ms to minimize.
[2023-03-22 08:23:25] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 1 ms to minimize.
[2023-03-22 08:23:26] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-22 08:23:26] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-22 08:23:26] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2023-03-22 08:23:26] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-22 08:23:26] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 0 ms to minimize.
[2023-03-22 08:23:27] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-22 08:23:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4693 ms
[2023-03-22 08:23:27] [INFO ] Deduced a trap composed of 17 places in 403 ms of which 2 ms to minimize.
[2023-03-22 08:23:28] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 0 ms to minimize.
[2023-03-22 08:23:28] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-22 08:23:28] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2023-03-22 08:23:29] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 2 ms to minimize.
[2023-03-22 08:23:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1759 ms
[2023-03-22 08:23:29] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2023-03-22 08:23:29] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2023-03-22 08:23:29] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-22 08:23:29] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2023-03-22 08:23:30] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-22 08:23:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 977 ms
[2023-03-22 08:23:30] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-22 08:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-22 08:23:30] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-22 08:23:30] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2023-03-22 08:23:31] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2023-03-22 08:23:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 576 ms
[2023-03-22 08:23:31] [INFO ] After 9787ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-22 08:23:31] [INFO ] After 11348ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 15 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.17 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 284 transition count 811
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 82 rules applied. Total rules applied 154 place count 238 transition count 775
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 162 place count 231 transition count 774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 230 transition count 774
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 163 place count 230 transition count 725
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 261 place count 181 transition count 725
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 298 place count 144 transition count 688
Iterating global reduction 4 with 37 rules applied. Total rules applied 335 place count 144 transition count 688
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 369 place count 110 transition count 654
Iterating global reduction 4 with 34 rules applied. Total rules applied 403 place count 110 transition count 654
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 4 with 69 rules applied. Total rules applied 472 place count 110 transition count 585
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 477 place count 105 transition count 580
Iterating global reduction 5 with 5 rules applied. Total rules applied 482 place count 105 transition count 580
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 486 place count 101 transition count 576
Iterating global reduction 5 with 4 rules applied. Total rules applied 490 place count 101 transition count 576
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 493 place count 101 transition count 573
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 517 place count 89 transition count 561
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 525 place count 89 transition count 553
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 532 place count 82 transition count 546
Iterating global reduction 7 with 7 rules applied. Total rules applied 539 place count 82 transition count 546
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 545 place count 76 transition count 540
Iterating global reduction 7 with 6 rules applied. Total rules applied 551 place count 76 transition count 540
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 557 place count 70 transition count 534
Iterating global reduction 7 with 6 rules applied. Total rules applied 563 place count 70 transition count 534
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 570 place count 70 transition count 527
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 572 place count 70 transition count 525
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 574 place count 68 transition count 525
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 582 place count 68 transition count 525
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 586 place count 68 transition count 521
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 587 place count 67 transition count 520
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 6 rules applied. Total rules applied 593 place count 66 transition count 515
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 599 place count 61 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 600 place count 60 transition count 514
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 600 place count 60 transition count 511
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 606 place count 57 transition count 511
Performed 13 Post agglomeration using F-continuation condition with reduction of 420 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 632 place count 44 transition count 78
Drop transitions removed 8 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 656 place count 44 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 662 place count 41 transition count 51
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 665 place count 41 transition count 48
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 668 place count 41 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 669 place count 41 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 670 place count 40 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 671 place count 40 transition count 44
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 672 place count 40 transition count 43
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 676 place count 36 transition count 39
Applied a total of 676 rules in 917 ms. Remains 36 /292 variables (removed 256) and now considering 39/890 (removed 851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 919 ms. Remains : 36/292 places, 39/890 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15909 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: StigmergyCommit_PT_07a
(NrP: 292 NrTr: 7108 NrArc: 108222)

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

net check time: 0m 0.024sec

init dd package: 0m 3.269sec


RS generation: 0m18.357sec


-> reachability set: #nodes 96973 (9.7e+04) #states 7,868,223 (6)



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

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

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

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.407sec

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

abstracting: (p245<=1)
states: 7,868,223 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [p114<=p98]
normalized: ~ [E [true U ~ [p114<=p98]]]

abstracting: (p114<=p98)
states: 7,851,839 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.705sec

checking: AG [p2<=p241]
normalized: ~ [E [true U ~ [p2<=p241]]]

abstracting: (p2<=p241)
states: 7,790,098 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.851sec

checking: AG [~ [[~ [p12<=1] & p106<=p149]]]
normalized: ~ [E [true U [~ [p12<=1] & p106<=p149]]]

abstracting: (p106<=p149)
states: 6,809,382 (6)
abstracting: (p12<=1)
states: 7,868,223 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: AG [[[p273<=0 & 1<=p5] | ~ [[1<=p273 & [[p167<=p178 | [[~ [p98<=1] | p225<=p136] & 1<=p121]] | ~ [p56<=p275]]]]]]
normalized: ~ [E [true U ~ [[[p273<=0 & 1<=p5] | ~ [[[[[[~ [p98<=1] | p225<=p136] & 1<=p121] | p167<=p178] | ~ [p56<=p275]] & 1<=p273]]]]]]

abstracting: (1<=p273)
states: 1
abstracting: (p56<=p275)
states: 7,868,222 (6)
abstracting: (p167<=p178)
states: 7,868,222 (6)
abstracting: (1<=p121)
states: 1
abstracting: (p225<=p136)
states: 7,868,222 (6)
abstracting: (p98<=1)
states: 7,868,223 (6)
abstracting: (1<=p5)
states: 16,384 (4)
abstracting: (p273<=0)
states: 7,868,222 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.634sec

checking: AG [~ [[1<=p52 & ~ [[p107<=1 & [[1<=p193 & ~ [p168<=p137]] | ~ [[1<=p123 & [[1<=p272 | p291<=0] | [1<=p172 & p196<=p123]]]]]]]]]]
normalized: ~ [E [true U [~ [[[~ [[[[1<=p172 & p196<=p123] | [1<=p272 | p291<=0]] & 1<=p123]] | [~ [p168<=p137] & 1<=p193]] & p107<=1]] & 1<=p52]]]

abstracting: (1<=p52)
states: 1
abstracting: (p107<=1)
states: 7,868,223 (6)
abstracting: (1<=p193)
states: 1
abstracting: (p168<=p137)
states: 7,868,222 (6)
abstracting: (1<=p123)
states: 1
abstracting: (p291<=0)
states: 1
abstracting: (1<=p272)
states: 1
abstracting: (p196<=p123)
states: 7,868,222 (6)
abstracting: (1<=p172)
states: 1
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.370sec

checking: AG [~ [[~ [[~ [[p169<=0 | ~ [[1<=p134 | p161<=1]]]] | 1<=p198]] & [~ [[1<=p27 & p176<=p75]] & [~ [[~ [p52<=0] | [p90<=p286 | [~ [1<=p244] | [1<=p158 | p258<=1]]]]] | 1<=p121]]]]]
normalized: ~ [E [true U [[[~ [[[[[1<=p158 | p258<=1] | ~ [1<=p244]] | p90<=p286] | ~ [p52<=0]]] | 1<=p121] & ~ [[1<=p27 & p176<=p75]]] & ~ [[~ [[~ [[1<=p134 | p161<=1]] | p169<=0]] | 1<=p198]]]]]

abstracting: (1<=p198)
states: 1
abstracting: (p169<=0)
states: 7,868,222 (6)
abstracting: (p161<=1)
states: 7,868,223 (6)
abstracting: (1<=p134)
states: 1
abstracting: (p176<=p75)
states: 6,809,382 (6)
abstracting: (1<=p27)
states: 1
abstracting: (1<=p121)
states: 1
abstracting: (p52<=0)
states: 7,868,222 (6)
abstracting: (p90<=p286)
states: 7,868,222 (6)
abstracting: (1<=p244)
states: 1
abstracting: (p258<=1)
states: 7,868,223 (6)
abstracting: (1<=p158)
states: 1
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.686sec

checking: EF [[1<=p139 & [~ [p53<=p158] | [~ [[[~ [p76<=p267] | ~ [p170<=p104]] | ~ [p12<=p89]]] & [~ [[p78<=0 | [[1<=p227 & p194<=1] & [p229<=0 | p104<=p266]]]] | p36<=p250]]]]]
normalized: E [true U [1<=p139 & [[[p36<=p250 | ~ [[p78<=0 | [[p229<=0 | p104<=p266] & [1<=p227 & p194<=1]]]]] & ~ [[~ [p12<=p89] | [~ [p170<=p104] | ~ [p76<=p267]]]]] | ~ [p53<=p158]]]]

abstracting: (p53<=p158)
states: 7,868,222 (6)
abstracting: (p76<=p267)
states: 7,790,098 (6)
abstracting: (p170<=p104)
states: 7,868,222 (6)
abstracting: (p12<=p89)
states: 7,868,222 (6)
abstracting: (p194<=1)
states: 7,868,223 (6)
abstracting: (1<=p227)
states: 1
abstracting: (p104<=p266)
states: 6,809,382 (6)
abstracting: (p229<=0)
states: 7,868,222 (6)
abstracting: (p78<=0)
states: 7,851,839 (6)
abstracting: (p36<=p250)
states: 6,960,645 (6)
abstracting: (1<=p139)
states: 1,058,841 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.536sec

checking: AG [~ [[~ [[~ [1<=p58] | [p265<=p232 & p128<=0]]] & [[[[[~ [1<=p259] | [p8<=p100 | p216<=p57]] | [[p180<=p148 & p219<=p203] & [p171<=0 & p223<=0]]] | [~ [p71<=p99] & ~ [p198<=1]]] & ~ [[p40<=0 & ~ [p266<=1]]]] & p79<=p59]]]]
normalized: ~ [E [true U [[p79<=p59 & [~ [[p40<=0 & ~ [p266<=1]]] & [[~ [p198<=1] & ~ [p71<=p99]] | [[[p171<=0 & p223<=0] & [p180<=p148 & p219<=p203]] | [[p8<=p100 | p216<=p57] | ~ [1<=p259]]]]]] & ~ [[[p265<=p232 & p128<=0] | ~ [1<=p58]]]]]]

abstracting: (1<=p58)
states: 1
abstracting: (p128<=0)
states: 7,868,222 (6)
abstracting: (p265<=p232)
states: 7,868,222 (6)
abstracting: (1<=p259)
states: 16,384 (4)
abstracting: (p216<=p57)
states: 6,809,382 (6)
abstracting: (p8<=p100)
states: 7,868,222 (6)
abstracting: (p219<=p203)
states: 7,790,098 (6)
abstracting: (p180<=p148)
states: 6,809,382 (6)
abstracting: (p223<=0)
states: 7,851,839 (6)
abstracting: (p171<=0)
states: 7,868,222 (6)
abstracting: (p71<=p99)
states: 6,809,382 (6)
abstracting: (p198<=1)
states: 7,868,223 (6)
abstracting: (p266<=1)
states: 7,868,223 (6)
abstracting: (p40<=0)
states: 7,790,098 (6)
abstracting: (p79<=p59)
states: 7,851,839 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.812sec

checking: AG [[[~ [p232<=p22] | p210<=p207] & [[1<=p130 & [1<=p27 & [[[[[p63<=1 & p221<=p44] & [p221<=p95 & p52<=p75]] | 1<=p161] | [[[p283<=p88 | p244<=p275] & [p15<=p52 | p234<=p96]] & [~ [1<=p192] | ~ [1<=p253]]]] | [1<=p127 & 1<=p63]]]] | [[[p32<=p256 & 1<=p193] | ~ [[[[~ [1<=p271] & p181<=1] | [[p288<=0 & p30<=p252] & [1<=p107 | p131<=p94]]] & [~ [[p223<=0 | 1<=p47]] | [[1<=p66 & p159<=1] & [p25<=0 | p223<=1]]]]]] & ~ [[[~ [[p161<=0 & p215<=0]] & p267<=0] & ~ [p39<=p139]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [p39<=p139] & [p267<=0 & ~ [[p161<=0 & p215<=0]]]]] & [~ [[[[[p25<=0 | p223<=1] & [1<=p66 & p159<=1]] | ~ [[p223<=0 | 1<=p47]]] & [[[1<=p107 | p131<=p94] & [p288<=0 & p30<=p252]] | [p181<=1 & ~ [1<=p271]]]]] | [p32<=p256 & 1<=p193]]] | [1<=p130 & [1<=p27 & [[1<=p127 & 1<=p63] | [[[~ [1<=p253] | ~ [1<=p192]] & [[p15<=p52 | p234<=p96] & [p283<=p88 | p244<=p275]]] | [1<=p161 | [[p221<=p95 & p52<=p75] & [p63<=1 & p221<=p44]]]]]]]] & [p210<=p207 | ~ [p232<=p22]]]]]]

abstracting: (p232<=p22)
states: 7,868,222 (6)
abstracting: (p210<=p207)
states: 6,714,721 (6)
abstracting: (p221<=p44)
states: 7,851,839 (6)
abstracting: (p63<=1)
states: 7,868,223 (6)
abstracting: (p52<=p75)
states: 7,868,222 (6)
abstracting: (p221<=p95)
states: 7,851,839 (6)
abstracting: (1<=p161)
states: 1
abstracting: (p244<=p275)
states: 7,868,222 (6)
abstracting: (p283<=p88)
states: 7,044,680 (6)
abstracting: (p234<=p96)
states: 7,868,222 (6)
abstracting: (p15<=p52)
states: 7,868,222 (6)
abstracting: (1<=p192)
states: 1
abstracting: (1<=p253)
states: 78,125 (4)
abstracting: (1<=p63)
states: 1
abstracting: (1<=p127)
states: 1
abstracting: (1<=p27)
states: 1
abstracting: (1<=p130)
states: 1
abstracting: (1<=p193)
states: 1
abstracting: (p32<=p256)
states: 6,809,382 (6)
abstracting: (1<=p271)
states: 1
abstracting: (p181<=1)
states: 7,868,223 (6)
abstracting: (p30<=p252)
states: 6,865,984 (6)
abstracting: (p288<=0)
states: 7,044,680 (6)
abstracting: (p131<=p94)
states: 7,868,222 (6)
abstracting: (1<=p107)
states: 1,058,841 (6)
abstracting: (1<=p47)
states: 1
abstracting: (p223<=0)
states: 7,851,839 (6)
abstracting: (p159<=1)
states: 7,868,223 (6)
abstracting: (1<=p66)
states: 1,153,502 (6)
abstracting: (p223<=1)
states: 7,868,223 (6)
abstracting: (p25<=0)
states: 7,868,222 (6)
abstracting: (p215<=0)
states: 6,809,382 (6)
abstracting: (p161<=0)
states: 7,868,222 (6)
abstracting: (p267<=0)
states: 7,868,222 (6)
abstracting: (p39<=p139)
states: 7,790,098 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.419sec

checking: AG [[~ [[[[p179<=p33 & p152<=1] | ~ [[p260<=p205 & [~ [1<=p2] & [p265<=0 | 1<=p124]]]]] | [[[[~ [1<=p264] & [p206<=p165 & p141<=1]] | [~ [p19<=p161] & [p9<=p109 & p283<=0]]] & 1<=p54] | [p168<=0 | ~ [[[p140<=p199 & p85<=p47] | [1<=p265 | p23<=p203]]]]]]] | [[~ [[~ [[[1<=p234 & 1<=p34] | [p88<=1 | p11<=p238]]] | [[[p224<=1 & p67<=p100] & ~ [p157<=0]] | [[p232<=0 | p19<=p233] | 1<=p196]]]] | 1<=p171] | [p235<=1 | ~ [[[~ [p175<=0] & [[~ [p243<=1] | ~ [p51<=0]] & p111<=p157]] & [[[~ [1<=p210] | [p95<=p30 | 1<=p148]] | 1<=p107] | ~ [p188<=p171]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[p168<=0 | ~ [[[1<=p265 | p23<=p203] | [p140<=p199 & p85<=p47]]]] | [1<=p54 & [[~ [p19<=p161] & [p9<=p109 & p283<=0]] | [[p206<=p165 & p141<=1] & ~ [1<=p264]]]]] | [~ [[p260<=p205 & [[p265<=0 | 1<=p124] & ~ [1<=p2]]]] | [p179<=p33 & p152<=1]]]] | [[1<=p171 | ~ [[[[~ [p157<=0] & [p224<=1 & p67<=p100]] | [1<=p196 | [p232<=0 | p19<=p233]]] | ~ [[[1<=p234 & 1<=p34] | [p88<=1 | p11<=p238]]]]]] | [p235<=1 | ~ [[[[p111<=p157 & [~ [p51<=0] | ~ [p243<=1]]] & ~ [p175<=0]] & [[1<=p107 | [~ [1<=p210] | [p95<=p30 | 1<=p148]]] | ~ [p188<=p171]]]]]]]]]]

abstracting: (p188<=p171)
states: 7,868,222 (6)
abstracting: (1<=p148)
states: 78,125 (4)
abstracting: (p95<=p30)
states: 7,868,223 (6)
abstracting: (1<=p210)
states: 1,153,502 (6)
abstracting: (1<=p107)
states: 1,058,841 (6)
abstracting: (p175<=0)
states: 6,809,382 (6)
abstracting: (p243<=1)
states: 7,868,223 (6)
abstracting: (p51<=0)
states: 7,868,222 (6)
abstracting: (p111<=p157)
states: 7,790,098 (6)
abstracting: (p235<=1)
states: 7,868,223 (6)
abstracting: (p11<=p238)
states: 7,868,222 (6)
abstracting: (p88<=1)
states: 7,868,223 (6)
abstracting: (1<=p34)
states: 1,058,841 (6)
abstracting: (1<=p234)
states: 1
abstracting: (p19<=p233)
states: 7,868,222 (6)
abstracting: (p232<=0)
states: 7,868,222 (6)
abstracting: (1<=p196)
states: 1
abstracting: (p67<=p100)
states: 6,809,382 (6)
abstracting: (p224<=1)
states: 7,868,223 (6)
abstracting: (p157<=0)
states: 7,868,222 (6)
abstracting: (1<=p171)
states: 1
abstracting: (p152<=1)
states: 7,868,223 (6)
abstracting: (p179<=p33)
states: 6,960,645 (6)
abstracting: (1<=p2)
states: 78,125 (4)
abstracting: (1<=p124)
states: 1
abstracting: (p265<=0)
states: 7,868,222 (6)
abstracting: (p260<=p205)
states: 7,868,222 (6)
abstracting: (1<=p264)
states: 1
abstracting: (p141<=1)
states: 7,868,223 (6)
abstracting: (p206<=p165)
states: 7,868,222 (6)
abstracting: (p283<=0)
states: 7,044,680 (6)
abstracting: (p9<=p109)
states: 7,868,222 (6)
abstracting: (p19<=p161)
states: 7,868,222 (6)
abstracting: (1<=p54)
states: 1
abstracting: (p85<=p47)
states: 7,868,222 (6)
abstracting: (p140<=p199)
states: 6,809,382 (6)
abstracting: (p23<=p203)
states: 7,868,222 (6)
abstracting: (1<=p265)
states: 1
abstracting: (p168<=0)
states: 7,868,222 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.823sec

checking: EF [[~ [[[p232<=p268 & [p121<=p147 | p86<=p173]] & [[[[[1<=p260 & [1<=p169 | 1<=p76]] & [[1<=p6 & p151<=0] & ~ [1<=p97]]] & 1<=p201] & ~ [[p182<=0 & [[p258<=p180 | 1<=p280] | ~ [p22<=1]]]]] | [[[[p108<=p219 & p157<=p60] | p145<=p138] & ~ [[[1<=p174 & 1<=p193] | p81<=p166]]] | ~ [[1<=p141 & [p281<=1 | [p39<=0 & p234<=0]]]]]]]] & [[[[[~ [[[p276<=p230 | p210<=1] | ~ [p65<=0]]] & [[p106<=p15 & ~ [p26<=p169]] & [1<=p51 | ~ [p105<=1]]]] & [[[[1<=p118 & p220<=p153] & p229<=0] | [1<=p18 & [p209<=1 & 1<=p200]]] | 1<=p113]] & p146<=p108] | ~ [p21<=p31]] & ~ [p112<=1]]]]
normalized: E [true U [[~ [p112<=1] & [~ [p21<=p31] | [p146<=p108 & [[1<=p113 | [[1<=p18 & [p209<=1 & 1<=p200]] | [p229<=0 & [1<=p118 & p220<=p153]]]] & [[[1<=p51 | ~ [p105<=1]] & [p106<=p15 & ~ [p26<=p169]]] & ~ [[~ [p65<=0] | [p276<=p230 | p210<=1]]]]]]]] & ~ [[[[~ [[1<=p141 & [p281<=1 | [p39<=0 & p234<=0]]]] | [~ [[p81<=p166 | [1<=p174 & 1<=p193]]] & [p145<=p138 | [p108<=p219 & p157<=p60]]]] | [~ [[p182<=0 & [~ [p22<=1] | [p258<=p180 | 1<=p280]]]] & [1<=p201 & [[~ [1<=p97] & [1<=p6 & p151<=0]] & [1<=p260 & [1<=p169 | 1<=p76]]]]]] & [p232<=p268 & [p121<=p147 | p86<=p173]]]]]]

abstracting: (p86<=p173)
states: 7,868,222 (6)
abstracting: (p121<=p147)
states: 7,868,222 (6)
abstracting: (p232<=p268)
states: 7,868,222 (6)
abstracting: (1<=p76)
states: 78,125 (4)
abstracting: (1<=p169)
states: 1
abstracting: (1<=p260)
states: 1
abstracting: (p151<=0)
states: 7,851,839 (6)
abstracting: (1<=p6)
states: 16,384 (4)
abstracting: (1<=p97)
states: 1
abstracting: (1<=p201)
states: 1
abstracting: (1<=p280)
states: 1
abstracting: (p258<=p180)
states: 7,851,839 (6)
abstracting: (p22<=1)
states: 7,868,223 (6)
abstracting: (p182<=0)
states: 7,790,098 (6)
abstracting: (p157<=p60)
states: 7,868,222 (6)
abstracting: (p108<=p219)
states: 6,809,382 (6)
abstracting: (p145<=p138)
states: 7,805,723 (6)
abstracting: (1<=p193)
states: 1
abstracting: (1<=p174)
states: 1,153,502 (6)
abstracting: (p81<=p166)
states: 7,868,222 (6)
abstracting: (p234<=0)
states: 7,868,222 (6)
abstracting: (p39<=0)
states: 7,790,098 (6)
abstracting: (p281<=1)
states: 7,868,223 (6)
abstracting: (1<=p141)
states: 1,058,841 (6)
abstracting: (p210<=1)
states: 7,868,223 (6)
abstracting: (p276<=p230)
states: 7,868,222 (6)
abstracting: (p65<=0)
states: 7,868,222 (6)
abstracting: (p26<=p169)
states: 7,868,222 (6)
abstracting: (p106<=p15)
states: 6,809,382 (6)
abstracting: (p105<=1)
states: 7,868,223 (6)
abstracting: (1<=p51)
states: 1
abstracting: (p220<=p153)
states: 7,790,098 (6)
abstracting: (1<=p118)
states: 1
abstracting: (p229<=0)
states: 7,868,222 (6)
abstracting: (1<=p200)
states: 1
abstracting: (p209<=1)
states: 7,868,223 (6)
abstracting: (1<=p18)
states: 1
abstracting: (1<=p113)
states: 16,384 (4)
abstracting: (p146<=p108)
states: 7,790,098 (6)
abstracting: (p21<=p31)
states: 7,868,222 (6)
abstracting: (p112<=1)
states: 7,868,223 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.750sec

checking: EF [[[[[~ [[p273<=0 | [~ [p273<=1] & 1<=p161]]] | [[[[[p236<=0 | p65<=p49] & p33<=p278] & ~ [1<=p58]] | p189<=p290] & [~ [[p185<=p1 | p279<=1]] | p229<=p228]]] & ~ [[[[[~ [1<=p50] & ~ [p29<=p117]] | p203<=1] | [p33<=p250 & ~ [p143<=0]]] & [[[[1<=p60 & p236<=0] | [p258<=p191 | 1<=p253]] & p236<=1] | ~ [[[p25<=1 | p125<=1] & [p216<=0 | 1<=p17]]]]]]] | [[[~ [[p139<=0 | p144<=p40]] & [[[1<=p238 & ~ [1<=p286]] & [[p232<=0 | 1<=p60] & ~ [1<=p161]]] & p12<=p284]] | [p226<=p157 & 1<=p279]] & ~ [[[[~ [1<=p40] & 1<=p95] | ~ [[1<=p179 | [p168<=p282 | p255<=p177]]]] & [~ [[[p64<=1 | p221<=p240] & [1<=p134 & p201<=0]]] & [p234<=p82 | [~ [1<=p280] | ~ [1<=p258]]]]]]]] & 1<=p175]]
normalized: E [true U [1<=p175 & [[~ [[[[p234<=p82 | [~ [1<=p258] | ~ [1<=p280]]] & ~ [[[1<=p134 & p201<=0] & [p64<=1 | p221<=p240]]]] & [~ [[1<=p179 | [p168<=p282 | p255<=p177]]] | [1<=p95 & ~ [1<=p40]]]]] & [[p226<=p157 & 1<=p279] | [[p12<=p284 & [[~ [1<=p161] & [p232<=0 | 1<=p60]] & [1<=p238 & ~ [1<=p286]]]] & ~ [[p139<=0 | p144<=p40]]]]] | [~ [[[~ [[[p216<=0 | 1<=p17] & [p25<=1 | p125<=1]]] | [p236<=1 & [[p258<=p191 | 1<=p253] | [1<=p60 & p236<=0]]]] & [[p33<=p250 & ~ [p143<=0]] | [p203<=1 | [~ [p29<=p117] & ~ [1<=p50]]]]]] & [[[p229<=p228 | ~ [[p185<=p1 | p279<=1]]] & [p189<=p290 | [~ [1<=p58] & [p33<=p278 & [p236<=0 | p65<=p49]]]]] | ~ [[p273<=0 | [1<=p161 & ~ [p273<=1]]]]]]]]]

abstracting: (p273<=1)
states: 7,868,223 (6)
abstracting: (1<=p161)
states: 1
abstracting: (p273<=0)
states: 7,868,222 (6)
abstracting: (p65<=p49)
states: 7,868,222 (6)
abstracting: (p236<=0)
states: 7,868,222 (6)
abstracting: (p33<=p278)
states: 6,809,382 (6)
abstracting: (1<=p58)
states: 1
abstracting: (p189<=p290)
states: 7,868,222 (6)
abstracting: (p279<=1)
states: 7,868,223 (6)
abstracting: (p185<=p1)
states: 7,851,839 (6)
abstracting: (p229<=p228)
states: 7,868,222 (6)
abstracting: (1<=p50)
states: 1
abstracting: (p29<=p117)
states: 7,868,222 (6)
abstracting: (p203<=1)
states: 7,868,223 (6)
abstracting: (p143<=0)
states: 6,809,382 (6)
abstracting: (p33<=p250)
states: 6,960,645 (6)
abstracting: (p236<=0)
states: 7,868,222 (6)
abstracting: (1<=p60)
states: 1
abstracting: (1<=p253)
states: 78,125 (4)
abstracting: (p258<=p191)
states: 7,851,839 (6)
abstracting: (p236<=1)
states: 7,868,223 (6)
abstracting: (p125<=1)
states: 7,868,223 (6)
abstracting: (p25<=1)
states: 7,868,223 (6)
abstracting: (1<=p17)
states: 1
abstracting: (p216<=0)
states: 6,809,382 (6)
abstracting: (p144<=p40)
states: 6,809,382 (6)
abstracting: (p139<=0)
states: 6,809,382 (6)
abstracting: (1<=p286)
states: 823,543 (5)
abstracting: (1<=p238)
states: 1
abstracting: (1<=p60)
states: 1
abstracting: (p232<=0)
states: 7,868,222 (6)
abstracting: (1<=p161)
states: 1
abstracting: (p12<=p284)
states: 7,868,222 (6)
abstracting: (1<=p279)
states: 1
abstracting: (p226<=p157)
states: 7,868,222 (6)
abstracting: (1<=p40)
states: 78,125 (4)
abstracting: (1<=p95)
states: 1
abstracting: (p255<=p177)
states: 7,790,098 (6)
abstracting: (p168<=p282)
states: 7,868,223 (6)
abstracting: (1<=p179)
states: 1,058,841 (6)
abstracting: (p221<=p240)
states: 7,851,839 (6)
abstracting: (p64<=1)
states: 7,868,223 (6)
abstracting: (p201<=0)
states: 7,868,222 (6)
abstracting: (1<=p134)
states: 1
abstracting: (1<=p280)
states: 1
abstracting: (1<=p258)
states: 16,384 (4)
abstracting: (p234<=p82)
states: 7,868,222 (6)
abstracting: (1<=p175)
states: 1,058,841 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.232sec

checking: AG [[[[p286<=0 | [p160<=0 | ~ [[[[~ [p21<=p252] | p24<=p235] & 1<=p282] | p211<=0]]]] | [~ [[[[~ [[p257<=0 | 1<=p274]] | [~ [1<=p274] | [1<=p5 & 1<=p280]]] | [[~ [1<=p253] | 1<=p171] & p247<=1]] | ~ [[1<=p173 & [[p83<=p42 & 1<=p175] | [p254<=0 | p226<=p18]]]]]] | [[[p63<=0 & p15<=0] | [1<=p271 & ~ [[1<=p253 & 1<=p245]]]] | [[[p164<=0 | ~ [p164<=p266]] & [p152<=p32 | [[1<=p189 & 1<=p238] & ~ [1<=p278]]]] | [[[p57<=p26 & ~ [p97<=p54]] | [[1<=p95 & p104<=p72] | [1<=p60 & p121<=p230]]] | [[1<=p221 | [p168<=p100 | p72<=p71]] & p259<=1]]]]]] | [~ [[[[1<=p22 & [p27<=0 | ~ [[1<=p81 | 1<=p93]]]] | [~ [[[1<=p277 | p6<=p93] | ~ [p274<=1]]] & ~ [p34<=p11]]] | p108<=0]] & ~ [p65<=0]]]]
normalized: ~ [E [true U ~ [[[~ [p65<=0] & ~ [[p108<=0 | [[~ [p34<=p11] & ~ [[~ [p274<=1] | [1<=p277 | p6<=p93]]]] | [1<=p22 & [p27<=0 | ~ [[1<=p81 | 1<=p93]]]]]]]] | [[[[[[p259<=1 & [1<=p221 | [p168<=p100 | p72<=p71]]] | [[[1<=p60 & p121<=p230] | [1<=p95 & p104<=p72]] | [p57<=p26 & ~ [p97<=p54]]]] | [[p152<=p32 | [~ [1<=p278] & [1<=p189 & 1<=p238]]] & [p164<=0 | ~ [p164<=p266]]]] | [[1<=p271 & ~ [[1<=p253 & 1<=p245]]] | [p63<=0 & p15<=0]]] | ~ [[~ [[1<=p173 & [[p254<=0 | p226<=p18] | [p83<=p42 & 1<=p175]]]] | [[p247<=1 & [1<=p171 | ~ [1<=p253]]] | [[[1<=p5 & 1<=p280] | ~ [1<=p274]] | ~ [[p257<=0 | 1<=p274]]]]]]] | [p286<=0 | [p160<=0 | ~ [[p211<=0 | [1<=p282 & [p24<=p235 | ~ [p21<=p252]]]]]]]]]]]]

abstracting: (p21<=p252)
states: 7,868,222 (6)
abstracting: (p24<=p235)
states: 7,868,222 (6)
abstracting: (1<=p282)
states: 918,204 (5)
abstracting: (p211<=0)
states: 6,809,382 (6)
abstracting: (p160<=0)
states: 7,868,222 (6)
abstracting: (p286<=0)
states: 7,044,680 (6)
abstracting: (1<=p274)
states: 1
abstracting: (p257<=0)
states: 7,851,839 (6)
abstracting: (1<=p274)
states: 1
abstracting: (1<=p280)
states: 1
abstracting: (1<=p5)
states: 16,384 (4)
abstracting: (1<=p253)
states: 78,125 (4)
abstracting: (1<=p171)
states: 1
abstracting: (p247<=1)
states: 7,868,223 (6)
abstracting: (1<=p175)
states: 1,058,841 (6)
abstracting: (p83<=p42)
states: 7,868,222 (6)
abstracting: (p226<=p18)
states: 7,868,222 (6)
abstracting: (p254<=0)
states: 7,790,098 (6)
abstracting: (1<=p173)
states: 1
abstracting: (p15<=0)
states: 7,868,222 (6)
abstracting: (p63<=0)
states: 7,868,222 (6)
abstracting: (1<=p245)
states: 1
abstracting: (1<=p253)
states: 78,125 (4)
abstracting: (1<=p271)
states: 1
abstracting: (p164<=p266)
states: 7,868,222 (6)
abstracting: (p164<=0)
states: 7,868,222 (6)
abstracting: (1<=p238)
states: 1
abstracting: (1<=p189)
states: 1
abstracting: (1<=p278)
states: 1
abstracting: (p152<=p32)
states: 7,868,222 (6)
abstracting: (p97<=p54)
states: 7,868,222 (6)
abstracting: (p57<=p26)
states: 7,868,222 (6)
abstracting: (p104<=p72)
states: 6,960,645 (6)
abstracting: (1<=p95)
states: 1
abstracting: (p121<=p230)
states: 7,868,222 (6)
abstracting: (1<=p60)
states: 1
abstracting: (p72<=p71)
states: 6,809,382 (6)
abstracting: (p168<=p100)
states: 7,868,222 (6)
abstracting: (1<=p221)
states: 16,384 (4)
abstracting: (p259<=1)
states: 7,868,223 (6)
abstracting: (1<=p93)
states: 1
abstracting: (1<=p81)
states: 1
abstracting: (p27<=0)
states: 7,868,222 (6)
abstracting: (1<=p22)
states: 1
abstracting: (p6<=p93)
states: 7,851,839 (6)
abstracting: (1<=p277)
states: 1
abstracting: (p274<=1)
states: 7,868,223 (6)
abstracting: (p34<=p11)
states: 6,809,382 (6)
abstracting: (p108<=0)
states: 6,809,382 (6)
abstracting: (p65<=0)
states: 7,868,222 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.104sec

checking: AG [[[~ [[p278<=0 | [[[[~ [p146<=1] | ~ [1<=p189]] | [~ [1<=p216] | [p282<=1 | p105<=p158]]] & [~ [1<=p196] & p1<=p268]] & [~ [p37<=0] | p186<=p118]]]] & [p252<=p66 | ~ [p70<=p230]]] | [~ [[[[[[[p110<=0 & p58<=p171] | [1<=p117 | 1<=p170]] | p280<=p116] & [~ [[p124<=p156 | 1<=p110]] & p236<=0]] & [~ [[p117<=p271 & [p43<=0 | p277<=0]]] & 1<=p271]] & [[~ [[~ [1<=p40] | p68<=0]] & [[[p38<=1 & p117<=1] & p159<=p53] | [[1<=p270 & 1<=p205] & ~ [p21<=p81]]]] & p21<=p279]]] | [~ [[[[~ [[p98<=0 & 1<=p100]] & ~ [[p9<=p111 & p102<=0]]] & 1<=p24] & [[~ [p168<=p149] | [[1<=p260 | p132<=p50] & p71<=p86]] | [[[p288<=0 & p221<=p194] & [1<=p0 | p275<=p185]] | ~ [1<=p130]]]]] | ~ [1<=p77]]]]]
normalized: ~ [E [true U ~ [[[[~ [1<=p77] | ~ [[[[~ [1<=p130] | [[1<=p0 | p275<=p185] & [p288<=0 & p221<=p194]]] | [[p71<=p86 & [1<=p260 | p132<=p50]] | ~ [p168<=p149]]] & [1<=p24 & [~ [[p9<=p111 & p102<=0]] & ~ [[p98<=0 & 1<=p100]]]]]]] | ~ [[[p21<=p279 & [[[~ [p21<=p81] & [1<=p270 & 1<=p205]] | [p159<=p53 & [p38<=1 & p117<=1]]] & ~ [[p68<=0 | ~ [1<=p40]]]]] & [[1<=p271 & ~ [[p117<=p271 & [p43<=0 | p277<=0]]]] & [[p236<=0 & ~ [[p124<=p156 | 1<=p110]]] & [p280<=p116 | [[1<=p117 | 1<=p170] | [p110<=0 & p58<=p171]]]]]]]] | [[p252<=p66 | ~ [p70<=p230]] & ~ [[p278<=0 | [[p186<=p118 | ~ [p37<=0]] & [[p1<=p268 & ~ [1<=p196]] & [[[p282<=1 | p105<=p158] | ~ [1<=p216]] | [~ [1<=p189] | ~ [p146<=1]]]]]]]]]]]]

abstracting: (p146<=1)
states: 7,868,223 (6)
abstracting: (1<=p189)
states: 1
abstracting: (1<=p216)
states: 1,058,841 (6)
abstracting: (p105<=p158)
states: 6,809,382 (6)
abstracting: (p282<=1)
states: 7,868,223 (6)
abstracting: (1<=p196)
states: 1
abstracting: (p1<=p268)
states: 7,790,098 (6)
abstracting: (p37<=0)
states: 7,790,098 (6)
abstracting: (p186<=p118)
states: 7,851,839 (6)
abstracting: (p278<=0)
states: 7,868,222 (6)
abstracting: (p70<=p230)
states: 6,809,382 (6)
abstracting: (p252<=p66)
states: 6,960,645 (6)
abstracting: (p58<=p171)
states: 7,868,222 (6)
abstracting: (p110<=0)
states: 7,790,098 (6)
abstracting: (1<=p170)
states: 1
abstracting: (1<=p117)
states: 1
abstracting: (p280<=p116)
states: 7,868,222 (6)
abstracting: (1<=p110)
states: 78,125 (4)
abstracting: (p124<=p156)
states: 7,868,222 (6)
abstracting: (p236<=0)
states: 7,868,222 (6)
abstracting: (p277<=0)
states: 7,868,222 (6)
abstracting: (p43<=0)
states: 7,851,839 (6)
abstracting: (p117<=p271)
states: 7,868,222 (6)
abstracting: (1<=p271)
states: 1
abstracting: (1<=p40)
states: 78,125 (4)
abstracting: (p68<=0)
states: 6,809,382 (6)
abstracting: (p117<=1)
states: 7,868,223 (6)
abstracting: (p38<=1)
states: 7,868,223 (6)
abstracting: (p159<=p53)
states: 7,868,222 (6)
abstracting: (1<=p205)
states: 1
abstracting: (1<=p270)
states: 1
abstracting: (p21<=p81)
states: 7,868,222 (6)
abstracting: (p21<=p279)
states: 7,868,222 (6)
abstracting: (1<=p100)
states: 1
abstracting: (p98<=0)
states: 7,868,222 (6)
abstracting: (p102<=0)
states: 6,714,721 (6)
abstracting: (p9<=p111)
states: 7,868,222 (6)
abstracting: (1<=p24)
states: 1
abstracting: (p168<=p149)
states: 7,868,222 (6)
abstracting: (p132<=p50)
states: 7,868,222 (6)
abstracting: (1<=p260)
states: 1
abstracting: (p71<=p86)
states: 6,809,382 (6)
abstracting: (p221<=p194)
states: 7,851,839 (6)
abstracting: (p288<=0)
states: 7,044,680 (6)
abstracting: (p275<=p185)
states: 7,868,222 (6)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p130)
states: 1
abstracting: (1<=p77)
states: 16,384 (4)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.917sec

totally nodes used: 9204867 (9.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17447908 106791875 124239783
used/not used/entry size/cache size: 54349371 12759493 16 1024MB
basic ops cache: hits/miss/sum: 4896126 31494434 36390560
used/not used/entry size/cache size: 15095903 1681313 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: 204127 1122008 1326135
used/not used/entry size/cache size: 1054837 7333771 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 60164939
1 5205790
2 1316476
3 337012
4 70522
5 12025
6 1859
7 210
8 27
9 4
>= 10 0

Total processing time: 1m20.831sec


BK_STOP 1679473499403

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

73448 75882 78037 80391 83569 85886 90699 93467
iterations count:893357 (125), effective:878 (0)

initing FirstDep: 0m 0.072sec


iterations count:68778 (9), effective:275 (0)

iterations count:72025 (10), effective:275 (0)

iterations count:68421 (9), effective:275 (0)

iterations count:68552 (9), effective:275 (0)

iterations count:68561 (9), effective:275 (0)

iterations count:7266 (1), effective:7 (0)

iterations count:12053 (1), effective:17 (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="StigmergyCommit-PT-07a"
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 StigmergyCommit-PT-07a, 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-167912650300478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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