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-167912641300249.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 SmartHome-PT-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641300249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.6K Feb 26 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 05:44 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:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 05:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K 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 SmartHome-PT-13-CTLCardinality-00
FORMULA_NAME SmartHome-PT-13-CTLCardinality-01
FORMULA_NAME SmartHome-PT-13-CTLCardinality-02
FORMULA_NAME SmartHome-PT-13-CTLCardinality-03
FORMULA_NAME SmartHome-PT-13-CTLCardinality-04
FORMULA_NAME SmartHome-PT-13-CTLCardinality-05
FORMULA_NAME SmartHome-PT-13-CTLCardinality-06
FORMULA_NAME SmartHome-PT-13-CTLCardinality-07
FORMULA_NAME SmartHome-PT-13-CTLCardinality-08
FORMULA_NAME SmartHome-PT-13-CTLCardinality-09
FORMULA_NAME SmartHome-PT-13-CTLCardinality-10
FORMULA_NAME SmartHome-PT-13-CTLCardinality-11
FORMULA_NAME SmartHome-PT-13-CTLCardinality-12
FORMULA_NAME SmartHome-PT-13-CTLCardinality-13
FORMULA_NAME SmartHome-PT-13-CTLCardinality-14
FORMULA_NAME SmartHome-PT-13-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679193027269

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=SmartHome-PT-13
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: SmartHome_PT_13
(NrP: 385 NrTr: 407 NrArc: 935)

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

net check time: 0m 0.000sec

init dd package: 0m 3.600sec


RS generation: 1m33.067sec


-> reachability set: #nodes 398798 (4.0e+05) #states 112,986,062,757,343 (14)



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

checking: EF [EG [AF [1<=p82]]]
normalized: E [true U EG [~ [EG [~ [1<=p82]]]]]

abstracting: (1<=p82)
states: 6,558,161,235,571 (12)
.
before gc: list nodes free: 909031

after gc: idd nodes used:1457790, unused:62542210; list nodes free:282748592

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

FORMULA SmartHome-PT-13-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m25.593sec

checking: AG [~ [AG [1<=p342]]]
normalized: ~ [E [true U ~ [E [true U ~ [1<=p342]]]]]

abstracting: (1<=p342)
states: 0
-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57.522sec

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

abstracting: (1<=p321)
states: 0
-> the formula is FALSE

FORMULA SmartHome-PT-13-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.234sec

checking: EF [EX [~ [p138<=p28]]]
normalized: E [true U EX [~ [p138<=p28]]]

abstracting: (p138<=p28)
states: 108,633,916,398,248 (14)

before gc: list nodes free: 3492770

after gc: idd nodes used:925920, unused:63074080; list nodes free:285247365
.-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 8.201sec

checking: AF [EX [AG [[EG [p73<=0] & ~ [EF [1<=p110]]]]]]
normalized: ~ [EG [~ [EX [~ [E [true U ~ [[~ [E [true U 1<=p110]] & EG [p73<=0]]]]]]]]]

abstracting: (p73<=0)
states: 106,427,901,521,772 (14)
.
EG iterations: 1
abstracting: (1<=p110)
states: 4,694,742,191,054 (12)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SmartHome-PT-13-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m56.754sec

checking: EF [AG [AX [~ [[p245<=0 | [p188<=0 | p381<=1]]]]]]
normalized: E [true U ~ [E [true U EX [[p245<=0 | [p188<=0 | p381<=1]]]]]]

abstracting: (p381<=1)
states: 112,986,062,757,343 (14)
abstracting: (p188<=0)
states: 110,326,716,466,118 (14)
abstracting: (p245<=0)
states: 110,109,764,705,457 (14)

before gc: list nodes free: 1936246

after gc: idd nodes used:1620299, unused:62379701; list nodes free:282176455
.-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m10.658sec

checking: AF [[AG [EG [EF [p169<=1]]] | [p226<=1 & AG [[~ [AX [p143<=0]] | 1<=p275]]]]]
normalized: ~ [EG [~ [[[p226<=1 & ~ [E [true U ~ [[1<=p275 | EX [~ [p143<=0]]]]]]] | ~ [E [true U ~ [EG [E [true U p169<=1]]]]]]]]]

abstracting: (p169<=1)
states: 112,986,062,757,343 (14)

EG iterations: 0
abstracting: (p143<=0)
states: 108,277,193,886,271 (14)
.abstracting: (1<=p275)
states: 4,917,149,869,209 (12)
abstracting: (p226<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.948sec

checking: ~ [AG [EG [[EF [~ [p260<=p212]] | AG [~ [p89<=p326]]]]]]
normalized: E [true U ~ [EG [[~ [E [true U p89<=p326]] | E [true U ~ [p260<=p212]]]]]]

abstracting: (p260<=p212)
states: 108,194,012,731,021 (14)
abstracting: (p89<=p326)
states: 106,427,901,521,772 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.681sec

checking: [EF [EG [EF [A [p230<=p378 U 1<=p345]]]] & E [EG [~ [AG [~ [1<=p289]]]] U AX [1<=p287]]]
normalized: [E [EG [E [true U 1<=p289]] U ~ [EX [~ [1<=p287]]]] & E [true U EG [E [true U [~ [EG [~ [1<=p345]]] & ~ [E [~ [1<=p345] U [~ [p230<=p378] & ~ [1<=p345]]]]]]]]]

abstracting: (1<=p345)
states: 0
abstracting: (p230<=p378)
states: 110,373,022,250,241 (14)
abstracting: (1<=p345)
states: 0
abstracting: (1<=p345)
states: 0

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p287)
states: 41,199,398,229 (10)
.abstracting: (1<=p289)
states: 41,199,398,229 (10)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA SmartHome-PT-13-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.104sec

checking: [EX [~ [[EF [AG [1<=p72]] | AG [EG [p199<=0]]]]] & AX [AX [[[E [p88<=0 U p306<=1] | AG [p194<=0]] & AF [AX [p254<=p148]]]]]]
normalized: [~ [EX [EX [~ [[~ [EG [EX [~ [p254<=p148]]]] & [~ [E [true U ~ [p194<=0]]] | E [p88<=0 U p306<=1]]]]]]] & EX [~ [[~ [E [true U ~ [EG [p199<=0]]]] | E [true U ~ [E [true U ~ [1<=p72]]]]]]]]

abstracting: (1<=p72)
states: 0
abstracting: (p199<=0)
states: 110,326,716,466,118 (14)

before gc: list nodes free: 918063

after gc: idd nodes used:2355826, unused:61644174; list nodes free:278938981
.
EG iterations: 1

before gc: list nodes free: 2784392

after gc: idd nodes used:2786961, unused:61213039; list nodes free:276971211
.abstracting: (p306<=1)
states: 112,986,062,757,343 (14)
abstracting: (p88<=0)
states: 106,427,901,521,772 (14)
abstracting: (p194<=0)
states: 110,326,716,466,118 (14)
MC time: 6m42.050sec

checking: AF [AG [EF [[[[p46<=p168 & p43<=p103] & [p116<=1 & p143<=p95]] | ~ [AG [p47<=1]]]]]]
normalized: ~ [EG [E [true U ~ [E [true U [E [true U ~ [p47<=1]] | [[p116<=1 & p143<=p95] & [p46<=p168 & p43<=p103]]]]]]]]

abstracting: (p43<=p103)
states: 108,328,447,695,106 (14)
abstracting: (p46<=p168)
states: 108,437,863,616,459 (14)
abstracting: (p143<=p95)
states: 108,392,316,449,229 (14)
abstracting: (p116<=1)
states: 112,986,062,757,343 (14)
abstracting: (p47<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.432sec

checking: E [A [~ [A [p365<=p43 U [1<=p69 & ~ [p17<=p24]]]] U p168<=0] U EG [[~ [EF [AF [1<=p122]]] & AG [[AF [1<=p205] | AX [1<=p28]]]]]]
normalized: E [[~ [EG [~ [p168<=0]]] & ~ [E [~ [p168<=0] U [[~ [EG [~ [[1<=p69 & ~ [p17<=p24]]]]] & ~ [E [~ [[1<=p69 & ~ [p17<=p24]]] U [~ [p365<=p43] & ~ [[1<=p69 & ~ [p17<=p24]]]]]]] & ~ [p168<=0]]]]] U EG [[~ [E [true U ~ [[~ [EX [~ [1<=p28]]] | ~ [EG [~ [1<=p205]]]]]]] & ~ [E [true U ~ [EG [~ [1<=p122]]]]]]]]

abstracting: (1<=p122)
states: 4,712,583,814,550 (12)

before gc: list nodes free: 5007874

after gc: idd nodes used:3122815, unused:60877185; list nodes free:275459464
.
EG iterations: 1
abstracting: (1<=p205)
states: 2,556,239,829,023 (12)
.
EG iterations: 1
abstracting: (1<=p28)
states: 8,619,346,549,303 (12)
.
before gc: list nodes free: 1261003

after gc: idd nodes used:3412105, unused:60587895; list nodes free:276336472
.
EG iterations: 1
abstracting: (p168<=0)
states: 110,333,471,874,082 (14)
abstracting: (p17<=p24)
states: 112,986,062,757,343 (14)
abstracting: (1<=p69)
states: 1,406,955,586,210 (12)
abstracting: (p365<=p43)
states: 112,986,062,757,343 (14)
abstracting: (p17<=p24)
states: 112,986,062,757,343 (14)
abstracting: (1<=p69)
states: 1,406,955,586,210 (12)
abstracting: (p17<=p24)
states: 112,986,062,757,343 (14)
abstracting: (1<=p69)
states: 1,406,955,586,210 (12)

EG iterations: 0
abstracting: (p168<=0)
states: 110,333,471,874,082 (14)
abstracting: (p168<=0)
states: 110,333,471,874,082 (14)
........
EG iterations: 8
-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m19.074sec

checking: E [A [AF [[[EF [p70<=p289] | p90<=0] | [~ [1<=p237] & AX [p180<=p30]]]] U AG [p141<=p209]] U ~ [EF [[p111<=1 | AX [p305<=p180]]]]]
normalized: E [[~ [EG [E [true U ~ [p141<=p209]]]] & ~ [E [E [true U ~ [p141<=p209]] U [EG [~ [[[~ [EX [~ [p180<=p30]]] & ~ [1<=p237]] | [p90<=0 | E [true U p70<=p289]]]]] & E [true U ~ [p141<=p209]]]]]] U ~ [E [true U [p111<=1 | ~ [EX [~ [p305<=p180]]]]]]]

abstracting: (p305<=p180)
states: 97,435,791,581,699 (13)
.abstracting: (p111<=1)
states: 112,986,062,757,343 (14)
abstracting: (p141<=p209)
states: 108,357,018,954,724 (14)
abstracting: (p70<=p289)
states: 110,115,900,282,998 (14)
abstracting: (p90<=0)
states: 106,427,901,521,772 (14)
abstracting: (1<=p237)
states: 2,876,298,051,886 (12)
abstracting: (p180<=p30)
states: 110,526,639,939,539 (14)

before gc: list nodes free: 4184494

after gc: idd nodes used:5184668, unused:58815332; list nodes free:268429160
..
EG iterations: 1
abstracting: (p141<=p209)
states: 108,357,018,954,724 (14)
abstracting: (p141<=p209)
states: 108,357,018,954,724 (14)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-13-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m22.906sec

checking: EX [[[[p193<=p57 & AF [~ [AX [p89<=p352]]]] | ~ [AG [p228<=p131]]] & [AG [EF [~ [1<=p85]]] | E [~ [[[1<=p332 | 1<=p55] & EG [p260<=p14]]] U EG [[p159<=1 | 1<=p118]]]]]]
normalized: EX [[[E [~ [[EG [p260<=p14] & [1<=p332 | 1<=p55]]] U EG [[p159<=1 | 1<=p118]]] | ~ [E [true U ~ [E [true U ~ [1<=p85]]]]]] & [E [true U ~ [p228<=p131]] | [p193<=p57 & ~ [EG [~ [EX [~ [p89<=p352]]]]]]]]]

abstracting: (p89<=p352)
states: 106,427,901,521,772 (14)
.
before gc: list nodes free: 2853985

after gc: idd nodes used:4830389, unused:59169611; list nodes free:270084097
........
EG iterations: 8
abstracting: (p193<=p57)
states: 110,436,650,591,283 (14)
abstracting: (p228<=p131)
states: 110,140,257,505,450 (14)
abstracting: (1<=p85)
states: 6,558,161,235,571 (12)
abstracting: (1<=p118)
states: 4,712,583,814,550 (12)
abstracting: (p159<=1)
states: 112,986,062,757,343 (14)

EG iterations: 0
abstracting: (1<=p55)
states: 4,674,660,479,433 (12)
abstracting: (1<=p332)
states: 1,077,239,945,542 (12)
abstracting: (p260<=p14)
states: 108,421,887,796,625 (14)

before gc: list nodes free: 3806867

after gc: idd nodes used:5855010, unused:58144990; list nodes free:265496119
.
EG iterations: 1
MC time: 7m 4.004sec

checking: [E [[[~ [AX [1<=p101]] | ~ [AF [[p84<=p223 & p164<=p16]]]] | AF [EX [A [p43<=0 U 1<=p154]]]] U EF [~ [[AG [p62<=1] | 1<=p381]]]] & EF [[EF [~ [EG [p145<=1]]] | ~ [[A [EX [p380<=1] U [1<=p294 | p237<=0]] & [[~ [p367<=1] & p219<=1] & EX [p149<=1]]]]]]]
normalized: [E [true U [~ [[[EX [p149<=1] & [p219<=1 & ~ [p367<=1]]] & [~ [EG [~ [[1<=p294 | p237<=0]]]] & ~ [E [~ [[1<=p294 | p237<=0]] U [~ [EX [p380<=1]] & ~ [[1<=p294 | p237<=0]]]]]]]] | E [true U ~ [EG [p145<=1]]]]] & E [[~ [EG [~ [EX [[~ [EG [~ [1<=p154]]] & ~ [E [~ [1<=p154] U [~ [p43<=0] & ~ [1<=p154]]]]]]]]] | [EG [~ [[p84<=p223 & p164<=p16]]] | EX [~ [1<=p101]]]] U E [true U ~ [[1<=p381 | ~ [E [true U ~ [p62<=1]]]]]]]]

abstracting: (p62<=1)
states: 112,986,062,757,343 (14)
abstracting: (1<=p381)
states: 20,489,056,583,240 (13)
abstracting: (1<=p101)
states: 1,201,341,517,199 (12)

before gc: list nodes free: 2541934

after gc: idd nodes used:5913604, unused:58086396; list nodes free:265123628
.abstracting: (p164<=p16)
states: 110,326,716,466,118 (14)
abstracting: (p84<=p223)
states: 106,594,206,307,701 (14)
.........
EG iterations: 9
abstracting: (1<=p154)
states: 4,726,582,623,692 (12)
abstracting: (p43<=0)
states: 108,328,447,695,106 (14)
abstracting: (1<=p154)
states: 4,726,582,623,692 (12)
abstracting: (1<=p154)
states: 4,726,582,623,692 (12)

before gc: list nodes free: 1723075

after gc: idd nodes used:6406701, unused:57593299; list nodes free:262997692
.
EG iterations: 1
.MC time: 5m18.012sec

checking: AG [[EX [AG [EX [p174<=1]]] | [[[[[~ [p174<=p332] & [p11<=1 | p264<=0]] & EX [p53<=0]] | A [[1<=p61 | 1<=p379] U ~ [p156<=p305]]] & [[[[p365<=0 | p334<=p189] & [p311<=1 | 1<=p147]] & [[1<=p39 | p205<=p341] & EG [p194<=p71]]] & 1<=p199]] & AF [AG [p322<=p86]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [E [true U ~ [p322<=p86]]]] & [[1<=p199 & [[EG [p194<=p71] & [1<=p39 | p205<=p341]] & [[p311<=1 | 1<=p147] & [p365<=0 | p334<=p189]]]] & [[~ [EG [p156<=p305]] & ~ [E [p156<=p305 U [p156<=p305 & ~ [[1<=p61 | 1<=p379]]]]]] | [EX [p53<=0] & [[p11<=1 | p264<=0] & ~ [p174<=p332]]]]]] | EX [~ [E [true U ~ [EX [p174<=1]]]]]]]]]

abstracting: (p174<=1)
states: 112,986,062,757,343 (14)
..abstracting: (p174<=p332)
states: 110,358,767,034,525 (14)
abstracting: (p264<=0)
states: 108,083,821,918,986 (14)
abstracting: (p11<=1)
states: 112,986,062,757,343 (14)
abstracting: (p53<=0)
states: 108,311,402,277,910 (14)
.abstracting: (1<=p379)
states: 10,248,334,181,268 (13)
abstracting: (1<=p61)
states: 4,674,660,479,433 (12)
abstracting: (p156<=p305)
states: 112,986,062,757,343 (14)
abstracting: (p156<=p305)
states: 112,986,062,757,343 (14)
abstracting: (p156<=p305)
states: 112,986,062,757,343 (14)

EG iterations: 0
abstracting: (p334<=p189)
states: 111,854,152,436,033 (14)
abstracting: (p365<=0)
states: 112,986,062,757,343 (14)
abstracting: (1<=p147)
states: 4,726,582,623,692 (12)
abstracting: (p311<=1)
states: 112,986,062,757,343 (14)
abstracting: (p205<=p341)
states: 110,429,822,928,320 (14)
abstracting: (1<=p39)
states: 1,406,955,586,210 (12)
abstracting: (p194<=p71)
states: 110,481,072,460,815 (14)

before gc: list nodes free: 2939733

after gc: idd nodes used:7696560, unused:56303440; list nodes free:257282336
.........
EG iterations: 9
abstracting: (1<=p199)
states: 2,659,346,291,225 (12)
abstracting: (p322<=p86)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
MC time: 3m59.152sec

checking: [EX [~ [[EF [AG [1<=p72]] | AG [EG [p199<=0]]]]] & AX [AX [[[E [p88<=0 U p306<=1] | AG [p194<=0]] & AF [AX [p254<=p148]]]]]]
normalized: [EX [~ [[~ [E [true U ~ [EG [p199<=0]]]] | E [true U ~ [E [true U ~ [1<=p72]]]]]]] & ~ [EX [EX [~ [[~ [EG [EX [~ [p254<=p148]]]] & [~ [E [true U ~ [p194<=0]]] | E [p88<=0 U p306<=1]]]]]]]]

abstracting: (p306<=1)
states: 112,986,062,757,343 (14)
abstracting: (p88<=0)
states: 106,427,901,521,772 (14)
abstracting: (p194<=0)
states: 110,326,716,466,118 (14)

before gc: list nodes free: 4406694

after gc: idd nodes used:7908084, unused:56091916; list nodes free:256462918
abstracting: (p254<=p148)
states: 110,230,009,621,553 (14)
...
EG iterations: 2
..abstracting: (1<=p72)
states: 0

before gc: list nodes free: 4512643

after gc: idd nodes used:7399860, unused:56600140; list nodes free:258632135
abstracting: (p199<=0)
states: 110,326,716,466,118 (14)
.
EG iterations: 1

before gc: list nodes free: 5542393

after gc: idd nodes used:7768692, unused:56231308; list nodes free:256997449
.-> the formula is TRUE

FORMULA SmartHome-PT-13-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 6090736 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16181216 kB

BK_TIME_CONFINEMENT_REACHED

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p261
p311
p62
p309
p76
p292
p323
p213
p295
p325
p298
p299
p329
p283
p314
p316
p317
p322
p201
p313
p296
p126
p330
p294
p331
p157
p202
p75
p327
p124
p80
p72
p297
p319
p125
p79
p77
p74
p64
p282
p326
p156
p155
p315
p81
p337
p339
p341
p342
p310
p344
p345
p134
p348
p349
p351
p352
p328
p353
p354
p356
p357
p359
p103
p360
p78
p361
p343
p363
p203
p366
p338
p369
p358
p308
p365
p293
p350
p362
p320
p364
p346
p355
p318
p347
p165
p300
p63
p284
p336
p324
p321
p340
p312
p8
p19
p15
p3
p18
p7
p21
p17
p22
p16
p20
p12
p11
p10
p9
p41
p6
p5
p4

The net has transition(s) that can never fire:
t20
t9
t133
t38
t39
t40
t41
t287
t288
t289
t290
t291
t292
t293
t294
t295
t297
t305
t306
t307
t332
t345
t346
t347
t348
t349
t350
t351
t352
t355
t356
t357
t358
t359
t360
t361
t362
t363
t364
t374
t375
t376
t377
t378
t379
t380
t381
t382
t383
t261
t144
t145
t146
t189
t198
t199
t200
t8
t77
t225
t234
t235
t236
t2
t3
t1
t4
t5
t6
t7
t26
t24
t25
t11
t23
t22
t21
t36
t19
t37
t0
t27
t42
t50
t51
t52
t35
t34

check for constant places
p315
p316
p320
p321
p324
p325
p343
p344
p347
p356
p357
found 11 constant places
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.001sec


iterations count:73886 (181), effective:5992 (14)

initing FirstDep: 0m 0.001sec


iterations count:675 (1), effective:28 (0)

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

iterations count:1053 (2), effective:44 (0)

iterations count:1055 (2), effective:44 (0)

iterations count:513 (1), effective:22 (0)

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

iterations count:2936 (7), effective:248 (0)

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

iterations count:769 (1), effective:75 (0)

iterations count:823 (2), effective:29 (0)

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

iterations count:815 (2), effective:29 (0)

iterations count:1634 (4), effective:64 (0)

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

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

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

iterations count:822 (2), effective:47 (0)

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

sat_reach.icc:155: Timeout: after 401 sec


iterations count:1140 (2), effective:89 (0)

iterations count:921 (2), effective:32 (0)

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

iterations count:2936 (7), effective:248 (0)

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

iterations count:1054 (2), effective:44 (0)

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

iterations count:1054 (2), effective:44 (0)

iterations count:1054 (2), effective:44 (0)

iterations count:1202 (2), effective:50 (0)

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

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

net_ddint.h:600: Timeout: after 423 sec


iterations count:1034 (2), effective:45 (0)

net_ddint.h:600: Timeout: after 317 sec


iterations count:2936 (7), effective:248 (0)

iterations count:905 (2), effective:39 (0)

sat_reach.icc:155: Timeout: after 238 sec


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

iterations count:820 (2), effective:47 (0)

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

iterations count:822 (2), effective:47 (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="SmartHome-PT-13"
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 SmartHome-PT-13, 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-167912641300249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-13.tgz
mv SmartHome-PT-13 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;