fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r458-smll-167912650300462
Last Updated
May 14, 2023

About the Execution of Marcie+red for StigmergyCommit-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5705.495 44224.00 55737.00 1489.20 TFTTFFFTFFTFFTFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 9.5K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 11:04 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 1.8M 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-06a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679465083634

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-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:04:47] [INFO ] Load time of PNML (sax parser for PT used): 699 ms
[2023-03-22 06:04:47] [INFO ] Transformed 256 places.
[2023-03-22 06:04:47] [INFO ] Transformed 2816 transitions.
[2023-03-22 06:04:47] [INFO ] Found NUPN structural information;
[2023-03-22 06:04:47] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 914 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 14) seen :7
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :1
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 06:04:48] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2023-03-22 06:04:48] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-22 06:04:49] [INFO ] After 1183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 06:04:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2023-03-22 06:04:50] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-22 06:04:50] [INFO ] State equation strengthened by 351 read => feed constraints.
[2023-03-22 06:04:51] [INFO ] After 233ms SMT Verify possible using 351 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-22 06:04:51] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 12 ms to minimize.
[2023-03-22 06:04:51] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 1 ms to minimize.
[2023-03-22 06:04:51] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2023-03-22 06:04:51] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2023-03-22 06:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 799 ms
[2023-03-22 06:04:52] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
[2023-03-22 06:04:52] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-22 06:04:52] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-22 06:04:52] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-22 06:04:52] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-22 06:04:53] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 2 ms to minimize.
[2023-03-22 06:04:53] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-03-22 06:04:53] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2023-03-22 06:04:53] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-22 06:04:53] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2023-03-22 06:04:54] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2023-03-22 06:04:54] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-22 06:04:54] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-22 06:04:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2370 ms
[2023-03-22 06:04:54] [INFO ] After 3560ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-22 06:04:54] [INFO ] After 4531ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 13 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 587/587 transitions.
Graph (complete) has 549 edges and 256 vertex of which 250 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 250 transition count 519
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 72 rules applied. Total rules applied 135 place count 210 transition count 487
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 142 place count 203 transition count 487
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 142 place count 203 transition count 444
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 228 place count 160 transition count 444
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 261 place count 127 transition count 411
Iterating global reduction 3 with 33 rules applied. Total rules applied 294 place count 127 transition count 411
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 326 place count 95 transition count 379
Iterating global reduction 3 with 32 rules applied. Total rules applied 358 place count 95 transition count 379
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 396 place count 95 transition count 341
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 401 place count 90 transition count 336
Iterating global reduction 4 with 5 rules applied. Total rules applied 406 place count 90 transition count 336
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 410 place count 86 transition count 332
Iterating global reduction 4 with 4 rules applied. Total rules applied 414 place count 86 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 418 place count 86 transition count 328
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 440 place count 75 transition count 317
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 448 place count 75 transition count 309
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 452 place count 71 transition count 305
Iterating global reduction 6 with 4 rules applied. Total rules applied 456 place count 71 transition count 305
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 459 place count 68 transition count 302
Iterating global reduction 6 with 3 rules applied. Total rules applied 462 place count 68 transition count 302
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 465 place count 65 transition count 299
Iterating global reduction 6 with 3 rules applied. Total rules applied 468 place count 65 transition count 299
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 474 place count 65 transition count 293
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 477 place count 65 transition count 290
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 480 place count 62 transition count 290
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 484 place count 62 transition count 290
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 487 place count 62 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 488 place count 61 transition count 286
Reduce places removed 1 places and 0 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 7 with 9 rules applied. Total rules applied 497 place count 60 transition count 278
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 505 place count 52 transition count 278
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 505 place count 52 transition count 272
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 517 place count 46 transition count 272
Performed 11 Post agglomeration using F-continuation condition with reduction of 200 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 539 place count 35 transition count 61
Drop transitions removed 8 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 560 place count 35 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 565 place count 32 transition count 38
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 567 place count 32 transition count 36
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 569 place count 32 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 570 place count 32 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 571 place count 31 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 572 place count 31 transition count 33
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 573 place count 31 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 574 place count 30 transition count 31
Applied a total of 574 rules in 481 ms. Remains 30 /256 variables (removed 226) and now considering 31/587 (removed 556) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 30/256 places, 31/587 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8383 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_06a
(NrP: 256 NrTr: 2816 NrArc: 35321)

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

net check time: 0m 0.005sec

init dd package: 0m 3.323sec


RS generation: 0m 6.196sec


-> reachability set: #nodes 41067 (4.1e+04) #states 1,153,503 (6)



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

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

abstracting: (p129<=1)
states: 1,153,503 (6)
-> the formula is TRUE

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

MC time: 0m 0.022sec

checking: AG [p6<=p177]
normalized: ~ [E [true U ~ [p6<=p177]]]

abstracting: (p6<=p177)
states: 1,149,407 (6)
-> the formula is FALSE

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

MC time: 0m 7.566sec

checking: AG [p3<=p27]
normalized: ~ [E [true U ~ [p3<=p27]]]

abstracting: (p3<=p27)
states: 1,137,878 (6)
-> the formula is FALSE

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

MC time: 0m 1.964sec

checking: AG [p18<=p148]
normalized: ~ [E [true U ~ [p18<=p148]]]

abstracting: (p18<=p148)
states: 1,153,502 (6)
-> the formula is FALSE

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

MC time: 0m 0.878sec

checking: AG [[p22<=p16 | p31<=p135]]
normalized: ~ [E [true U ~ [[p22<=p16 | p31<=p135]]]]

abstracting: (p31<=p135)
states: 1,002,240 (6)
abstracting: (p22<=p16)
states: 1,153,502 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: AG [[p15<=0 & [[~ [[[p31<=p8 & [[[p253<=0 | p69<=0] & ~ [p202<=0]] | 1<=p175]] | [~ [1<=p241] & 1<=p185]]] | ~ [p183<=1]] | ~ [[1<=p93 & p165<=0]]]]]
normalized: ~ [E [true U ~ [[p15<=0 & [~ [[1<=p93 & p165<=0]] | [~ [p183<=1] | ~ [[[1<=p185 & ~ [1<=p241]] | [p31<=p8 & [1<=p175 | [~ [p202<=0] & [p253<=0 | p69<=0]]]]]]]]]]]]

abstracting: (p69<=0)
states: 1,002,240 (6)
abstracting: (p253<=0)
states: 1,035,854 (6)
abstracting: (p202<=0)
states: 1,153,502 (6)
abstracting: (1<=p175)
states: 151,263 (5)
abstracting: (p31<=p8)
states: 1,002,240 (6)
abstracting: (1<=p241)
states: 1
abstracting: (1<=p185)
states: 4,096 (3)
abstracting: (p183<=1)
states: 1,153,503 (6)
abstracting: (p165<=0)
states: 1,153,502 (6)
abstracting: (1<=p93)
states: 1
abstracting: (p15<=0)
states: 1,153,502 (6)
-> the formula is FALSE

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

MC time: 0m 0.391sec

checking: AG [~ [[1<=p253 & [[~ [[~ [p20<=1] | p77<=1]] & [p217<=p218 | [[p139<=0 | 1<=p201] & p98<=1]]] | ~ [[~ [p49<=p95] | [1<=p102 | p246<=p82]]]]]]]
normalized: ~ [E [true U [1<=p253 & [~ [[[1<=p102 | p246<=p82] | ~ [p49<=p95]]] | [[p217<=p218 | [p98<=1 & [p139<=0 | 1<=p201]]] & ~ [[p77<=1 | ~ [p20<=1]]]]]]]]

abstracting: (p20<=1)
states: 1,153,503 (6)
abstracting: (p77<=1)
states: 1,153,503 (6)
abstracting: (1<=p201)
states: 1
abstracting: (p139<=0)
states: 1,002,240 (6)
abstracting: (p98<=1)
states: 1,153,503 (6)
abstracting: (p217<=p218)
states: 1,137,878 (6)
abstracting: (p49<=p95)
states: 1,153,502 (6)
abstracting: (p246<=p82)
states: 1,016,004 (6)
abstracting: (1<=p102)
states: 171,114 (5)
abstracting: (1<=p253)
states: 117,649 (5)
-> the formula is TRUE

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

MC time: 0m 0.190sec

checking: EF [[1<=p209 | [1<=p223 & [[[~ [[[~ [p103<=1] & ~ [p208<=p226]] | [p0<=p81 & [p236<=p132 | p41<=p87]]]] & 1<=p27] & ~ [p183<=1]] | p222<=1]]]]
normalized: E [true U [1<=p209 | [1<=p223 & [p222<=1 | [~ [p183<=1] & [1<=p27 & ~ [[[p0<=p81 & [p236<=p132 | p41<=p87]] | [~ [p208<=p226] & ~ [p103<=1]]]]]]]]]]

abstracting: (p103<=1)
states: 1,153,503 (6)
abstracting: (p208<=p226)
states: 1,153,502 (6)
abstracting: (p41<=p87)
states: 1,149,407 (6)
abstracting: (p236<=p132)
states: 1,153,502 (6)
abstracting: (p0<=p81)
states: 1,153,502 (6)
abstracting: (1<=p27)
states: 1
abstracting: (p183<=1)
states: 1,153,503 (6)
abstracting: (p222<=1)
states: 1,153,503 (6)
abstracting: (1<=p223)
states: 4,096 (3)
abstracting: (1<=p209)
states: 1
-> the formula is TRUE

FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.403sec

checking: AG [[p85<=p64 | [[p196<=p113 | [[1<=p48 | p35<=0] & ~ [[~ [p12<=0] | p32<=p233]]]] | [~ [[p243<=0 | [[[[1<=p9 & 1<=p160] & p57<=p244] & ~ [[p90<=p134 | p250<=p53]]] | ~ [[~ [p32<=1] | [1<=p106 & 1<=p237]]]]]] | ~ [[1<=p87 | p49<=0]]]]]]
normalized: ~ [E [true U ~ [[p85<=p64 | [[~ [[1<=p87 | p49<=0]] | ~ [[p243<=0 | [~ [[[1<=p106 & 1<=p237] | ~ [p32<=1]]] | [~ [[p90<=p134 | p250<=p53]] & [p57<=p244 & [1<=p9 & 1<=p160]]]]]]] | [p196<=p113 | [~ [[p32<=p233 | ~ [p12<=0]]] & [1<=p48 | p35<=0]]]]]]]]

abstracting: (p35<=0)
states: 1,002,240 (6)
abstracting: (1<=p48)
states: 1
abstracting: (p12<=0)
states: 1,153,502 (6)
abstracting: (p32<=p233)
states: 1,002,240 (6)
abstracting: (p196<=p113)
states: 1,153,502 (6)
abstracting: (1<=p160)
states: 1
abstracting: (1<=p9)
states: 1
abstracting: (p57<=p244)
states: 1,153,502 (6)
abstracting: (p250<=p53)
states: 1,035,854 (6)
abstracting: (p90<=p134)
states: 1,153,502 (6)
abstracting: (p32<=1)
states: 1,153,503 (6)
abstracting: (1<=p237)
states: 1
abstracting: (1<=p106)
states: 151,263 (5)
abstracting: (p243<=0)
states: 1,153,502 (6)
abstracting: (p49<=0)
states: 1,153,502 (6)
abstracting: (1<=p87)
states: 1
abstracting: (p85<=p64)
states: 1,153,502 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.411sec

checking: EF [[1<=p173 & [[[~ [1<=p60] & [[~ [1<=p125] & [p109<=p110 & [~ [p121<=1] & [p58<=0 & p129<=0]]]] | 1<=p185]] & [[[[p24<=p133 & ~ [[p100<=p124 | 1<=p216]]] | ~ [p174<=p7]] & [~ [p65<=0] & [~ [p84<=p107] | [~ [p201<=p199] & [1<=p205 & p148<=p73]]]]] & p8<=0]] | ~ [p88<=1]]]]
normalized: E [true U [1<=p173 & [~ [p88<=1] | [[p8<=0 & [[[[[1<=p205 & p148<=p73] & ~ [p201<=p199]] | ~ [p84<=p107]] & ~ [p65<=0]] & [~ [p174<=p7] | [p24<=p133 & ~ [[p100<=p124 | 1<=p216]]]]]] & [[1<=p185 | [[p109<=p110 & [[p58<=0 & p129<=0] & ~ [p121<=1]]] & ~ [1<=p125]]] & ~ [1<=p60]]]]]]

abstracting: (1<=p60)
states: 1
abstracting: (1<=p125)
states: 1
abstracting: (p121<=1)
states: 1,153,503 (6)
abstracting: (p129<=0)
states: 1,153,502 (6)
abstracting: (p58<=0)
states: 1,153,502 (6)
abstracting: (p109<=p110)
states: 1,137,878 (6)
abstracting: (1<=p185)
states: 4,096 (3)
abstracting: (1<=p216)
states: 151,263 (5)
abstracting: (p100<=p124)
states: 1,153,502 (6)
abstracting: (p24<=p133)
states: 1,153,502 (6)
abstracting: (p174<=p7)
states: 983,413 (5)
abstracting: (p65<=0)
states: 1,153,502 (6)
abstracting: (p84<=p107)
states: 1,153,502 (6)
abstracting: (p201<=p199)
states: 1,153,502 (6)
abstracting: (p148<=p73)
states: 1,141,003 (6)
abstracting: (1<=p205)
states: 1
abstracting: (p8<=0)
states: 1,153,502 (6)
abstracting: (p88<=1)
states: 1,153,503 (6)
abstracting: (1<=p173)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.372sec

checking: AG [[[p165<=1 & [~ [[~ [1<=p166] | [~ [[1<=p35 | 1<=p19]] | 1<=p125]]] | [1<=p157 | p231<=1]]] & [1<=p252 | [~ [[~ [[[[p92<=p208 & 1<=p140] & [p231<=p4 & 1<=p18]] & [~ [p65<=p222] & ~ [p78<=p213]]]] | ~ [[[p129<=p196 & 1<=p106] & p4<=p2]]]] | [1<=p87 | p40<=p239]]]]]
normalized: ~ [E [true U ~ [[[1<=p252 | [[1<=p87 | p40<=p239] | ~ [[~ [[p4<=p2 & [p129<=p196 & 1<=p106]]] | ~ [[[~ [p78<=p213] & ~ [p65<=p222]] & [[p231<=p4 & 1<=p18] & [p92<=p208 & 1<=p140]]]]]]]] & [p165<=1 & [[1<=p157 | p231<=1] | ~ [[[1<=p125 | ~ [[1<=p35 | 1<=p19]]] | ~ [1<=p166]]]]]]]]]

abstracting: (1<=p166)
states: 1
abstracting: (1<=p19)
states: 1
abstracting: (1<=p35)
states: 151,263 (5)
abstracting: (1<=p125)
states: 1
abstracting: (p231<=1)
states: 1,153,503 (6)
abstracting: (1<=p157)
states: 1
abstracting: (p165<=1)
states: 1,153,503 (6)
abstracting: (1<=p140)
states: 151,263 (5)
abstracting: (p92<=p208)
states: 1,153,502 (6)
abstracting: (1<=p18)
states: 1
abstracting: (p231<=p4)
states: 1,153,502 (6)
abstracting: (p65<=p222)
states: 1,153,502 (6)
abstracting: (p78<=p213)
states: 1,149,407 (6)
abstracting: (1<=p106)
states: 151,263 (5)
abstracting: (p129<=p196)
states: 1,153,502 (6)
abstracting: (p4<=p2)
states: 1,137,878 (6)
abstracting: (p40<=p239)
states: 1,137,878 (6)
abstracting: (1<=p87)
states: 1
abstracting: (1<=p252)
states: 117,649 (5)
-> the formula is FALSE

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

MC time: 0m 0.626sec

checking: AG [[[[~ [1<=p136] & ~ [[p14<=0 | [[1<=p106 & ~ [[p173<=1 | 1<=p115]]] | [[~ [1<=p104] | ~ [p198<=p215]] & [[p210<=0 & p189<=p35] | 1<=p45]]]]]] & [p48<=p230 | ~ [[1<=p185 | 1<=p175]]]] | ~ [[[1<=p183 & [[~ [p171<=1] & [[~ [p157<=0] & ~ [p161<=p59]] & [1<=p56 & [p138<=p143 & p200<=1]]]] | [[~ [p40<=1] | [[1<=p131 & p222<=p239] & p48<=p169]] & 1<=p73]]] | 1<=p196]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p196 | [1<=p183 & [[1<=p73 & [~ [p40<=1] | [p48<=p169 & [1<=p131 & p222<=p239]]]] | [[[~ [p161<=p59] & ~ [p157<=0]] & [1<=p56 & [p138<=p143 & p200<=1]]] & ~ [p171<=1]]]]]] | [[~ [1<=p136] & ~ [[p14<=0 | [[1<=p106 & ~ [[p173<=1 | 1<=p115]]] | [[~ [p198<=p215] | ~ [1<=p104]] & [1<=p45 | [p210<=0 & p189<=p35]]]]]]] & [p48<=p230 | ~ [[1<=p185 | 1<=p175]]]]]]]]

abstracting: (1<=p175)
states: 151,263 (5)
abstracting: (1<=p185)
states: 4,096 (3)
abstracting: (p48<=p230)
states: 1,153,502 (6)
abstracting: (p189<=p35)
states: 1,153,502 (6)
abstracting: (p210<=0)
states: 982,389 (5)
abstracting: (1<=p45)
states: 1
abstracting: (1<=p104)
states: 151,263 (5)
abstracting: (p198<=p215)
states: 1,153,502 (6)
abstracting: (1<=p115)
states: 4,096 (3)
abstracting: (p173<=1)
states: 1,153,503 (6)
abstracting: (1<=p106)
states: 151,263 (5)
abstracting: (p14<=0)
states: 1,153,502 (6)
abstracting: (1<=p136)
states: 1
abstracting: (p171<=1)
states: 1,153,503 (6)
abstracting: (p200<=1)
states: 1,153,503 (6)
abstracting: (p138<=p143)
states: 982,389 (5)
abstracting: (1<=p56)
states: 1
abstracting: (p157<=0)
states: 1,153,502 (6)
abstracting: (p161<=p59)
states: 1,153,502 (6)
abstracting: (p222<=p239)
states: 1,149,407 (6)
abstracting: (1<=p131)
states: 1
abstracting: (p48<=p169)
states: 1,153,502 (6)
abstracting: (p40<=1)
states: 1,153,503 (6)
abstracting: (1<=p73)
states: 15,625 (4)
abstracting: (1<=p183)
states: 15,625 (4)
abstracting: (1<=p196)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.612sec

checking: AG [[[p147<=1 & [[[1<=p18 | [[[p170<=p65 | [p50<=p201 & p217<=p164]] | [~ [p125<=p148] | [1<=p218 & p211<=1]]] & p189<=p169]] | ~ [p199<=p129]] | [p96<=p125 & [p79<=p237 & [~ [[[1<=p243 & p192<=0] | p126<=0]] & [p128<=0 | ~ [[p255<=p175 | 1<=p193]]]]]]]] & [[p163<=p189 | ~ [[[p23<=1 | ~ [p234<=p109]] | 1<=p99]]] | ~ [p251<=1]]]]
normalized: ~ [E [true U ~ [[[~ [p251<=1] | [p163<=p189 | ~ [[1<=p99 | [p23<=1 | ~ [p234<=p109]]]]]] & [p147<=1 & [[p96<=p125 & [p79<=p237 & [[p128<=0 | ~ [[p255<=p175 | 1<=p193]]] & ~ [[p126<=0 | [1<=p243 & p192<=0]]]]]] | [~ [p199<=p129] | [1<=p18 | [p189<=p169 & [[[1<=p218 & p211<=1] | ~ [p125<=p148]] | [p170<=p65 | [p50<=p201 & p217<=p164]]]]]]]]]]]]

abstracting: (p217<=p164)
states: 1,137,878 (6)
abstracting: (p50<=p201)
states: 1,153,502 (6)
abstracting: (p170<=p65)
states: 1,153,502 (6)
abstracting: (p125<=p148)
states: 1,153,502 (6)
abstracting: (p211<=1)
states: 1,153,503 (6)
abstracting: (1<=p218)
states: 15,625 (4)
abstracting: (p189<=p169)
states: 1,153,502 (6)
abstracting: (1<=p18)
states: 1
abstracting: (p199<=p129)
states: 1,153,502 (6)
abstracting: (p192<=0)
states: 1,153,502 (6)
abstracting: (1<=p243)
states: 1
abstracting: (p126<=0)
states: 1,153,502 (6)
abstracting: (1<=p193)
states: 1
abstracting: (p255<=p175)
states: 151,264 (5)
abstracting: (p128<=0)
states: 1,153,502 (6)
abstracting: (p79<=p237)
states: 1,149,407 (6)
abstracting: (p96<=p125)
states: 1,153,502 (6)
abstracting: (p147<=1)
states: 1,153,503 (6)
abstracting: (p234<=p109)
states: 1,153,502 (6)
abstracting: (p23<=1)
states: 1,153,503 (6)
abstracting: (1<=p99)
states: 1
abstracting: (p163<=p189)
states: 1,153,502 (6)
abstracting: (p251<=1)
states: 1,153,503 (6)
-> the formula is FALSE

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

MC time: 0m 0.663sec

checking: EF [[[[~ [[[[[1<=p194 & p147<=0] | [p100<=p123 | p161<=p210]] & p151<=p12] & p131<=1]] | [[[[[1<=p180 | ~ [p14<=p137]] & [p91<=p131 | [p221<=p45 | p116<=p166]]] & [[p101<=0 & [p128<=0 | 1<=p211]] & [[1<=p47 & 1<=p63] & ~ [p251<=0]]]] | [~ [[~ [p12<=p224] | ~ [p80<=p156]]] & [[1<=p141 | ~ [p153<=0]] | ~ [1<=p42]]]] | p221<=p250]] | ~ [1<=p228]] & 1<=p100]]
normalized: E [true U [1<=p100 & [~ [1<=p228] | [[p221<=p250 | [[[~ [1<=p42] | [1<=p141 | ~ [p153<=0]]] & ~ [[~ [p80<=p156] | ~ [p12<=p224]]]] | [[[~ [p251<=0] & [1<=p47 & 1<=p63]] & [p101<=0 & [p128<=0 | 1<=p211]]] & [[p91<=p131 | [p221<=p45 | p116<=p166]] & [1<=p180 | ~ [p14<=p137]]]]]] | ~ [[p131<=1 & [p151<=p12 & [[p100<=p123 | p161<=p210] | [1<=p194 & p147<=0]]]]]]]]]

abstracting: (p147<=0)
states: 1,137,878 (6)
abstracting: (1<=p194)
states: 1
abstracting: (p161<=p210)
states: 1,153,503 (6)
abstracting: (p100<=p123)
states: 1,153,502 (6)
abstracting: (p151<=p12)
states: 1,149,407 (6)
abstracting: (p131<=1)
states: 1,153,503 (6)
abstracting: (p14<=p137)
states: 1,153,502 (6)
abstracting: (1<=p180)
states: 151,263 (5)
abstracting: (p116<=p166)
states: 1,153,502 (6)
abstracting: (p221<=p45)
states: 1,149,407 (6)
abstracting: (p91<=p131)
states: 1,153,502 (6)
abstracting: (1<=p211)
states: 151,263 (5)
abstracting: (p128<=0)
states: 1,153,502 (6)
abstracting: (p101<=0)
states: 1,153,502 (6)
abstracting: (1<=p63)
states: 1
abstracting: (1<=p47)
states: 1
abstracting: (p251<=0)
states: 1,035,854 (6)
abstracting: (p12<=p224)
states: 1,153,502 (6)
abstracting: (p80<=p156)
states: 1,153,502 (6)
abstracting: (p153<=0)
states: 1,153,502 (6)
abstracting: (1<=p141)
states: 151,263 (5)
abstracting: (1<=p42)
states: 4,096 (3)
abstracting: (p221<=p250)
states: 1,149,407 (6)
abstracting: (1<=p228)
states: 1
abstracting: (1<=p100)
states: 1
-> the formula is TRUE

FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.729sec

checking: AG [~ [[[[[1<=p194 | [~ [1<=p136] & [[1<=p112 | p70<=0] & [1<=p146 | p107<=p202]]]] | [[[~ [1<=p186] & 1<=p151] | [~ [p123<=1] | [p47<=p3 | 1<=p41]]] | [[[1<=p191 | p216<=1] | [p22<=p58 | 1<=p242]] | [p27<=1 | [p113<=p60 | p241<=p30]]]]] | [[[~ [p2<=p147] & [[p133<=p185 & p101<=p238] & ~ [p186<=p121]]] | ~ [[1<=p199 | p122<=0]]] | [[[[p30<=p195 | 1<=p40] & [1<=p127 & p222<=1]] & [[1<=p167 | 1<=p124] | [p254<=p80 | p115<=1]]] & 1<=p143]]] & [~ [p233<=p152] | ~ [p168<=p220]]]]]
normalized: ~ [E [true U [[~ [p168<=p220] | ~ [p233<=p152]] & [[[1<=p143 & [[[p254<=p80 | p115<=1] | [1<=p167 | 1<=p124]] & [[1<=p127 & p222<=1] & [p30<=p195 | 1<=p40]]]] | [~ [[1<=p199 | p122<=0]] | [[~ [p186<=p121] & [p133<=p185 & p101<=p238]] & ~ [p2<=p147]]]] | [[[[p27<=1 | [p113<=p60 | p241<=p30]] | [[p22<=p58 | 1<=p242] | [1<=p191 | p216<=1]]] | [[[p47<=p3 | 1<=p41] | ~ [p123<=1]] | [1<=p151 & ~ [1<=p186]]]] | [1<=p194 | [[[1<=p146 | p107<=p202] & [1<=p112 | p70<=0]] & ~ [1<=p136]]]]]]]]

abstracting: (1<=p136)
states: 1
abstracting: (p70<=0)
states: 1,002,240 (6)
abstracting: (1<=p112)
states: 15,625 (4)
abstracting: (p107<=p202)
states: 1,002,240 (6)
abstracting: (1<=p146)
states: 15,625 (4)
abstracting: (1<=p194)
states: 1
abstracting: (1<=p186)
states: 4,096 (3)
abstracting: (1<=p151)
states: 4,096 (3)
abstracting: (p123<=1)
states: 1,153,503 (6)
abstracting: (1<=p41)
states: 4,096 (3)
abstracting: (p47<=p3)
states: 1,153,502 (6)
abstracting: (p216<=1)
states: 1,153,503 (6)
abstracting: (1<=p191)
states: 1
abstracting: (1<=p242)
states: 1
abstracting: (p22<=p58)
states: 1,153,502 (6)
abstracting: (p241<=p30)
states: 1,153,503 (6)
abstracting: (p113<=p60)
states: 1,149,407 (6)
abstracting: (p27<=1)
states: 1,153,503 (6)
abstracting: (p2<=p147)
states: 1,141,003 (6)
abstracting: (p101<=p238)
states: 1,153,502 (6)
abstracting: (p133<=p185)
states: 1,153,502 (6)
abstracting: (p186<=p121)
states: 1,149,407 (6)
abstracting: (p122<=0)
states: 1,153,502 (6)
abstracting: (1<=p199)
states: 1
abstracting: (1<=p40)
states: 15,625 (4)
abstracting: (p30<=p195)
states: 982,390 (5)
abstracting: (p222<=1)
states: 1,153,503 (6)
abstracting: (1<=p127)
states: 1
abstracting: (1<=p124)
states: 1
abstracting: (1<=p167)
states: 1
abstracting: (p115<=1)
states: 1,153,503 (6)
abstracting: (p254<=p80)
states: 1,035,854 (6)
abstracting: (1<=p143)
states: 151,263 (5)
abstracting: (p233<=p152)
states: 1,153,502 (6)
abstracting: (p168<=p220)
states: 1,153,502 (6)
-> the formula is FALSE

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

MC time: 0m 0.806sec

checking: AG [[[[p29<=p187 | ~ [[p66<=p117 | ~ [p82<=0]]]] & [~ [p88<=1] | p125<=p99]] | [[[[[~ [p44<=0] & 1<=p151] | [~ [[p10<=0 | p235<=1]] & [p135<=0 & p185<=0]]] & [~ [p111<=0] & [[[~ [p232<=p241] & [1<=p236 | p40<=p57]] & [~ [1<=p246] | 1<=p85]] & 1<=p17]]] | [[[p198<=1 | ~ [[[1<=p53 & p207<=0] & p197<=p70]]] | [[1<=p202 | [[p168<=p242 & p247<=p156] | [p33<=p139 | p216<=p80]]] & [1<=p117 | [[p242<=1 & p69<=1] & p228<=0]]]] | [[~ [[[p43<=1 | p195<=1] & [p166<=1 & p175<=1]]] & ~ [[p229<=0 | 1<=p246]]] | [~ [[[p114<=0 & p173<=0] | [p117<=p242 & p252<=p169]]] | p201<=1]]]] | p135<=1]]]
normalized: ~ [E [true U ~ [[[p135<=1 | [[[[p201<=1 | ~ [[[p117<=p242 & p252<=p169] | [p114<=0 & p173<=0]]]] | [~ [[p229<=0 | 1<=p246]] & ~ [[[p166<=1 & p175<=1] & [p43<=1 | p195<=1]]]]] | [[[1<=p117 | [p228<=0 & [p242<=1 & p69<=1]]] & [1<=p202 | [[p33<=p139 | p216<=p80] | [p168<=p242 & p247<=p156]]]] | [p198<=1 | ~ [[p197<=p70 & [1<=p53 & p207<=0]]]]]] | [[[1<=p17 & [[1<=p85 | ~ [1<=p246]] & [[1<=p236 | p40<=p57] & ~ [p232<=p241]]]] & ~ [p111<=0]] & [[[p135<=0 & p185<=0] & ~ [[p10<=0 | p235<=1]]] | [1<=p151 & ~ [p44<=0]]]]]] | [[p125<=p99 | ~ [p88<=1]] & [p29<=p187 | ~ [[p66<=p117 | ~ [p82<=0]]]]]]]]]

abstracting: (p82<=0)
states: 1,153,502 (6)
abstracting: (p66<=p117)
states: 982,390 (5)
abstracting: (p29<=p187)
states: 1,153,502 (6)
abstracting: (p88<=1)
states: 1,153,503 (6)
abstracting: (p125<=p99)
states: 1,153,502 (6)
abstracting: (p44<=0)
states: 1,153,502 (6)
abstracting: (1<=p151)
states: 4,096 (3)
abstracting: (p235<=1)
states: 1,153,503 (6)
abstracting: (p10<=0)
states: 1,153,502 (6)
abstracting: (p185<=0)
states: 1,149,407 (6)
abstracting: (p135<=0)
states: 1,153,502 (6)
abstracting: (p111<=0)
states: 1,137,878 (6)
abstracting: (p232<=p241)
states: 1,153,502 (6)
abstracting: (p40<=p57)
states: 1,137,878 (6)
abstracting: (1<=p236)
states: 1
abstracting: (1<=p246)
states: 137,500 (5)
abstracting: (1<=p85)
states: 1
abstracting: (1<=p17)
states: 1
abstracting: (p207<=0)
states: 1,153,502 (6)
abstracting: (1<=p53)
states: 1
abstracting: (p197<=p70)
states: 1,153,502 (6)
abstracting: (p198<=1)
states: 1,153,503 (6)
abstracting: (p247<=p156)
states: 1,035,854 (6)
abstracting: (p168<=p242)
states: 1,153,502 (6)
abstracting: (p216<=p80)
states: 1,002,240 (6)
abstracting: (p33<=p139)
states: 1,023,849 (6)
abstracting: (1<=p202)
states: 1
abstracting: (p69<=1)
states: 1,153,503 (6)
abstracting: (p242<=1)
states: 1,153,503 (6)
abstracting: (p228<=0)
states: 1,153,502 (6)
abstracting: (1<=p117)
states: 1
abstracting: (p195<=1)
states: 1,153,503 (6)
abstracting: (p43<=1)
states: 1,153,503 (6)
abstracting: (p175<=1)
states: 1,153,503 (6)
abstracting: (p166<=1)
states: 1,153,503 (6)
abstracting: (1<=p246)
states: 137,500 (5)
abstracting: (p229<=0)
states: 1,153,502 (6)
abstracting: (p173<=0)
states: 1,153,502 (6)
abstracting: (p114<=0)
states: 1,149,407 (6)
abstracting: (p252<=p169)
states: 1,035,854 (6)
abstracting: (p117<=p242)
states: 1,153,502 (6)
abstracting: (p201<=1)
states: 1,153,503 (6)
abstracting: (p135<=1)
states: 1,153,503 (6)
-> the formula is TRUE

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

MC time: 0m 0.842sec

totally nodes used: 3843692 (3.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7481671 40758170 48239841
used/not used/entry size/cache size: 31916472 35192392 16 1024MB
basic ops cache: hits/miss/sum: 2104064 11638849 13742913
used/not used/entry size/cache size: 9695366 7081850 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: 60217 337858 398075
used/not used/entry size/cache size: 331843 8056765 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 64129342
1 2303859
2 520296
3 127404
4 23647
5 3607
6 579
7 110
8 18
9 2
>= 10 0

Total processing time: 0m29.582sec


BK_STOP 1679465127858

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

31390 33944 38028
iterations count:360004 (127), effective:870 (0)

initing FirstDep: 0m 0.022sec


iterations count:37719 (13), effective:241 (0)

iterations count:35802 (12), effective:241 (0)

iterations count:35986 (12), effective:241 (0)

iterations count:35794 (12), effective:241 (0)

iterations count:33860 (12), effective:240 (0)

iterations count:35590 (12), effective:241 (0)

iterations count:35801 (12), effective:241 (0)

iterations count:35697 (12), effective:240 (0)

iterations count:35714 (12), effective:241 (0)

iterations count:35892 (12), effective:240 (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-06a"
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-06a, 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-167912650300462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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