Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 181K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 568K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 67K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 228K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 15M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-PT-S06J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-152673532900227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526949887031


BK_STOP 1526950128345

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S06J04T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1726327, 'Memory': 15927, 'Tool': 'lola'}, {'Time': 1735010, 'Memory': 15921.02, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J04T06...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBLF-PT-S06J04T06: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J04T06: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S06J04T06 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 11132/65536 symbol table entries, 6611 collisions
lola: preprocessing...
lola: finding significant places
lola: 632 places, 10500 transitions, 578 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2723 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T06-CTLCardinality.task
lola: ((3 <= P_1097) OR (NOT(A (F ((3 <= JobCnt)))) AND E (X ((P_1727 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6))))) : A (G (((P_1095 <= cBlockedTasks) OR (P_1160_5 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_6 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4)))) : E (F (NOT(A (F ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6)))))) : E (F (E (F ((2 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6))))) : E ((((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 <= P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1) OR (P_1099 <= cPollingAbort) OR (2 <= MarkerRead)) U E (G ((2 <= cIsMonitoring))))) : NOT(NOT(((P_1160_5 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_6 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4) AND E (F ((1 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6)))))) : NOT(E (G (E (G ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 <= P_1095)))))) : E (X (A (((NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 <= P_1716) U (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6))))) : E ((A (F ((QueueJobB_1_2 <= TryAllocateOneTaskE_2))) U (2 <= NotifyEventSourceAddedE_5))) : (E (G (E (F ((3 <= NotifyEventJobQueuedB_2_1))))) OR (((NotifyEventJobQueuedB_1_0 <= P_2318_3) AND (PollingAbort <= Insert_Source_B_2_1) AND (NotifyEventJobQueuedB_6_3 <= Insert_Source_B_1_5) AND ((IsMonitoring + 1 <= DisablePollingE_2_2) OR (ProcessingEvt_6 + 1 <= P_1119_6_3))) OR E (F (((cIdleTasks <= Try_Check_Sources_E_3) AND (1 <= FetchJobE_6_2)))))) : (((((1 <= Try_Check_Sources_E_2) AND (NotifyEventJobQueuedB_5_2 <= Insert_Source_B_3_6)) OR E (F ((P_2579_2_5 <= QueueJobE_1)))) AND (((P_1724_4 <= Insert_Source_B_2_2) AND (1 <= DisablePollingE_1_1)) OR A (G ((P_1717 <= NotifyEventJobCompletedB_3))))) OR (((CreatedJobs_3_1 + 1 <= P_2579_1_6) OR (FetchJobE_2_3 + 1 <= Check_Sources_E_5) OR ((ScheduleTaskE_Work_3_3 <= 2) AND (P_1119_2_3 + 1 <= P_1119_4_2))) AND E (G ((P_2579_3_2 <= 1))))) : E (G (((Insert_Source_B_2_2 <= P_2318_6) OR ((NotifyEventJobQueuedB_5_1 + 1 <= ScheduleTaskB_1) AND (QueueJobB_4_2 + 1 <= DisablePollingB_2_5))))) : E (F ((A (F ((CreatedJobs_4_5 <= FetchJobE_3_1))) AND E (X ((3 <= IdleTasks_4)))))) : ((P_2321_1 <= Try_Check_Sources_E_1) AND A (((FetchJobE_1_3 <= 1) U (2 <= P_2318_2)))) : ((E (G ((P_1158_5 <= NotifyEventEndOfCheckSourcesB_2))) AND ((CreatedJobs_0_4 <= DataOnSrc_2) OR (Insert_Source_B_2_3 <= Insert_Source_E_1))) OR E (F (E (F ((3 <= CreatedJobs_2_1)))))) : ((NOT(A (X ((3 <= cIdleTasks)))) AND A (G (((Insert_Source_B_2_6 <= ModifiedSrc_4) OR (2 <= ScheduleTaskE_Work_6_0))))) AND (((NotifyEventSourceAddedE_5 <= P_2579_2_6) AND (P_1717 <= DisablePollingB_5_3)) AND A (X (((FetchJobE_4_2 <= ModifiedSrc_5) AND (P_1119_1_1 <= P_1119_6_3))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= P_1097) OR (NOT(A (F ((3 <= JobCnt)))) AND E (X ((P_1727 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + Dis... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P_1097)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P_1097)
lola: processed formula length: 13
lola: 3 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T06-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((JobCnt <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= JobCnt)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 30115 markings, 48473 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((P_1727 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((P_1727 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePolli... (shortened)
lola: processed formula length: 805
lola: 4 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1095 <= cBlockedTasks) OR (P_1160_5 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_6 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T06-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T06-CTLCardinality.sara.
lola: sara is running 0 secs || 6835 markings, 12889 edges, 1367 markings/sec, 0 secs
lola: sara is running 5 secs || 20921 markings, 28109 edges, 2817 markings/sec, 5 secs
lola: sara is running 10 secs || 34860 markings, 43417 edges, 2788 markings/sec, 10 secs
lola: sara is running 15 secs || 49773 markings, 59352 edges, 2983 markings/sec, 15 secs
lola: sara is running 20 secs || 64995 markings, 75712 edges, 3044 markings/sec, 20 secs
lola: sara is running 25 secs || 80169 markings, 92062 edges, 3035 markings/sec, 25 secs
lola: sara is running 30 secs || 95387 markings, 109226 edges, 3044 markings/sec, 30 secs
lola: sara is running 35 secs || 110400 markings, 125324 edges, 3003 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 125619 markings, 142208 edges, 3044 markings/sec, 40 secs
lola: sara is running 45 secs || 140592 markings, 158328 edges, 2995 markings/sec, 45 secs
lola: sara is running 50 secs || 155633 markings, 174767 edges, 3008 markings/sec, 50 secs
lola: sara is running 55 secs || 170921 markings, 191821 edges, 3058 markings/sec, 55 secs
lola: sara is running 60 secs || 185868 markings, 208225 edges, 2989 markings/sec, 60 secs
lola: sara is running 65 secs || 200247 markings, 224176 edges, 2876 markings/sec, 65 secs
lola: sara is running 70 secs || 215014 markings, 240528 edges, 2953 markings/sec, 70 secs
lola: sara is running 75 secs || 230404 markings, 257893 edges, 3078 markings/sec, 75 secs
lola: sara is running 80 secs || 244952 markings, 274107 edges, 2910 markings/sec, 80 secs
lola: sara is running 85 secs || 259822 markings, 291169 edges, 2974 markings/sec, 85 secs
lola: sara is running 90 secs || 275153 markings, 308928 edges, 3066 markings/sec, 90 secs
lola: sara is running 95 secs || 289680 markings, 325086 edges, 2905 markings/sec, 95 secs
lola: sara is running 100 secs || 305121 markings, 343530 edges, 3088 markings/sec, 100 secs
lola: sara is running 105 secs || 320899 markings, 362605 edges, 3156 markings/sec, 105 secs
lola: sara is running 110 secs || 336153 markings, 380701 edges, 3051 markings/sec, 110 secs
lola: sara is running 115 secs || 351358 markings, 397744 edges, 3041 markings/sec, 115 secs
lola: sara is running 120 secs || 365965 markings, 413547 edges, 2921 markings/sec, 120 secs
lola: sara is running 125 secs || 382548 markings, 433872 edges, 3317 markings/sec, 125 secs
lola: sara is running 130 secs || 397824 markings, 450738 edges, 3055 markings/sec, 130 secs
lola: sara is running 135 secs || 413454 markings, 469167 edges, 3126 markings/sec, 135 secs
lola: sara is running 140 secs || 429658 markings, 489561 edges, 3241 markings/sec, 140 secs
lola: sara is running 145 secs || 445059 markings, 507525 edges, 3080 markings/sec, 145 secs
lola: sara is running 150 secs || 461086 markings, 526792 edges, 3205 markings/sec, 150 secs
lola: sara is running 155 secs || 476824 markings, 545011 edges, 3148 markings/sec, 155 secs
lola: sara is running 160 secs || 494681 markings, 570005 edges, 3571 markings/sec, 160 secs
lola: sara is running 165 secs || 516147 markings, 611708 edges, 4293 markings/sec, 165 secs
lola: sara is running 170 secs || 531657 markings, 629918 edges, 3102 markings/sec, 170 secs
lola: sara is running 175 secs || 547424 markings, 648448 edges, 3153 markings/sec, 175 secs
lola: sara is running 180 secs || 563263 markings, 666729 edges, 3168 markings/sec, 180 secs
lola: sara is running 185 secs || 578488 markings, 683216 edges, 3045 markings/sec, 185 secs
lola: sara is running 190 secs || 594506 markings, 702238 edges, 3204 markings/sec, 190 secs
lola: sara is running 195 secs || 616978 markings, 746821 edges, 4494 markings/sec, 195 secs
lola: sara is running 200 secs || 632867 markings, 766119 edges, 3178 markings/sec, 200 secs
lola: sara is running 205 secs || 649896 markings, 788067 edges, 3406 markings/sec, 205 secs
lola: sara is running 210 secs || 664743 markings, 804961 edges, 2969 markings/sec, 210 secs
lola: sara is running 215 secs || 680340 markings, 824085 edges, 3119 markings/sec, 215 secs
lola: sara is running 220 secs || 695278 markings, 841338 edges, 2988 markings/sec, 220 secs
lola: sara is running 225 secs || 710950 markings, 860045 edges, 3134 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PolyORBLF-PT-S06J04T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-152673532900227"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;