Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 259K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 736K 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 26K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K 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 68K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 213K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 19M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBNT-PT-S10J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673527300395
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527288427554

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBNT-PT-S10J80 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBNT-PT-S10J80 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ PolyORBNT-PT-S10J80 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 15114/65536 symbol table entries, 4786 collisions
lola: preprocessing...
lola: Size of bit vector: 51648
lola: finding significant places
lola: 1614 places, 13500 transitions, 1422 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S10J80-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= Perform_Work_E_1)
lola: LP says that atomic proposition is always false: (3 <= 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)
lola: LP says that atomic proposition is always false: (cJobCnt <= QueueJobE_1)
lola: LP says that atomic proposition is always true: (f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_58 + f3_59 + f3_60 + f3_61 + f3_62 + f3_63 + f3_64 + f3_65 + f3_66 + f3_67 + f3_68 + f3_69 + f3_70 + f3_71 + f3_72 + f3_73 + f3_74 + f3_75 + f3_76 + f3_77 + f3_78 + f3_79 + f3_80 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_16 + AvailableJobId_19 + AvailableJobId_21 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_33 + AvailableJobId_34 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_40 + AvailableJobId_41 + AvailableJobId_45 + AvailableJobId_46 + AvailableJobId_48 + AvailableJobId_49 + AvailableJobId_50 + AvailableJobId_51 + AvailableJobId_52 + AvailableJobId_53 + AvailableJobId_57 + AvailableJobId_58 + AvailableJobId_60 + AvailableJobId_61 + AvailableJobId_62 + AvailableJobId_63 + AvailableJobId_64 + AvailableJobId_65 + AvailableJobId_69 + AvailableJobId_70 + AvailableJobId_71 + AvailableJobId_72 + AvailableJobId_73 + AvailableJobId_74 + AvailableJobId_75 + AvailableJobId_76 + AvailableJobId_77 + AvailableJobId_4 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_80 + AvailableJobId_79 + AvailableJobId_78 + AvailableJobId_68 + AvailableJobId_67 + AvailableJobId_66 + AvailableJobId_59 + AvailableJobId_56 + AvailableJobId_55 + AvailableJobId_54 + AvailableJobId_47 + AvailableJobId_44 + AvailableJobId_43 + AvailableJobId_42 + AvailableJobId_32 + AvailableJobId_31 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_20 + AvailableJobId_18 + AvailableJobId_17)
lola: LP says that atomic proposition is always false: (3 <= NotifyEventJobQueuedB_1_38)
lola: LP says that atomic proposition is always false: (2 <= Schedule_Task_E_1_PerformWork_51)
lola: LP says that atomic proposition is always false: (2 <= CreatedJobs_33_10)
lola: LP says that atomic proposition is always false: (3 <= CreatedJobs_24_3)
lola: A (G (((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3))) AND E (X ((QueueJobE_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 + f2_48 + f2_49 + f2_50 + f2_51 + f2_52 + f2_53 + f2_54 + f2_55 + f2_56 + f2_57 + f2_58 + f2_59 + f2_60 + f2_61 + f2_62 + f2_63 + f2_64 + f2_65 + f2_66 + f2_67 + f2_68 + f2_69 + f2_70 + f2_71 + f2_72 + f2_73 + f2_74 + f2_75 + f2_76 + f2_77 + f2_78 + f2_79 + f2_80)))))) : E (G (A (X ((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 <= 0))))) : (E (F ((1 <= place_522_1))) AND NOT(E (F ((DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJobQueuedB_1_67 + NotifyEventJobQueuedB_1_66 + NotifyEventJobQueuedB_1_65 + NotifyEventJobQueuedB_1_64 + NotifyEventJobQueuedB_1_63 + NotifyEventJobQueuedB_1_62 + NotifyEventJobQueuedB_1_61 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_80 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9))))) : 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 <= place_521_1) AND (2 <= place_460)))) : A (F ((A (G (FALSE)) AND (place_462 <= mo1)))) : (((place_782_1 <= NotifyEventEndOfCheckSourcesE_1) AND E (G ((place_456 + 1 <= mo1)))) OR FALSE) : E (X (E (F (FALSE)))) : A (G (E (G (TRUE)))) : NOT(E (G ((f3_6 <= CreatedJobs_12_1)))) : A (G (E (G ((CreatedJobs_61_7 <= CreatedJobs_50_10))))) : E ((E (G (FALSE)) U E (G ((f1_8 <= Perform_Work_B_1_58))))) : E ((() U E (G ((CreatedJobs_18_2 <= CreatedJobs_26_5))))) : A ((E (X ((CreatedJobs_5_8 <= FetchJobE_1_27))) U FALSE)) : E (G (E (F (((TheSour_8 <= CreatedJobs_58_9) OR (CreatedJobs_58_3 <= CreatedJobs_63_1)))))) : A (G ((FetchJobE_1_80 <= CreatedJobs_39_7))) : A ((A (G ((FetchJobE_1_1 <= f1_24))) U A (X ((1 <= FetchJobE_1_15)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-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: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3))))) AND A (G (E (X ((QueueJobE_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((3 <= place_462) OR (1 <= CanInjectEvent)) AND ((place_462 <= place_521_1) OR (1 <= mi3)))))
lola: processed formula length: 102
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((place_462 <= 2) AND (CanInjectEvent <= 0)) OR ((place_521_1 + 1 <= place_462) AND (mi3 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((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... (shortened)
lola: processed formula length: 666
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= FetchJobE_1_15))) OR (A (G ((FetchJobE_1_1 <= f1_24))) AND A (F (A (X ((1 <= FetchJobE_1_15)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FetchJobE_1_1 <= f1_24)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FetchJobE_1_1 <= f1_24)))
lola: processed formula length: 32
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (f1_24 + 1 <= FetchJobE_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-6-0.sara.
lola: sara is running 0 secs || 5059 markings, 6047 edges, 1012 markings/sec, 0 secs
lola: sara is running 5 secs || 9910 markings, 11521 edges, 970 markings/sec, 5 secs
lola: sara is running 10 secs || 14664 markings, 16911 edges, 951 markings/sec, 10 secs
lola: sara is running 15 secs || 19366 markings, 22280 edges, 940 markings/sec, 15 secs
lola: sara is running 20 secs || 24140 markings, 27727 edges, 955 markings/sec, 20 secs
lola: sara is running 25 secs || 29065 markings, 33315 edges, 985 markings/sec, 25 secs
lola: sara is running 30 secs || 33805 markings, 38800 edges, 948 markings/sec, 30 secs
lola: sara is running 35 secs || 38583 markings, 44361 edges, 956 markings/sec, 35 secs
lola: sara is running 40 secs || 43406 markings, 49948 edges, 965 markings/sec, 40 secs
lola: sara is running 45 secs || 48298 markings, 55641 edges, 978 markings/sec, 45 secs
lola: sara is running 50 secs || 53178 markings, 61361 edges, 976 markings/sec, 50 secs
lola: sara is running 55 secs || 58013 markings, 67077 edges, 967 markings/sec, 55 secs
lola: sara is running 60 secs || 62861 markings, 72864 edges, 970 markings/sec, 60 secs
lola: sara is running 65 secs || 67561 markings, 78625 edges, 940 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 72380 markings, 84536 edges, 964 markings/sec, 70 secs

lola: sara is running 75 secs || 77261 markings, 90604 edges, 976 markings/sec, 75 secs
lola: sara is running 80 secs || 82044 markings, 96742 edges, 957 markings/sec, 80 secs
lola: sara is running 85 secs || 86642 markings, 102749 edges, 920 markings/sec, 85 secs
lola: sara is running 90 secs || 91133 markings, 108961 edges, 898 markings/sec, 90 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= FetchJobE_1_15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((1 <= FetchJobE_1_15))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FetchJobE_1_80 <= CreatedJobs_39_7)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FetchJobE_1_80 <= CreatedJobs_39_7)))
lola: processed formula length: 44
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (CreatedJobs_39_7 + 1 <= FetchJobE_1_80)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-7-0.sara.
lola: sara is running 0 secs || 4828 markings, 5373 edges, 966 markings/sec, 0 secs
lola: sara is running 5 secs || 9721 markings, 10907 edges, 979 markings/sec, 5 secs
lola: sara is running 10 secs || 14570 markings, 16430 edges, 970 markings/sec, 10 secs
lola: sara is running 15 secs || 19369 markings, 21872 edges, 960 markings/sec, 15 secs
lola: sara is running 20 secs || 24266 markings, 27395 edges, 979 markings/sec, 20 secs
lola: sara is running 25 secs || 28994 markings, 32865 edges, 946 markings/sec, 25 secs
lola: sara is running 30 secs || 33924 markings, 38461 edges, 986 markings/sec, 30 secs
lola: sara is running 35 secs || 38698 markings, 44018 edges, 955 markings/sec, 35 secs
lola: sara is running 40 secs || 43546 markings, 49648 edges, 970 markings/sec, 40 secs
lola: sara is running 45 secs || 48425 markings, 55341 edges, 976 markings/sec, 45 secs
lola: sara is running 50 secs || 53113 markings, 60937 edges, 938 markings/sec, 50 secs
lola: sara is running 55 secs || 57966 markings, 66642 edges, 971 markings/sec, 55 secs
lola: sara is running 60 secs || 62746 markings, 72376 edges, 956 markings/sec, 60 secs
lola: sara is running 65 secs || 67597 markings, 78238 edges, 970 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 72427 markings, 84163 edges, 966 markings/sec, 70 secs

lola: sara is running 75 secs || 77177 markings, 90165 edges, 950 markings/sec, 75 secs
lola: sara is running 80 secs || 82084 markings, 96389 edges, 981 markings/sec, 80 secs
lola: sara is running 85 secs || 86964 markings, 102841 edges, 976 markings/sec, 85 secs
lola: sara is running 90 secs || 91803 markings, 109582 edges, 968 markings/sec, 90 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((CreatedJobs_61_7 <= CreatedJobs_50_10)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((CreatedJobs_61_7 <= CreatedJobs_50_10)))
lola: processed formula length: 47
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (CreatedJobs_50_10 + 1 <= CreatedJobs_61_7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 34 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CreatedJobs_12_1 + 1 <= f3_6)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (f3_6 <= CreatedJobs_12_1)
lola: processed formula length: 26
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 17 edges

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((f1_8 <= Perform_Work_B_1_58)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((f1_8 <= Perform_Work_B_1_58)))
lola: processed formula length: 37
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((CreatedJobs_18_2 <= CreatedJobs_26_5)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (CreatedJobs_18_2 <= CreatedJobs_26_5)
lola: processed formula length: 38
lola: 36 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 793 seconds at most (--localtimelimit=0)
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 + Perfor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((place_521_1 + 1 <= 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_... (shortened)
lola: processed formula length: 1813
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1057 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((place_782_1 <= NotifyEventEndOfCheckSourcesE_1) AND E (G ((place_456 + 1 <= mo1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1057 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (place_782_1 <= NotifyEventEndOfCheckSourcesE_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (place_782_1 <= NotifyEventEndOfCheckSourcesE_1)
lola: processed formula length: 48
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((place_456 + 1 <= mo1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((place_456 + 1 <= mo1)))
lola: processed formula length: 30
lola: 35 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((TheSour_8 <= CreatedJobs_58_9) OR (CreatedJobs_58_3 <= CreatedJobs_63_1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: ((TheSour_8 <= CreatedJobs_58_9) OR (CreatedJobs_58_3 <= CreatedJobs_63_1))
lola: processed formula length: 76
lola: 36 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= place_522_1))) AND A (G ((NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= place_522_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= place_522_1)))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= place_522_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= place_522_1))) AND A (G ((NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= place_522_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= place_522_1)))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= place_522_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJobQueuedB_1_67 + NotifyEventJobQu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJobQueuedB_1_67 + NotifyEventJobQu... (shortened)
lola: processed formula length: 2492
lola: 37 rewrites
lola: closed formula file PolyORBNT-PT-S10J80-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= NotifyEventJobQueuedB_1_79 + NotifyEventJobQueuedB_1_78 + NotifyEventJobQueuedB_1_77 + NotifyEventJobQueuedB_1_76 + NotifyEventJobQueuedB_1_75 + NotifyEventJobQueuedB_1_74 + NotifyEventJobQueuedB_1_73 + NotifyEventJobQueuedB_1_72 + NotifyEventJobQueuedB_1_71 + NotifyEventJobQueuedB_1_70 + NotifyEventJobQueuedB_1_69 + NotifyEventJobQueuedB_1_68 + NotifyEventJobQueuedB_1_67 + NotifyEventJobQueuedB_1_66 + NotifyEventJobQueuedB_1_65 + NotifyEventJobQueuedB_1_64 + NotifyEventJobQueuedB_1_63 + NotifyEventJobQueuedB_1_62 + NotifyEventJobQueuedB_1_61 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_80 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J80-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J80-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes no yes no no yes yes no yes no no
lola:
preliminary result: no yes no no no yes no yes no no yes yes no yes no no
lola: memory consumption: 75328 KB
lola: time consumption: 396 seconds

BK_STOP 1527288824730

--------------------
content from 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="PolyORBNT-PT-S10J80"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-S10J80.tgz
mv PolyORBNT-PT-S10J80 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 lola"
echo " Input is PolyORBNT-PT-S10J80, 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 r124-smll-152673527300395"
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 ;