About the Execution of Marcie for Solitaire-PT-SqrNC5x5
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10305.376 | 2590428.00 | 2590112.00 | 0.00 | FFFFTFFFTTTTTFFF | 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.r449-smll-167912641400345.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 Solitaire-PT-SqrNC5x5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641400345
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.4K Feb 26 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-00
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-01
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-02
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-03
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-04
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-05
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-06
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-07
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-08
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-09
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-10
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-11
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-12
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-13
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-14
FORMULA_NAME Solitaire-PT-SqrNC5x5-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679268273280
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=Solitaire-PT-SqrNC5x5
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: Solitaire_PT_SqrNC5x5
(NrP: 50 NrTr: 84 NrArc: 456)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.525sec
RS generation: 0m39.307sec
-> reachability set: #nodes 64614 (6.5e+04) #states 16,098,428 (7)
starting MCC model checker
--------------------------
checking: EG [AF [AX [EF [EG [1<=F43]]]]]
normalized: EG [~ [EG [EX [~ [E [true U EG [1<=F43]]]]]]]
abstracting: (1<=F43)
states: 8,165,694 (6)
.................
EG iterations: 17
...............
EG iterations: 14
EG iterations: 0
-> the formula is TRUE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m28.672sec
checking: ~ [EF [EG [EX [F43<=1]]]]
normalized: ~ [E [true U EG [EX [F43<=1]]]]
abstracting: (F43<=1)
states: 16,098,428 (7)
................................................
EG iterations: 47
-> the formula is TRUE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m43.149sec
checking: ~ [EG [[F45<=0 & T62<=1]]]
normalized: ~ [EG [[F45<=0 & T62<=1]]]
abstracting: (T62<=1)
states: 16,098,428 (7)
abstracting: (F45<=0)
states: 7,932,734 (6)
....................
EG iterations: 20
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.554sec
checking: AX [EF [AG [EX [[T33<=0 | T26<=T26]]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U ~ [EX [[T33<=0 | T26<=T26]]]]]]]]]
abstracting: (T26<=T26)
states: 16,098,428 (7)
abstracting: (T33<=0)
states: 8,172,693 (6)
..-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m57.672sec
checking: EX [~ [AG [[T66<=0 | [EF [1<=F63] & E [F33<=0 U F66<=F45]]]]]]
normalized: EX [E [true U ~ [[T66<=0 | [E [F33<=0 U F66<=F45] & E [true U 1<=F63]]]]]]
abstracting: (1<=F63)
states: 8,214,174 (6)
abstracting: (F66<=F45)
states: 12,156,461 (7)
abstracting: (F33<=0)
states: 7,925,735 (6)
before gc: list nodes free: 5377
after gc: idd nodes used:167921, unused:63832079; list nodes free:305380265
abstracting: (T66<=0)
states: 8,010,218 (6)
.-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m35.219sec
checking: ~ [AG [[EX [A [T32<=1 U T65<=1]] | EG [A [1<=F55 U F33<=F53]]]]]
normalized: E [true U ~ [[EG [[~ [EG [~ [F33<=F53]]] & ~ [E [~ [F33<=F53] U [~ [1<=F55] & ~ [F33<=F53]]]]]] | EX [[~ [EG [~ [T65<=1]]] & ~ [E [~ [T65<=1] U [~ [T32<=1] & ~ [T65<=1]]]]]]]]]
abstracting: (T65<=1)
states: 16,098,428 (7)
abstracting: (T32<=1)
states: 16,098,428 (7)
abstracting: (T65<=1)
states: 16,098,428 (7)
abstracting: (T65<=1)
states: 16,098,428 (7)
.
EG iterations: 1
.abstracting: (F33<=F53)
states: 12,054,147 (7)
abstracting: (1<=F55)
states: 8,172,693 (6)
abstracting: (F33<=F53)
states: 12,054,147 (7)
abstracting: (F33<=F53)
states: 12,054,147 (7)
.......................
EG iterations: 23
...........
EG iterations: 11
-> the formula is TRUE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m54.987sec
checking: AF [~ [EG [[AF [~ [T62<=T63]] & [~ [[1<=T44 & 1<=T36]] | E [T66<=T56 U 1<=T24]]]]]]
normalized: ~ [EG [EG [[[E [T66<=T56 U 1<=T24] | ~ [[1<=T44 & 1<=T36]]] & ~ [EG [T62<=T63]]]]]]
abstracting: (T62<=T63)
states: 12,009,368 (7)
.
EG iterations: 1
abstracting: (1<=T36)
states: 7,884,254 (6)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (1<=T24)
states: 7,913,667 (6)
abstracting: (T66<=T56)
states: 12,009,368 (7)
before gc: list nodes free: 2079056
after gc: idd nodes used:312640, unused:63687360; list nodes free:306769066
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m15.347sec
checking: E [EF [[[EX [[1<=F65 & T35<=T46]] | AG [AX [1<=F34]]] | ~ [[EX [F52<=T63] & 1<=T52]]]] U ~ [AX [EX [~ [EG [T62<=1]]]]]]
normalized: E [E [true U [~ [[1<=T52 & EX [F52<=T63]]] | [~ [E [true U EX [~ [1<=F34]]]] | EX [[1<=F65 & T35<=T46]]]]] U EX [~ [EX [~ [EG [T62<=1]]]]]]
abstracting: (T62<=1)
states: 16,098,428 (7)
EG iterations: 0
..abstracting: (T35<=T46)
states: 12,047,081 (7)
abstracting: (1<=F65)
states: 8,214,174 (6)
.abstracting: (1<=F34)
states: 8,165,694 (6)
.abstracting: (F52<=T63)
states: 11,955,451 (7)
.abstracting: (1<=T52)
states: 7,884,254 (6)
-> the formula is TRUE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m42.958sec
checking: A [E [AF [EF [T63<=1]] U A [~ [EG [1<=T34]] U T43<=1]] U [~ [EF [E [1<=F64 U [F64<=0 & 1<=T43]]]] & F24<=T53]]
normalized: [~ [EG [~ [[F24<=T53 & ~ [E [true U E [1<=F64 U [F64<=0 & 1<=T43]]]]]]]] & ~ [E [~ [[F24<=T53 & ~ [E [true U E [1<=F64 U [F64<=0 & 1<=T43]]]]]] U [~ [E [~ [EG [~ [E [true U T63<=1]]]] U [~ [EG [~ [T43<=1]]] & ~ [E [~ [T43<=1] U [EG [1<=T34] & ~ [T43<=1]]]]]]] & ~ [[F24<=T53 & ~ [E [true U E [1<=F64 U [F64<=0 & 1<=T43]]]]]]]]]]
abstracting: (1<=T43)
states: 7,932,734 (6)
abstracting: (F64<=0)
states: 7,913,667 (6)
abstracting: (1<=F64)
states: 8,184,761 (6)
abstracting: (F24<=T53)
states: 11,960,178 (7)
abstracting: (T43<=1)
states: 16,098,428 (7)
abstracting: (1<=T34)
states: 7,932,734 (6)
....................
EG iterations: 20
abstracting: (T43<=1)
states: 16,098,428 (7)
abstracting: (T43<=1)
states: 16,098,428 (7)
.
EG iterations: 1
abstracting: (T63<=1)
states: 16,098,428 (7)
.
EG iterations: 1
abstracting: (1<=T43)
states: 7,932,734 (6)
abstracting: (F64<=0)
states: 7,913,667 (6)
abstracting: (1<=F64)
states: 8,184,761 (6)
abstracting: (F24<=T53)
states: 11,960,178 (7)
abstracting: (1<=T43)
states: 7,932,734 (6)
abstracting: (F64<=0)
states: 7,913,667 (6)
abstracting: (1<=F64)
states: 8,184,761 (6)
abstracting: (F24<=T53)
states: 11,960,178 (7)
.......................
EG iterations: 23
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m27.760sec
checking: A [AF [[A [[EF [T34<=0] & AG [F24<=1]] U 1<=T25] & [~ [EG [1<=T33]] & EX [F63<=0]]]] U E [~ [F64<=T42] U AG [[~ [AF [1<=F65]] | AX [F45<=T44]]]]]
normalized: [~ [EG [~ [E [~ [F64<=T42] U ~ [E [true U ~ [[EG [~ [1<=F65]] | ~ [EX [~ [F45<=T44]]]]]]]]]]] & ~ [E [~ [E [~ [F64<=T42] U ~ [E [true U ~ [[EG [~ [1<=F65]] | ~ [EX [~ [F45<=T44]]]]]]]]] U [~ [E [~ [F64<=T42] U ~ [E [true U ~ [[EG [~ [1<=F65]] | ~ [EX [~ [F45<=T44]]]]]]]]] & EG [~ [[[EX [F63<=0] & ~ [EG [1<=T33]]] & [~ [EG [~ [1<=T25]]] & ~ [E [~ [1<=T25] U [~ [[~ [E [true U ~ [F24<=1]]] & E [true U T34<=0]]] & ~ [1<=T25]]]]]]]]]]]]
abstracting: (1<=T25)
states: 7,884,254 (6)
abstracting: (T34<=0)
states: 8,165,694 (6)
abstracting: (F24<=1)
states: 16,098,428 (7)
abstracting: (1<=T25)
states: 7,884,254 (6)
before gc: list nodes free: 2591167
after gc: idd nodes used:460330, unused:63539670; list nodes free:306071640
abstracting: (1<=T25)
states: 7,884,254 (6)
.
EG iterations: 1
abstracting: (1<=T33)
states: 7,925,735 (6)
......................
EG iterations: 22
abstracting: (F63<=0)
states: 7,884,254 (6)
..
EG iterations: 1
abstracting: (F45<=T44)
states: 11,974,538 (7)
.abstracting: (1<=F65)
states: 8,214,174 (6)
...............................................
EG iterations: 47
abstracting: (F64<=T42)
states: 11,962,461 (7)
abstracting: (F45<=T44)
states: 11,974,538 (7)
.abstracting: (1<=F65)
states: 8,214,174 (6)
...............................................
EG iterations: 47
abstracting: (F64<=T42)
states: 11,962,461 (7)
abstracting: (F45<=T44)
states: 11,974,538 (7)
.abstracting: (1<=F65)
states: 8,214,174 (6)
...............................................
EG iterations: 47
abstracting: (F64<=T42)
states: 11,962,461 (7)
.............................................
EG iterations: 45
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m 8.223sec
checking: ~ [[~ [AF [AF [~ [AF [T64<=1]]]]] | E [E [[E [1<=T23 U 1<=T32] & AG [1<=F36]] U ~ [EX [F63<=F55]]] U AG [~ [[[F45<=F42 | 1<=T34] & AG [F65<=T44]]]]]]]
normalized: ~ [[E [E [[~ [E [true U ~ [1<=F36]]] & E [1<=T23 U 1<=T32]] U ~ [EX [F63<=F55]]] U ~ [E [true U [~ [E [true U ~ [F65<=T44]]] & [F45<=F42 | 1<=T34]]]]] | EG [EG [~ [EG [~ [T64<=1]]]]]]]
abstracting: (T64<=1)
states: 16,098,428 (7)
.
EG iterations: 1
EG iterations: 0
EG iterations: 0
abstracting: (1<=T34)
states: 7,932,734 (6)
abstracting: (F45<=F42)
states: 12,064,466 (7)
abstracting: (F65<=T44)
states: 11,954,314 (7)
before gc: list nodes free: 836403
after gc: idd nodes used:458832, unused:63541168; list nodes free:308179500
abstracting: (F63<=F55)
states: 12,027,137 (7)
.abstracting: (1<=T32)
states: 7,884,254 (6)
abstracting: (1<=T23)
states: 7,884,254 (6)
before gc: list nodes free: 5518317
after gc: idd nodes used:640908, unused:63359092; list nodes free:307315048
abstracting: (1<=F36)
states: 8,214,174 (6)
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m57.838sec
checking: [~ [AX [[[1<=F25 | ~ [[AF [F65<=0] | 1<=T42]]] | [[F44<=0 & ~ [T54<=F46]] & [[T54<=0 | ~ [1<=T42]] | AG [1<=F42]]]]]] & ~ [AF [EG [[F23<=0 | [~ [1<=F22] | ~ [1<=T25]]]]]]]
normalized: [EG [~ [EG [[F23<=0 | [~ [1<=T25] | ~ [1<=F22]]]]]] & EX [~ [[[[~ [E [true U ~ [1<=F42]]] | [T54<=0 | ~ [1<=T42]]] & [F44<=0 & ~ [T54<=F46]]] | [1<=F25 | ~ [[1<=T42 | ~ [EG [~ [F65<=0]]]]]]]]]]
abstracting: (F65<=0)
states: 7,884,254 (6)
.
EG iterations: 1
abstracting: (1<=T42)
states: 7,913,667 (6)
abstracting: (1<=F25)
states: 8,214,174 (6)
abstracting: (T54<=F46)
states: 12,220,245 (7)
abstracting: (F44<=0)
states: 7,927,714 (6)
abstracting: (1<=T42)
states: 7,913,667 (6)
abstracting: (T54<=0)
states: 8,165,694 (6)
abstracting: (1<=F42)
states: 8,184,761 (6)
.abstracting: (1<=F22)
states: 8,010,218 (6)
abstracting: (1<=T25)
states: 7,884,254 (6)
abstracting: (F23<=0)
states: 7,884,254 (6)
.
EG iterations: 1
..........................................
EG iterations: 42
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m59.298sec
checking: AG [[EF [[EX [[F66<=T22 | 1<=F43]] & T22<=0]] | AX [[EG [1<=F54] | [[~ [1<=T55] & ~ [1<=T33]] | [F42<=T45 | [F24<=F62 | T26<=0]]]]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[[[F42<=T45 | [F24<=F62 | T26<=0]] | [~ [1<=T33] & ~ [1<=T55]]] | EG [1<=F54]]]]] | E [true U [T22<=0 & EX [[F66<=T22 | 1<=F43]]]]]]]]
abstracting: (1<=F43)
states: 8,165,694 (6)
abstracting: (F66<=T22)
states: 12,113,409 (7)
.abstracting: (T22<=0)
states: 8,010,218 (6)
before gc: list nodes free: 4613011
after gc: idd nodes used:738301, unused:63261699; list nodes free:306850062
abstracting: (1<=F54)
states: 8,165,694 (6)
.................
EG iterations: 17
abstracting: (1<=T55)
states: 7,925,735 (6)
abstracting: (1<=T33)
states: 7,925,735 (6)
abstracting: (T26<=0)
states: 8,010,218 (6)
abstracting: (F24<=F62)
states: 11,984,888 (7)
abstracting: (F42<=T45)
states: 11,966,696 (7)
.
before gc: list nodes free: 5151748
after gc: idd nodes used:1000771, unused:62999229; list nodes free:305600133
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 6m38.164sec
checking: AX [E [[A [[[T33<=0 | 1<=T62] | F43<=F62] U ~ [[T34<=F45 & 1<=F46]]] | [EG [A [T53<=T43 U F55<=T22]] & T32<=0]] U [F45<=0 & [~ [F22<=0] | EG [EX [1<=F35]]]]]]
normalized: ~ [EX [~ [E [[[T32<=0 & EG [[~ [EG [~ [F55<=T22]]] & ~ [E [~ [F55<=T22] U [~ [T53<=T43] & ~ [F55<=T22]]]]]]] | [~ [EG [[T34<=F45 & 1<=F46]]] & ~ [E [[T34<=F45 & 1<=F46] U [~ [[F43<=F62 | [T33<=0 | 1<=T62]]] & [T34<=F45 & 1<=F46]]]]]] U [F45<=0 & [EG [EX [1<=F35]] | ~ [F22<=0]]]]]]]
abstracting: (F22<=0)
states: 8,088,210 (6)
abstracting: (1<=F35)
states: 8,172,693 (6)
................................................
EG iterations: 47
abstracting: (F45<=0)
states: 7,932,734 (6)
abstracting: (1<=F46)
states: 8,184,761 (6)
abstracting: (T34<=F45)
states: 12,207,492 (7)
abstracting: (1<=T62)
states: 8,088,210 (6)
abstracting: (T33<=0)
states: 8,172,693 (6)
abstracting: (F43<=F62)
states: 12,000,985 (7)
abstracting: (1<=F46)
states: 8,184,761 (6)
abstracting: (T34<=F45)
states: 12,207,492 (7)
abstracting: (1<=F46)
states: 8,184,761 (6)
abstracting: (T34<=F45)
states: 12,207,492 (7)
........
EG iterations: 8
abstracting: (F55<=T22)
states: 12,029,690 (7)
abstracting: (T53<=T43)
states: 12,060,067 (7)
abstracting: (F55<=T22)
states: 12,029,690 (7)
abstracting: (F55<=T22)
states: 12,029,690 (7)
.......................
EG iterations: 23
...................
EG iterations: 19
abstracting: (T32<=0)
states: 8,214,174 (6)
before gc: list nodes free: 3194502
after gc: idd nodes used:891057, unused:63108943; list nodes free:306109530
.-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m 7.393sec
checking: [~ [EG [~ [[EG [~ [T22<=0]] | AG [E [T26<=0 U F36<=F46]]]]]] & [EX [E [A [E [F66<=1 U F25<=F32] U [1<=F33 | T64<=1]] U [[~ [T45<=T66] & [F52<=F33 | 1<=F42]] | AG [T64<=1]]]] & AF [[EF [AG [1<=F52]] | EF [1<=F43]]]]]
normalized: [[~ [EG [~ [[E [true U 1<=F43] | E [true U ~ [E [true U ~ [1<=F52]]]]]]]] & EX [E [[~ [EG [~ [[1<=F33 | T64<=1]]]] & ~ [E [~ [[1<=F33 | T64<=1]] U [~ [E [F66<=1 U F25<=F32]] & ~ [[1<=F33 | T64<=1]]]]]] U [~ [E [true U ~ [T64<=1]]] | [[F52<=F33 | 1<=F42] & ~ [T45<=T66]]]]]] & ~ [EG [~ [[~ [E [true U ~ [E [T26<=0 U F36<=F46]]]] | EG [~ [T22<=0]]]]]]]
abstracting: (T22<=0)
states: 8,010,218 (6)
.
EG iterations: 1
abstracting: (F36<=F46)
states: 12,030,083 (7)
abstracting: (T26<=0)
states: 8,010,218 (6)
before gc: list nodes free: 2972761
after gc: idd nodes used:885929, unused:63114071; list nodes free:306147658
........................................
EG iterations: 40
abstracting: (T45<=T66)
states: 12,156,461 (7)
abstracting: (1<=F42)
states: 8,184,761 (6)
abstracting: (F52<=F33)
states: 12,027,137 (7)
abstracting: (T64<=1)
states: 16,098,428 (7)
abstracting: (T64<=1)
states: 16,098,428 (7)
abstracting: (1<=F33)
states: 8,172,693 (6)
abstracting: (F25<=F32)
states: 12,039,542 (7)
abstracting: (F66<=1)
states: 16,098,428 (7)
abstracting: (T64<=1)
states: 16,098,428 (7)
abstracting: (1<=F33)
states: 8,172,693 (6)
abstracting: (T64<=1)
states: 16,098,428 (7)
abstracting: (1<=F33)
states: 8,172,693 (6)
.
EG iterations: 1
.abstracting: (1<=F52)
states: 8,214,174 (6)
before gc: list nodes free: 3538119
after gc: idd nodes used:858596, unused:63141404; list nodes free:306275559
abstracting: (1<=F43)
states: 8,165,694 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 8m27.555sec
checking: ~ [A [A [EX [AX [T22<=0]] U F52<=1] U [[F24<=F52 & EG [EG [1<=T22]]] & [~ [A [F43<=T34 U T32<=F23]] | [[[[T32<=1 | F35<=F23] & F32<=0] & ~ [AG [T46<=1]]] & [~ [A [F22<=F33 U 1<=T44]] & [F44<=0 | AF [1<=T23]]]]]]]]
normalized: ~ [[~ [EG [~ [[[[[[F44<=0 | ~ [EG [~ [1<=T23]]]] & ~ [[~ [EG [~ [1<=T44]]] & ~ [E [~ [1<=T44] U [~ [F22<=F33] & ~ [1<=T44]]]]]]] & [E [true U ~ [T46<=1]] & [F32<=0 & [T32<=1 | F35<=F23]]]] | ~ [[~ [EG [~ [T32<=F23]]] & ~ [E [~ [T32<=F23] U [~ [F43<=T34] & ~ [T32<=F23]]]]]]] & [F24<=F52 & EG [EG [1<=T22]]]]]]] & ~ [E [~ [[[[[[F44<=0 | ~ [EG [~ [1<=T23]]]] & ~ [[~ [EG [~ [1<=T44]]] & ~ [E [~ [1<=T44] U [~ [F22<=F33] & ~ [1<=T44]]]]]]] & [E [true U ~ [T46<=1]] & [F32<=0 & [T32<=1 | F35<=F23]]]] | ~ [[~ [EG [~ [T32<=F23]]] & ~ [E [~ [T32<=F23] U [~ [F43<=T34] & ~ [T32<=F23]]]]]]] & [F24<=F52 & EG [EG [1<=T22]]]]] U [~ [[~ [EG [~ [F52<=1]]] & ~ [E [~ [F52<=1] U [~ [EX [~ [EX [~ [T22<=0]]]]] & ~ [F52<=1]]]]]] & ~ [[[[[[F44<=0 | ~ [EG [~ [1<=T23]]]] & ~ [[~ [EG [~ [1<=T44]]] & ~ [E [~ [1<=T44] U [~ [F22<=F33] & ~ [1<=T44]]]]]]] & [E [true U ~ [T46<=1]] & [F32<=0 & [T32<=1 | F35<=F23]]]] | ~ [[~ [EG [~ [T32<=F23]]] & ~ [E [~ [T32<=F23] U [~ [F43<=T34] & ~ [T32<=F23]]]]]]] & [F24<=F52 & EG [EG [1<=T22]]]]]]]]]]
abstracting: (1<=T22)
states: 8,088,210 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (F24<=F52)
states: 12,063,625 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
abstracting: (F43<=T34)
states: 11,974,532 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
..........................................
EG iterations: 42
abstracting: (F35<=F23)
states: 12,068,618 (7)
abstracting: (T32<=1)
states: 16,098,428 (7)
abstracting: (F32<=0)
states: 7,884,254 (6)
abstracting: (T46<=1)
states: 16,098,428 (7)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (F22<=F33)
states: 12,180,899 (7)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (1<=T44)
states: 7,927,714 (6)
.
EG iterations: 1
abstracting: (1<=T23)
states: 7,884,254 (6)
.
EG iterations: 1
abstracting: (F44<=0)
states: 7,927,714 (6)
abstracting: (F52<=1)
states: 16,098,428 (7)
abstracting: (T22<=0)
states: 8,010,218 (6)
..abstracting: (F52<=1)
states: 16,098,428 (7)
abstracting: (F52<=1)
states: 16,098,428 (7)
.
EG iterations: 1
abstracting: (1<=T22)
states: 8,088,210 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (F24<=F52)
states: 12,063,625 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
abstracting: (F43<=T34)
states: 11,974,532 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
..........................................
EG iterations: 42
abstracting: (F35<=F23)
states: 12,068,618 (7)
abstracting: (T32<=1)
states: 16,098,428 (7)
abstracting: (F32<=0)
states: 7,884,254 (6)
abstracting: (T46<=1)
states: 16,098,428 (7)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (F22<=F33)
states: 12,180,899 (7)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (1<=T44)
states: 7,927,714 (6)
.
EG iterations: 1
abstracting: (1<=T23)
states: 7,884,254 (6)
.
EG iterations: 1
abstracting: (F44<=0)
states: 7,927,714 (6)
abstracting: (1<=T22)
states: 8,088,210 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (F24<=F52)
states: 12,063,625 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
abstracting: (F43<=T34)
states: 11,974,532 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
abstracting: (T32<=F23)
states: 12,285,371 (7)
..........................................
EG iterations: 42
abstracting: (F35<=F23)
states: 12,068,618 (7)
abstracting: (T32<=1)
states: 16,098,428 (7)
abstracting: (F32<=0)
states: 7,884,254 (6)
abstracting: (T46<=1)
states: 16,098,428 (7)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (F22<=F33)
states: 12,180,899 (7)
abstracting: (1<=T44)
states: 7,927,714 (6)
abstracting: (1<=T44)
states: 7,927,714 (6)
.
EG iterations: 1
abstracting: (1<=T23)
states: 7,884,254 (6)
.
EG iterations: 1
abstracting: (F44<=0)
states: 7,927,714 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Solitaire-PT-SqrNC5x5-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m44.089sec
totally nodes used: 684138152 (6.8e+08)
number of garbage collections: 10
fire ops cache: hits/miss/sum: 531703421 1439274106 1970977527
used/not used/entry size/cache size: 60891167 6217697 16 1024MB
basic ops cache: hits/miss/sum: 428548273 919879267 1348427540
used/not used/entry size/cache size: 16758155 19061 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: 1104440 2459718 3564158
used/not used/entry size/cache size: 430076 7958532 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 32154209
1 23078169
2 8874642
3 2398664
4 502246
5 86606
6 12542
7 1584
8 181
9 20
>= 10 1
Total processing time: 43m10.293sec
BK_STOP 1679270863708
--------------------
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
54762 90897
iterations count:249238 (2967), effective:18969 (225)
initing FirstDep: 0m 0.000sec
iterations count:1971 (23), effective:124 (1)
iterations count:44568 (530), effective:3491 (41)
iterations count:9108 (108), effective:695 (8)
iterations count:1093 (13), effective:61 (0)
iterations count:1327 (15), effective:80 (0)
iterations count:73399 (873), effective:5389 (64)
iterations count:8473 (100), effective:460 (5)
iterations count:5535 (65), effective:294 (3)
iterations count:1702 (20), effective:134 (1)
iterations count:84 (1), effective:0 (0)
iterations count:14203 (169), effective:985 (11)
iterations count:5452 (64), effective:351 (4)
iterations count:84 (1), effective:0 (0)
iterations count:84 (1), effective:0 (0)
iterations count:14203 (169), effective:985 (11)
iterations count:5452 (64), effective:351 (4)
iterations count:14203 (169), effective:985 (11)
iterations count:5452 (64), effective:351 (4)
iterations count:1055 (12), effective:56 (0)
iterations count:55139 (656), effective:4014 (47)
iterations count:1598 (19), effective:110 (1)
iterations count:37846 (450), effective:3196 (38)
iterations count:1598 (19), effective:110 (1)
iterations count:37846 (450), effective:3196 (38)
iterations count:199 (2), effective:13 (0)
iterations count:1598 (19), effective:110 (1)
iterations count:37846 (450), effective:3196 (38)
iterations count:2264 (26), effective:174 (2)
iterations count:65197 (776), effective:5203 (61)
iterations count:8073 (96), effective:433 (5)
iterations count:6383 (75), effective:345 (4)
iterations count:10339 (123), effective:593 (7)
iterations count:14584 (173), effective:1401 (16)
iterations count:15401 (183), effective:987 (11)
iterations count:7583 (90), effective:422 (5)
iterations count:80700 (960), effective:6378 (75)
iterations count:3584 (42), effective:214 (2)
iterations count:13700 (163), effective:788 (9)
iterations count:772 (9), effective:56 (0)
iterations count:11711 (139), effective:786 (9)
iterations count:100 (1), effective:4 (0)
iterations count:84 (1), effective:0 (0)
iterations count:14503 (172), effective:925 (11)
iterations count:39458 (469), effective:3114 (37)
iterations count:1533 (18), effective:88 (1)
iterations count:3850 (45), effective:213 (2)
iterations count:7367 (87), effective:413 (4)
iterations count:3850 (45), effective:213 (2)
iterations count:7367 (87), effective:413 (4)
iterations count:3850 (45), effective:213 (2)
iterations count:7367 (87), effective:413 (4)
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="Solitaire-PT-SqrNC5x5"
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 Solitaire-PT-SqrNC5x5, 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 r449-smll-167912641400345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 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 ;