fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r079-blw3-152649946600122
Last Updated
June 26, 2018

About the Execution of Irma.struct for Diffusion2D-PT-D05N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10848.690 214682.00 218548.00 293.60 TFTFFTTTFTFTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Diffusion2D-PT-D05N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-blw3-152649946600122
=====================================================================


--------------------
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 Diffusion2D-PT-D05N050-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527082513054


BK_STOP 1527082727736

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Diffusion2D-PT-D05N050 as instance name.
Using Diffusion2D as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': True, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 451672, 'Memory': 15948.16, 'Tool': 'marcie'}, {'Time': 476339, 'Memory': 15948.38, 'Tool': 'marcie'}, {'Time': 903135, 'Memory': 10600.59, 'Tool': 'lola'}, {'Time': 904227, 'Memory': 9545.2, 'Tool': 'lola'}, {'Time': 3139424, 'Memory': 12524.15, 'Tool': 'itstools'}, {'Time': 3263448, 'Memory': 12513.39, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 6.950672169184718x far from the best tool marcie.
CTLCardinality marcie Diffusion2D-PT-D05N050...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
check for maximal unmarked siphon

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 NrArc: 288)

ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

net check time: 0m 0.000sec

init dd package: 0m 1.392sec

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 NrArc: 288)

check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

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

net check time: 0m 0.000sec

init dd package: 0m 4.082sec


iterations count:42944 (298), effective:1200 (8)


RS generation: 0m 0.327sec


-> reachability set: #nodes 1225 (1.2e+03) #states 17,529,515,713,716,297,876 (19)



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

initing FirstDep: 0m 0.000sec

checking: EF [3<=cAMP__5_2_]
normalized: E [true U 3<=cAMP__5_2_]

abstracting: (3<=cAMP__5_2_)
states: 5,300,174,441,392,685,400 (18)

iterations count:2718 (18), effective:72 (0)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.234sec

checking: AG [AF [~ [3<=cAMP__4_2_]]]
normalized: ~ [E [true U EG [3<=cAMP__4_2_]]]

abstracting: (3<=cAMP__4_2_)
states: 5,300,174,441,392,685,400 (18)
.
EG iterations: 1

iterations count:2721 (18), effective:72 (0)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.971sec

checking: AG [[AF [2<=cAMP__4_1_] | ~ [3<=cAMP__1_1_]]]
normalized: ~ [E [true U ~ [[~ [3<=cAMP__1_1_] | ~ [EG [~ [2<=cAMP__4_1_]]]]]]]

abstracting: (2<=cAMP__4_1_)
states: 7,950,261,662,089,028,100 (18)
.
EG iterations: 1
abstracting: (3<=cAMP__1_1_)
states: 5,300,174,441,392,685,400 (18)

iterations count:3742 (25), effective:118 (0)

-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.095sec

checking: EF [cAMP__3_3_<=cAMP__4_3_]
normalized: E [true U cAMP__3_3_<=cAMP__4_3_]

abstracting: (cAMP__3_3_<=cAMP__4_3_)
states: 10,450,079,192,611,522,356 (19)
iterations count:244 (1), effective:50 (0)

iterations count:2543 (17), effective:181 (1)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.268sec

checking: EF [~ [AX [cAMP__3_3_<=cAMP__3_4_]]]
normalized: E [true U EX [~ [cAMP__3_3_<=cAMP__3_4_]]]

abstracting: (cAMP__3_3_<=cAMP__3_4_)
states: 10,450,079,192,611,522,356 (19)

iterations count:3580 (24), effective:96 (0)
.-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.482sec

checking: E [cAMP__5_2_<=cAMP__2_3_ U AX [3<=cAMP__4_3_]]
normalized: E [cAMP__5_2_<=cAMP__2_3_ U ~ [EX [~ [3<=cAMP__4_3_]]]]

abstracting: (3<=cAMP__4_3_)
states: 5,300,174,441,392,685,400 (18)
.abstracting: (cAMP__5_2_<=cAMP__2_3_)
states: 10,450,079,192,611,522,356 (19)

-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.312sec

checking: AG [EF [[cAMP__4_4_<=cAMP__3_5_ | cAMP__4_3_<=cAMP__1_1_]]]
normalized: ~ [E [true U ~ [E [true U [cAMP__4_4_<=cAMP__3_5_ | cAMP__4_3_<=cAMP__1_1_]]]]]

abstracting: (cAMP__4_3_<=cAMP__1_1_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__4_4_<=cAMP__3_5_)
states: 10,450,079,192,611,522,356 (19)
iterations count:13916 (96), effective:561 (3)

-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m37.763sec

checking: E [EF [cAMP__3_3_<=cAMP__5_1_] U AG [cAMP__5_3_<=cAMP__3_2_]]
normalized: E [E [true U cAMP__3_3_<=cAMP__5_1_] U ~ [E [true U ~ [cAMP__5_3_<=cAMP__3_2_]]]]

abstracting: (cAMP__5_3_<=cAMP__3_2_)
states: 10,450,079,192,611,522,356 (19)
iterations count:4089 (28), effective:73 (0)

abstracting: (cAMP__3_3_<=cAMP__5_1_)
states: 10,450,079,192,611,522,356 (19)
iterations count:244 (1), effective:50 (0)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.525sec

checking: [AX [[~ [cAMP__3_3_<=cAMP__1_4_] & ~ [2<=cAMP__5_5_]]] & AG [EX [cAMP__1_5_<=cAMP__2_5_]]]
normalized: [~ [E [true U ~ [EX [cAMP__1_5_<=cAMP__2_5_]]]] & ~ [EX [~ [[~ [2<=cAMP__5_5_] & ~ [cAMP__3_3_<=cAMP__1_4_]]]]]]

abstracting: (cAMP__3_3_<=cAMP__1_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__5_5_)
states: 7,950,261,662,089,028,100 (18)
.abstracting: (cAMP__1_5_<=cAMP__2_5_)
states: 10,450,079,192,611,522,356 (19)

iterations count:3223 (22), effective:165 (1)

.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.383sec

checking: [AG [EF [cAMP__1_3_<=cAMP__3_3_]] & [~ [AX [2<=cAMP__3_4_]] | cAMP__3_2_<=cAMP__1_3_]]
normalized: [[cAMP__3_2_<=cAMP__1_3_ | EX [~ [2<=cAMP__3_4_]]] & ~ [E [true U ~ [E [true U cAMP__1_3_<=cAMP__3_3_]]]]]

abstracting: (cAMP__1_3_<=cAMP__3_3_)
states: 10,450,079,192,611,522,356 (19)
iterations count:1519 (10), effective:150 (1)

iterations count:23392 (162), effective:649 (4)
abstracting: (2<=cAMP__3_4_)
states: 7,950,261,662,089,028,100 (18)
.abstracting: (cAMP__3_2_<=cAMP__1_3_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.444sec

checking: ~ [EF [[[3<=cAMP__5_5_ & cAMP__5_4_<=cAMP__5_3_] & cAMP__3_1_<=cAMP__4_2_]]]
normalized: ~ [E [true U [cAMP__3_1_<=cAMP__4_2_ & [3<=cAMP__5_5_ & cAMP__5_4_<=cAMP__5_3_]]]]

abstracting: (cAMP__5_4_<=cAMP__5_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__5_5_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__3_1_<=cAMP__4_2_)
states: 10,450,079,192,611,522,356 (19)

iterations count:894 (6), effective:50 (0)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.810sec

checking: E [[[cAMP__1_1_<=cAMP__3_2_ | 1<=cAMP__5_2_] & cAMP__1_1_<=cAMP__2_3_] U AG [1<=cAMP__2_3_]]
normalized: E [[cAMP__1_1_<=cAMP__2_3_ & [cAMP__1_1_<=cAMP__3_2_ | 1<=cAMP__5_2_]] U ~ [E [true U ~ [1<=cAMP__2_3_]]]]

abstracting: (1<=cAMP__2_3_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (1<=cAMP__5_2_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__1_1_<=cAMP__3_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_1_<=cAMP__2_3_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.585sec

checking: [EX [[[3<=cAMP__4_4_ | cAMP__4_4_<=cAMP__2_2_] | [1<=cAMP__3_4_ & 3<=cAMP__3_3_]]] & EF [AG [cAMP__1_1_<=cAMP__5_2_]]]
normalized: [E [true U ~ [E [true U ~ [cAMP__1_1_<=cAMP__5_2_]]]] & EX [[[1<=cAMP__3_4_ & 3<=cAMP__3_3_] | [3<=cAMP__4_4_ | cAMP__4_4_<=cAMP__2_2_]]]]

abstracting: (cAMP__4_4_<=cAMP__2_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__4_4_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (3<=cAMP__3_3_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (1<=cAMP__3_4_)
states: 11,844,267,374,132,633,700 (19)
.abstracting: (cAMP__1_1_<=cAMP__5_2_)
states: 10,450,079,192,611,522,356 (19)

iterations count:11872 (82), effective:457 (3)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.671sec

checking: [[EF [[cAMP__5_4_<=cAMP__2_3_ | cAMP__2_4_<=cAMP__2_3_]] | [[2<=cAMP__5_2_ | ~ [2<=cAMP__3_1_]] & ~ [[2<=cAMP__4_3_ | 3<=cAMP__5_2_]]]] & EF [EG [2<=cAMP__5_1_]]]
normalized: [E [true U EG [2<=cAMP__5_1_]] & [[~ [[2<=cAMP__4_3_ | 3<=cAMP__5_2_]] & [2<=cAMP__5_2_ | ~ [2<=cAMP__3_1_]]] | E [true U [cAMP__5_4_<=cAMP__2_3_ | cAMP__2_4_<=cAMP__2_3_]]]]

abstracting: (cAMP__2_4_<=cAMP__2_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__5_4_<=cAMP__2_3_)
states: 10,450,079,192,611,522,356 (19)

iterations count:193 (1), effective:49 (0)

abstracting: (2<=cAMP__3_1_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__5_2_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (3<=cAMP__5_2_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__4_3_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__5_1_)
states: 7,950,261,662,089,028,100 (18)
.
EG iterations: 1
iterations count:1860 (12), effective:48 (0)

-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.173sec

checking: [E [cAMP__3_4_<=cAMP__1_2_ U ~ [1<=cAMP__3_2_]] & [[[[cAMP__3_2_<=cAMP__4_2_ & 2<=cAMP__4_2_] | [2<=cAMP__1_5_ & cAMP__5_1_<=cAMP__1_2_]] | EF [3<=cAMP__4_1_]] | [EG [1<=cAMP__2_3_] | ~ [~ [cAMP__3_3_<=cAMP__3_1_]]]]]
normalized: [[[[[cAMP__3_2_<=cAMP__4_2_ & 2<=cAMP__4_2_] | [2<=cAMP__1_5_ & cAMP__5_1_<=cAMP__1_2_]] | E [true U 3<=cAMP__4_1_]] | [cAMP__3_3_<=cAMP__3_1_ | EG [1<=cAMP__2_3_]]] & E [cAMP__3_4_<=cAMP__1_2_ U ~ [1<=cAMP__3_2_]]]

abstracting: (1<=cAMP__3_2_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__3_4_<=cAMP__1_2_)
states: 10,450,079,192,611,522,356 (19)
iterations count:3294 (22), effective:50 (0)
abstracting: (1<=cAMP__2_3_)
states: 11,844,267,374,132,633,700 (19)
.
EG iterations: 1
abstracting: (cAMP__3_3_<=cAMP__3_1_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__4_1_)
states: 5,300,174,441,392,685,400 (18)

iterations count:2724 (18), effective:72 (0)

iterations count:1744 (12), effective:50 (0)
abstracting: (cAMP__5_1_<=cAMP__1_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__1_5_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__4_2_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__3_2_<=cAMP__4_2_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.700sec

checking: [[[AX [1<=cAMP__1_2_] & EX [cAMP__4_5_<=cAMP__4_3_]] & [[[3<=cAMP__2_5_ | cAMP__4_5_<=cAMP__3_2_] & [cAMP__3_2_<=cAMP__4_4_ & cAMP__2_4_<=cAMP__3_1_]] & [~ [3<=cAMP__2_3_] | [cAMP__4_4_<=cAMP__4_3_ & 3<=cAMP__2_5_]]]] | EF [AG [1<=cAMP__3_1_]]]
normalized: [E [true U ~ [E [true U ~ [1<=cAMP__3_1_]]]] | [[[[cAMP__4_4_<=cAMP__4_3_ & 3<=cAMP__2_5_] | ~ [3<=cAMP__2_3_]] & [[cAMP__3_2_<=cAMP__4_4_ & cAMP__2_4_<=cAMP__3_1_] & [3<=cAMP__2_5_ | cAMP__4_5_<=cAMP__3_2_]]] & [EX [cAMP__4_5_<=cAMP__4_3_] & ~ [EX [~ [1<=cAMP__1_2_]]]]]]

abstracting: (1<=cAMP__1_2_)
states: 11,844,267,374,132,633,700 (19)
.abstracting: (cAMP__4_5_<=cAMP__4_3_)
states: 10,450,079,192,611,522,356 (19)
.abstracting: (cAMP__4_5_<=cAMP__3_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__2_5_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__2_4_<=cAMP__3_1_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_2_<=cAMP__4_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__2_3_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (3<=cAMP__2_5_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__4_4_<=cAMP__4_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (1<=cAMP__3_1_)
states: 11,844,267,374,132,633,700 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.073sec

totally nodes used: 8703414 (8.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2633642883 154397017 2788039900
used/not used/entry size/cache size: 61066129 6042735 16 1024MB
basic ops cache: hits/miss/sum: 141736737 9077024 150813761
used/not used/entry size/cache size: 8278911 8498305 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: 2202326 109423 2311749
used/not used/entry size/cache size: 108708 8279900 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 59524474
1 7077480
2 427903
3 25295
4 8161
5 6864
6 5820
7 5344
8 4439
9 4074
>= 10 19010

Total processing time: 3m31.863sec

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="Diffusion2D-PT-D05N050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N050.tgz
mv Diffusion2D-PT-D05N050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is Diffusion2D-PT-D05N050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r079-blw3-152649946600122"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;