About the Execution of Marcie for IBM703-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6073.588 | 14340.00 | 14079.00 | 0.00 | TTFFFFFFFTTTFTFF | 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.r225-tall-167856407100089.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 marcie
Input is IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407100089
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 11K Feb 26 04:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 04:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-CTLCardinality-00
FORMULA_NAME IBM703-PT-none-CTLCardinality-01
FORMULA_NAME IBM703-PT-none-CTLCardinality-02
FORMULA_NAME IBM703-PT-none-CTLCardinality-03
FORMULA_NAME IBM703-PT-none-CTLCardinality-04
FORMULA_NAME IBM703-PT-none-CTLCardinality-05
FORMULA_NAME IBM703-PT-none-CTLCardinality-06
FORMULA_NAME IBM703-PT-none-CTLCardinality-07
FORMULA_NAME IBM703-PT-none-CTLCardinality-08
FORMULA_NAME IBM703-PT-none-CTLCardinality-09
FORMULA_NAME IBM703-PT-none-CTLCardinality-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-11
FORMULA_NAME IBM703-PT-none-CTLCardinality-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678606095864
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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: IBM703_PT_none
(NrP: 262 NrTr: 284 NrArc: 572)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.000sec
init dd package: 0m 2.872sec
RS generation: 0m 0.048sec
-> reachability set: #nodes 755 (7.6e+02) #states 8,370 (3)
starting MCC model checker
--------------------------
checking: ~ [EF [AG [EX [task_s00000707_input_s00000263<=1]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [task_s00000707_input_s00000263<=1]]]]]]
abstracting: (task_s00000707_input_s00000263<=1)
states: 8,370 (3)
.-> the formula is TRUE
FORMULA IBM703-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.124sec
checking: EX [[1<=task_s00000758_output_s00000264 | AX [AF [~ [EF [1<=task_s00000755_inputCriterion_s00000257_used]]]]]]
normalized: EX [[~ [EX [EG [E [true U 1<=task_s00000755_inputCriterion_s00000257_used]]]] | 1<=task_s00000758_output_s00000264]]
abstracting: (1<=task_s00000758_output_s00000264)
states: 125
abstracting: (1<=task_s00000755_inputCriterion_s00000257_used)
states: 145
............................................................................................................
EG iterations: 108
..-> the formula is TRUE
FORMULA IBM703-PT-none-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.347sec
checking: ~ [AG [E [A [~ [1<=merge_s00000455_input_s00000263] U EG [1<=task_s00000704_input_s00000263]] U EF [[EX [task_s00000740_inputCriterion_s00000257_used<=0] & EG [1<=task_s00000760_inputCriterion_s00000257_used]]]]]]
normalized: E [true U ~ [E [[~ [EG [~ [EG [1<=task_s00000704_input_s00000263]]]] & ~ [E [~ [EG [1<=task_s00000704_input_s00000263]] U [~ [EG [1<=task_s00000704_input_s00000263]] & 1<=merge_s00000455_input_s00000263]]]] U E [true U [EX [task_s00000740_inputCriterion_s00000257_used<=0] & EG [1<=task_s00000760_inputCriterion_s00000257_used]]]]]]
abstracting: (1<=task_s00000760_inputCriterion_s00000257_used)
states: 5
.....
EG iterations: 5
abstracting: (task_s00000740_inputCriterion_s00000257_used<=0)
states: 8,225 (3)
.abstracting: (1<=merge_s00000455_input_s00000263)
states: 60
abstracting: (1<=task_s00000704_input_s00000263)
states: 5
.....
EG iterations: 5
abstracting: (1<=task_s00000704_input_s00000263)
states: 5
.....
EG iterations: 5
abstracting: (1<=task_s00000704_input_s00000263)
states: 5
.....
EG iterations: 5
EG iterations: 0
-> the formula is TRUE
FORMULA IBM703-PT-none-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.101sec
checking: AG [AG [E [decision_s00000783_activated<=0 U [[task_s00000759_output_s00000264<=task_s00000748_output_s00000264 & AG [1<=task_s00000706_input_s00000263]] | task_s00000748_output_s00000264<=1]]]]
normalized: ~ [E [true U E [true U ~ [E [decision_s00000783_activated<=0 U [task_s00000748_output_s00000264<=1 | [task_s00000759_output_s00000264<=task_s00000748_output_s00000264 & ~ [E [true U ~ [1<=task_s00000706_input_s00000263]]]]]]]]]]
abstracting: (1<=task_s00000706_input_s00000263)
states: 5
abstracting: (task_s00000759_output_s00000264<=task_s00000748_output_s00000264)
states: 8,365 (3)
abstracting: (task_s00000748_output_s00000264<=1)
states: 8,370 (3)
abstracting: (decision_s00000783_activated<=0)
states: 8,365 (3)
-> the formula is TRUE
FORMULA IBM703-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: ~ [[EG [task_s00000762_inputCriterion_s00000257_used<=task_s00000727_output_s00000264] | AX [EG [[AF [decision_s00000793_activated<=task_s00000727_input_s00000263] & EG [merge_s00000462_activated<=0]]]]]]
normalized: ~ [[~ [EX [~ [EG [[~ [EG [~ [decision_s00000793_activated<=task_s00000727_input_s00000263]]] & EG [merge_s00000462_activated<=0]]]]]] | EG [task_s00000762_inputCriterion_s00000257_used<=task_s00000727_output_s00000264]]]
abstracting: (task_s00000762_inputCriterion_s00000257_used<=task_s00000727_output_s00000264)
states: 8,345 (3)
........
EG iterations: 8
abstracting: (merge_s00000462_activated<=0)
states: 8,365 (3)
...........
EG iterations: 11
abstracting: (decision_s00000793_activated<=task_s00000727_input_s00000263)
states: 8,365 (3)
.....
EG iterations: 5
.
EG iterations: 1
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.214sec
checking: EX [EF [~ [A [EF [1<=task_s00000731_inputCriterion_s00000257_used] U [[task_s00000732_inputCriterion_s00000257_used<=1 | 1<=decision_s00000796_input_s00000263] | [task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263 | 1<=merge_s00000452_activated]]]]]]
normalized: EX [E [true U ~ [[~ [E [~ [[[task_s00000732_inputCriterion_s00000257_used<=1 | 1<=decision_s00000796_input_s00000263] | [task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263 | 1<=merge_s00000452_activated]]] U [~ [E [true U 1<=task_s00000731_inputCriterion_s00000257_used]] & ~ [[[task_s00000732_inputCriterion_s00000257_used<=1 | 1<=decision_s00000796_input_s00000263] | [task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263 | 1<=merge_s00000452_activated]]]]]] & ~ [EG [~ [[[task_s00000732_inputCriterion_s00000257_used<=1 | 1<=decision_s00000796_input_s00000263] | [task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263 | 1<=merge_s00000452_activated]]]]]]]]]
abstracting: (1<=merge_s00000452_activated)
states: 5
abstracting: (task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263)
states: 8,369 (3)
abstracting: (1<=decision_s00000796_input_s00000263)
states: 5
abstracting: (task_s00000732_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
.
EG iterations: 1
abstracting: (1<=merge_s00000452_activated)
states: 5
abstracting: (task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263)
states: 8,369 (3)
abstracting: (1<=decision_s00000796_input_s00000263)
states: 5
abstracting: (task_s00000732_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (1<=task_s00000731_inputCriterion_s00000257_used)
states: 5
abstracting: (1<=merge_s00000452_activated)
states: 5
abstracting: (task_s00000714_inputCriterion_s00000257_used<=task_s00000757_input_s00000263)
states: 8,369 (3)
abstracting: (1<=decision_s00000796_input_s00000263)
states: 5
abstracting: (task_s00000732_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: A [AF [~ [E [[AF [1<=task_s00000731_inputCriterion_s00000257_used] & task_s00000735_inputCriterion_s00000257_used<=task_s00000732_input_s00000263] U [~ [1<=task_s00000711_inputCriterion_s00000257_used] & AG [task_s00000720_input_s00000263<=task_s00000748_output_s00000264]]]]] U ~ [task_s00000749_output_s00000264<=0]]
normalized: [~ [E [task_s00000749_output_s00000264<=0 U [EG [E [[~ [EG [~ [1<=task_s00000731_inputCriterion_s00000257_used]]] & task_s00000735_inputCriterion_s00000257_used<=task_s00000732_input_s00000263] U [~ [1<=task_s00000711_inputCriterion_s00000257_used] & ~ [E [true U ~ [task_s00000720_input_s00000263<=task_s00000748_output_s00000264]]]]]] & task_s00000749_output_s00000264<=0]]] & ~ [EG [task_s00000749_output_s00000264<=0]]]
abstracting: (task_s00000749_output_s00000264<=0)
states: 8,100 (3)
...........................................................
EG iterations: 59
abstracting: (task_s00000749_output_s00000264<=0)
states: 8,100 (3)
abstracting: (task_s00000720_input_s00000263<=task_s00000748_output_s00000264)
states: 8,365 (3)
abstracting: (1<=task_s00000711_inputCriterion_s00000257_used)
states: 1
abstracting: (task_s00000735_inputCriterion_s00000257_used<=task_s00000732_input_s00000263)
states: 8,100 (3)
abstracting: (1<=task_s00000731_inputCriterion_s00000257_used)
states: 5
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (task_s00000749_output_s00000264<=0)
states: 8,100 (3)
-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.862sec
checking: EG [[[EX [1<=task_s00000746_output_s00000264] & ~ [task_s00000738_output_s00000264<=task_s00000716_input_s00000263]] | [AF [~ [1<=decision_s00000787_activated]] & [AF [EG [task_s00000706_inputCriterion_s00000257_used<=0]] & EF [EF [decision_s00000783_input_s00000263<=task_s00000754_output_s00000264]]]]]]
normalized: EG [[[[~ [EG [~ [EG [task_s00000706_inputCriterion_s00000257_used<=0]]]] & E [true U E [true U decision_s00000783_input_s00000263<=task_s00000754_output_s00000264]]] & ~ [EG [1<=decision_s00000787_activated]]] | [~ [task_s00000738_output_s00000264<=task_s00000716_input_s00000263] & EX [1<=task_s00000746_output_s00000264]]]]
abstracting: (1<=task_s00000746_output_s00000264)
states: 125
.abstracting: (task_s00000738_output_s00000264<=task_s00000716_input_s00000263)
states: 8,365 (3)
abstracting: (1<=decision_s00000787_activated)
states: 5
.....
EG iterations: 5
abstracting: (decision_s00000783_input_s00000263<=task_s00000754_output_s00000264)
states: 8,365 (3)
abstracting: (task_s00000706_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
...........................
EG iterations: 27
............................
EG iterations: 28
EG iterations: 0
-> the formula is TRUE
FORMULA IBM703-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.806sec
checking: AX [AG [[A [~ [AF [1<=task_s00000724_output_s00000264]] U ~ [[1<=task_s00000730_output_s00000264 & task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263]]] & AF [[EX [merge_s00000806_activated<=0] & A [task_s00000722_output_s00000264<=merge_s00000452_input_s00000285 U task_s00000742_inputCriterion_s00000257_used<=1]]]]]]
normalized: ~ [EX [E [true U ~ [[[~ [E [[1<=task_s00000730_output_s00000264 & task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263] U [[1<=task_s00000730_output_s00000264 & task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263] & ~ [EG [~ [1<=task_s00000724_output_s00000264]]]]]] & ~ [EG [[1<=task_s00000730_output_s00000264 & task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263]]]] & ~ [EG [~ [[[~ [E [~ [task_s00000742_inputCriterion_s00000257_used<=1] U [~ [task_s00000722_output_s00000264<=merge_s00000452_input_s00000285] & ~ [task_s00000742_inputCriterion_s00000257_used<=1]]]] & ~ [EG [~ [task_s00000742_inputCriterion_s00000257_used<=1]]]] & EX [merge_s00000806_activated<=0]]]]]]]]]]
abstracting: (merge_s00000806_activated<=0)
states: 8,365 (3)
.abstracting: (task_s00000742_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
.
EG iterations: 1
abstracting: (task_s00000742_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (task_s00000722_output_s00000264<=merge_s00000452_input_s00000285)
states: 8,365 (3)
abstracting: (task_s00000742_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
..
EG iterations: 2
abstracting: (task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263)
states: 8,369 (3)
abstracting: (1<=task_s00000730_output_s00000264)
states: 5
.....
EG iterations: 5
abstracting: (1<=task_s00000724_output_s00000264)
states: 25
.........
EG iterations: 9
abstracting: (task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263)
states: 8,369 (3)
abstracting: (1<=task_s00000730_output_s00000264)
states: 5
abstracting: (task_s00000711_inputCriterion_s00000257_used<=task_s00000756_input_s00000263)
states: 8,369 (3)
abstracting: (1<=task_s00000730_output_s00000264)
states: 5
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.128sec
checking: ~ [EG [[[[A [~ [1<=callToProcess_s00000348_inputCriterion_s00000257_used] U [merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290 & task_s00000759_inputCriterion_s00000257_used<=0]] | AX [E [task_s00000737_inputCriterion_s00000257_used<=1 U task_s00000756_output_s00000264<=1]]] | task_s00000720_output_s00000264<=task_s00000707_inputCriterion_s00000257_used] & ~ [A [AG [task_s00000763_input_s00000263<=1] U ~ [task_s00000755_input_s00000263<=task_s00000705_input_s00000263]]]]]]
normalized: ~ [EG [[[[~ [EX [~ [E [task_s00000737_inputCriterion_s00000257_used<=1 U task_s00000756_output_s00000264<=1]]]] | [~ [E [~ [[merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290 & task_s00000759_inputCriterion_s00000257_used<=0]] U [~ [[merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290 & task_s00000759_inputCriterion_s00000257_used<=0]] & 1<=callToProcess_s00000348_inputCriterion_s00000257_used]]] & ~ [EG [~ [[merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290 & task_s00000759_inputCriterion_s00000257_used<=0]]]]]] | task_s00000720_output_s00000264<=task_s00000707_inputCriterion_s00000257_used] & ~ [[~ [EG [task_s00000755_input_s00000263<=task_s00000705_input_s00000263]] & ~ [E [task_s00000755_input_s00000263<=task_s00000705_input_s00000263 U [E [true U ~ [task_s00000763_input_s00000263<=1]] & task_s00000755_input_s00000263<=task_s00000705_input_s00000263]]]]]]]]
abstracting: (task_s00000755_input_s00000263<=task_s00000705_input_s00000263)
states: 8,225 (3)
abstracting: (task_s00000763_input_s00000263<=1)
states: 8,370 (3)
abstracting: (task_s00000755_input_s00000263<=task_s00000705_input_s00000263)
states: 8,225 (3)
abstracting: (task_s00000755_input_s00000263<=task_s00000705_input_s00000263)
states: 8,225 (3)
.....................................................................................................
EG iterations: 101
abstracting: (task_s00000720_output_s00000264<=task_s00000707_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (task_s00000759_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
abstracting: (merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290)
states: 8,370 (3)
.....
EG iterations: 5
abstracting: (1<=callToProcess_s00000348_inputCriterion_s00000257_used)
states: 125
abstracting: (task_s00000759_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
abstracting: (merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290)
states: 8,370 (3)
abstracting: (task_s00000759_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
abstracting: (merge_s00000320_input_s00000290<=merge_s00000320_input_s00000290)
states: 8,370 (3)
abstracting: (task_s00000756_output_s00000264<=1)
states: 8,370 (3)
abstracting: (task_s00000737_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
..
EG iterations: 1
-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.078sec
checking: EX [AF [[[A [[task_s00000717_inputCriterion_s00000257_used<=1 & callToProcess_s00000807_input_s00000263<=1] U ~ [merge_s00000457_input_s00000285<=1]] | [~ [fork_s00000466_activated_s00000272<=1] | [AG [task_s00000728_inputCriterion_s00000257_used<=merge_s00000806_activated] & [1<=callToProcess_s00000596_output_s00000264 | 1<=task_s00000741_output_s00000264]]]] & AG [[~ [1<=merge_s00000453_input_s00000290] | [decision_s00000805_activated<=task_s00000712_output_s00000264 | decision_s00000780_input_s00000263<=0]]]]]]
normalized: EX [~ [EG [~ [[~ [E [true U ~ [[~ [1<=merge_s00000453_input_s00000290] | [decision_s00000805_activated<=task_s00000712_output_s00000264 | decision_s00000780_input_s00000263<=0]]]]] & [[~ [EG [merge_s00000457_input_s00000285<=1]] & ~ [E [merge_s00000457_input_s00000285<=1 U [merge_s00000457_input_s00000285<=1 & ~ [[task_s00000717_inputCriterion_s00000257_used<=1 & callToProcess_s00000807_input_s00000263<=1]]]]]] | [[~ [E [true U ~ [task_s00000728_inputCriterion_s00000257_used<=merge_s00000806_activated]]] & [1<=callToProcess_s00000596_output_s00000264 | 1<=task_s00000741_output_s00000264]] | ~ [fork_s00000466_activated_s00000272<=1]]]]]]]]
abstracting: (fork_s00000466_activated_s00000272<=1)
states: 8,370 (3)
abstracting: (1<=task_s00000741_output_s00000264)
states: 125
abstracting: (1<=callToProcess_s00000596_output_s00000264)
states: 5
abstracting: (task_s00000728_inputCriterion_s00000257_used<=merge_s00000806_activated)
states: 8,365 (3)
abstracting: (callToProcess_s00000807_input_s00000263<=1)
states: 8,370 (3)
abstracting: (task_s00000717_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (merge_s00000457_input_s00000285<=1)
states: 8,370 (3)
abstracting: (merge_s00000457_input_s00000285<=1)
states: 8,370 (3)
abstracting: (merge_s00000457_input_s00000285<=1)
states: 8,370 (3)
EG iterations: 0
abstracting: (decision_s00000780_input_s00000263<=0)
states: 8,365 (3)
abstracting: (decision_s00000805_activated<=task_s00000712_output_s00000264)
states: 8,365 (3)
abstracting: (1<=merge_s00000453_input_s00000290)
states: 5
.................................
EG iterations: 33
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.622sec
checking: EF [[EX [[[AG [task_s00000739_input_s00000263<=fork_s00000465_activated_s00000274] & [~ [1<=task_s00000721_input_s00000263] & AF [task_s00000754_output_s00000264<=0]]] | [A [task_s00000712_output_s00000264<=0 U 1<=task_s00000761_input_s00000263] & [[task_s00000763_input_s00000263<=1 & task_s00000711_output_s00000264<=1] & ~ [1<=decision_s00000784_activated]]]]] & E [EF [task_s00000715_output_s00000264<=1] U ~ [[~ [AX [task_s00000738_input_s00000263<=0]] | task_s00000747_inputCriterion_s00000257_used<=1]]]]]
normalized: E [true U [EX [[[[~ [EG [~ [task_s00000754_output_s00000264<=0]]] & ~ [1<=task_s00000721_input_s00000263]] & ~ [E [true U ~ [task_s00000739_input_s00000263<=fork_s00000465_activated_s00000274]]]] | [[~ [EG [~ [1<=task_s00000761_input_s00000263]]] & ~ [E [~ [1<=task_s00000761_input_s00000263] U [~ [1<=task_s00000761_input_s00000263] & ~ [task_s00000712_output_s00000264<=0]]]]] & [[task_s00000763_input_s00000263<=1 & task_s00000711_output_s00000264<=1] & ~ [1<=decision_s00000784_activated]]]]] & E [E [true U task_s00000715_output_s00000264<=1] U ~ [[task_s00000747_inputCriterion_s00000257_used<=1 | EX [~ [task_s00000738_input_s00000263<=0]]]]]]]
abstracting: (task_s00000738_input_s00000263<=0)
states: 8,365 (3)
.abstracting: (task_s00000747_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (task_s00000715_output_s00000264<=1)
states: 8,370 (3)
abstracting: (1<=decision_s00000784_activated)
states: 5
abstracting: (task_s00000711_output_s00000264<=1)
states: 8,370 (3)
abstracting: (task_s00000763_input_s00000263<=1)
states: 8,370 (3)
abstracting: (task_s00000712_output_s00000264<=0)
states: 8,369 (3)
abstracting: (1<=task_s00000761_input_s00000263)
states: 5
abstracting: (1<=task_s00000761_input_s00000263)
states: 5
abstracting: (1<=task_s00000761_input_s00000263)
states: 5
.
EG iterations: 1
abstracting: (task_s00000739_input_s00000263<=fork_s00000465_activated_s00000274)
states: 8,365 (3)
abstracting: (1<=task_s00000721_input_s00000263)
states: 145
abstracting: (task_s00000754_output_s00000264<=0)
states: 8,145 (3)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.091sec
checking: AX [[[EX [E [AF [1<=task_s00000704_output_s00000264] U [1<=merge_s00000451_input_s00000285 & task_s00000713_output_s00000264<=task_s00000755_output_s00000264]]] | AG [merge_s00000319_activated<=0]] & A [~ [[[EX [task_s00000745_input_s00000263<=decision_s00000784_input_s00000263] | EX [1<=callToProcess_s00000348_inputCriterion_s00000257_used]] & EG [1<=task_s00000719_input_s00000263]]] U ~ [[EG [process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264] & [AF [task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274] | AX [1<=task_s00000715_input_s00000263]]]]]]]
normalized: ~ [EX [~ [[[~ [E [true U ~ [merge_s00000319_activated<=0]]] | EX [E [~ [EG [~ [1<=task_s00000704_output_s00000264]]] U [1<=merge_s00000451_input_s00000285 & task_s00000713_output_s00000264<=task_s00000755_output_s00000264]]]] & [~ [EG [[[~ [EX [~ [1<=task_s00000715_input_s00000263]]] | ~ [EG [~ [task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274]]]] & EG [process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264]]]] & ~ [E [[[~ [EX [~ [1<=task_s00000715_input_s00000263]]] | ~ [EG [~ [task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274]]]] & EG [process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264]] U [[[EX [1<=callToProcess_s00000348_inputCriterion_s00000257_used] | EX [task_s00000745_input_s00000263<=decision_s00000784_input_s00000263]] & EG [1<=task_s00000719_input_s00000263]] & [[~ [EX [~ [1<=task_s00000715_input_s00000263]]] | ~ [EG [~ [task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274]]]] & EG [process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264]]]]]]]]]]
abstracting: (process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264)
states: 8,369 (3)
..
EG iterations: 2
abstracting: (task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274)
states: 8,365 (3)
.....
EG iterations: 5
abstracting: (1<=task_s00000715_input_s00000263)
states: 1
.abstracting: (1<=task_s00000719_input_s00000263)
states: 5
.....
EG iterations: 5
abstracting: (task_s00000745_input_s00000263<=decision_s00000784_input_s00000263)
states: 8,345 (3)
.abstracting: (1<=callToProcess_s00000348_inputCriterion_s00000257_used)
states: 125
.abstracting: (process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264)
states: 8,369 (3)
..
EG iterations: 2
abstracting: (task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274)
states: 8,365 (3)
.....
EG iterations: 5
abstracting: (1<=task_s00000715_input_s00000263)
states: 1
.abstracting: (process_s00000030__s00000703_input_s00000263<=task_s00000742_output_s00000264)
states: 8,369 (3)
..
EG iterations: 2
abstracting: (task_s00000759_output_s00000264<=fork_s00000463_activated_s00000274)
states: 8,365 (3)
.....
EG iterations: 5
abstracting: (1<=task_s00000715_input_s00000263)
states: 1
..
EG iterations: 1
abstracting: (task_s00000713_output_s00000264<=task_s00000755_output_s00000264)
states: 6,731 (3)
abstracting: (1<=merge_s00000451_input_s00000285)
states: 20
abstracting: (1<=task_s00000704_output_s00000264)
states: 5
..............
EG iterations: 14
.abstracting: (merge_s00000319_activated<=0)
states: 8,225 (3)
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.506sec
checking: E [E [~ [EF [[[1<=fork_s00000464_activated_s00000274 & 1<=merge_s00000451_activated] & decision_s00000773_activated<=merge_s00000320_input_s00000263]]] U [[[[[1<=merge_s00000283_input_s00000263 & task_s00000724_input_s00000263<=0] | ~ [merge_s00000341_input_s00000263<=1]] | task_s00000747_input_s00000263<=1] & 1<=task_s00000752_output_s00000264] & EX [task_s00000714_output_s00000264<=decision_s00000780_activated]]] U AG [A [~ [1<=task_s00000732_input_s00000263] U decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used]]]
normalized: E [E [~ [E [true U [[1<=fork_s00000464_activated_s00000274 & 1<=merge_s00000451_activated] & decision_s00000773_activated<=merge_s00000320_input_s00000263]]] U [EX [task_s00000714_output_s00000264<=decision_s00000780_activated] & [1<=task_s00000752_output_s00000264 & [task_s00000747_input_s00000263<=1 | [~ [merge_s00000341_input_s00000263<=1] | [1<=merge_s00000283_input_s00000263 & task_s00000724_input_s00000263<=0]]]]]] U ~ [E [true U ~ [[~ [EG [~ [decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used]]] & ~ [E [~ [decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used] U [1<=task_s00000732_input_s00000263 & ~ [decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used]]]]]]]]]
abstracting: (decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (1<=task_s00000732_input_s00000263)
states: 270
abstracting: (decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (decision_s00000764_activated<=task_s00000752_inputCriterion_s00000257_used)
states: 8,365 (3)
.....
EG iterations: 5
abstracting: (task_s00000724_input_s00000263<=0)
states: 8,345 (3)
abstracting: (1<=merge_s00000283_input_s00000263)
states: 5
abstracting: (merge_s00000341_input_s00000263<=1)
states: 8,370 (3)
abstracting: (task_s00000747_input_s00000263<=1)
states: 8,370 (3)
abstracting: (1<=task_s00000752_output_s00000264)
states: 1
abstracting: (task_s00000714_output_s00000264<=decision_s00000780_activated)
states: 8,369 (3)
.abstracting: (decision_s00000773_activated<=merge_s00000320_input_s00000263)
states: 8,245 (3)
abstracting: (1<=merge_s00000451_activated)
states: 25
abstracting: (1<=fork_s00000464_activated_s00000274)
states: 270
-> the formula is TRUE
FORMULA IBM703-PT-none-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.066sec
checking: A [EG [~ [A [[~ [task_s00000752_output_s00000264<=1] & AG [merge_s00000454_activated<=0]] U task_s00000714_inputCriterion_s00000257_used<=0]]] U [~ [EF [E [[1<=task_s00000721_output_s00000264 & fork_s00000464_input_s00000263<=0] U [merge_s00000451_input_s00000285<=0 | decision_s00000784_input_s00000263<=0]]]] | ~ [[[[EF [task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264] & [[1<=decision_s00000787_input_s00000263 | 1<=merge_s00000455_input_s00000290] & [task_s00000718_inputCriterion_s00000257_used<=1 & task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated]]] | [[~ [1<=task_s00000723_inputCriterion_s00000257_used] & 1<=task_s00000737_output_s00000264] & AG [task_s00000744_inputCriterion_s00000257_used<=0]]] | EG [EF [task_s00000725_input_s00000263<=1]]]]]]
normalized: [~ [EG [~ [[~ [[EG [E [true U task_s00000725_input_s00000263<=1]] | [[~ [E [true U ~ [task_s00000744_inputCriterion_s00000257_used<=0]]] & [~ [1<=task_s00000723_inputCriterion_s00000257_used] & 1<=task_s00000737_output_s00000264]] | [[[task_s00000718_inputCriterion_s00000257_used<=1 & task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated] & [1<=decision_s00000787_input_s00000263 | 1<=merge_s00000455_input_s00000290]] & E [true U task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264]]]]] | ~ [E [true U E [[1<=task_s00000721_output_s00000264 & fork_s00000464_input_s00000263<=0] U [merge_s00000451_input_s00000285<=0 | decision_s00000784_input_s00000263<=0]]]]]]]] & ~ [E [~ [[~ [[EG [E [true U task_s00000725_input_s00000263<=1]] | [[~ [E [true U ~ [task_s00000744_inputCriterion_s00000257_used<=0]]] & [~ [1<=task_s00000723_inputCriterion_s00000257_used] & 1<=task_s00000737_output_s00000264]] | [[[task_s00000718_inputCriterion_s00000257_used<=1 & task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated] & [1<=decision_s00000787_input_s00000263 | 1<=merge_s00000455_input_s00000290]] & E [true U task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264]]]]] | ~ [E [true U E [[1<=task_s00000721_output_s00000264 & fork_s00000464_input_s00000263<=0] U [merge_s00000451_input_s00000285<=0 | decision_s00000784_input_s00000263<=0]]]]]] U [~ [EG [~ [[~ [E [~ [task_s00000714_inputCriterion_s00000257_used<=0] U [~ [task_s00000714_inputCriterion_s00000257_used<=0] & ~ [[~ [task_s00000752_output_s00000264<=1] & ~ [E [true U ~ [merge_s00000454_activated<=0]]]]]]]] & ~ [EG [~ [task_s00000714_inputCriterion_s00000257_used<=0]]]]]]] & ~ [[~ [[EG [E [true U task_s00000725_input_s00000263<=1]] | [[~ [E [true U ~ [task_s00000744_inputCriterion_s00000257_used<=0]]] & [~ [1<=task_s00000723_inputCriterion_s00000257_used] & 1<=task_s00000737_output_s00000264]] | [[[task_s00000718_inputCriterion_s00000257_used<=1 & task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated] & [1<=decision_s00000787_input_s00000263 | 1<=merge_s00000455_input_s00000290]] & E [true U task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264]]]]] | ~ [E [true U E [[1<=task_s00000721_output_s00000264 & fork_s00000464_input_s00000263<=0] U [merge_s00000451_input_s00000285<=0 | decision_s00000784_input_s00000263<=0]]]]]]]]]]
abstracting: (decision_s00000784_input_s00000263<=0)
states: 8,365 (3)
abstracting: (merge_s00000451_input_s00000285<=0)
states: 8,350 (3)
abstracting: (fork_s00000464_input_s00000263<=0)
states: 8,365 (3)
abstracting: (1<=task_s00000721_output_s00000264)
states: 145
abstracting: (task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264)
states: 8,154 (3)
abstracting: (1<=merge_s00000455_input_s00000290)
states: 60
abstracting: (1<=decision_s00000787_input_s00000263)
states: 5
abstracting: (task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated)
states: 8,365 (3)
abstracting: (task_s00000718_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (1<=task_s00000737_output_s00000264)
states: 5
abstracting: (1<=task_s00000723_inputCriterion_s00000257_used)
states: 5
abstracting: (task_s00000744_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
abstracting: (task_s00000725_input_s00000263<=1)
states: 8,370 (3)
EG iterations: 0
abstracting: (task_s00000714_inputCriterion_s00000257_used<=0)
states: 8,369 (3)
..
EG iterations: 2
abstracting: (merge_s00000454_activated<=0)
states: 8,365 (3)
abstracting: (task_s00000752_output_s00000264<=1)
states: 8,370 (3)
abstracting: (task_s00000714_inputCriterion_s00000257_used<=0)
states: 8,369 (3)
abstracting: (task_s00000714_inputCriterion_s00000257_used<=0)
states: 8,369 (3)
..
EG iterations: 2
abstracting: (decision_s00000784_input_s00000263<=0)
states: 8,365 (3)
abstracting: (merge_s00000451_input_s00000285<=0)
states: 8,350 (3)
abstracting: (fork_s00000464_input_s00000263<=0)
states: 8,365 (3)
abstracting: (1<=task_s00000721_output_s00000264)
states: 145
abstracting: (task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264)
states: 8,154 (3)
abstracting: (1<=merge_s00000455_input_s00000290)
states: 60
abstracting: (1<=decision_s00000787_input_s00000263)
states: 5
abstracting: (task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated)
states: 8,365 (3)
abstracting: (task_s00000718_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (1<=task_s00000737_output_s00000264)
states: 5
abstracting: (1<=task_s00000723_inputCriterion_s00000257_used)
states: 5
abstracting: (task_s00000744_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
abstracting: (task_s00000725_input_s00000263<=1)
states: 8,370 (3)
EG iterations: 0
abstracting: (decision_s00000784_input_s00000263<=0)
states: 8,365 (3)
abstracting: (merge_s00000451_input_s00000285<=0)
states: 8,350 (3)
abstracting: (fork_s00000464_input_s00000263<=0)
states: 8,365 (3)
abstracting: (1<=task_s00000721_output_s00000264)
states: 145
abstracting: (task_s00000749_inputCriterion_s00000257_used<=task_s00000713_output_s00000264)
states: 8,154 (3)
abstracting: (1<=merge_s00000455_input_s00000290)
states: 60
abstracting: (1<=decision_s00000787_input_s00000263)
states: 5
abstracting: (task_s00000763_inputCriterion_s00000257_used<=merge_s00000320_activated)
states: 8,365 (3)
abstracting: (task_s00000718_inputCriterion_s00000257_used<=1)
states: 8,370 (3)
abstracting: (1<=task_s00000737_output_s00000264)
states: 5
abstracting: (1<=task_s00000723_inputCriterion_s00000257_used)
states: 5
abstracting: (task_s00000744_inputCriterion_s00000257_used<=0)
states: 8,365 (3)
abstracting: (task_s00000725_input_s00000263<=1)
states: 8,370 (3)
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.099sec
checking: [EF [[~ [EX [[[task_s00000752_output_s00000264<=task_s00000755_inputCriterion_s00000257_used | merge_s00000319_input_s00000290<=task_s00000728_output_s00000264] & EX [decision_s00000789_activated<=merge_s00000319_activated]]]] & [A [~ [EF [decision_s00000775_input_s00000263<=decision_s00000799_activated]] U ~ [E [1<=task_s00000716_input_s00000263 U 1<=task_s00000756_output_s00000264]]] & A [AF [task_s00000707_output_s00000264<=0] U A [1<=merge_s00000446_input_s00000285 U 1<=merge_s00000457_input_s00000285]]]]] | EX [[[~ [EX [[1<=merge_s00000458_input_s00000285 | task_s00000757_input_s00000263<=1]]] | ~ [E [EG [task_s00000713_output_s00000264<=0] U task_s00000711_output_s00000264<=1]]] | EG [A [EG [task_s00000731_inputCriterion_s00000257_used<=task_s00000745_output_s00000264] U A [task_s00000733_output_s00000264<=task_s00000755_input_s00000263 U 1<=task_s00000747_inputCriterion_s00000257_used]]]]]]
normalized: [EX [[[~ [E [EG [task_s00000713_output_s00000264<=0] U task_s00000711_output_s00000264<=1]] | ~ [EX [[1<=merge_s00000458_input_s00000285 | task_s00000757_input_s00000263<=1]]]] | EG [[~ [E [~ [[~ [EG [~ [1<=task_s00000747_inputCriterion_s00000257_used]]] & ~ [E [~ [1<=task_s00000747_inputCriterion_s00000257_used] U [~ [task_s00000733_output_s00000264<=task_s00000755_input_s00000263] & ~ [1<=task_s00000747_inputCriterion_s00000257_used]]]]]] U [~ [[~ [EG [~ [1<=task_s00000747_inputCriterion_s00000257_used]]] & ~ [E [~ [1<=task_s00000747_inputCriterion_s00000257_used] U [~ [task_s00000733_output_s00000264<=task_s00000755_input_s00000263] & ~ [1<=task_s00000747_inputCriterion_s00000257_used]]]]]] & ~ [EG [task_s00000731_inputCriterion_s00000257_used<=task_s00000745_output_s00000264]]]]] & ~ [EG [~ [[~ [EG [~ [1<=task_s00000747_inputCriterion_s00000257_used]]] & ~ [E [~ [1<=task_s00000747_inputCriterion_s00000257_used] U [~ [task_s00000733_output_s00000264<=task_s00000755_input_s00000263] & ~ [1<=task_s00000747_inputCriterion_s00000257_used]]]]]]]]]]]] | E [true U [~ [EX [[[task_s00000752_output_s00000264<=task_s00000755_inputCriterion_s00000257_used | merge_s00000319_input_s00000290<=task_s00000728_output_s00000264] & EX [decision_s00000789_activated<=merge_s00000319_activated]]]] & [[~ [EG [~ [[~ [E [~ [1<=merge_s00000457_input_s00000285] U [~ [1<=merge_s00000457_input_s00000285] & ~ [1<=merge_s00000446_input_s00000285]]]] & ~ [EG [~ [1<=merge_s00000457_input_s00000285]]]]]]] & ~ [E [~ [[~ [E [~ [1<=merge_s00000457_input_s00000285] U [~ [1<=merge_s00000457_input_s00000285] & ~ [1<=merge_s00000446_input_s00000285]]]] & ~ [EG [~ [1<=merge_s00000457_input_s00000285]]]]] U [~ [[~ [E [~ [1<=merge_s00000457_input_s00000285] U [~ [1<=merge_s00000457_input_s00000285] & ~ [1<=merge_s00000446_input_s00000285]]]] & ~ [EG [~ [1<=merge_s00000457_input_s00000285]]]]] & EG [~ [task_s00000707_output_s00000264<=0]]]]]] & [~ [E [E [1<=task_s00000716_input_s00000263 U 1<=task_s00000756_output_s00000264] U [E [1<=task_s00000716_input_s00000263 U 1<=task_s00000756_output_s00000264] & E [true U decision_s00000775_input_s00000263<=decision_s00000799_activated]]]] & ~ [EG [E [1<=task_s00000716_input_s00000263 U 1<=task_s00000756_output_s00000264]]]]]]]]
abstracting: (1<=task_s00000756_output_s00000264)
states: 145
abstracting: (1<=task_s00000716_input_s00000263)
states: 5
................
EG iterations: 16
abstracting: (decision_s00000775_input_s00000263<=decision_s00000799_activated)
states: 8,369 (3)
abstracting: (1<=task_s00000756_output_s00000264)
states: 145
abstracting: (1<=task_s00000716_input_s00000263)
states: 5
abstracting: (1<=task_s00000756_output_s00000264)
states: 145
abstracting: (1<=task_s00000716_input_s00000263)
states: 5
abstracting: (task_s00000707_output_s00000264<=0)
states: 8,365 (3)
.....
EG iterations: 5
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
.
EG iterations: 1
abstracting: (1<=merge_s00000446_input_s00000285)
states: 5
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
.
EG iterations: 1
abstracting: (1<=merge_s00000446_input_s00000285)
states: 5
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
.
EG iterations: 1
abstracting: (1<=merge_s00000446_input_s00000285)
states: 5
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
abstracting: (1<=merge_s00000457_input_s00000285)
states: 125
.
EG iterations: 1
abstracting: (decision_s00000789_activated<=merge_s00000319_activated)
states: 8,365 (3)
.abstracting: (merge_s00000319_input_s00000290<=task_s00000728_output_s00000264)
states: 8,365 (3)
abstracting: (task_s00000752_output_s00000264<=task_s00000755_inputCriterion_s00000257_used)
states: 8,369 (3)
.abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
abstracting: (task_s00000733_output_s00000264<=task_s00000755_input_s00000263)
states: 8,105 (3)
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
......................................................
EG iterations: 54
.
EG iterations: 1
abstracting: (task_s00000731_inputCriterion_s00000257_used<=task_s00000745_output_s00000264)
states: 8,365 (3)
.......
EG iterations: 7
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
abstracting: (task_s00000733_output_s00000264<=task_s00000755_input_s00000263)
states: 8,105 (3)
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
......................................................
EG iterations: 54
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
abstracting: (task_s00000733_output_s00000264<=task_s00000755_input_s00000263)
states: 8,105 (3)
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
abstracting: (1<=task_s00000747_inputCriterion_s00000257_used)
states: 270
......................................................
EG iterations: 54
.......................................................
EG iterations: 55
abstracting: (task_s00000757_input_s00000263<=1)
states: 8,370 (3)
abstracting: (1<=merge_s00000458_input_s00000285)
states: 5
.abstracting: (task_s00000711_output_s00000264<=1)
states: 8,370 (3)
abstracting: (task_s00000713_output_s00000264<=0)
states: 6,702 (3)
.......................................................................................................
EG iterations: 103
.-> the formula is FALSE
FORMULA IBM703-PT-none-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.990sec
totally nodes used: 7938799 (7.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10160023 22021327 32181350
used/not used/entry size/cache size: 25611661 41497203 16 1024MB
basic ops cache: hits/miss/sum: 135322 759245 894567
used/not used/entry size/cache size: 1428114 15349102 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: 7511 14424 21935
used/not used/entry size/cache size: 14407 8374201 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 59990071
1 6400436
2 629419
3 77758
4 9845
5 1152
6 171
7 11
8 1
9 0
>= 10 0
Total processing time: 0m14.287sec
BK_STOP 1678606110204
--------------------
content from stderr:
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:1716 (6), effective:266 (0)
initing FirstDep: 0m 0.000sec
iterations count:1751 (6), effective:256 (0)
iterations count:1681 (5), effective:227 (0)
iterations count:562 (1), effective:67 (0)
iterations count:284 (1), effective:0 (0)
iterations count:286 (1), effective:1 (0)
iterations count:284 (1), effective:0 (0)
iterations count:736 (2), effective:75 (0)
iterations count:655 (2), effective:81 (0)
iterations count:284 (1), effective:0 (0)
iterations count:660 (2), effective:82 (0)
iterations count:291 (1), effective:1 (0)
iterations count:284 (1), effective:0 (0)
iterations count:1751 (6), effective:256 (0)
iterations count:284 (1), effective:0 (0)
iterations count:611 (2), effective:65 (0)
iterations count:284 (1), effective:0 (0)
iterations count:316 (1), effective:9 (0)
iterations count:529 (1), effective:56 (0)
iterations count:284 (1), effective:0 (0)
iterations count:1445 (5), effective:196 (0)
iterations count:315 (1), effective:9 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:293 (1), effective:4 (0)
iterations count:620 (2), effective:69 (0)
iterations count:284 (1), effective:0 (0)
iterations count:535 (1), effective:59 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:293 (1), effective:4 (0)
iterations count:620 (2), effective:69 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:293 (1), effective:4 (0)
iterations count:620 (2), effective:69 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:299 (1), effective:1 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:284 (1), effective:0 (0)
iterations count:304 (1), effective:1 (0)
iterations count:304 (1), effective:1 (0)
iterations count:304 (1), effective:1 (0)
iterations count:572 (2), effective:72 (0)
iterations count:572 (2), effective:72 (0)
iterations count:572 (2), effective:72 (0)
iterations count:729 (2), effective:72 (0)
iterations count:284 (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="IBM703-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is IBM703-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r225-tall-167856407100089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;