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

About the Execution of Marcie+red for StigmergyElection-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.151 18573.00 23508.00 2428.30 TFFFTTFTFFFTFFTF 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-167912650500586.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is StigmergyElection-PT-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500586
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679551300411

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 06:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:01:45] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-23 06:01:45] [INFO ] Transformed 58 places.
[2023-03-23 06:01:45] [INFO ] Transformed 218 transitions.
[2023-03-23 06:01:45] [INFO ] Found NUPN structural information;
[2023-03-23 06:01:45] [INFO ] Parsed PT model containing 58 places and 218 transitions and 1238 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyElection-PT-04a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 108/108 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 105
Applied a total of 6 rules in 34 ms. Remains 55 /58 variables (removed 3) and now considering 105/108 (removed 3) transitions.
[2023-03-23 06:01:45] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
// Phase 1: matrix 96 rows 55 cols
[2023-03-23 06:01:45] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 06:01:45] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-23 06:01:45] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
[2023-03-23 06:01:45] [INFO ] Invariant cache hit.
[2023-03-23 06:01:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-23 06:01:46] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-23 06:01:46] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
[2023-03-23 06:01:46] [INFO ] Invariant cache hit.
[2023-03-23 06:01:46] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/58 places, 105/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 55/58 places, 105/108 transitions.
Support contains 30 out of 55 places after structural reductions.
[2023-03-23 06:01:46] [INFO ] Flatten gal took : 59 ms
[2023-03-23 06:01:46] [INFO ] Flatten gal took : 28 ms
[2023-03-23 06:01:46] [INFO ] Input system was already deterministic with 105 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 755 ms. (steps per millisecond=13 ) properties (out of 40) seen :36
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 06:01:47] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
[2023-03-23 06:01:47] [INFO ] Invariant cache hit.
[2023-03-23 06:01:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 06:01:47] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-23 06:01:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 06:01:47] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2023-03-23 06:01:47] [INFO ] Flatten gal took : 15 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 16 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 27 out of 55 places (down from 28) after GAL structural reductions.
Computed a total of 10 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 47 transition count 89
Applied a total of 16 rules in 11 ms. Remains 47 /55 variables (removed 8) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 47/55 places, 89/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 47 transition count 89
Applied a total of 16 rules in 10 ms. Remains 47 /55 variables (removed 8) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 47/55 places, 89/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 10 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 52 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 52 transition count 99
Applied a total of 6 rules in 9 ms. Remains 52 /55 variables (removed 3) and now considering 99/105 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 52/55 places, 99/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 10 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 51 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 51 transition count 97
Applied a total of 8 rules in 8 ms. Remains 51 /55 variables (removed 4) and now considering 97/105 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 51/55 places, 97/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 10 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 48 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 48 transition count 91
Applied a total of 14 rules in 9 ms. Remains 48 /55 variables (removed 7) and now considering 91/105 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 48/55 places, 91/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 51 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 51 transition count 97
Applied a total of 8 rules in 7 ms. Remains 51 /55 variables (removed 4) and now considering 97/105 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/55 places, 97/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 52 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 52 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 50 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 50 transition count 95
Applied a total of 10 rules in 8 ms. Remains 50 /55 variables (removed 5) and now considering 95/105 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 50/55 places, 95/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 10 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 52 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 52 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 50 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 50 transition count 95
Applied a total of 10 rules in 7 ms. Remains 50 /55 variables (removed 5) and now considering 95/105 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 50/55 places, 95/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 10 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 47 transition count 89
Applied a total of 16 rules in 7 ms. Remains 47 /55 variables (removed 8) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 47/55 places, 89/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 47 transition count 89
Applied a total of 16 rules in 7 ms. Remains 47 /55 variables (removed 8) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 47/55 places, 89/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 47 transition count 89
Applied a total of 16 rules in 7 ms. Remains 47 /55 variables (removed 8) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 47/55 places, 89/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 47 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 47 transition count 89
Applied a total of 16 rules in 7 ms. Remains 47 /55 variables (removed 8) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 47/55 places, 89/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 48 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 48 transition count 91
Applied a total of 14 rules in 7 ms. Remains 48 /55 variables (removed 7) and now considering 91/105 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 48/55 places, 91/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 7 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 52 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 52 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 49 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 49 transition count 93
Applied a total of 12 rules in 5 ms. Remains 49 /55 variables (removed 6) and now considering 93/105 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/55 places, 93/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 52 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 52 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 50 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 50 transition count 95
Applied a total of 10 rules in 4 ms. Remains 50 /55 variables (removed 5) and now considering 95/105 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/55 places, 95/105 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 7 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Input system was already deterministic with 95 transitions.
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 9 ms
[2023-03-23 06:01:48] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:01:48] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-23 06:01:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 105 transitions and 456 arcs took 2 ms.
Total runtime 3862 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 55 NrTr: 105 NrArc: 456)

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

net check time: 0m 0.000sec

init dd package: 0m 3.690sec


RS generation: 0m 0.038sec


-> reachability set: #nodes 1374 (1.4e+03) #states 977



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

checking: AX [AG [[p24<=1 & 1<=p24]]]
normalized: ~ [EX [E [true U ~ [[p24<=1 & 1<=p24]]]]]

abstracting: (1<=p24)
states: 1
abstracting: (p24<=1)
states: 977
.-> the formula is FALSE

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

MC time: 0m 0.043sec

checking: EX [AG [[p42<=1 & 1<=p42]]]
normalized: EX [~ [E [true U ~ [[p42<=1 & 1<=p42]]]]]

abstracting: (1<=p42)
states: 125
abstracting: (p42<=1)
states: 977
.-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]
normalized: EX [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]

abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AX [AF [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]]]
normalized: EG [~ [EX [EG [~ [[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]]]]]]

abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
.
EG iterations: 1
..........
EG iterations: 9
-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EF [[[AX [[[p41<=1 & 1<=p41] | [p1<=0 & 0<=p1]]] & [p12<=1 & 1<=p12]] & [[p25<=1 & 1<=p25] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]
normalized: E [true U [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [p25<=1 & 1<=p25]] & [[p12<=1 & 1<=p12] & ~ [EX [~ [[[p1<=0 & 0<=p1] | [p41<=1 & 1<=p41]]]]]]]]

abstracting: (1<=p41)
states: 125
abstracting: (p41<=1)
states: 977
abstracting: (0<=p1)
states: 977
abstracting: (p1<=0)
states: 852
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
-> the formula is TRUE

FORMULA StigmergyElection-PT-04a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: E [EG [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] U EX [AF [[~ [EG [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]] & ~ [[p46<=1 & 1<=p46]]]]]]
normalized: E [EG [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] U EX [~ [EG [~ [[~ [[p46<=1 & 1<=p46]] & ~ [EG [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]]]]

abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.
EG iterations: 1
abstracting: (1<=p46)
states: 64
abstracting: (p46<=1)
states: 977
.
EG iterations: 1
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-04a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AF [[AX [~ [A [[p43<=1 & 1<=p43] U [p5<=1 & 1<=p5]]]] | [EX [[[[p14<=1 & 1<=p14] | [p12<=0 & 0<=p12]] | [[p25<=0 & 0<=p25] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]] | [[p6<=0 & 0<=p6] & AG [AX [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]]]]]]
normalized: ~ [EG [~ [[[[~ [E [true U EX [~ [[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]]]]] & [p6<=0 & 0<=p6]] | EX [[[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [p25<=0 & 0<=p25]] | [[p12<=0 & 0<=p12] | [p14<=1 & 1<=p14]]]]] | ~ [EX [[~ [EG [~ [[p5<=1 & 1<=p5]]]] & ~ [E [~ [[p5<=1 & 1<=p5]] U [~ [[p43<=1 & 1<=p43]] & ~ [[p5<=1 & 1<=p5]]]]]]]]]]]]

abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 977
abstracting: (1<=p43)
states: 125
abstracting: (p43<=1)
states: 977
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 977
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 977
.
EG iterations: 1
.abstracting: (1<=p14)
states: 27
abstracting: (p14<=1)
states: 977
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
.abstracting: (0<=p6)
states: 977
abstracting: (p6<=0)
states: 913
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
..
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-04a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: EX [[A [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] U [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] & AX [AG [[[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] | [[p44<=1 & 1<=p44] & [p54<=1 & 1<=p54]]]]]]]
normalized: EX [[~ [EX [E [true U ~ [[[[p54<=1 & 1<=p54] & [p44<=1 & 1<=p44]] | [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]] & [~ [EG [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]] & ~ [E [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] U [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] & ~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]]]

abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
..........
EG iterations: 10
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p44)
states: 125
abstracting: (p44<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
..-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EG [[AX [AX [AX [[[[p25<=1 & 1<=p25] & [1<=p12 & p12<=1]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]] | AF [[[[[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] | AX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]] & [p12<=1 & 1<=p12]] & [[p25<=1 & 1<=p25] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]]
normalized: EG [[~ [EG [~ [[[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [p25<=1 & 1<=p25]] & [[p12<=1 & 1<=p12] & [~ [EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]] | [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]] | ~ [EX [EX [EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[1<=p12 & p12<=1] & [p25<=1 & 1<=p25]]]]]]]]]]

abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (p12<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
...abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
..........
EG iterations: 10
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-04a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AF [EG [[[EG [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]] | [AX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] | EX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]] | [[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]]]
normalized: ~ [EG [~ [EG [[[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]] | [[EX [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] | ~ [EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]] | EG [[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]]]]]]]]

abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
..........
EG iterations: 10
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-04a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AX [[[AF [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] | [p12<=0 & 0<=p12]] | [[p25<=0 & 0<=p25] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]] | [AG [EX [[p19<=0 & 0<=p19]]] & EX [[[p2<=1 & 1<=p2] & [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]] & [[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]]]]]
normalized: [[EX [[[[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]] & [[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]] & [p2<=1 & 1<=p2]]] & ~ [E [true U ~ [EX [[p19<=0 & 0<=p19]]]]]] | ~ [EX [~ [[[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [p25<=0 & 0<=p25]] | [[p12<=0 & 0<=p12] | ~ [EG [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]]]]]

abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
..........
EG iterations: 10
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
.abstracting: (0<=p19)
states: 977
abstracting: (p19<=0)
states: 913
.abstracting: (1<=p2)
states: 125
abstracting: (p2<=1)
states: 977
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
.-> the formula is TRUE

FORMULA StigmergyElection-PT-04a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EX [[[[p45<=1 & 1<=p45] | [EX [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]] | AX [EF [[p50<=0 & 0<=p50]]]]] & [[EG [[[p20<=0 & 0<=p20] & [[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]] | EG [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]]] & [EF [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] | [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]]
normalized: EX [[[[[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] | E [true U [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]] & [EG [[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]] | EG [[[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]] & [p20<=0 & 0<=p20]]]]] & [[~ [EX [~ [E [true U [p50<=0 & 0<=p50]]]]] | EX [[[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]]] | [p45<=1 & 1<=p45]]]]

abstracting: (1<=p45)
states: 64
abstracting: (p45<=1)
states: 977
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
.abstracting: (0<=p50)
states: 977
abstracting: (p50<=0)
states: 976
.abstracting: (0<=p20)
states: 977
abstracting: (p20<=0)
states: 913
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
..........
EG iterations: 10
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
..........
EG iterations: 10
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: [EX [AF [[EG [[[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] | [p42<=1 & 1<=p42]]] | A [~ [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] U EG [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]]] & E [AF [[[A [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] U [p15<=1 & 1<=p15]] & [EX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] & [p12<=1 & 1<=p12]]] & [[p25<=1 & 1<=p25] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]] U [AF [AX [EG [[[p47<=1 & 1<=p47] & [p54<=1 & 1<=p54]]]]] | [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]
normalized: [E [~ [EG [~ [[[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [p25<=1 & 1<=p25]] & [[[p12<=1 & 1<=p12] & EX [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]] & [~ [EG [~ [[p15<=1 & 1<=p15]]]] & ~ [E [~ [[p15<=1 & 1<=p15]] U [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] & ~ [[p15<=1 & 1<=p15]]]]]]]]]]] U [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] | ~ [EG [EX [~ [EG [[[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]]]]]]]] & EX [~ [EG [~ [[[~ [EG [~ [EG [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [~ [EG [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]] U [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] & ~ [EG [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]] | EG [[[p42<=1 & 1<=p42] | [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]]]]

abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p42)
states: 125
abstracting: (p42<=1)
states: 977
.
EG iterations: 1
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.
EG iterations: 1
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.
EG iterations: 1
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.
EG iterations: 1
..........
EG iterations: 10
...
EG iterations: 3
.abstracting: (1<=p47)
states: 64
abstracting: (p47<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
..
EG iterations: 2
.
EG iterations: 0
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p15)
states: 125
abstracting: (p15<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p15)
states: 125
abstracting: (p15<=1)
states: 977
abstracting: (1<=p15)
states: 125
abstracting: (p15<=1)
states: 977
.
EG iterations: 1
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AX [[[[~ [E [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] U [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]] | [EF [[[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]] | E [E [EF [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] U [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] U EX [AG [[p15<=1 & 1<=p15]]]]]] | [[[p12<=0 & 0<=p12] | [p25<=0 & 0<=p25]] | [[p38<=0 & 0<=p38] | [p51<=0 & 0<=p51]]]] & [EF [[[p32<=1 & 1<=p32] & [E [[[p18<=1 & 1<=p18] & [p54<=1 & 1<=p54]] U [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] | [[p34<=1 & 1<=p34] & [[p54<=1 & 1<=p54] & [p46<=1 & 1<=p46]]]]]] | AG [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]]
normalized: ~ [EX [~ [[[[~ [E [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] U [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]] | [E [E [E [true U [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] U [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] U EX [~ [E [true U ~ [[p15<=1 & 1<=p15]]]]]] | E [true U [[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]]]] | [[[p51<=0 & 0<=p51] | [p38<=0 & 0<=p38]] | [[p25<=0 & 0<=p25] | [p12<=0 & 0<=p12]]]] & [~ [E [true U ~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]] | E [true U [[[[[p46<=1 & 1<=p46] & [p54<=1 & 1<=p54]] & [p34<=1 & 1<=p34]] | E [[[p54<=1 & 1<=p54] & [p18<=1 & 1<=p18]] U [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]] & [p32<=1 & 1<=p32]]]]]]]]

abstracting: (1<=p32)
states: 64
abstracting: (p32<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p18)
states: 125
abstracting: (p18<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
abstracting: (1<=p34)
states: 64
abstracting: (p34<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
abstracting: (1<=p46)
states: 64
abstracting: (p46<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
abstracting: (0<=p12)
states: 977
abstracting: (p12<=0)
states: 751
abstracting: (0<=p25)
states: 977
abstracting: (p25<=0)
states: 751
abstracting: (0<=p38)
states: 977
abstracting: (p38<=0)
states: 751
abstracting: (0<=p51)
states: 977
abstracting: (p51<=0)
states: 751
abstracting: (1<=p15)
states: 125
abstracting: (p15<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: E [EG [[EF [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] & [EX [AX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]] & [~ [[[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] | EG [[p5<=1 & 1<=p5]]]] | EG [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]]] U [~ [[A [[p22<=1 & 1<=p22] U E [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]] U [[p26<=1 & 1<=p26] & [p54<=1 & 1<=p54]]]] | A [~ [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]] U AX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]] & [~ [EF [[EF [[[p47<=1 & 1<=p47] & [p54<=1 & 1<=p54]]] | [[p19<=1 & 1<=p19] | [[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]] | [[~ [AX [[[[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]] & [p12<=1 & 1<=p12]] & [[p25<=1 & 1<=p25] & [[p38<=1 & 1<=p38] & [p51<=1 & 1<=p51]]]]]]]
normalized: E [EG [[[[EG [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]] | ~ [[EG [[p5<=1 & 1<=p5]] | [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]] & EX [~ [EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]] & E [true U [[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]] U [[[[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [p25<=1 & 1<=p25]] & [[p12<=1 & 1<=p12] & EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]] | ~ [E [true U [[[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] | [p19<=1 & 1<=p19]] | E [true U [[p54<=1 & 1<=p54] & [p47<=1 & 1<=p47]]]]]]] & ~ [[[~ [EG [EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]] & ~ [E [EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]] U [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] & EX [~ [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]]]]]]]] | [~ [EG [~ [E [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] U [[p54<=1 & 1<=p54] & [p26<=1 & 1<=p26]]]]]] & ~ [E [~ [E [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] U [[p54<=1 & 1<=p54] & [p26<=1 & 1<=p26]]]] U [~ [[p22<=1 & 1<=p22]] & ~ [E [[[[p51<=1 & 1<=p51] & [p38<=1 & 1<=p38]] & [[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]]] U [[p54<=1 & 1<=p54] & [p26<=1 & 1<=p26]]]]]]]]]]]]

abstracting: (1<=p26)
states: 27
abstracting: (p26<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 977
abstracting: (1<=p26)
states: 27
abstracting: (p26<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p26)
states: 27
abstracting: (p26<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.........
EG iterations: 9
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
..........
EG iterations: 9
abstracting: (1<=p47)
states: 64
abstracting: (p47<=1)
states: 977
abstracting: (1<=p54)
states: 976
abstracting: (p54<=1)
states: 977
abstracting: (1<=p19)
states: 64
abstracting: (p19<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
..abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 977
.
EG iterations: 1
abstracting: (1<=p12)
states: 226
abstracting: (p12<=1)
states: 977
abstracting: (1<=p25)
states: 226
abstracting: (p25<=1)
states: 977
abstracting: (1<=p38)
states: 226
abstracting: (p38<=1)
states: 977
abstracting: (1<=p51)
states: 226
abstracting: (p51<=1)
states: 977
.
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE

FORMULA StigmergyElection-PT-04a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

totally nodes used: 169049 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 236795 727044 963839
used/not used/entry size/cache size: 880388 66228476 16 1024MB
basic ops cache: hits/miss/sum: 39349 126371 165720
used/not used/entry size/cache size: 192534 16584682 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: 1752 4726 6478
used/not used/entry size/cache size: 4725 8383883 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 66948337
1 152623
2 7328
3 534
4 42
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.758sec


BK_STOP 1679551318984

--------------------
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 CTLFireability -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.000sec


iterations count:2633 (25), effective:92 (0)

initing FirstDep: 0m 0.000sec


iterations count:110 (1), effective:1 (0)

iterations count:115 (1), effective:1 (0)

iterations count:1501 (14), effective:49 (0)

iterations count:105 (1), effective:0 (0)

iterations count:106 (1), effective:1 (0)

iterations count:1239 (11), effective:49 (0)

iterations count:105 (1), effective:0 (0)

iterations count:185 (1), effective:2 (0)

iterations count:110 (1), effective:1 (0)

iterations count:1501 (14), effective:49 (0)

iterations count:153 (1), effective:1 (0)

iterations count:105 (1), effective:0 (0)

iterations count:105 (1), effective:0 (0)

iterations count:153 (1), effective:1 (0)

iterations count:153 (1), effective:1 (0)

iterations count:148 (1), effective:1 (0)

iterations count:1501 (14), effective:49 (0)

iterations count:1501 (14), effective:49 (0)

iterations count:105 (1), effective:0 (0)

iterations count:105 (1), effective:0 (0)

iterations count:105 (1), effective:0 (0)

iterations count:145 (1), effective:1 (0)

iterations count:105 (1), effective:0 (0)

iterations count:1084 (10), effective:28 (0)

iterations count:1470 (14), effective:49 (0)

iterations count:105 (1), effective:0 (0)

iterations count:1501 (14), effective:49 (0)

iterations count:105 (1), effective:0 (0)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-04a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is StigmergyElection-PT-04a, examination is CTLFireability"
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-167912650500586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04a.tgz
mv StigmergyElection-PT-04a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;