MCC'2023- Execution of r170-tall-167838856800162

About the Execution of Marcie+red for Eratosthenes-PT-100

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
5517.048	8701.00	10981.00	387.50	FTFFTFFTTFFFFFFF	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.r170-tall-167838856800162.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 Eratosthenes-PT-100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 126K Mar 5 18:22 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 Eratosthenes-PT-100-CTLFireability-00
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-01
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-02
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-03
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-04
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-05
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-06
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-07
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-08
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-09
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-10
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-11
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-12
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-13
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-14
FORMULA_NAME Eratosthenes-PT-100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678493534973

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=Eratosthenes-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:12:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:12:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:12:16] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-11 00:12:16] [INFO ] Transformed 99 places.
[2023-03-11 00:12:16] [INFO ] Transformed 283 transitions.
[2023-03-11 00:12:16] [INFO ] Parsed PT model containing 99 places and 283 transitions and 849 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Support contains 64 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 209
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 209
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 141 place count 72 transition count 72
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 148 place count 65 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 155 place count 65 transition count 65
Applied a total of 155 rules in 16 ms. Remains 65 /74 variables (removed 9) and now considering 65/211 (removed 146) transitions.
// Phase 1: matrix 65 rows 65 cols
[2023-03-11 00:12:16] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-11 00:12:16] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-11 00:12:16] [INFO ] Invariant cache hit.
[2023-03-11 00:12:17] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-11 00:12:17] [INFO ] Invariant cache hit.
[2023-03-11 00:12:17] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/74 places, 65/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 65/74 places, 65/211 transitions.
Support contains 64 out of 65 places after structural reductions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 20 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 7 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 65 transitions.
Finished random walk after 305 steps, including 4 resets, run visited all 80 properties in 31 ms. (steps per millisecond=9 )
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 65 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Eratosthenes-PT-100-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 4 transition count 4
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 4 transition count 4
Applied a total of 122 rules in 3 ms. Remains 4 /65 variables (removed 61) and now considering 4/65 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 4/65 places, 4/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 5 transition count 5
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 5 transition count 5
Applied a total of 120 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 5/65 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/65 places, 5/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 5 transition count 5
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 5 transition count 5
Applied a total of 120 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 5/65 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/65 places, 5/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Graph (complete) has 0 edges and 65 vertex of which 15 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Applied a total of 1 rules in 3 ms. Remains 15 /65 variables (removed 50) and now considering 15/65 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 15/65 places, 15/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 10 transition count 10
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 10 transition count 10
Applied a total of 110 rules in 2 ms. Remains 10 /65 variables (removed 55) and now considering 10/65 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 10/65 places, 10/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Graph (complete) has 0 edges and 65 vertex of which 7 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Applied a total of 1 rules in 1 ms. Remains 7 /65 variables (removed 58) and now considering 7/65 (removed 58) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 7/65 places, 7/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 15 transition count 15
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 15 transition count 15
Applied a total of 100 rules in 1 ms. Remains 15 /65 variables (removed 50) and now considering 15/65 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/65 places, 15/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 2 transition count 2
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 2 transition count 2
Applied a total of 126 rules in 1 ms. Remains 2 /65 variables (removed 63) and now considering 2/65 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/65 places, 2/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 13 transition count 13
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 13 transition count 13
Applied a total of 104 rules in 1 ms. Remains 13 /65 variables (removed 52) and now considering 13/65 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/65 places, 13/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 6 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 16 transition count 16
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 16 transition count 16
Applied a total of 98 rules in 1 ms. Remains 16 /65 variables (removed 49) and now considering 16/65 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/65 places, 16/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 10 transition count 10
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 10 transition count 10
Applied a total of 110 rules in 1 ms. Remains 10 /65 variables (removed 55) and now considering 10/65 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 10/65 places, 10/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 11 transition count 11
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 11 transition count 11
Applied a total of 108 rules in 2 ms. Remains 11 /65 variables (removed 54) and now considering 11/65 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 11/65 places, 11/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 14 transition count 14
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 14 transition count 14
Applied a total of 102 rules in 2 ms. Remains 14 /65 variables (removed 51) and now considering 14/65 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/65 places, 14/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Graph (complete) has 0 edges and 65 vertex of which 1 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /65 variables (removed 64) and now considering 1/65 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 1/65 places, 1/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 65/65 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 29 transition count 29
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 29 transition count 29
Applied a total of 72 rules in 2 ms. Remains 29 /65 variables (removed 36) and now considering 29/65 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 29/65 places, 29/65 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:17] [INFO ] Input system was already deterministic with 29 transitions.
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:12:17] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:12:17] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:12:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 65 transitions and 65 arcs took 0 ms.
Total runtime 1216 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: 65 NrTr: 65 NrArc: 65)

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

net check time: 0m 0.000sec

init dd package: 0m 2.735sec

RS generation: 0m 0.001sec

-> reachability set: #nodes 65 (6.5e+01) #states 202,914,184,810,805,067,776 (20)

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

checking: AX [EX [p20<=0]]
normalized: ~ [EX [~ [EX [p20<=0]]]]

abstracting: (p20<=0)
states: 101,457,092,405,402,533,888 (20)
..-> the formula is TRUE

FORMULA Eratosthenes-PT-100-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
...........................................................................
EG iterations: 75
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: EG [AX [EG [[[1<=p23 & 1<=p7] | 1<=p10]]]]
normalized: EG [~ [EX [~ [EG [[1<=p10 | [1<=p23 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p23)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p10)
states: 101,457,092,405,402,533,888 (20)
...........................................................................
EG iterations: 75
..
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AF [[AX [1<=p7] | [AF [1<=p22] & EG [[1<=p48 & 1<=p54]]]]]
normalized: ~ [EG [~ [[[EG [[1<=p48 & 1<=p54]] & ~ [EG [~ [1<=p22]]]] | ~ [EX [~ [1<=p7]]]]]]]

abstracting: (1<=p7)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p22)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p54)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
..........................................................................
EG iterations: 74
...........................................................................
EG iterations: 75
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: EG [E [[1<=p48 & 1<=p54] U AX [[1<=p64 & 1<=p1]]]]
normalized: EG [E [[1<=p48 & 1<=p54] U ~ [EX [~ [[1<=p64 & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p54)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [[[~ [A [p53<=0 U [1<=p41 & 1<=p48]]] & EG [1<=p43]] & [EF [1<=p1] & [p34<=0 | AF [[p46<=0 | p41<=0]]]]]]
normalized: ~ [EG [~ [[[~ [[~ [EG [~ [[1<=p41 & 1<=p48]]]] & ~ [E [~ [[1<=p41 & 1<=p48]] U [~ [p53<=0] & ~ [[1<=p41 & 1<=p48]]]]]]] & EG [1<=p43]] & [[~ [EG [~ [[p46<=0 | p41<=0]]]] | p34<=0] & E [true U 1<=p1]]]]]]

abstracting: (1<=p1)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p34<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p41<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p46<=0)
states: 101,457,092,405,402,533,888 (20)
..........................................................................
EG iterations: 74
abstracting: (1<=p43)
states: 101,457,092,405,402,533,888 (20)
...........................................................................
EG iterations: 75
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p53<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: AG [AF [[[1<=p28 & 1<=p0] & [1<=p35 & [[1<=p17 | AX [1<=p55]] | [[1<=p7 & 1<=p36] | [1<=p4 & 1<=p37]]]]]]]
normalized: ~ [E [true U EG [~ [[[[[[1<=p4 & 1<=p37] | [1<=p7 & 1<=p36]] | [~ [EX [~ [1<=p55]]] | 1<=p17]] & 1<=p35] & [1<=p28 & 1<=p0]]]]]]

abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p35)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p17)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p55)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p7)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p37)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p4)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [EF [[AG [[EX [1<=p8] | 1<=p62]] & [A [AX [1<=p53] U [1<=p7 & [1<=p47 & 1<=p51]]] | [1<=p45 | [1<=p27 & 1<=p55]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[~ [EG [~ [[[1<=p47 & 1<=p51] & 1<=p7]]]] & ~ [E [~ [[[1<=p47 & 1<=p51] & 1<=p7]] U [EX [~ [1<=p53]] & ~ [[[1<=p47 & 1<=p51] & 1<=p7]]]]]] | [[1<=p27 & 1<=p55] | 1<=p45]] & ~ [E [true U ~ [[EX [1<=p8] | 1<=p62]]]]]]]]]

abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p45)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p55)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p27)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p7)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p51)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p53)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p7)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p51)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p7)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p51)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [EX [[1<=p40 & [~ [[1<=p46 & 1<=p62]] | [A [1<=p24 U 1<=p50] & E [[1<=p0 & 1<=p24] U [1<=p9 & 1<=p27]]]]]] U EX [~ [[~ [EG [1<=p63]] | 1<=p31]]]]
normalized: E [EX [[[[E [[1<=p0 & 1<=p24] U [1<=p9 & 1<=p27]] & [~ [EG [~ [1<=p50]]] & ~ [E [~ [1<=p50] U [~ [1<=p24] & ~ [1<=p50]]]]]] | ~ [[1<=p46 & 1<=p62]]] & 1<=p40]] U EX [~ [[~ [EG [1<=p63]] | 1<=p31]]]]

abstracting: (1<=p31)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p63)
states: 101,457,092,405,402,533,888 (20)
...........................................................................
EG iterations: 75
.abstracting: (1<=p40)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p27)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
.-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EG [E [[AG [[AX [1<=p57] & A [1<=p10 U [1<=p36 & 1<=p46]]]] & [1<=p38 | [~ [[1<=p21 & 1<=p58]] & [~ [[1<=p9 & 1<=p27]] & [1<=p61 | 1<=p59]]]]] U 1<=p23]]
normalized: EG [E [[[[[[1<=p61 | 1<=p59] & ~ [[1<=p9 & 1<=p27]]] & ~ [[1<=p21 & 1<=p58]]] | 1<=p38] & ~ [E [true U ~ [[[~ [EG [~ [[1<=p36 & 1<=p46]]]] & ~ [E [~ [[1<=p36 & 1<=p46]] U [~ [1<=p10] & ~ [[1<=p36 & 1<=p46]]]]]] & ~ [EX [~ [1<=p57]]]]]]]] U 1<=p23]]

abstracting: (1<=p23)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p10)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p38)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p58)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p21)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p27)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p59)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p61)
states: 101,457,092,405,402,533,888 (20)
...........................................................................
EG iterations: 75
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: ~ [A [EX [~ [AG [p53<=0]]] U ~ [EG [[[1<=p34 & 1<=p49] & [1<=p6 & [A [1<=p29 U [1<=p19 & 1<=p48]] & [[[1<=p0 & 1<=p35] & [1<=p22 & 1<=p47]] | AX [[1<=p10 & 1<=p28]]]]]]]]]]
normalized: ~ [[~ [EG [EG [[[[[~ [EX [~ [[1<=p10 & 1<=p28]]]] | [[1<=p22 & 1<=p47] & [1<=p0 & 1<=p35]]] & [~ [EG [~ [[1<=p19 & 1<=p48]]]] & ~ [E [~ [[1<=p19 & 1<=p48]] U [~ [1<=p29] & ~ [[1<=p19 & 1<=p48]]]]]]] & 1<=p6] & [1<=p34 & 1<=p49]]]]] & ~ [E [EG [[[[[~ [EX [~ [[1<=p10 & 1<=p28]]]] | [[1<=p22 & 1<=p47] & [1<=p0 & 1<=p35]]] & [~ [EG [~ [[1<=p19 & 1<=p48]]]] & ~ [E [~ [[1<=p19 & 1<=p48]] U [~ [1<=p29] & ~ [[1<=p19 & 1<=p48]]]]]]] & 1<=p6] & [1<=p34 & 1<=p49]]] U [~ [EX [E [true U ~ [p53<=0]]]] & EG [[[[[~ [EX [~ [[1<=p10 & 1<=p28]]]] | [[1<=p22 & 1<=p47] & [1<=p0 & 1<=p35]]] & [~ [EG [~ [[1<=p19 & 1<=p48]]]] & ~ [E [~ [[1<=p19 & 1<=p48]] U [~ [1<=p29] & ~ [[1<=p19 & 1<=p48]]]]]]] & 1<=p6] & [1<=p34 & 1<=p49]]]]]]]]

abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p34)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p6)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p29)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p35)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p22)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p10)
states: 101,457,092,405,402,533,888 (20)
....................................................................
EG iterations: 67
abstracting: (p53<=0)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p34)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p6)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p29)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p35)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p22)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p10)
states: 101,457,092,405,402,533,888 (20)
....................................................................
EG iterations: 67
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p34)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p6)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p29)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p35)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p22)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p10)
states: 101,457,092,405,402,533,888 (20)
....................................................................
EG iterations: 67
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: [EX [[EX [[~ [A [[1<=p15 & 1<=p43] U [1<=p25 & 1<=p59]]] & [p12<=0 | p45<=0]]] & EF [[AF [1<=p16] | AX [1<=p64]]]]] & [AX [EF [[p7<=0 | [p16<=0 | EG [p33<=0]]]]] | [AX [1<=p15] & AF [EX [[EF [[1<=p47 & 1<=p48]] & [1<=p17 & 1<=p36]]]]]]]
normalized: [[[~ [EG [~ [EX [[E [true U [1<=p47 & 1<=p48]] & [1<=p17 & 1<=p36]]]]]] & ~ [EX [~ [1<=p15]]]] | ~ [EX [~ [E [true U [[EG [p33<=0] | p16<=0] | p7<=0]]]]]] & EX [[E [true U [~ [EX [~ [1<=p64]]] | ~ [EG [~ [1<=p16]]]]] & EX [[[p12<=0 | p45<=0] & ~ [[~ [EG [~ [[1<=p25 & 1<=p59]]]] & ~ [E [~ [[1<=p25 & 1<=p59]] U [~ [[1<=p15 & 1<=p43]] & ~ [[1<=p25 & 1<=p59]]]]]]]]]]]]

abstracting: (1<=p59)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p25)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p43)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p59)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p25)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p59)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p25)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (p45<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p12<=0)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p16)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
..abstracting: (p7<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p16<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p33<=0)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p17)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p48)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [[[[A [1<=p46 U 1<=p50] & EG [[1<=p8 & 1<=p17]]] & [p15<=0 & [AX [[1<=p9 & 1<=p27]] | 1<=p24]]] | [EX [[E [1<=p11 U [1<=p46 & 1<=p50]] | 1<=p30]] & [EF [1<=p44] | [1<=p52 & [1<=p26 | [1<=p45 & 1<=p47]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[1<=p45 & 1<=p47] | 1<=p26] & 1<=p52] | E [true U 1<=p44]] & EX [[E [1<=p11 U [1<=p46 & 1<=p50]] | 1<=p30]]] | [[[~ [EX [~ [[1<=p9 & 1<=p27]]]] | 1<=p24] & p15<=0] & [EG [[1<=p8 & 1<=p17]] & [~ [EG [~ [1<=p50]]] & ~ [E [~ [1<=p50] U [~ [1<=p46] & ~ [1<=p50]]]]]]]]]]]

abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p17)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
..........................................................................
EG iterations: 74
abstracting: (p15<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p27)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p30)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p11)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (1<=p44)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p52)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p26)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p47)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p45)
states: 101,457,092,405,402,533,888 (20)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: A [E [[~ [[[1<=p20 & 1<=p39] | [1<=p50 & [1<=p14 & 1<=p22]]]] & [EG [[[1<=p19 & 1<=p32] & [1<=p15 & 1<=p37]]] & EF [1<=p35]]] U [1<=p16 & 1<=p22]] U EG [A [[1<=p60 | ~ [[1<=p64 & 1<=p24]]] U [EF [1<=p64] & [1<=p3 & 1<=p15]]]]]
normalized: [~ [EG [~ [EG [[~ [EG [~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]]]] & ~ [E [~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]] U [~ [[~ [[1<=p64 & 1<=p24]] | 1<=p60]] & ~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]]]]]]]]]] & ~ [E [~ [EG [[~ [EG [~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]]]] & ~ [E [~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]] U [~ [[~ [[1<=p64 & 1<=p24]] | 1<=p60]] & ~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]]]]]]]] U [~ [EG [[~ [EG [~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]]]] & ~ [E [~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]] U [~ [[~ [[1<=p64 & 1<=p24]] | 1<=p60]] & ~ [[[1<=p3 & 1<=p15] & E [true U 1<=p64]]]]]]]]] & ~ [E [[[E [true U 1<=p35] & EG [[[1<=p15 & 1<=p37] & [1<=p19 & 1<=p32]]]] & ~ [[[[1<=p14 & 1<=p22] & 1<=p50] | [1<=p20 & 1<=p39]]]] U [1<=p16 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p16)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p39)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p20)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p22)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p14)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p19)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p37)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
........................................................................
EG iterations: 72
abstracting: (1<=p35)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p60)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
.........................................................................
EG iterations: 73
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p60)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
.........................................................................
EG iterations: 73
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p60)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p64)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p3)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
.........................................................................
EG iterations: 73

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: A [[1<=p46 & [1<=p50 & [[EF [[[1<=p43 | 1<=p59] & E [1<=p59 U [1<=p16 & 1<=p46]]]] | 1<=p10] | [[p13<=0 & AX [~ [A [[1<=p17 & 1<=p36] U 1<=p56]]]] | [[EF [1<=p27] & [AF [[1<=p27 & 1<=p55]] & ~ [[1<=p16 & 1<=p62]]]] | [AX [1<=p42] & 1<=p36]]]]]] U A [[[A [p37<=0 U 1<=p32] & AG [[1<=p46 & 1<=p62]]] & [AG [[1<=p29 & 1<=p49]] & ~ [EF [[[1<=p49 & 1<=p62] | [1<=p18 & 1<=p28]]]]]] U [A [A [1<=p41 U 1<=p57] U [[1<=p0 & 1<=p24] & [1<=p8 & p5<=0]]] & [EF [1<=p15] | [1<=p9 & 1<=p49]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]]]] & ~ [E [~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]] U [~ [[[~ [E [true U [[1<=p18 & 1<=p28] | [1<=p49 & 1<=p62]]]] & ~ [E [true U ~ [[1<=p29 & 1<=p49]]]]] & [~ [E [true U ~ [[1<=p46 & 1<=p62]]]] & [~ [EG [~ [1<=p32]]] & ~ [E [~ [1<=p32] U [~ [p37<=0] & ~ [1<=p32]]]]]]]] & ~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]]]] & ~ [E [~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]] U [~ [[[~ [E [true U [[1<=p18 & 1<=p28] | [1<=p49 & 1<=p62]]]] & ~ [E [true U ~ [[1<=p29 & 1<=p49]]]]] & [~ [E [true U ~ [[1<=p46 & 1<=p62]]]] & [~ [EG [~ [1<=p32]]] & ~ [E [~ [1<=p32] U [~ [p37<=0] & ~ [1<=p32]]]]]]]] & ~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]]]]]]] U [~ [[[[[[~ [EX [[~ [EG [~ [1<=p56]]] & ~ [E [~ [1<=p56] U [~ [[1<=p17 & 1<=p36]] & ~ [1<=p56]]]]]]] & p13<=0] | [[~ [EX [~ [1<=p42]]] & 1<=p36] | [[~ [[1<=p16 & 1<=p62]] & ~ [EG [~ [[1<=p27 & 1<=p55]]]]] & E [true U 1<=p27]]]] | [E [true U [E [1<=p59 U [1<=p16 & 1<=p46]] & [1<=p43 | 1<=p59]]] | 1<=p10]] & 1<=p50] & 1<=p46]] & ~ [[~ [EG [~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]]]] & ~ [E [~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]] U [~ [[[~ [E [true U [[1<=p18 & 1<=p28] | [1<=p49 & 1<=p62]]]] & ~ [E [true U ~ [[1<=p29 & 1<=p49]]]]] & [~ [E [true U ~ [[1<=p46 & 1<=p62]]]] & [~ [EG [~ [1<=p32]]] & ~ [E [~ [1<=p32] U [~ [p37<=0] & ~ [1<=p32]]]]]]]] & ~ [[[[1<=p9 & 1<=p49] | E [true U 1<=p15]] & [~ [EG [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]] & ~ [E [~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]] U [~ [[~ [EG [~ [1<=p57]]] & ~ [E [~ [1<=p57] U [~ [1<=p41] & ~ [1<=p57]]]]]] & ~ [[[1<=p8 & p5<=0] & [1<=p0 & 1<=p24]]]]]]]]]]]]]]]]]]

abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p37<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p29)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p18)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p50)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p10)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p59)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p43)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p16)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p59)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p27)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p55)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p27)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p16)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p42)
states: 101,457,092,405,402,533,888 (20)
.abstracting: (p13<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p56)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p36)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p17)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p56)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p56)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
.abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p37<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p29)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p18)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p37<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p32)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p46)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p29)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p62)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p28)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p18)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p41)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p57)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p24)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (p5<=0)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p8)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
abstracting: (1<=p15)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p49)
states: 101,457,092,405,402,533,888 (20)
abstracting: (1<=p9)
states: 101,457,092,405,402,533,888 (20)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

totally nodes used: 1208865 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1007080 1173425 2180505
used/not used/entry size/cache size: 2280769 64828095 16 1024MB
basic ops cache: hits/miss/sum: 109388 192096 301484
used/not used/entry size/cache size: 367888 16409328 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: 441 2483 2924
used/not used/entry size/cache size: 2483 8386125 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 65919354
1 1170833
2 18082
3 566
4 18
5 1
6 0
7 1
8 3
9 1
>= 10 5

Total processing time: 0m 5.082sec

BK_STOP 1678493543674

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:139 (2), effective:74 (1)

initing FirstDep: 0m 0.000sec

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

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

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

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

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

iterations count:84 (1), effective:19 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:138 (2), effective:73 (1)

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

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

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

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

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

iterations count:69 (1), effective:4 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:69 (1), effective:4 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:65 (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="Eratosthenes-PT-100"
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 Eratosthenes-PT-100, 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 r170-tall-167838856800162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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