fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r065-smll-167814393000169
Last Updated
May 14, 2023

About the Execution of Marcie for CircularTrains-PT-096

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10153.512 3600000.00 3600099.00 59.40 F?T?TTFF?FT?F?F? 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.r065-smll-167814393000169.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 CircularTrains-PT-096, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.0K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 04:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 73K 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 CircularTrains-PT-096-CTLCardinality-00
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-01
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-02
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-03
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-04
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-05
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-06
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-07
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-08
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-09
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-10
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-11
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-12
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-13
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-14
FORMULA_NAME CircularTrains-PT-096-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678270259324

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=CircularTrains-PT-096
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: CircularTrains_PT_096
(NrP: 192 NrTr: 96 NrArc: 384)

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

net check time: 0m 0.000sec

init dd package: 0m 3.578sec


RS generation: 0m 2.721sec


-> reachability set: #nodes 12299 (1.2e+04) #states 2,591,300,278,296,609,652,179 (21)



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

checking: EG [1<=F70]
normalized: EG [1<=F70]

abstracting: (1<=F70)
states: 1,032,389,510,489,402,280,336 (21)
..................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 909148

after gc: idd nodes used:1579136, unused:62420864; list nodes free:292521543
............................................................................................................
before gc: list nodes free: 1051235

after gc: idd nodes used:2341542, unused:61658458; list nodes free:288965545
...........................................MC time: 3m45.010sec

checking: EG [AF [[F16<=1 | ~ [EG [~ [F22<=1]]]]]]
normalized: EG [~ [EG [~ [[F16<=1 | ~ [EG [~ [F22<=1]]]]]]]]

abstracting: (F22<=1)
states: 2,591,300,278,296,609,652,179 (21)
.
EG iterations: 1
abstracting: (F16<=1)
states: 2,591,300,278,296,609,652,179 (21)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-096-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AF [AG [[1<=Section_59 & F57<=0]]]
normalized: ~ [EG [E [true U ~ [[1<=Section_59 & F57<=0]]]]]

abstracting: (F57<=0)
states: 1,558,910,767,807,207,371,843 (21)
abstracting: (1<=Section_59)
states: 1,032,389,510,489,402,280,336 (21)

EG iterations: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.714sec

checking: AX [~ [AG [AF [A [F78<=Section_80 U Section_17<=1]]]]]
normalized: ~ [EX [~ [E [true U EG [~ [[~ [EG [~ [Section_17<=1]]] & ~ [E [~ [Section_17<=1] U [~ [F78<=Section_80] & ~ [Section_17<=1]]]]]]]]]]]

abstracting: (Section_17<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (F78<=Section_80)
states: 2,085,432,025,125,012,463,350 (21)
abstracting: (Section_17<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (Section_17<=1)
states: 2,591,300,278,296,609,652,179 (21)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CircularTrains-PT-096-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.224sec

checking: AG [AG [[1<=F52 | AX [E [1<=Section_73 U F64<=F32]]]]]
normalized: ~ [E [true U E [true U ~ [[1<=F52 | ~ [EX [~ [E [1<=Section_73 U F64<=F32]]]]]]]]]

abstracting: (F64<=F32)
states: 2,424,191,713,348,205,405,682 (21)
abstracting: (1<=Section_73)
states: 526,521,257,317,805,091,507 (20)
.abstracting: (1<=F52)
states: 1,032,389,510,489,402,280,336 (21)
-> the formula is FALSE

FORMULA CircularTrains-PT-096-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.071sec

checking: ~ [[~ [[EF [AG [~ [F73<=1]]] & AX [F21<=1]]] | AG [AX [~ [E [Section_5<=F73 U 1<=F57]]]]]]
normalized: ~ [[~ [E [true U EX [E [Section_5<=F73 U 1<=F57]]]] | ~ [[~ [EX [~ [F21<=1]]] & E [true U ~ [E [true U F73<=1]]]]]]]

abstracting: (F73<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (F21<=1)
states: 2,591,300,278,296,609,652,179 (21)
.abstracting: (1<=F57)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (Section_5<=F73)
states: 1,978,393,904,301,956,634,801 (21)
.-> the formula is FALSE

FORMULA CircularTrains-PT-096-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.187sec

checking: ~ [EF [~ [A [[~ [AG [1<=F5]] & F13<=1] U [EX [Section_69<=Section_54] | EX [F96<=1]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[EX [F96<=1] | EX [Section_69<=Section_54]]]]] & ~ [E [~ [[EX [F96<=1] | EX [Section_69<=Section_54]]] U [~ [[F13<=1 & E [true U ~ [1<=F5]]]] & ~ [[EX [F96<=1] | EX [Section_69<=Section_54]]]]]]]]]]

abstracting: (Section_69<=Section_54)
states: 1,962,075,573,554,485,757,742 (21)
.abstracting: (F96<=1)
states: 2,591,300,278,296,609,652,179 (21)
.abstracting: (1<=F5)
states: 2,188,135,472,549,331,266,280 (21)
abstracting: (F13<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (Section_69<=Section_54)
states: 1,962,075,573,554,485,757,742 (21)
.abstracting: (F96<=1)
states: 2,591,300,278,296,609,652,179 (21)
.abstracting: (Section_69<=Section_54)
states: 1,962,075,573,554,485,757,742 (21)
.abstracting: (F96<=1)
states: 2,591,300,278,296,609,652,179 (21)
..
EG iterations: 1
-> the formula is TRUE

FORMULA CircularTrains-PT-096-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.016sec

checking: A [[EF [Section_69<=Section_77] & EF [EX [AX [Section_49<=1]]]] U F94<=F48]
normalized: [~ [EG [~ [F94<=F48]]] & ~ [E [~ [F94<=F48] U [~ [[E [true U EX [~ [EX [~ [Section_49<=1]]]]] & E [true U Section_69<=Section_77]]] & ~ [F94<=F48]]]]]

abstracting: (F94<=F48)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_69<=Section_77)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_49<=1)
states: 2,591,300,278,296,609,652,179 (21)
..abstracting: (F94<=F48)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (F94<=F48)
states: 1,962,075,573,554,485,757,742 (21)
................
before gc: list nodes free: 1044670

after gc: idd nodes used:193208, unused:63806792; list nodes free:298983329
.....................................................................................................
before gc: list nodes free: 308855

after gc: idd nodes used:1709354, unused:62290646; list nodes free:291842515
...................................
before gc: list nodes free: 464957

after gc: idd nodes used:1885444, unused:62114556; list nodes free:291097969
.......................
before gc: list nodes free: 555664

after gc: idd nodes used:2605076, unused:61394924; list nodes free:287742733
MC time: 5m38.174sec

checking: AG [AF [EF [[F55<=Section_64 & ~ [[Section_6<=F26 | F1<=F67]]]]]]
normalized: ~ [E [true U EG [~ [E [true U [F55<=Section_64 & ~ [[Section_6<=F26 | F1<=F67]]]]]]]]

abstracting: (F1<=F67)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_6<=F26)
states: 2,437,086,595,848,198,989,310 (21)
abstracting: (F55<=Section_64)
states: 1,768,652,336,054,582,003,322 (21)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircularTrains-PT-096-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.681sec

checking: EX [~ [EG [E [[[1<=F87 | Section_95<=Section_38] | ~ [1<=F31]] U [EF [1<=F57] | AG [1<=Section_56]]]]]]
normalized: EX [~ [EG [E [[~ [1<=F31] | [1<=F87 | Section_95<=Section_38]] U [~ [E [true U ~ [1<=Section_56]]] | E [true U 1<=F57]]]]]]

abstracting: (1<=F57)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (1<=Section_56)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (Section_95<=Section_38)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (1<=F87)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (1<=F31)
states: 1,032,389,510,489,402,280,336 (21)

EG iterations: 0
.-> the formula is FALSE

FORMULA CircularTrains-PT-096-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.750sec

checking: ~ [AG [E [[[[[F36<=1 & 1<=F35] & EG [Section_65<=1]] | AX [Section_48<=0]] & ~ [EX [1<=Section_2]]] U Section_52<=F17]]]
normalized: E [true U ~ [E [[~ [EX [1<=Section_2]] & [~ [EX [~ [Section_48<=0]]] | [EG [Section_65<=1] & [F36<=1 & 1<=F35]]]] U Section_52<=F17]]]

abstracting: (Section_52<=F17)
states: 2,509,457,719,946,146,175,646 (21)
abstracting: (1<=F35)
states: 2,188,135,472,549,331,266,280 (21)
abstracting: (F36<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (Section_65<=1)
states: 2,591,300,278,296,609,652,179 (21)

EG iterations: 0
abstracting: (Section_48<=0)
states: 1,558,910,767,807,207,371,843 (21)
.abstracting: (1<=Section_2)
states: 1,032,389,510,489,402,280,336 (21)
.-> the formula is TRUE

FORMULA CircularTrains-PT-096-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.487sec

checking: [AG [[EG [EG [1<=F45]] & Section_20<=1]] | EG [[A [1<=Section_12 U F54<=0] | AG [E [EF [F72<=Section_81] U EX [Section_82<=F57]]]]]]
normalized: [EG [[~ [E [true U ~ [E [E [true U F72<=Section_81] U EX [Section_82<=F57]]]]] | [~ [EG [~ [F54<=0]]] & ~ [E [~ [F54<=0] U [~ [1<=Section_12] & ~ [F54<=0]]]]]]] | ~ [E [true U ~ [[Section_20<=1 & EG [EG [1<=F45]]]]]]]

abstracting: (1<=F45)
states: 1,032,389,510,489,402,280,336 (21)
................................................................................................................................................................................................................................................................
before gc: list nodes free: 235241

after gc: idd nodes used:1013577, unused:62986423; list nodes free:295160576
........................................................................................................................................
before gc: list nodes free: 2089292

after gc: idd nodes used:1339253, unused:62660747; list nodes free:295729039
.......................................................................................................
before gc: list nodes free: 2175522

after gc: idd nodes used:1701081, unused:62298919; list nodes free:294056516
.........................................................................................
before gc: list nodes free: 2258423

after gc: idd nodes used:1868643, unused:62131357; list nodes free:293278062
.MC time: 7m12.567sec

checking: AF [AG [E [[1<=Section_29 & [~ [F25<=1] & Section_34<=F85]] U [[AG [1<=Section_30] & AF [F35<=F17]] | ~ [[F40<=F55 & 1<=F88]]]]]]
normalized: ~ [EG [E [true U ~ [E [[1<=Section_29 & [Section_34<=F85 & ~ [F25<=1]]] U [~ [[F40<=F55 & 1<=F88]] | [~ [EG [~ [F35<=F17]]] & ~ [E [true U ~ [1<=Section_30]]]]]]]]]]

abstracting: (1<=Section_30)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (F35<=F17)
states: 1,790,266,072,230,545,732,460 (21)
.
EG iterations: 1
abstracting: (1<=F88)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (F40<=F55)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (F25<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (Section_34<=F85)
states: 2,274,520,589,226,179,192,151 (21)
abstracting: (1<=Section_29)
states: 1,032,389,510,489,402,280,336 (21)

EG iterations: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.091sec

checking: ~ [EX [A [[A [[Section_13<=1 | 1<=F79] U EG [Section_3<=F79]] | AG [[Section_36<=1 & Section_84<=1]]] U AG [[AG [F17<=Section_67] | [Section_6<=Section_20 | 1<=F43]]]]]]
normalized: ~ [EX [[~ [EG [E [true U ~ [[[Section_6<=Section_20 | 1<=F43] | ~ [E [true U ~ [F17<=Section_67]]]]]]]] & ~ [E [E [true U ~ [[[Section_6<=Section_20 | 1<=F43] | ~ [E [true U ~ [F17<=Section_67]]]]]] U [~ [[~ [E [true U ~ [[Section_36<=1 & Section_84<=1]]]] | [~ [EG [~ [EG [Section_3<=F79]]]] & ~ [E [~ [EG [Section_3<=F79]] U [~ [[Section_13<=1 | 1<=F79]] & ~ [EG [Section_3<=F79]]]]]]]] & E [true U ~ [[[Section_6<=Section_20 | 1<=F43] | ~ [E [true U ~ [F17<=Section_67]]]]]]]]]]]]

abstracting: (F17<=Section_67)
states: 658,962,825,541,100,695,791 (20)
abstracting: (1<=F43)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (Section_6<=Section_20)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_3<=F79)
states: 1,978,393,904,301,956,634,801 (21)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 887
abstracting: (1<=F79)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (Section_13<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (Section_3<=F79)
states: 1,978,393,904,301,956,634,801 (21)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 887
abstracting: (Section_3<=F79)
states: 1,978,393,904,301,956,634,801 (21)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 887
................................................................
before gc: list nodes free: 2902800

after gc: idd nodes used:538383, unused:63461617; list nodes free:299472890
..............................................................................................................................................................................................
before gc: list nodes free: 3669956

after gc: idd nodes used:1863215, unused:62136785; list nodes free:293295233
.......................................................................................................
before gc: list nodes free: 3541286

after gc: idd nodes used:2075455, unused:61924545; list nodes free:292304853
...MC time: 7m10.008sec

checking: [E [[[~ [EX [EG [1<=F48]]] & ~ [[~ [[F75<=F16 & 1<=F15]] & ~ [Section_15<=0]]]] & ~ [[~ [A [F78<=Section_91 U Section_28<=1]] | AF [~ [F52<=0]]]]] U AF [AG [AG [Section_31<=0]]]] & A [EG [Section_61<=F23] U [EX [EX [~ [F16<=1]]] & [E [[1<=F73 | [F22<=Section_61 & F46<=F50]] U AF [Section_24<=0]] | EX [EF [1<=Section_94]]]]]]
normalized: [[~ [EG [~ [[[EX [E [true U 1<=Section_94]] | E [[1<=F73 | [F22<=Section_61 & F46<=F50]] U ~ [EG [~ [Section_24<=0]]]]] & EX [EX [~ [F16<=1]]]]]]] & ~ [E [~ [[[EX [E [true U 1<=Section_94]] | E [[1<=F73 | [F22<=Section_61 & F46<=F50]] U ~ [EG [~ [Section_24<=0]]]]] & EX [EX [~ [F16<=1]]]]] U [~ [EG [Section_61<=F23]] & ~ [[[EX [E [true U 1<=Section_94]] | E [[1<=F73 | [F22<=Section_61 & F46<=F50]] U ~ [EG [~ [Section_24<=0]]]]] & EX [EX [~ [F16<=1]]]]]]]]] & E [[~ [[~ [EG [F52<=0]] | ~ [[~ [EG [~ [Section_28<=1]]] & ~ [E [~ [Section_28<=1] U [~ [F78<=Section_91] & ~ [Section_28<=1]]]]]]]] & [~ [[~ [Section_15<=0] & ~ [[F75<=F16 & 1<=F15]]]] & ~ [EX [EG [1<=F48]]]]] U ~ [EG [E [true U E [true U ~ [Section_31<=0]]]]]]]

abstracting: (Section_31<=0)
states: 2,064,779,020,978,804,560,672 (21)

EG iterations: 0
abstracting: (1<=F48)
states: 1,032,389,510,489,402,280,336 (21)
..............................................................................................................................................................
before gc: list nodes free: 2848808

after gc: idd nodes used:680689, unused:63319311; list nodes free:298787447
...............................................................................................................................................................................................
before gc: list nodes free: 2120656

after gc: idd nodes used:1267131, unused:62732869; list nodes free:295992788
..............................................................................................................................
before gc: list nodes free: 2251299

after gc: idd nodes used:1777453, unused:62222547; list nodes free:293692169
...............................MC time: 5m58.002sec

checking: ~ [[AG [E [[E [Section_77<=F73 U 1<=Section_16] | ~ [Section_45<=F55]] U [AG [1<=Section_44] | [[1<=F10 & F26<=F67] | A [1<=F85 U 1<=F49]]]]] | ~ [A [[E [EX [Section_68<=0] U [F67<=1 | 1<=F79]] | E [Section_13<=1 U [F59<=0 & 1<=F67]]] U EX [[1<=Section_88 & [Section_21<=Section_82 & Section_27<=Section_8]]]]]]]
normalized: ~ [[~ [E [true U ~ [E [[~ [Section_45<=F55] | E [Section_77<=F73 U 1<=Section_16]] U [[[~ [EG [~ [1<=F49]]] & ~ [E [~ [1<=F49] U [~ [1<=F85] & ~ [1<=F49]]]]] | [1<=F10 & F26<=F67]] | ~ [E [true U ~ [1<=Section_44]]]]]]]] | ~ [[~ [EG [~ [EX [[1<=Section_88 & [Section_21<=Section_82 & Section_27<=Section_8]]]]]] & ~ [E [~ [EX [[1<=Section_88 & [Section_21<=Section_82 & Section_27<=Section_8]]]] U [~ [[E [EX [Section_68<=0] U [F67<=1 | 1<=F79]] | E [Section_13<=1 U [F59<=0 & 1<=F67]]]] & ~ [EX [[1<=Section_88 & [Section_21<=Section_82 & Section_27<=Section_8]]]]]]]]]]]

abstracting: (Section_27<=Section_8)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_21<=Section_82)
states: 1,768,652,336,054,582,003,322 (21)
abstracting: (1<=Section_88)
states: 526,521,257,317,805,091,507 (20)
.abstracting: (1<=F67)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (F59<=0)
states: 403,164,805,747,278,385,899 (20)
abstracting: (Section_13<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (1<=F79)
states: 1,032,389,510,489,402,280,336 (21)
abstracting: (F67<=1)
states: 2,591,300,278,296,609,652,179 (21)
abstracting: (Section_68<=0)
states: 1,558,910,767,807,207,371,843 (21)
.abstracting: (Section_27<=Section_8)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_21<=Section_82)
states: 1,768,652,336,054,582,003,322 (21)
abstracting: (1<=Section_88)
states: 526,521,257,317,805,091,507 (20)
.abstracting: (Section_27<=Section_8)
states: 1,962,075,573,554,485,757,742 (21)
abstracting: (Section_21<=Section_82)
states: 1,768,652,336,054,582,003,322 (21)
abstracting: (1<=Section_88)
states: 526,521,257,317,805,091,507 (20)
..............................
before gc: list nodes free: 2168530

after gc: idd nodes used:1136000, unused:62864000; list nodes free:296621928
.........................
before gc: list nodes free: 1231373

after gc: idd nodes used:2645266, unused:61354734; list nodes free:289551388
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 6073448 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16181444 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:7616 (79), effective:1536 (16)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 224 sec


iterations count:416 (4), effective:46 (0)

iterations count:186 (1), effective:30 (0)

iterations count:1211 (12), effective:222 (2)

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

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

iterations count:500 (5), effective:73 (0)

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

iterations count:751 (7), effective:97 (1)

iterations count:117 (1), effective:7 (0)

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

net_ddint.h:600: Timeout: after 336 sec


iterations count:1488 (15), effective:282 (2)

iterations count:422 (4), effective:48 (0)

iterations count:422 (4), effective:48 (0)

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

iterations count:198 (2), effective:34 (0)

iterations count:1548 (16), effective:303 (3)

ctl_mc.icc:221: Timeout: after 430 sec


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

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

iterations count:842 (8), effective:128 (1)

iterations count:372 (3), effective:92 (0)

iterations count:886 (9), effective:142 (1)

net_ddint.h:600: Timeout: after 429 sec


iterations count:563 (5), effective:95 (0)

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

net_ddint.h:600: Timeout: after 357 sec


iterations count:707 (7), effective:143 (1)

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

net_ddint.h:600: Timeout: after 298 sec

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="CircularTrains-PT-096"
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 CircularTrains-PT-096, 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 r065-smll-167814393000169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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