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 4.2M
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 6.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 44K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 143K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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 3.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-PT-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265500407
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527471600939


BK_STOP 1527471879751

--------------------
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-S04J06T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 147268, 'Memory': 728.02, 'Tool': 'lola'}, {'Time': 147886, 'Memory': 724.16, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S04J06T06...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S04J06T06: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-PT-S04J06T06 @ 3539 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3808/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J06T06-LTLCardinality.task
lola: A ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4)) : A (X (((3 <= JobCnt) U X ((2 <= IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1))))) : A ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6)) : A (G ((G ((2 <= MarkerRead)) U F ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= ORB_Lock))))) : A (F (((3 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4) U F ((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4))))) : A (X (((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6) U X ((1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6))))) : A (X ((G ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6)) U F ((3 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6))))) : A ((DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6)) : A (G (F (X (F ((EnablePollingB_1 <= ScheduleTaskB_3)))))) : A (F (X (F (F ((P_2579_4_4 <= Check_Sources_E_1)))))) : A (G (G (F (F ((FetchJobE_4_6 <= AvailableJobId_0)))))) : A (F (G (X (X ((2 <= CanInjectEvent)))))) : A (G (F (X ((Insert_Source_E_4 <= ScheduleTaskE_Work_5_4))))) : A ((AwakeTasks_5 <= CreatedJobs_5_3)) : A (X ((P_2579_2_2 <= ScheduleTaskE_Work_3_5))) : A (X (G (X (F ((ScheduleTaskE_Work_5_0 <= P_1119_5_4))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4)
lola: processed formula length: 378
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the 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: A (X (((3 <= JobCnt) U X ((2 <= IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((3 <= JobCnt) U X ((2 <= IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))
lola: processed formula: A (X (((3 <= JobCnt) U X ((2 <= IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))
lola: processed formula length: 118
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 25 markings, 36 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + ... (shortened)
lola: processed formula length: 1350
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((2 <= MarkerRead)) U F ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= ORB_Lock)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((2 <= MarkerRead)) U F ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= ORB_Lock)))))
lola: processed formula: A (G ((G ((2 <= MarkerRead)) U F ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= ORB_Lock)))))
lola: processed formula length: 169
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 23735 markings, 24206 edges, 4747 markings/sec, 0 secs
lola: 50699 markings, 52156 edges, 5393 markings/sec, 5 secs
lola: 77875 markings, 80561 edges, 5435 markings/sec, 10 secs
lola: 104791 markings, 109012 edges, 5383 markings/sec, 15 secs
lola: 129847 markings, 135417 edges, 5011 markings/sec, 20 secs
lola: 157308 markings, 164472 edges, 5492 markings/sec, 25 secs
lola: 184796 markings, 193181 edges, 5498 markings/sec, 30 secs
lola: 212096 markings, 222047 edges, 5460 markings/sec, 35 secs
lola: 239873 markings, 251863 edges, 5555 markings/sec, 40 secs
lola: 267278 markings, 281169 edges, 5481 markings/sec, 45 secs
lola: 294815 markings, 310485 edges, 5507 markings/sec, 50 secs
lola: 322341 markings, 339865 edges, 5505 markings/sec, 55 secs
lola: 349885 markings, 370012 edges, 5509 markings/sec, 60 secs
lola: 377575 markings, 400257 edges, 5538 markings/sec, 65 secs
lola: 404891 markings, 430044 edges, 5463 markings/sec, 70 secs
lola: 432627 markings, 460356 edges, 5547 markings/sec, 75 secs
lola: 460362 markings, 491310 edges, 5547 markings/sec, 80 secs
lola: 487794 markings, 521476 edges, 5486 markings/sec, 85 secs
lola: 515256 markings, 551449 edges, 5492 markings/sec, 90 secs
lola: 543234 markings, 582777 edges, 5596 markings/sec, 95 secs
lola: 571074 markings, 613761 edges, 5568 markings/sec, 100 secs
lola: 598850 markings, 644786 edges, 5555 markings/sec, 105 secs
lola: 626556 markings, 675550 edges, 5541 markings/sec, 110 secs
lola: 654125 markings, 706291 edges, 5514 markings/sec, 115 secs
lola: 679547 markings, 734602 edges, 5084 markings/sec, 120 secs
lola: 707053 markings, 765517 edges, 5501 markings/sec, 125 secs
lola: 734131 markings, 795450 edges, 5416 markings/sec, 130 secs
lola: 761494 markings, 826205 edges, 5473 markings/sec, 135 secs
lola: 789189 markings, 857695 edges, 5539 markings/sec, 140 secs
lola: 816830 markings, 889066 edges, 5528 markings/sec, 145 secs
lola: 844376 markings, 920379 edges, 5509 markings/sec, 150 secs
lola: 871979 markings, 951944 edges, 5521 markings/sec, 155 secs
lola: 899345 markings, 982735 edges, 5473 markings/sec, 160 secs
lola: 926713 markings, 1013800 edges, 5474 markings/sec, 165 secs
lola: 953825 markings, 1043856 edges, 5422 markings/sec, 170 secs
lola: 981654 markings, 1075440 edges, 5566 markings/sec, 175 secs
lola: 1009132 markings, 1106318 edges, 5496 markings/sec, 180 secs
lola: 1036826 markings, 1137755 edges, 5539 markings/sec, 185 secs
lola: 1064393 markings, 1169299 edges, 5513 markings/sec, 190 secs
lola: 1089965 markings, 1198780 edges, 5114 markings/sec, 195 secs
lola: 1118020 markings, 1230672 edges, 5611 markings/sec, 200 secs
lola: 1146007 markings, 1262569 edges, 5597 markings/sec, 205 secs
lola: 1173525 markings, 1293760 edges, 5504 markings/sec, 210 secs
lola: 1201178 markings, 1325261 edges, 5531 markings/sec, 215 secs
lola: 1229369 markings, 1357936 edges, 5638 markings/sec, 220 secs
lola: 1257485 markings, 1389946 edges, 5623 markings/sec, 225 secs
lola: 1285588 markings, 1422064 edges, 5621 markings/sec, 230 secs
lola: 1313431 markings, 1454139 edges, 5569 markings/sec, 235 secs
lola: 1339280 markings, 1483503 edges, 5170 markings/sec, 240 secs
lola: 1365163 markings, 1512989 edges, 5177 markings/sec, 245 secs
lola: 1393168 markings, 1545245 edges, 5601 markings/sec, 250 secs
lola: 1421187 markings, 1577769 edges, 5604 markings/sec, 255 secs
lola: 1449429 markings, 1610442 edges, 5648 markings/sec, 260 secs
lola: 1477677 markings, 1643186 edges, 5650 markings/sec, 265 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)
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
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-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 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-S04J06T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r214-smll-152732265500407"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;