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 3.5M
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K 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 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 56K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-PT-S05J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534400360
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527071562621


BK_STOP 1527071884174

--------------------
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 PolyORBNT-PT-S05J80 as instance name.
Using PolyORBNT 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': 1329555, 'Memory': 15951.79, 'Tool': 'lola'}, {'Time': 1340308, 'Memory': 15952.83, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-PT-S05J80...

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


checking for too many tokens
===========================================================================================
PolyORBNT-PT-S05J80: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-PT-S05J80 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
Makefile:222: recipe for target 'verify' failed
----- Finished stderr -----
----- 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: 3539/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 1189 places, 2350 transitions, 1007 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S05J80-CTLCardinality.task
lola: NOT(E (F (((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60 + QueueJobB_1_61 + QueueJobB_1_62 + QueueJobB_1_63 + QueueJobB_1_64 + QueueJobB_1_65 + QueueJobB_1_66 + QueueJobB_1_67 + QueueJobB_1_68 + QueueJobB_1_69 + QueueJobB_1_70 + QueueJobB_1_71 + QueueJobB_1_72 + QueueJobB_1_73 + QueueJobB_1_74 + QueueJobB_1_75 + QueueJobB_1_76 + QueueJobB_1_77 + QueueJobB_1_78 + QueueJobB_1_79 + QueueJobB_1_80) AND (Check_Sources_B_1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30 + FetchJobE_1_31 + FetchJobE_1_32 + FetchJobE_1_33 + FetchJobE_1_34 + FetchJobE_1_35 + FetchJobE_1_36 + FetchJobE_1_37 + FetchJobE_1_38 + FetchJobE_1_39 + FetchJobE_1_40 + FetchJobE_1_41 + FetchJobE_1_42 + FetchJobE_1_43 + FetchJobE_1_44 + FetchJobE_1_45 + FetchJobE_1_46 + FetchJobE_1_47 + FetchJobE_1_48 + FetchJobE_1_49 + FetchJobE_1_50 + FetchJobE_1_51 + FetchJobE_1_52 + FetchJobE_1_53 + FetchJobE_1_54 + FetchJobE_1_55 + FetchJobE_1_56 + FetchJobE_1_57 + FetchJobE_1_58 + FetchJobE_1_59 + FetchJobE_1_60 + FetchJobE_1_61 + FetchJobE_1_62 + FetchJobE_1_63 + FetchJobE_1_64 + FetchJobE_1_65 + FetchJobE_1_66 + FetchJobE_1_67 + FetchJobE_1_68 + FetchJobE_1_69 + FetchJobE_1_70 + FetchJobE_1_71 + FetchJobE_1_72 + FetchJobE_1_73 + FetchJobE_1_74 + FetchJobE_1_75 + FetchJobE_1_76 + FetchJobE_1_77 + FetchJobE_1_78 + FetchJobE_1_79 + FetchJobE_1_80) AND ((place_456 <= place_518_1) OR (1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)))))) : E (G ((A (G ((1 <= mi1))) OR (3 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_PerformWork_61 + Schedule_Task_E_1_PerformWork_62 + Schedule_Task_E_1_PerformWork_63 + Schedule_Task_E_1_PerformWork_64 + Schedule_Task_E_1_PerformWork_65 + Schedule_Task_E_1_PerformWork_66 + Schedule_Task_E_1_PerformWork_67 + Schedule_Task_E_1_PerformWork_68 + Schedule_Task_E_1_PerformWork_69 + Schedule_Task_E_1_PerformWork_70 + Schedule_Task_E_1_PerformWork_71 + Schedule_Task_E_1_PerformWork_72 + Schedule_Task_E_1_PerformWork_73 + Schedule_Task_E_1_PerformWork_74 + Schedule_Task_E_1_PerformWork_75 + Schedule_Task_E_1_PerformWork_76 + Schedule_Task_E_1_PerformWork_77 + Schedule_Task_E_1_PerformWork_78 + Schedule_Task_E_1_PerformWork_79 + Schedule_Task_E_1_PerformWork_80 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9)))) : E (G (TRUE)) : (A (G ((1 <= place_462))) OR A (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80 + 1 <= Perform_Work_E_1)))) : (E ((((3 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) OR (2 <= Try_Check_Sources_B_1)) U ((Schedule_Task_B_1 <= CanInjectEvent) AND (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60 + QueueJobB_1_61 + QueueJobB_1_62 + QueueJobB_1_63 + QueueJobB_1_64 + QueueJobB_1_65 + QueueJobB_1_66 + QueueJobB_1_67 + QueueJobB_1_68 + QueueJobB_1_69 + QueueJobB_1_70 + QueueJobB_1_71 + QueueJobB_1_72 + QueueJobB_1_73 + QueueJobB_1_74 + QueueJobB_1_75 + QueueJobB_1_76 + QueueJobB_1_77 + QueueJobB_1_78 + QueueJobB_1_79 + QueueJobB_1_80)))) OR (NOT(A (X ((1 <= Check_Sources_E_1)))) AND (1 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5))) : E (X (E (((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) U (3 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_PerformWork_61 + Schedule_Task_E_1_PerformWork_62 + Schedule_Task_E_1_PerformWork_63 + Schedule_Task_E_1_PerformWork_64 + Schedule_Task_E_1_PerformWork_65 + Schedule_Task_E_1_PerformWork_66 + Schedule_Task_E_1_PerformWork_67 + Schedule_Task_E_1_PerformWork_68 + Schedule_Task_E_1_PerformWork_69 + Schedule_Task_E_1_PerformWork_70 + Schedule_Task_E_1_PerformWork_71 + Schedule_Task_E_1_PerformWork_72 + Schedule_Task_E_1_PerformWork_73 + Schedule_Task_E_1_PerformWork_74 + Schedule_Task_E_1_PerformWork_75 + Schedule_Task_E_1_PerformWork_76 + Schedule_Task_E_1_PerformWork_77 + Schedule_Task_E_1_PerformWork_78 + Schedule_Task_E_1_PerformWork_79 + Schedule_Task_E_1_PerformWork_80 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9))))) : ((1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60 + QueueJobB_1_61 + QueueJobB_1_62 + QueueJobB_1_63 + QueueJobB_1_64 + QueueJobB_1_65 + QueueJobB_1_66 + QueueJobB_1_67 + QueueJobB_1_68 + QueueJobB_1_69 + QueueJobB_1_70 + QueueJobB_1_71 + QueueJobB_1_72 + QueueJobB_1_73 + QueueJobB_1_74 + QueueJobB_1_75 + QueueJobB_1_76 + QueueJobB_1_77 + QueueJobB_1_78 + QueueJobB_1_79 + QueueJobB_1_80) OR NOT(NOT(E (F ((2 <= place_518_1)))))) : E (G ((((DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 + 1 <= place_518_1) AND ((block <= Try_Check_Sources_E_1) OR (place_500_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 + f1_41 + f1_42 + f1_43 + f1_44 + f1_45 + f1_46 + f1_47 + f1_48 + f1_49 + f1_50 + f1_51 + f1_52 + f1_53 + f1_54 + f1_55 + f1_56 + f1_57 + f1_58 + f1_59 + f1_60 + f1_61 + f1_62 + f1_63 + f1_64 + f1_65 + f1_66 + f1_67 + f1_68 + f1_69 + f1_70 + f1_71 + f1_72 + f1_73 + f1_74 + f1_75 + f1_76 + f1_77 + f1_78 + f1_79 + f1_80))) OR E (F ((mo3 <= block)))))) : E (F ((3 <= f2_16))) : A (G ((A (X ((2 <= AvailableJobId_26))) OR ((2 <= CreatedJobs_10_4) OR (2 <= FetchJobE_1_2) OR (CreatedJobs_77_1 <= CreatedJobs_32_2) OR (2 <= CreatedJobs_24_4))))) : A (F (A (G ((2 <= f1_72))))) : NOT(E (G (((CreatedJobs_63_5 <= 2) OR (CreatedJobs_40_5 <= 1))))) : A (F (E (F ((3 <= Perform_Work_B_1_25))))) : (NOT(A (G ((FetchJobE_1_46 <= 2)))) OR ((NotifyEventJobQueuedB_1_17 <= 0) AND (CreatedJobs_12_5 <= 2) AND (CreatedJobs_26_2 + 1 <= place_500_1) AND ((AvailableJobId_34 + 1 <= CreatedJobs_5_2) OR (3 <= f2_58) OR (FetchJobE_1_32 + 1 <= CreatedJobs_19_3)))) : (((CreatedJobs_54_1 <= 0) OR (CreatedJobs_67_1 + 1 <= f2_24) OR ((FetchJobE_1_33 <= Perform_Work_B_1_11) AND (Schedule_Task_E_1_PerformWork_26 <= CreatedJobs_23_3) AND ((1 <= QueueJobB_1_53) OR (1 <= CreatedJobs_72_1))) OR ((2 <= CreatedJobs_55_3) AND (((CreatedJobs_32_1 <= CreatedJobs_9_4) AND (FetchJobE_1_46 <= CreatedJobs_23_1)) OR (3 <= f1_19)))) AND E (F (E (G ((1 <= AvailableJobId_44)))))) : E (((CreatedJobs_3_1 <= 0) U A (G ((CreatedJobs_58_5 <= CreatedJobs_34_5)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + Qu... (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 4028 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 PolyORBNT-PT-S05J80-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((1 <= mi1))) OR (3 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (mi1 <= 0)) AND (Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_T... (shortened)
lola: processed formula length: 2905
lola: 6 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 27 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J80-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= place_462))) OR A (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= place_462)))
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 4028 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to PolyORBNT-PT-S05J80-CTLCardinality-3.sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80 + 1 <= Perform_Work_E_1)))
lola: processed formula: A (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform... (shortened)
lola: processed formula length: 1803
lola: 0 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J80-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4032 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) OR (2 <= Try_Check_Sources_B_1)) U ((Schedule_Task_B_1 <= CanInjectEvent) AND (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) OR (2 <= Try_Check_Sources_B_1)) U ((Schedule_Task_B_1 <= CanInjectEvent) AND (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) OR (2 <= Try_Check_Sources_B_1)) U ((Schedule_Task_B_1 <= CanInjectEvent) AND (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + Qu... (shortened)
lola: processed formula length: 1520
lola: 4 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) U (3 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Sc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5) U (3 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedul... (shortened)
lola: processed formula length: 2937
lola: 2 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: 285520 markings, 732584 edges, 3689348869717491712 markings/sec, 0 secs
lola: 574526 markings, 1474300 edges, 57801 markings/sec, 5 secs
lola: 844071 markings, 2177818 edges, 53909 markings/sec, 10 secs
lola: 1114249 markings, 2883922 edges, 54036 markings/sec, 15 secs
lola: 1406193 markings, 3592193 edges, 58389 markings/sec, 20 secs
lola: 1702310 markings, 4290109 edges, 59223 markings/sec, 25 secs
lola: 1985768 markings, 4966077 edges, 56692 markings/sec, 30 secs
lola: 2259192 markings, 5625055 edges, 54685 markings/sec, 35 secs
lola: 2530169 markings, 6290262 edges, 54195 markings/sec, 40 secs
lola: 2771480 markings, 6886538 edges, 48262 markings/sec, 45 secs
lola: 2993910 markings, 7445847 edges, 44486 markings/sec, 50 secs
lola: 3211309 markings, 8004890 edges, 43480 markings/sec, 55 secs
lola: 3411128 markings, 8533478 edges, 39964 markings/sec, 60 secs
lola: 3598762 markings, 9056546 edges, 37527 markings/sec, 65 secs
lola: 3757244 markings, 9619518 edges, 31696 markings/sec, 70 secs
lola: 3884574 markings, 10102058 edges, 25466 markings/sec, 75 secs
lola: 4035782 markings, 10555333 edges, 30242 markings/sec, 80 secs
lola: 4194998 markings, 11037073 edges, 31843 markings/sec, 85 secs
lola: 4350177 markings, 11514713 edges, 31036 markings/sec, 90 secs
lola: 4487350 markings, 11951097 edges, 27435 markings/sec, 95 secs
lola: 4620857 markings, 12428378 edges, 26701 markings/sec, 100 secs
lola: 4770002 markings, 12874771 edges, 29829 markings/sec, 105 secs
lola: 4925397 markings, 13345175 edges, 31079 markings/sec, 110 secs
lola: 5074044 markings, 13802252 edges, 29729 markings/sec, 115 secs
lola: 5208160 markings, 14227603 edges, 26823 markings/sec, 120 secs
lola: 5331042 markings, 14681956 edges, 24576 markings/sec, 125 secs
lola: 5442749 markings, 15103001 edges, 22341 markings/sec, 130 secs
lola: 5715520 markings, 15822327 edges, 54554 markings/sec, 135 secs
lola: 5991330 markings, 16539649 edges, 55162 markings/sec, 140 secs
lola: 6244671 markings, 17197608 edges, 50668 markings/sec, 145 secs
lola: 6494371 markings, 17844668 edges, 49940 markings/sec, 150 secs
lola: 6772358 markings, 18556712 edges, 55597 markings/sec, 155 secs
lola: 7024068 markings, 19194281 edges, 50342 markings/sec, 160 secs
lola: 7284673 markings, 19840552 edges, 52121 markings/sec, 165 secs
lola: 7529877 markings, 20457504 edges, 49041 markings/sec, 170 secs
lola: 7756535 markings, 21033997 edges, 45332 markings/sec, 175 secs
lola: 7998354 markings, 21650325 edges, 48364 markings/sec, 180 secs
lola: 8213280 markings, 22199147 edges, 42985 markings/sec, 185 secs
lola: 8446689 markings, 22783625 edges, 46682 markings/sec, 190 secs
lola: 8676291 markings, 23355698 edges, 45920 markings/sec, 195 secs
lola: 8871332 markings, 23850740 edges, 39008 markings/sec, 200 secs
lola: 9066333 markings, 24353699 edges, 39000 markings/sec, 205 secs
lola: 9241876 markings, 24823105 edges, 35109 markings/sec, 210 secs
lola: 9287210 markings, 24946208 edges, 9067 markings/sec, 215 secs
lola: 9287956 markings, 24949303 edges, 149 markings/sec, 220 secs
lola: 9288363 markings, 24950414 edges, 81 markings/sec, 225 secs
lola: 9288828 markings, 24951930 edges, 93 markings/sec, 230 secs
lola: 9289081 markings, 24952746 edges, 51 markings/sec, 235 secs
lola: 9289214 markings, 24953130 edges, 27 markings/sec, 240 secs
lola: 9289368 markings, 24953638 edges, 31 markings/sec, 245 secs
lola: 9289478 markings, 24953857 edges, 22 markings/sec, 250 secs
lola: 9289494 markings, 24953895 edges, 3 markings/sec, 255 secs
lola: 9289502 markings, 24953917 edges, 2 markings/sec, 260 secs
lola: 9289509 markings, 24953932 edges, 1 markings/sec, 265 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 PolyORBNT-PT-S05J80-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J80-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="PolyORBNT-PT-S05J80"
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/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 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 PolyORBNT-PT-S05J80, 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-152673534400360"
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 ;