fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r131-smll-152673534200255
Last Updated
June 26, 2018

About the Execution of M4M.struct for PolyORBLF-PT-S06J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.290 495600.00 500190.00 3248.00 ???????????????? normal

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 21M
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 232K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 724K 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 7.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K 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 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 20M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBLF-PT-S06J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534200255
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526997050259


BK_STOP 1526997545859

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S06J06T08 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': 1130462, 'Memory': 15940.47, 'Tool': 'lola'}, {'Time': 1130977, 'Memory': 15942.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J06T08...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S06J06T08 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 15228/65536 symbol table entries, 9133 collisions
lola: preprocessing...
lola: finding significant places
lola: 894 places, 14334 transitions, 832 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4215 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: ((2 <= MarkerRead) OR E (F (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= 0))))) : E (G (NOT(A (X ((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_7_5 + FetchJobE_7_6 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_8_5 + FetchJobE_8_6)))))) : A (F (E (G ((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 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6 <= 1))))) : A (X (NOT(E (G ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_6)))))) : NOT(A (F (((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8) OR (PollingAbort + 1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8))))) : A (G ((cPollingAbort <= NoSigAbort))) : A (F (A (X (((2 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8) AND (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_5_5 + Insert_Source_B_5_6 + Insert_Source_B_8_6 + Insert_Source_B_8_5 + Insert_Source_B_8_4 + Insert_Source_B_8_3 + Insert_Source_B_8_2 + Insert_Source_B_8_1 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4 + Insert_Source_B_6_5 + Insert_Source_B_6_6 + Insert_Source_B_7_1 + Insert_Source_B_7_2 + Insert_Source_B_7_3 + Insert_Source_B_7_4 + Insert_Source_B_7_5 + Insert_Source_B_7_6 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6)))))) : E ((((DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= cIsMonitoring) OR (2 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8) OR (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 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_7_5 + P_1119_7_6 + P_1119_8_1 + P_1119_8_2 + P_1119_8_3 + P_1119_8_4 + P_1119_8_5 + P_1119_8_6 + 1 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6)) U E (G ((1 <= NoSigAbort))))) : A (F (NOT(A (F ((3 <= ProcessingEvt_4)))))) : (NOT((((3 <= DisablePollingE_2_3) AND (FetchJobE_4_3 <= Abort_Check_Sources_B_4) AND (P_1724_5 <= EnablePollingE_3) AND (3 <= QueueJobB_5_4)) AND E (G ((3 <= P_1158_8))))) AND A (F ((3 <= AvailableJobId_2)))) : E ((((NotifyEventJobQueuedB_4_4 <= 1) OR (P_1119_8_2 <= 2)) U ((P_1158_1 <= DisablePollingB_3_4) AND (P_2579_7_1 <= P_2579_8_1) AND (P_1159_5 + 1 <= DisablePollingE_1_5)))) : (A (X ((1 <= DisablePollingE_1_4))) OR E (G (A (G ((P_2579_3_1 <= QueueJobB_2_5)))))) : E ((((Insert_Source_B_6_4 <= P_1155_2) OR (1 <= QueueJobB_7_2)) U E (G ((QueueJobE_8 <= ScheduleTaskE_Work_8_2))))) : A (G (E (F (((3 <= Insert_Source_B_3_6) OR (SigAbort <= Abort_Check_Sources_E_6)))))) : A (F (((2 <= PlaceSources_3) AND (QueueJobB_8_3 <= DisablePollingB_5_2) AND (Abort_Check_Sources_E_1 + 1 <= FetchJobE_8_0) AND (1 <= CreatedJobs_3_4)))) : (A (G (((Insert_Source_B_7_5 <= 2) AND (Abort_Check_Sources_B_2 <= 2)))) OR ((A (X ((1 <= QueueJobB_1_5))) OR E (F ((2 <= AvailableJobId_0)))) AND E (X ((3 <= Abort_Check_Sources_E_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= MarkerRead) OR E (F (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4... (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: (2 <= MarkerRead)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MarkerRead)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-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: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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-S06J06T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T08-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 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: E (G (NOT(A (X ((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4... (shortened)
lola: processed formula length: 924
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 50801 markings, 187581 edges, 2316348567939186688 markings/sec, 0 secs
lola: 104097 markings, 396774 edges, 10659 markings/sec, 5 secs
lola: 157586 markings, 611162 edges, 10698 markings/sec, 10 secs
lola: 210895 markings, 822877 edges, 10662 markings/sec, 15 secs
lola: 264329 markings, 1037612 edges, 10687 markings/sec, 20 secs
lola: 317781 markings, 1253983 edges, 10690 markings/sec, 25 secs
lola: 371504 markings, 1474906 edges, 10745 markings/sec, 30 secs
lola: 424807 markings, 1685059 edges, 10661 markings/sec, 35 secs
lola: 478243 markings, 1900643 edges, 10687 markings/sec, 40 secs
lola: 531757 markings, 2117166 edges, 10703 markings/sec, 45 secs
lola: 585593 markings, 2336738 edges, 10767 markings/sec, 50 secs
lola: 638958 markings, 2553840 edges, 10673 markings/sec, 55 secs
lola: 692729 markings, 2774977 edges, 10754 markings/sec, 60 secs
lola: 746083 markings, 2998437 edges, 10671 markings/sec, 65 secs
lola: 797002 markings, 3246309 edges, 10184 markings/sec, 70 secs
lola: 847954 markings, 3498143 edges, 10190 markings/sec, 75 secs
lola: 899233 markings, 3751112 edges, 10256 markings/sec, 80 secs
lola: 950874 markings, 4010083 edges, 10328 markings/sec, 85 secs
lola: 1001435 markings, 4224648 edges, 10112 markings/sec, 90 secs
lola: 1051324 markings, 4424475 edges, 9978 markings/sec, 95 secs
lola: 1101488 markings, 4630096 edges, 10033 markings/sec, 100 secs
lola: 1149608 markings, 4828474 edges, 9624 markings/sec, 105 secs
lola: 1198408 markings, 5033971 edges, 9760 markings/sec, 110 secs
lola: 1247322 markings, 5234808 edges, 9783 markings/sec, 115 secs
lola: 1296034 markings, 5434914 edges, 9742 markings/sec, 120 secs
lola: 1344996 markings, 5634949 edges, 9792 markings/sec, 125 secs
lola: 1393193 markings, 5836446 edges, 9639 markings/sec, 130 secs
lola: 1440361 markings, 6036956 edges, 9434 markings/sec, 135 secs
lola: 1487591 markings, 6239818 edges, 9446 markings/sec, 140 secs
lola: 1534967 markings, 6470790 edges, 9475 markings/sec, 145 secs
lola: 1578830 markings, 6685624 edges, 8773 markings/sec, 150 secs
lola: 1626459 markings, 6921443 edges, 9526 markings/sec, 155 secs
lola: 1674052 markings, 7158722 edges, 9519 markings/sec, 160 secs
lola: 1720998 markings, 7381721 edges, 9389 markings/sec, 165 secs
lola: 1764977 markings, 7566759 edges, 8796 markings/sec, 170 secs
lola: 1813368 markings, 7759812 edges, 9678 markings/sec, 175 secs
lola: 1861323 markings, 7953593 edges, 9591 markings/sec, 180 secs
lola: 1909468 markings, 8150121 edges, 9629 markings/sec, 185 secs
lola: 1954766 markings, 8338738 edges, 9060 markings/sec, 190 secs
lola: 1999781 markings, 8532126 edges, 9003 markings/sec, 195 secs
lola: 2047362 markings, 8725665 edges, 9516 markings/sec, 200 secs
lola: 2095961 markings, 8925198 edges, 9720 markings/sec, 205 secs
lola: 2146497 markings, 9134566 edges, 10107 markings/sec, 210 secs
lola: 2191260 markings, 9343734 edges, 8953 markings/sec, 215 secs
lola: 2238759 markings, 9576836 edges, 9500 markings/sec, 220 secs
lola: 2283585 markings, 9801723 edges, 8965 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((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 + Que... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (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 + Queu... (shortened)
lola: processed formula length: 925
lola: 3 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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 2 significant temporal operators and needs 9 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: 212 markings, 212 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + Sched... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTask... (shortened)
lola: processed formula length: 1495
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 64885 markings, 123716 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8) OR (PollingAbort + 1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8) OR (PollingAbort + 1... (shortened)
lola: processed formula length: 493
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 219069 markings, 487176 edges, 3067840576268271616 markings/sec, 0 secs
lola: 425044 markings, 973472 edges, 41195 markings/sec, 5 secs
lola: 632837 markings, 1474698 edges, 41559 markings/sec, 10 secs
lola: 838495 markings, 1961826 edges, 41132 markings/sec, 15 secs
lola: 1043428 markings, 2455183 edges, 40987 markings/sec, 20 secs
lola: 1244844 markings, 2931953 edges, 40283 markings/sec, 25 secs
lola: 1445726 markings, 3415741 edges, 40176 markings/sec, 30 secs
lola: 1647082 markings, 3892025 edges, 40271 markings/sec, 35 secs
lola: 1847487 markings, 4374378 edges, 40081 markings/sec, 40 secs
lola: 2046154 markings, 4843993 edges, 39733 markings/sec, 45 secs
lola: 2244924 markings, 5324568 edges, 39754 markings/sec, 50 secs
lola: 2445408 markings, 5809052 edges, 40097 markings/sec, 55 secs
lola: 2645401 markings, 6281315 edges, 39999 markings/sec, 60 secs
lola: 2843488 markings, 6762435 edges, 39617 markings/sec, 65 secs
lola: 3040840 markings, 7246437 edges, 39470 markings/sec, 70 secs
lola: 3237654 markings, 7725302 edges, 39363 markings/sec, 75 secs
lola: 3433742 markings, 8210956 edges, 39218 markings/sec, 80 secs
lola: 3632713 markings, 8746333 edges, 39794 markings/sec, 85 secs
lola: 3844259 markings, 9413569 edges, 42309 markings/sec, 90 secs
lola: 4056234 markings, 10078847 edges, 42395 markings/sec, 95 secs
lola: 4263609 markings, 10739868 edges, 41475 markings/sec, 100 secs
lola: 4475521 markings, 11420179 edges, 42382 markings/sec, 105 secs
lola: 4686623 markings, 12079828 edges, 42220 markings/sec, 110 secs
lola: 4895683 markings, 12740323 edges, 41812 markings/sec, 115 secs
lola: 5097808 markings, 13390880 edges, 40425 markings/sec, 120 secs
lola: 5304879 markings, 14059244 edges, 41414 markings/sec, 125 secs
lola: 5509507 markings, 14709042 edges, 40926 markings/sec, 130 secs
lola: 5713054 markings, 15366177 edges, 40709 markings/sec, 135 secs
lola: 5920152 markings, 16022392 edges, 41420 markings/sec, 140 secs
lola: 6124988 markings, 16669381 edges, 40967 markings/sec, 145 secs
lola: 6324191 markings, 17318968 edges, 39841 markings/sec, 150 secs
lola: 6524669 markings, 17959013 edges, 40096 markings/sec, 155 secs
lola: 6718840 markings, 18587181 edges, 38834 markings/sec, 160 secs
lola: 6920129 markings, 19263655 edges, 40258 markings/sec, 165 secs
lola: 7127450 markings, 19932855 edges, 41464 markings/sec, 170 secs
lola: 7336835 markings, 20625649 edges, 41877 markings/sec, 175 secs
lola: 7532826 markings, 21326045 edges, 39198 markings/sec, 180 secs
lola: 7746871 markings, 22014248 edges, 42809 markings/sec, 185 secs
lola: 7959129 markings, 22685592 edges, 42452 markings/sec, 190 secs
lola: 8170904 markings, 23353492 edges, 42355 markings/sec, 195 secs
lola: 8378909 markings, 24029106 edges, 41601 markings/sec, 200 secs
lola: 8591536 markings, 24696381 edges, 42525 markings/sec, 205 secs
lola: 8812218 markings, 25387442 edges, 44136 markings/sec, 210 secs
lola: 9019071 markings, 26043789 edges, 41371 markings/sec, 215 secs
lola: 9225703 markings, 26719807 edges, 41326 markings/sec, 220 secs
lola: 9431142 markings, 27370883 edges, 41088 markings/sec, 225 secs
lola: 9637290 markings, 28025707 edges, 41230 markings/sec, 230 secs
lola: 9843820 markings, 28691561 edges, 41306 markings/sec, 235 secs
lola: 10058315 markings, 29371563 edges, 42899 markings/sec, 240 secs
lola: 10210693 markings, 29854198 edges, 30476 markings/sec, 245 secs
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-S06J06T08-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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-S06J06T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-S06J06T08.tgz
mv PolyORBLF-PT-S06J06T08 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-structural"
echo " Input is PolyORBLF-PT-S06J06T08, 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 r131-smll-152673534200255"
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 ;