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 7.1M
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 75K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K 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 8.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 189K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K 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 28K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 6.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S04J06T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529200215
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526845469477


BK_STOP 1526846041648

--------------------
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-S04J06T10 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 3539372, 'Memory': 6722.11, 'Tool': 'lola'}, {'Time': 3539678, 'Memory': 6759.79, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola PolyORBLF-PT-S04J06T10...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S04J06T10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PolyORBLF-PT-S04J06T10 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 6320/65536 symbol table entries, 1503 collisions
lola: preprocessing...
lola: finding significant places
lola: 966 places, 5354 transitions, 904 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3657 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J06T10-ReachabilityCardinality.task
lola: E (F (((1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4) AND (TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= P_1099) AND (Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 <= MarkerWrite) AND ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10 + 1 <= SigAbort) OR (P_1726 <= 0))))) : E (F (((2 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_9 + ScheduleTaskE_Check_10) AND (2 <= P_1099) AND ((3 <= P_1093) OR (2 <= BlockedTasks)) AND ((3 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9) OR (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8 + RunE_9 + RunE_10) OR (BlockedTasks <= 0))))) : A (G ((3 <= IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10))) : E (F ((cPollingAbort <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6))) : E (F (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= 1) AND ((3 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10) OR (1 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8 + RunE_9 + RunE_10))))) : A (G ((((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_9_1 + DisablePollingB_9_2 + DisablePollingB_9_3 + DisablePollingB_9_4 + 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_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_10_1 + DisablePollingB_10_2 + DisablePollingB_10_3 + DisablePollingB_10_4 + 1 <= P_1093) AND (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_10_0 + FetchJobE_10_1 + FetchJobE_10_2 + FetchJobE_10_3 + FetchJobE_10_4 + FetchJobE_10_5 + FetchJobE_10_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 + FetchJobE_9_5 + FetchJobE_9_4 + FetchJobE_9_0 + FetchJobE_9_1 + FetchJobE_9_2 + FetchJobE_9_3 + FetchJobE_9_6 + 1 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)) OR (RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8 + RunE_9 + RunE_10 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 + ScheduleTaskE_Idle_10)))) : E (F ((AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + 1 <= MarkerRead))) : E (F (((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8 + Check_Sources_E_9 + Check_Sources_E_10 <= cJobCnt) AND (2 <= Abort_Check_Sources_E_10 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9) AND (2 <= NoSigAbort) AND (Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8 + Try_Check_Sources_E_9 + Try_Check_Sources_E_10 <= P_1726) AND (Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 + Check_Sources_B_9 <= 0)))) : A (G (((NotifyEventJobQueuedB_10_2 <= AwakeTasks_6) AND ((ScheduleTaskE_Work_6_5 + 1 <= CreatedJobs_4_3) OR (CreatedJobs_1_2 <= 2))))) : A (G ((P_1159_2 <= cPollingAbort))) : A (G (((NotifyEventSourceAddedE_6 <= DisablePollingE_2_3) OR (1 <= BlockedTasks) OR (3 <= ScheduleTaskE_Work_3_2) OR (NotifyEventEndOfCheckSourcesE_2 <= P_1725_1) OR (AvailableJobId_3 <= DisablePollingB_5_3)))) : A (G (((P_1119_7_3 <= 1) OR (FetchJobB_8 + 1 <= NotifyEventJobQueuedB_1_2) OR (NotifyEventJobCompletedB_2 <= NotifyEventJobQueuedB_2_0)))) : E (F ((((2 <= Insert_Source_B_10_1) AND (1 <= AwakeTasks_4) AND (2 <= Insert_Source_B_1_4)) OR ((1 <= P_1097) AND (2 <= P_1712_0) AND (2 <= Perform_Work_E_6))))) : E (F ((1 <= Perform_Work_E_9))) : A (G (((ScheduleTaskE_Work_2_3 + 1 <= DisablePollingE_1_2) OR (P_1119_1_3 <= 2) OR (P_2579_7_4 <= FetchJobE_10_1) OR (3 <= NotifyEventJobQueuedB_1_6)))) : E (F ((3 <= P_1727)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4) AND (TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= P_1099) AND (Insert_Source_E_10 + Insert_Source_E_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 55 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_9 + ScheduleTaskE_Check_10) AND (2 <= P_1099) AND ((3 <= P_1093) OR (2 <= BlockedTasks)) AND ((3 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobC... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 13615 markings, 15045 edges, 2723 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 28864 markings, 33099 edges, 3050 markings/sec, 5 secs
lola: sara is running 10 secs || 44120 markings, 50846 edges, 3051 markings/sec, 10 secs
lola: sara is running 15 secs || 59277 markings, 69958 edges, 3031 markings/sec, 15 secs
lola: sara is running 20 secs || 74722 markings, 88014 edges, 3089 markings/sec, 20 secs
lola: sara is running 25 secs || 89765 markings, 106839 edges, 3009 markings/sec, 25 secs
lola: sara is running 30 secs || 105030 markings, 124878 edges, 3053 markings/sec, 30 secs
lola: sara is running 35 secs || 120266 markings, 143340 edges, 3047 markings/sec, 35 secs
lola: sara is running 40 secs || 135523 markings, 162111 edges, 3051 markings/sec, 40 secs
lola: sara is running 45 secs || 150705 markings, 180847 edges, 3036 markings/sec, 45 secs
lola: sara is running 50 secs || 165971 markings, 199299 edges, 3053 markings/sec, 50 secs
lola: sara is running 55 secs || 181231 markings, 217723 edges, 3052 markings/sec, 55 secs
lola: sara is running 60 secs || 196481 markings, 236377 edges, 3050 markings/sec, 60 secs
lola: sara is running 65 secs || 211586 markings, 254682 edges, 3021 markings/sec, 65 secs
lola: sara is running 70 secs || 226278 markings, 272530 edges, 2938 markings/sec, 70 secs
lola: sara is running 75 secs || 240980 markings, 290722 edges, 2940 markings/sec, 75 secs
lola: sara is running 80 secs || 255679 markings, 308533 edges, 2940 markings/sec, 80 secs
lola: sara is running 85 secs || 270255 markings, 327431 edges, 2915 markings/sec, 85 secs
lola: sara is running 90 secs || 284863 markings, 346410 edges, 2922 markings/sec, 90 secs
lola: sara is running 95 secs || 299491 markings, 365059 edges, 2926 markings/sec, 95 secs
lola: sara is running 100 secs || 314191 markings, 384322 edges, 2940 markings/sec, 100 secs
lola: sara is running 105 secs || 328856 markings, 404091 edges, 2933 markings/sec, 105 secs
lola: sara is running 110 secs || 343490 markings, 423845 edges, 2927 markings/sec, 110 secs
lola: sara is running 115 secs || 358154 markings, 442825 edges, 2933 markings/sec, 115 secs
lola: sara is running 120 secs || 373105 markings, 461849 edges, 2990 markings/sec, 120 secs
lola: sara is running 125 secs || 388434 markings, 481621 edges, 3066 markings/sec, 125 secs
lola: sara is running 130 secs || 403800 markings, 501182 edges, 3073 markings/sec, 130 secs
lola: sara is running 135 secs || 419118 markings, 521687 edges, 3064 markings/sec, 135 secs
lola: sara is running 140 secs || 434393 markings, 541890 edges, 3055 markings/sec, 140 secs
lola: sara is running 145 secs || 449695 markings, 561099 edges, 3060 markings/sec, 145 secs
lola: sara is running 150 secs || 465047 markings, 580286 edges, 3070 markings/sec, 150 secs
lola: sara is running 155 secs || 480375 markings, 599587 edges, 3066 markings/sec, 155 secs
lola: sara is running 160 secs || 495633 markings, 620027 edges, 3052 markings/sec, 160 secs
lola: sara is running 165 secs || 510841 markings, 639496 edges, 3042 markings/sec, 165 secs
lola: sara is running 170 secs || 526093 markings, 659307 edges, 3050 markings/sec, 170 secs
lola: sara is running 175 secs || 541298 markings, 680011 edges, 3041 markings/sec, 175 secs
lola: sara is running 180 secs || 556555 markings, 700439 edges, 3051 markings/sec, 180 secs
lola: sara is running 185 secs || 571809 markings, 720526 edges, 3051 markings/sec, 185 secs
lola: sara is running 190 secs || 587145 markings, 740042 edges, 3067 markings/sec, 190 secs
lola: sara is running 195 secs || 602413 markings, 759684 edges, 3054 markings/sec, 195 secs
lola: sara is running 200 secs || 617684 markings, 779431 edges, 3054 markings/sec, 200 secs
lola: sara is running 205 secs || 632895 markings, 800046 edges, 3042 markings/sec, 205 secs
lola: sara is running 210 secs || 648200 markings, 819462 edges, 3061 markings/sec, 210 secs
lola: sara is running 215 secs || 663412 markings, 838809 edges, 3042 markings/sec, 215 secs
lola: sara is running 220 secs || 678759 markings, 858233 edges, 3069 markings/sec, 220 secs
lola: sara is running 225 secs || 694034 markings, 877172 edges, 3055 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10)))
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 3616 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 119 markings, 118 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cPollingAbort <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= 1) AND ((3 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10) OR (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 87 markings, 86 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_9_1 + DisablePollingB_9... (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 3616 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + 1 <= MarkerRead)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J06T10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J06T10-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 14321 markings, 15118 edges, 2864 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 28915 markings, 31201 edges, 2919 markings/sec, 5 secs
lola: sara is running 10 secs || 43569 markings, 47594 edges, 2931 markings/sec, 10 secs
lola: sara is running 15 secs || 58100 markings, 64415 edges, 2906 markings/sec, 15 secs
lola: sara is running 20 secs || 72591 markings, 81077 edges, 2898 markings/sec, 20 secs
lola: sara is running 25 secs || 87147 markings, 98197 edges, 2911 markings/sec, 25 secs
lola: sara is running 30 secs || 101692 markings, 117313 edges, 2909 markings/sec, 30 secs
lola: sara is running 35 secs || 116116 markings, 134542 edges, 2885 markings/sec, 35 secs
lola: sara is running 40 secs || 130694 markings, 152145 edges, 2916 markings/sec, 40 secs
lola: sara is running 45 secs || 145083 markings, 170003 edges, 2878 markings/sec, 45 secs
lola: sara is running 50 secs || 159587 markings, 187562 edges, 2901 markings/sec, 50 secs
lola: sara is running 55 secs || 174062 markings, 205886 edges, 2895 markings/sec, 55 secs
lola: sara is running 60 secs || 188818 markings, 225670 edges, 2951 markings/sec, 60 secs
lola: sara is running 65 secs || 203323 markings, 243390 edges, 2901 markings/sec, 65 secs
lola: sara is running 70 secs || 217823 markings, 261535 edges, 2900 markings/sec, 70 secs
lola: sara is running 75 secs || 232302 markings, 279219 edges, 2896 markings/sec, 75 secs
lola: sara is running 80 secs || 246884 markings, 299637 edges, 2916 markings/sec, 80 secs
lola: sara is running 85 secs || 261331 markings, 317596 edges, 2889 markings/sec, 85 secs
lola: sara is running 90 secs || 275772 markings, 335935 edges, 2888 markings/sec, 90 secs
lola: sara is running 95 secs || 290244 markings, 354281 edges, 2894 markings/sec, 95 secs
lola: sara is running 100 secs || 304698 markings, 371684 edges, 2891 markings/sec, 100 secs
lola: sara is running 105 secs || 319209 markings, 389976 edges, 2902 markings/sec, 105 secs
lola: sara is running 110 secs || 333682 markings, 408468 edges, 2895 markings/sec, 110 secs
lola: sara is running 115 secs || 348136 markings, 427044 edges, 2891 markings/sec, 115 secs
lola: sara is running 120 secs || 362421 markings, 445016 edges, 2857 markings/sec, 120 secs
lola: sara is running 125 secs || 376264 markings, 462853 edges, 2769 markings/sec, 125 secs
lola: sara is running 130 secs || 389905 markings, 480342 edges, 2728 markings/sec, 130 secs
lola: sara is running 135 secs || 403694 markings, 497934 edges, 2758 markings/sec, 135 secs
lola: sara is running 140 secs || 418074 markings, 516422 edges, 2876 markings/sec, 140 secs
lola: sara is running 145 secs || 432520 markings, 535548 edges, 2889 markings/sec, 145 secs
lola: sara is running 150 secs || 446959 markings, 553570 edges, 2888 markings/sec, 150 secs
lola: sara is running 155 secs || 461580 markings, 574153 edges, 2924 markings/sec, 155 secs
lola: sara is running 160 secs || 475896 markings, 592638 edges, 2863 markings/sec, 160 secs
lola: sara is running 165 secs || 490437 markings, 611634 edges, 2908 markings/sec, 165 secs
lola: sara is running 170 secs || 504837 markings, 629897 edges, 2880 markings/sec, 170 secs
lola: sara is running 175 secs || 519267 markings, 648838 edges, 2886 markings/sec, 175 secs
lola: sara is running 180 secs || 533730 markings, 667497 edges, 2893 markings/sec, 180 secs
lola: sara is running 185 secs || 548096 markings, 686320 edges, 2873 markings/sec, 185 secs
lola: sara is running 190 secs || 562398 markings, 705560 edges, 2860 markings/sec, 190 secs
lola: sara is running 195 secs || 576732 markings, 723885 edges, 2867 markings/sec, 195 secs
lola: sara is running 200 secs || 591318 markings, 744381 edges, 2917 markings/sec, 200 secs
lola: sara is running 205 secs || 605724 markings, 762786 edges, 2881 markings/sec, 205 secs
lola: sara is running 210 secs || 619930 markings, 780982 edges, 2841 markings/sec, 210 secs
lola: sara is running 215 secs || 634146 markings, 799238 edges, 2843 markings/sec, 215 secs
lola: sara is running 220 secs || 648391 markings, 817051 edges, 2849 markings/sec, 220 secs
lola: sara is running 225 secs || 662581 markings, 835263 edges, 2838 markings/sec, 225 secs
lola: sara is running 230 secs || 676764 markings, 853452 edges, 2837 markings/sec, 230 secs
lola: sara is running 235 secs || 690913 markings, 871930 edges, 2830 markings/sec, 235 secs
lola: sara is running 240 secs || 704956 markings, 890021 edges, 2809 markings/sec, 240 secs
lola: sara is running 245 secs || 718845 markings, 907858 edges, 2778 markings/sec, 245 secs
lola: sara is running 250 secs || 732733 markings, 925585 edges, 2778 markings/sec, 250 secs
lola: sara is running 255 secs || 746566 markings, 944314 edges, 2767 markings/sec, 255 secs
lola: sara is running 260 secs || 760526 markings, 962350 edges, 2792 markings/sec, 260 secs
lola: sara is running 265 secs || 774387 markings, 979833 edges, 2772 markings/sec, 265 secs
lola: sara is running 270 secs || 788404 markings, 998532 edges, 2803 markings/sec, 270 secs
lola: sara is running 275 secs || 802347 markings, 1016809 edges, 2789 markings/sec, 275 secs
lola: sara is running 280 secs || 816197 markings, 1034817 edges, 2770 markings/sec, 280 secs
lola: sara is running 285 secs || 830069 markings, 1052613 edges, 2774 markings/sec, 285 secs
lola: sara is running 290 secs || 843804 markings, 1071083 edges, 2747 markings/sec, 290 secs
lola: sara is running 295 secs || 857635 markings, 1089470 edges, 2766 markings/sec, 295 secs
lola: sara is running 300 secs || 871412 markings, 1108170 edges, 2755 markings/sec, 300 secs
lola: sara is running 305 secs || 885271 markings, 1126411 edges, 2772 markings/sec, 305 secs
lola: sara is running 310 secs || 899098 markings, 1144549 edges, 2765 markings/sec, 310 secs
lola: sara is running 315 secs || 913043 markings, 1162999 edges, 2789 markings/sec, 315 secs
lola: sara is running 320 secs || 926953 markings, 1181144 edges, 2782 markings/sec, 320 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: '\ufffd'
Aborted (core dumped)
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-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-S04J06T10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 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 irma4mcc-structural"
echo " Input is PolyORBLF-PT-S04J06T10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r127-smll-152673529200215"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;