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.1M
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 54K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 176K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K 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 9.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 3.6M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S04J04T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529200180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526834352271


BK_STOP 1526834953198

--------------------
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-S04J04T06 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': 2683498, 'Memory': 4215.91, 'Tool': 'lola'}, {'Time': 2684380, 'Memory': 4189.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola PolyORBLF-PT-S04J04T06...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S04J04T06: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PolyORBLF-PT-S04J04T06 @ 3540 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 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: 3552/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 554 places, 2998 transitions, 504 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1821 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J04T06-ReachabilityCardinality.task
lola: A (G ((((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6) OR ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) AND (QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_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)))))) : E (F ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + 1 <= P_1726))) : A (G (((3 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4) OR (2 <= cJobCnt)))) : E (F ((1 <= SigAbort))) : E (F ((3 <= 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))) : A (G ((((3 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6) AND (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6) AND ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1) OR (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6))) OR (3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6)))) : A (G ((BlockedTasks <= cJobCnt))) : E (F (((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + 1 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4) AND (NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 <= 0) AND (2 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6)))) : E (F (((PlaceSources_4 + 1 <= QueueJobB_5_4) AND (2 <= RunB_3) AND (P_1113_1 <= ProcessingEvt_4)))) : A (G (((2 <= P_2579_6_2) OR ((NotifyEventJobQueuedB_1_1 <= ProcessingEvt_6) AND (2 <= cPollingAbort)) OR (Perform_Work_E_6 <= Abort_Check_Sources_B_4) OR (3 <= QueueJobB_6_1) OR (DisablePollingE_6_3 <= P_1158_1)))) : A (G ((((3 <= DisablePollingE_1_1) AND (3 <= NotifyEventJobQueuedE_1)) OR ((1 <= AvailableJobId_4) AND (ScheduleTaskE_Work_6_3 <= TryAllocateOneTaskB_3)) OR (P_1119_5_1 <= 1)))) : E (F (((FetchJobE_4_2 <= P_1095) AND (NotifyEventJobQueuedB_5_4 + 1 <= Check_Sources_E_6) AND ((1 <= Idle_4) OR (SigAbort <= NotifyEventJobQueuedB_3_0) OR ((QueueJobB_2_0 <= AwakeTasks_4) AND (3 <= NotifyEventJobQueuedB_2_4)))))) : A (G (((1 <= ScheduleTaskE_Work_1_4) OR (NotifyEventSourceAddedE_4 <= NotifyEventSourceAddedB_4)))) : A (G (((3 <= Insert_Source_E_2) OR (1 <= IdleTasks_5) OR (1 <= NotifyEventEndOfCheckSourcesE_5) OR (3 <= Insert_Source_B_4_1) OR (((3 <= Insert_Source_B_6_3) OR (DisablePollingE_5_3 <= P_1617_5)) AND (NotifyEventEndOfCheckSourcesE_3 <= 1))))) : E (F (((Try_Check_Sources_E_6 + 1 <= IdleTasks_2) AND (P_1119_5_1 + 1 <= P_2318_2) AND (AvailableJobId_1 <= cIdleTasks)))) : A (G ((((ScheduleTaskE_Work_2_4 + 1 <= P_1119_3_3) OR (P_2318_4 <= 2)) AND ((NotifyEventJobCompletedB_2 <= 1) OR (QueueJobB_5_0 + 1 <= DisablePollingE_2_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 (G ((((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6) OR ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + ... (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 2016 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T06-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1098 markings, 1115 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + 1 <= P_1726)))
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 2016 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-S04J04T06-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4) OR (2 <= cJobCnt))))
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 2016 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-S04J04T06-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 34327 markings, 37247 edges, 6865 markings/sec, 0 secs
lola: sara is running 5 secs || 68226 markings, 76243 edges, 6780 markings/sec, 5 secs
lola: sara is running 10 secs || 103649 markings, 117165 edges, 7085 markings/sec, 10 secs
lola: sara is running 15 secs || 139104 markings, 159254 edges, 7091 markings/sec, 15 secs
lola: sara is running 20 secs || 174558 markings, 201896 edges, 7091 markings/sec, 20 secs
lola: sara is running 25 secs || 209790 markings, 244249 edges, 7046 markings/sec, 25 secs
lola: sara is running 30 secs || 243754 markings, 285179 edges, 6793 markings/sec, 30 secs
lola: sara is running 35 secs || 276855 markings, 325198 edges, 6620 markings/sec, 35 secs
lola: sara is running 40 secs || 309958 markings, 366045 edges, 6621 markings/sec, 40 secs
lola: sara is running 45 secs || 343008 markings, 407473 edges, 6610 markings/sec, 45 secs
lola: sara is running 50 secs || 376116 markings, 448485 edges, 6622 markings/sec, 50 secs
lola: sara is running 55 secs || 409141 markings, 490250 edges, 6605 markings/sec, 55 secs
lola: sara is running 60 secs || 442226 markings, 532067 edges, 6617 markings/sec, 60 secs
lola: sara is running 65 secs || 475305 markings, 574145 edges, 6616 markings/sec, 65 secs
lola: sara is running 70 secs || 508192 markings, 614811 edges, 6577 markings/sec, 70 secs
lola: sara is running 75 secs || 541176 markings, 656262 edges, 6597 markings/sec, 75 secs
lola: sara is running 80 secs || 574223 markings, 697891 edges, 6609 markings/sec, 80 secs
lola: sara is running 85 secs || 607199 markings, 740823 edges, 6595 markings/sec, 85 secs
lola: sara is running 90 secs || 641190 markings, 784121 edges, 6798 markings/sec, 90 secs
lola: sara is running 95 secs || 675534 markings, 827655 edges, 6869 markings/sec, 95 secs
lola: sara is running 100 secs || 709980 markings, 871263 edges, 6889 markings/sec, 100 secs
lola: sara is running 105 secs || 744339 markings, 915563 edges, 6872 markings/sec, 105 secs
lola: sara is running 110 secs || 778819 markings, 959233 edges, 6896 markings/sec, 110 secs
lola: sara is running 115 secs || 813110 markings, 1003752 edges, 6858 markings/sec, 115 secs
lola: sara is running 120 secs || 846596 markings, 1047431 edges, 6697 markings/sec, 120 secs
lola: sara is running 125 secs || 880055 markings, 1091366 edges, 6692 markings/sec, 125 secs
lola: sara is running 130 secs || 913379 markings, 1134534 edges, 6665 markings/sec, 130 secs
lola: sara is running 135 secs || 946850 markings, 1178340 edges, 6694 markings/sec, 135 secs
lola: sara is running 140 secs || 980207 markings, 1221055 edges, 6671 markings/sec, 140 secs
lola: sara is running 145 secs || 1013569 markings, 1264885 edges, 6672 markings/sec, 145 secs
lola: sara is running 150 secs || 1046911 markings, 1308235 edges, 6668 markings/sec, 150 secs
lola: sara is running 155 secs || 1080017 markings, 1351123 edges, 6621 markings/sec, 155 secs
lola: sara is running 160 secs || 1113413 markings, 1393914 edges, 6679 markings/sec, 160 secs
lola: sara is running 165 secs || 1146816 markings, 1436996 edges, 6681 markings/sec, 165 secs
lola: sara is running 170 secs || 1180038 markings, 1479620 edges, 6644 markings/sec, 170 secs
lola: sara is running 175 secs || 1213251 markings, 1522676 edges, 6643 markings/sec, 175 secs
lola: sara is running 180 secs || 1246519 markings, 1566121 edges, 6654 markings/sec, 180 secs
lola: sara is running 185 secs || 1279763 markings, 1609802 edges, 6649 markings/sec, 185 secs
lola: sara is running 190 secs || 1313159 markings, 1654197 edges, 6679 markings/sec, 190 secs
lola: sara is running 195 secs || 1346437 markings, 1698050 edges, 6656 markings/sec, 195 secs
lola: sara is running 200 secs || 1379782 markings, 1741450 edges, 6669 markings/sec, 200 secs
lola: sara is running 205 secs || 1412940 markings, 1784253 edges, 6632 markings/sec, 205 secs
lola: sara is running 210 secs || 1446022 markings, 1826567 edges, 6616 markings/sec, 210 secs
lola: sara is running 215 secs || 1479158 markings, 1869488 edges, 6627 markings/sec, 215 secs
lola: sara is running 220 secs || 1512314 markings, 1912690 edges, 6631 markings/sec, 220 secs
lola: sara is running 225 secs || 1545393 markings, 1956421 edges, 6616 markings/sec, 225 secs
lola: sara is running 230 secs || 1578541 markings, 1998825 edges, 6630 markings/sec, 230 secs
lola: sara is running 235 secs || 1611698 markings, 2041899 edges, 6631 markings/sec, 235 secs
lola: sara is running 240 secs || 1645106 markings, 2085224 edges, 6682 markings/sec, 240 secs
lola: sara is running 245 secs || 1678231 markings, 2128399 edges, 6625 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= SigAbort)))
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 2016 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-S04J04T06-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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)))
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 2016 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-S04J04T06-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 54154 markings, 58013 edges, 10831 markings/sec, 0 secs
lola: sara is running 5 secs || 108830 markings, 116757 edges, 10935 markings/sec, 5 secs
lola: sara is running 10 secs || 165278 markings, 178318 edges, 11290 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6) AND (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6) AND ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + Dis... (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 2016 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T06-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((BlockedTasks <= cJobCnt)))
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 2016 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-S04J04T06-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 35309 markings, 38057 edges, 7062 markings/sec, 0 secs
lola: sara is running 5 secs || 70390 markings, 77593 edges, 7016 markings/sec, 5 secs
lola: sara is running 10 secs || 105391 markings, 117389 edges, 7000 markings/sec, 10 secs
lola: sara is running 15 secs || 140365 markings, 157463 edges, 6995 markings/sec, 15 secs
lola: sara is running 20 secs || 175339 markings, 198827 edges, 6995 markings/sec, 20 secs
lola: sara is running 25 secs || 209843 markings, 239433 edges, 6901 markings/sec, 25 secs
lola: sara is running 30 secs || 243208 markings, 280719 edges, 6673 markings/sec, 30 secs
lola: sara is running 35 secs || 277485 markings, 321423 edges, 6855 markings/sec, 35 secs
lola: sara is running 40 secs || 311776 markings, 363495 edges, 6858 markings/sec, 40 secs
lola: sara is running 45 secs || 346022 markings, 404787 edges, 6849 markings/sec, 45 secs
lola: sara is running 50 secs || 380314 markings, 446496 edges, 6858 markings/sec, 50 secs
lola: sara is running 55 secs || 414533 markings, 487682 edges, 6844 markings/sec, 55 secs
lola: sara is running 60 secs || 448800 markings, 529685 edges, 6853 markings/sec, 60 secs
lola: sara is running 65 secs || 482999 markings, 571767 edges, 6840 markings/sec, 65 secs
lola: sara is running 70 secs || 517268 markings, 615317 edges, 6854 markings/sec, 70 secs
lola: sara is running 75 secs || 551498 markings, 658398 edges, 6846 markings/sec, 75 secs
lola: sara is running 80 secs || 585525 markings, 700686 edges, 6805 markings/sec, 80 secs
lola: sara is running 85 secs || 619575 markings, 743103 edges, 6810 markings/sec, 85 secs
lola: sara is running 90 secs || 652939 markings, 784931 edges, 6673 markings/sec, 90 secs
lola: sara is running 95 secs || 685512 markings, 826055 edges, 6515 markings/sec, 95 secs
lola: sara is running 100 secs || 718185 markings, 866270 edges, 6535 markings/sec, 100 secs
lola: sara is running 105 secs || 750785 markings, 906743 edges, 6520 markings/sec, 105 secs
lola: sara is running 110 secs || 783316 markings, 948026 edges, 6506 markings/sec, 110 secs
lola: sara is running 115 secs || 816041 markings, 989933 edges, 6545 markings/sec, 115 secs
lola: sara is running 120 secs || 848725 markings, 1030503 edges, 6537 markings/sec, 120 secs
lola: sara is running 125 secs || 881388 markings, 1071545 edges, 6533 markings/sec, 125 secs
lola: sara is running 130 secs || 914015 markings, 1113353 edges, 6525 markings/sec, 130 secs
lola: sara is running 135 secs || 946681 markings, 1156158 edges, 6533 markings/sec, 135 secs
lola: sara is running 140 secs || 979270 markings, 1197476 edges, 6518 markings/sec, 140 secs
lola: sara is running 145 secs || 1011780 markings, 1238022 edges, 6502 markings/sec, 145 secs
lola: sara is running 150 secs || 1044391 markings, 1279537 edges, 6522 markings/sec, 150 secs
lola: sara is running 155 secs || 1076910 markings, 1322051 edges, 6504 markings/sec, 155 secs
lola: sara is running 160 secs || 1109511 markings, 1363303 edges, 6520 markings/sec, 160 secs
lola: sara is running 165 secs || 1141997 markings, 1404490 edges, 6497 markings/sec, 165 secs
lola: sara is running 170 secs || 1174650 markings, 1448311 edges, 6531 markings/sec, 170 secs
lola: sara is running 175 secs || 1207167 markings, 1491248 edges, 6503 markings/sec, 175 secs
lola: sara is running 180 secs || 1239732 markings, 1533363 edges, 6513 markings/sec, 180 secs
lola: sara is running 185 secs || 1272212 markings, 1575066 edges, 6496 markings/sec, 185 secs
lola: sara is running 190 secs || 1304648 markings, 1615937 edges, 6487 markings/sec, 190 secs
lola: sara is running 195 secs || 1337092 markings, 1657716 edges, 6489 markings/sec, 195 secs
lola: sara is running 200 secs || 1369623 markings, 1698547 edges, 6506 markings/sec, 200 secs
lola: sara is running 205 secs || 1402011 markings, 1738977 edges, 6478 markings/sec, 205 secs
lola: sara is running 210 secs || 1435380 markings, 1780380 edges, 6674 markings/sec, 210 secs
lola: sara is running 215 secs || 1469029 markings, 1823991 edges, 6730 markings/sec, 215 secs
lola: sara is running 220 secs || 1502788 markings, 1867074 edges, 6752 markings/sec, 220 secs
lola: sara is running 225 secs || 1536242 markings, 1909678 edges, 6691 markings/sec, 225 secs
lola: sara is running 230 secs || 1569860 markings, 1953298 edges, 6724 markings/sec, 230 secs
lola: sara is running 235 secs || 1603307 markings, 1996605 edges, 6689 markings/sec, 235 secs
lola: sara is running 240 secs || 1635675 markings, 2038621 edges, 6474 markings/sec, 240 secs
lola: sara is running 245 secs || 1668004 markings, 2079833 edges, 6466 markings/sec, 245 secs
lola: sara is running 250 secs || 1700435 markings, 2121981 edges, 6486 markings/sec, 250 secs
lola: sara is running 255 secs || 1732882 markings, 2164038 edges, 6489 markings/sec, 255 secs
lola: sara is running 260 secs || 1765213 markings, 2206176 edges, 6466 markings/sec, 260 secs
lola: sara is running 265 secs || 1797465 markings, 2247491 edges, 6450 markings/sec, 265 secs
lola: sara is running 270 secs || 1829760 markings, 2289726 edges, 6459 markings/sec, 270 secs
lola: sara is running 275 secs || 1862116 markings, 2332015 edges, 6471 markings/sec, 275 secs
lola: sara is running 280 secs || 1894373 markings, 2373872 edges, 6451 markings/sec, 280 secs
lola: sara is running 285 secs || 1926756 markings, 2416274 edges, 6477 markings/sec, 285 secs
lola: sara is running 290 secs || 1959016 markings, 2457461 edges, 6452 markings/sec, 290 secs
lola: sara is running 295 secs || 1991373 markings, 2499791 edges, 6471 markings/sec, 295 secs
lola: sara is running 300 secs || 2023909 markings, 2542502 edges, 6507 markings/sec, 300 secs
lola: sara is running 305 secs || 2056143 markings, 2583527 edges, 6447 markings/sec, 305 secs
lola: sara is running 310 secs || 2088429 markings, 2625923 edges, 6457 markings/sec, 310 secs
lola: sara is running 315 secs || 2120645 markings, 2667591 edges, 6443 markings/sec, 315 secs
lola: sara is running 320 secs || 2152771 markings, 2708058 edges, 6425 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: '@'
Aborted (core dumped)
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-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 stdout -----
----- Finished stderr -----

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-S04J04T06"
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-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 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-S04J04T06, 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-152673529200180"
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 ;