About the Execution of 2018-Gold for NeoElection-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 147.270 | 243.00 | 678.00 | 14.70 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r110-oct2-155272242200063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is NeoElection-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242200063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 19K Feb 12 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 12 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 8 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 8 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 13K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 4 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 4 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 1 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 1 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 320K Mar 10 17:31 model.pnml
--------------------
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 NeoElection-PT-2-LTLFireability-00
FORMULA_NAME NeoElection-PT-2-LTLFireability-01
FORMULA_NAME NeoElection-PT-2-LTLFireability-02
FORMULA_NAME NeoElection-PT-2-LTLFireability-03
FORMULA_NAME NeoElection-PT-2-LTLFireability-04
FORMULA_NAME NeoElection-PT-2-LTLFireability-05
FORMULA_NAME NeoElection-PT-2-LTLFireability-06
FORMULA_NAME NeoElection-PT-2-LTLFireability-07
FORMULA_NAME NeoElection-PT-2-LTLFireability-08
FORMULA_NAME NeoElection-PT-2-LTLFireability-09
FORMULA_NAME NeoElection-PT-2-LTLFireability-10
FORMULA_NAME NeoElection-PT-2-LTLFireability-11
FORMULA_NAME NeoElection-PT-2-LTLFireability-12
FORMULA_NAME NeoElection-PT-2-LTLFireability-13
FORMULA_NAME NeoElection-PT-2-LTLFireability-14
FORMULA_NAME NeoElection-PT-2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1553033667062
info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NeoElection-PT-2 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ NeoElection-PT-2 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 438
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-2-LTLFireability.task
lola: A ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR FIREABLE(T-poll__handleAnnP1_18) OR FIREABLE(T-poll__handleAnnP1_19) OR FIREABLE(T-poll__handleAnnP1_21) OR FIREABLE(T-poll__handleAnnP1_22) OR FIREABLE(T-poll__handleAnnP1_24) OR FIREABLE(T-poll__handleAnnP1_25) OR FIREABLE(T-poll__handleAnnP1_27) OR FIREABLE(T-poll__handleAnnP1_28) OR FIREABLE(T-poll__handleAnnP1_30) OR FIREABLE(T-poll__handleAnnP1_31) OR FIREABLE(T-poll__handleAnnP1_33) OR FIREABLE(T-poll__handleAnnP1_34) OR FIREABLE(T-poll__handleAnnP1_36) OR FIREABLE(T-poll__handleAnnP1_37) OR FIREABLE(T-poll__handleAnnP1_38) OR FIREABLE(T-poll__handleAnnP1_40) OR FIREABLE(T-poll__handleAnnP1_41) OR FIREABLE(T-poll__handleAnnP1_43) OR FIREABLE(T-poll__handleAnnP1_44) OR FIREABLE(T-poll__handleAnnP1_46) OR FIREABLE(T-poll__handleAnnP1_47) OR FIREABLE(T-poll__handleAnnP1_49) OR FIREABLE(T-poll__handleAnnP1_50) OR FIREABLE(T-poll__handleAnnP1_52) OR FIREABLE(T-poll__handleAnnP1_53))) : A ((FIREABLE(T-poll__handleAskP_1) OR FIREABLE(T-poll__handleAskP_2) OR FIREABLE(T-poll__handleAskP_3) OR FIREABLE(T-poll__handleAskP_4) OR FIREABLE(T-poll__handleAskP_5) OR FIREABLE(T-poll__handleAskP_6) OR FIREABLE(T-poll__handleAskP_7) OR FIREABLE(T-poll__handleAskP_8) OR FIREABLE(T-poll__handleAskP_9) OR FIREABLE(T-poll__handleAskP_10) OR FIREABLE(T-poll__handleAskP_11) OR FIREABLE(T-poll__handleAskP_12) OR FIREABLE(T-poll__handleAskP_13) OR FIREABLE(T-poll__handleAskP_14) OR FIREABLE(T-poll__handleAskP_15) OR FIREABLE(T-poll__handleAskP_16) OR FIREABLE(T-poll__handleAskP_17) OR FIREABLE(T-poll__handleAskP_18) OR FIREABLE(T-poll__handleAskP_19) OR FIREABLE(T-poll__handleAskP_20) OR FIREABLE(T-poll__handleAskP_21) OR FIREABLE(T-poll__handleAskP_22) OR FIREABLE(T-poll__handleAskP_23) OR FIREABLE(T-poll__handleAskP_24) OR FIREABLE(T-poll__handleAskP_25) OR FIREABLE(T-poll__handleAskP_26) OR FIREABLE(T-poll__handleAskP_27) OR FIREABLE(T-poll__handleAskP_28) OR FIREABLE(T-poll__handleAskP_29) OR FIREABLE(T-poll__handleAskP_30) OR FIREABLE(T-poll__handleAskP_31) OR FIREABLE(T-poll__handleAskP_32) OR FIREABLE(T-poll__handleAskP_33) OR FIREABLE(T-poll__handleAskP_34) OR FIREABLE(T-poll__handleAskP_35) OR FIREABLE(T-poll__handleAskP_36) OR FIREABLE(T-poll__handleAskP_37) OR FIREABLE(T-poll__handleAskP_38) OR FIREABLE(T-poll__handleAskP_39) OR FIREABLE(T-poll__handleAskP_40) OR FIREABLE(T-poll__handleAskP_41) OR FIREABLE(T-poll__handleAskP_42) OR FIREABLE(T-poll__handleAskP_43) OR FIREABLE(T-poll__handleAskP_44) OR FIREABLE(T-poll__handleAskP_45) OR FIREABLE(T-poll__handleAskP_46) OR FIREABLE(T-poll__handleAskP_47) OR FIREABLE(T-poll__handleAskP_48) OR FIREABLE(T-poll__handleAskP_49) OR FIREABLE(T-poll__handleAskP_50) OR FIREABLE(T-poll__handleAskP_51) OR FIREABLE(T-poll__handleAskP_52) OR FIREABLE(T-poll__handleAskP_53) OR FIREABLE(T-poll__handleAskP_54))) : A (F (G ((FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE(T-poll__handleAI1_21) OR FIREABLE(T-poll__handleAI1_22) OR FIREABLE(T-poll__handleAI1_23) OR FIREABLE(T-poll__handleAI1_24) OR FIREABLE(T-poll__handleAI1_25) OR FIREABLE(T-poll__handleAI1_26) OR FIREABLE(T-poll__handleAI1_27))))) : A (F (G (((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3)) U F ((FIREABLE(T-poll__start_1) OR FIREABLE(T-poll__start_2) OR FIREABLE(T-poll__start_3))))))) : A (F ((X ((FIREABLE(T-sendAnnPs__start_1) OR FIREABLE(T-sendAnnPs__start_2) OR FIREABLE(T-sendAnnPs__start_3))) U X (G ((FIREABLE(T-sendAnnPs__start_1) OR FIREABLE(T-sendAnnPs__start_2) OR FIREABLE(T-sendAnnPs__start_3))))))) : A ((FIREABLE(T-poll__iAmPrimary_1) OR FIREABLE(T-poll__iAmPrimary_2) OR FIREABLE(T-poll__iAmPrimary_3))) : A (G (G ((X ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR FIREABLE(T-poll__handleAnnP1_18) OR FIREABLE(T-poll__handleAnnP1_19) OR FIREABLE(T-poll__handleAnnP1_21) OR FIREABLE(T-poll__handleAnnP1_22) OR FIREABLE(T-poll__handleAnnP1_24) OR FIREABLE(T-poll__handleAnnP1_25) OR FIREABLE(T-poll__handleAnnP1_27) OR FIREABLE(T-poll__handleAnnP1_28) OR FIREABLE(T-poll__handleAnnP1_30) OR FIREABLE(T-poll__handleAnnP1_31) OR FIREABLE(T-poll__handleAnnP1_33) OR FIREABLE(T-poll__handleAnnP1_34) OR FIREABLE(T-poll__handleAnnP1_36) OR FIREABLE(T-poll__handleAnnP1_37) OR FIREABLE(T-poll__handleAnnP1_38) OR FIREABLE(T-poll__handleAnnP1_40) OR FIREABLE(T-poll__handleAnnP1_41) OR FIREABLE(T-poll__handleAnnP1_43) OR FIREABLE(T-poll__handleAnnP1_44) OR FIREABLE(T-poll__handleAnnP1_46) OR FIREABLE(T-poll__handleAnnP1_47) OR FIREABLE(T-poll__handleAnnP1_49) OR FIREABLE(T-poll__handleAnnP1_50) OR FIREABLE(T-poll__handleAnnP1_52) OR FIREABLE(T-poll__handleAnnP1_53))) U G ((FIREABLE(T-poll__handleAnsP4_3) OR FIREABLE(T-poll__handleAnsP4_4) OR FIREABLE(T-poll__handleAnsP4_5) OR FIREABLE(T-poll__handleAnsP4_6) OR FIREABLE(T-poll__handleAnsP4_9) OR FIREABLE(T-poll__handleAnsP4_10) OR FIREABLE(T-poll__handleAnsP4_11) OR FIREABLE(T-poll__handleAnsP4_12) OR FIREABLE(T-poll__handleAnsP4_15) OR FIREABLE(T-poll__handleAnsP4_16) OR FIREABLE(T-poll__handleAnsP4_17) OR FIREABLE(T-poll__handleAnsP4_18) OR FIREABLE(T-poll__handleAnsP4_21) OR FIREABLE(T-poll__handleAnsP4_22) OR FIREABLE(T-poll__handleAnsP4_23) OR FIREABLE(T-poll__handleAnsP4_24) OR FIREABLE(T-poll__handleAnsP4_27) OR FIREABLE(T-poll__handleAnsP4_28) OR FIREABLE(T-poll__handleAnsP4_29) OR FIREABLE(T-poll__handleAnsP4_30) OR FIREABLE(T-poll__handleAnsP4_33) OR FIREABLE(T-poll__handleAnsP4_34) OR FIREABLE(T-poll__handleAnsP4_35) OR FIREABLE(T-poll__handleAnsP4_36) OR FIREABLE(T-poll__handleAnsP4_39) OR FIREABLE(T-poll__handleAnsP4_40) OR FIREABLE(T-poll__handleAnsP4_41) OR FIREABLE(T-poll__handleAnsP4_42) OR FIREABLE(T-poll__handleAnsP4_45) OR FIREABLE(T-poll__handleAnsP4_46) OR FIREABLE(T-poll__handleAnsP4_47) OR FIREABLE(T-poll__handleAnsP4_48) OR FIREABLE(T-poll__handleAnsP4_51) OR FIREABLE(T-poll__handleAnsP4_52) OR FIREABLE(T-poll__handleAnsP4_53) OR FIREABLE(T-poll__handleAnsP4_54))))))) : A (F (G (F (F ((FIREABLE(T-poll__handleAI2_7) OR FIREABLE(T-poll__handleAI2_8) OR FIREABLE(T-poll__handleAI2_9) OR FIREABLE(T-poll__handleAI2_10) OR FIREABLE(T-poll__handleAI2_11) OR FIREABLE(T-poll__handleAI2_12) OR FIREABLE(T-poll__handleAI2_13) OR FIREABLE(T-poll__handleAI2_14) OR FIREABLE(T-poll__handleAI2_15) OR FIREABLE(T-poll__handleAI2_16) OR FIREABLE(T-poll__handleAI2_17) OR FIREABLE(T-poll__handleAI2_18) OR FIREABLE(T-poll__handleAI2_25) OR FIREABLE(T-poll__handleAI2_26) OR FIREABLE(T-poll__handleAI2_27) OR FIREABLE(T-poll__handleAI2_28) OR FIREABLE(T-poll__handleAI2_29) OR FIREABLE(T-poll__handleAI2_30) OR FIREABLE(T-poll__handleAI2_31) OR FIREABLE(T-poll__handleAI2_32) OR FIREABLE(T-poll__handleAI2_33) OR FIREABLE(T-poll__handleAI2_34) OR FIREABLE(T-poll__handleAI2_35) OR FIREABLE(T-poll__handleAI2_36) OR FIREABLE(T-poll__handleAI2_43) OR FIREABLE(T-poll__handleAI2_44) OR FIREABLE(T-poll__handleAI2_45) OR FIREABLE(T-poll__handleAI2_46) OR FIREABLE(T-poll__handleAI2_47) OR FIREABLE(T-poll__handleAI2_48) OR FIREABLE(T-poll__handleAI2_49) OR FIREABLE(T-poll__handleAI2_50) OR FIREABLE(T-poll__handleAI2_51) OR FIREABLE(T-poll__handleAI2_52) OR FIREABLE(T-poll__handleAI2_53) OR FIREABLE(T-poll__handleAI2_54) OR FIREABLE(T-poll__handleAI2_67) OR FIREABLE(T-poll__handleAI2_68) OR FIREABLE(T-poll__handleAI2_69) OR FIREABLE(T-poll__handleAI2_70) OR FIREABLE(T-poll__handleAI2_71) OR FIREABLE(T-poll__handleAI2_72) OR FIREABLE(T-poll__handleAI2_85) OR FIREABLE(T-poll__handleAI2_86) OR FIREABLE(T-poll__handleAI2_87) OR FIREABLE(T-poll__handleAI2_88) OR FIREABLE(T-poll__handleAI2_89) OR FIREABLE(T-poll__handleAI2_90) OR FIREABLE(T-poll__handleAI2_103) OR FIREABLE(T-poll__handleAI2_104) OR FIREABLE(T-poll__handleAI2_105) OR FIREABLE(T-poll__handleAI2_106) OR FIREABLE(T-poll__handleAI2_107) OR FIREABLE(T-poll__handleAI2_108))))))) : A (G (F (F (FIREABLE(T-poll__handleAnsP4_17))))) : A (F (X (X (G (G (FIREABLE(T-poll__handleAskP_49))))))) : A (G (F (F (F (F (FIREABLE(T-poll__handleAskP_17))))))) : A (G (F (FIREABLE(T-poll__handleAI2_16)))) : A (X (X (G (X (F (FIREABLE(T-poll__iAmPrimary_1))))))) : A (X (FIREABLE(T-startNeg__start_3))) : A (F (G (G ((FIREABLE(T-poll__handleAnsP4_22) U FIREABLE(T-poll__handleAnnP1_36)))))) : A (X (X (FIREABLE(T-poll__handleAnnP1_22))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR... (shortened)
lola: processed formula length: 1323
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.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 NeoElection-PT-2-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-poll__handleAskP_1) OR FIREABLE(T-poll__handleAskP_2) OR FIREABLE(T-poll__handleAskP_3) OR FIREABLE(T-poll__handleAskP_4) OR FIREABLE(T-poll__handleAskP_5) OR FIREABLE(T-poll__handleAskP_6) OR FIREABLE(T-poll__handleAskP_7) OR FIREABLE(T-poll__handleAskP_8) OR FIREABLE(T-poll__handleAskP_9) OR FIREABLE(T-poll__handleAskP_10) OR FIREABLE(T-poll__handleAskP_11) OR FIREABLE(T-p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T-poll__handleAskP_1) OR FIREABLE(T-poll__handleAskP_2) OR FIREABLE(T-poll__handleAskP_3) OR FIREABLE(T-poll__handleAskP_4) OR FIREABLE(T-poll__handleAskP_5) OR FIREABLE(T-poll__handleAskP_6) OR FIREABLE(T-poll__handleAskP_7) OR FIREABLE(T-poll__handleAskP_8) OR FIREABLE(T-poll__handleAskP_9) OR FIREABLE(T-poll__handleAskP_10) OR FIREABLE(T-poll__handleAskP_11) OR FIREABLE(T-p... (shortened)
lola: processed formula length: 1932
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.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 NeoElection-PT-2-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-poll__iAmPrimary_1) OR FIREABLE(T-poll__iAmPrimary_2) OR FIREABLE(T-poll__iAmPrimary_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T-poll__iAmPrimary_1) OR FIREABLE(T-poll__iAmPrimary_2) OR FIREABLE(T-poll__iAmPrimary_3))
lola: processed formula length: 102
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.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 NeoElection-PT-2-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((FIREABLE(T-poll__handleAnsP4_3) OR FIREABLE(T-poll__handleAnsP4_4) OR FIREABLE(T-poll__handleAnsP4_5) OR FIREABLE(T-poll__handleAnsP4_6) OR FIREABLE(T-poll__handleAnsP4_9) OR FIREABLE(T-poll__handleAnsP4_10) OR FIREABLE(T-poll__handleAnsP4_11) OR FIREABLE(T-poll__handleAnsP4_12) OR FIREABLE(T-poll__handleAnsP4_15) OR FIREABLE(T-poll__handleAnsP4_16) OR FIREABLE(T-poll__handleA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(T-poll__handleAnsP4_3) OR FIREABLE(T-poll__handleAnsP4_4) OR FIREABLE(T-poll__handleAnsP4_5) OR FIREABLE(T-poll__handleAnsP4_6) OR FIREABLE(T-poll__handleAnsP4_9) OR FIREABLE(T-poll__handleAnsP4_10) OR FIREABLE(T-poll__handleAnsP4_11) OR FIREABLE(T-poll__handleAnsP4_12) OR FIREABLE(T-poll__handleAnsP4_15) OR FIREABLE(T-poll__handleAnsP4_16) OR FIREABLE(T-poll__handleAn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(T-poll__handleAnsP4_3) OR FIREABLE(T-poll__handleAnsP4_4) OR FIREABLE(T-poll__handleAnsP4_5) OR FIREABLE(T-poll__handleAnsP4_6) OR FIREABLE(T-poll__handleAnsP4_9) OR FIREABLE(T-poll__handleAnsP4_10) OR FIREABLE(T-poll__handleAnsP4_11) OR FIREABLE(T-poll__handleAnsP4_12) OR FIREABLE(T-poll__handleAnsP4_15) OR FIREABLE(T-poll__handleAnsP4_16) OR FIREABLE(T-poll__handleAn... (shortened)
lola: processed formula length: 1336
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 34 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(T-startNeg__start_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(T-startNeg__start_3)))
lola: processed formula length: 37
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(T-poll__handleAnnP1_22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(T-poll__handleAnnP1_22))))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(T-poll__handleAskP_17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(T-poll__handleAskP_17))))
lola: processed formula length: 43
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 33 markings, 33 edges
FORMULA NeoElection-PT-2-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(T-poll__handleAI2_16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(T-poll__handleAI2_16))))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 33 markings, 33 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(T-poll__iAmPrimary_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(T-poll__iAmPrimary_1))))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 33 markings, 33 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(T-poll__handleAnsP4_17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(T-poll__handleAnsP4_17))))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 33 markings, 33 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(T-poll__handleAskP_49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(T-poll__handleAskP_49))))
lola: processed formula length: 43
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 34 markings, 35 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (FIREABLE(T-poll__handleAnnP1_36)) AND (FIREABLE(T-poll__handleAnsP4_22) OR FIREABLE(T-poll__handleAnnP1_36))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (FIREABLE(T-poll__handleAnnP1_36)) AND (FIREABLE(T-poll__handleAnsP4_22) OR FIREABLE(T-poll__handleAnnP1_36))))))
lola: processed formula length: 125
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 34 markings, 35 edges
FORMULA NeoElection-PT-2-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(T-poll__start_1) OR FIREABLE(T-poll__start_2) OR FIREABLE(T-poll__start_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(T-poll__start_1) OR FIREABLE(T-poll__start_2) OR FIREABLE(T-poll__start_3)))))
lola: processed formula length: 99
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 71 markings, 82 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(T-sendAnnPs__start_1) OR FIREABLE(T-sendAnnPs__start_2) OR FIREABLE(T-sendAnnPs__start_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(T-sendAnnPs__start_1) OR FIREABLE(T-sendAnnPs__start_2) OR FIREABLE(T-sendAnnPs__start_3)))))
lola: processed formula length: 114
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 34 markings, 35 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE... (shortened)
lola: processed formula length: 636
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 34 markings, 35 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(T-poll__handleAI2_7) OR FIREABLE(T-poll__handleAI2_8) OR FIREABLE(T-poll__handleAI2_9) OR FIREABLE(T-poll__handleAI2_10) OR FIREABLE(T-poll__handleAI2_11) OR FIREABLE(T-poll__handleAI2_12) OR FIREABLE(T-poll__handleAI2_13) OR FIREABLE(T-poll__handleAI2_14) OR FIREABLE(T-poll__handleAI2_15) OR FIREABLE(T-poll__handleAI2_16) OR FIREABLE(T-poll__handleAI2_17) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(T-poll__handleAI2_7) OR FIREABLE(T-poll__handleAI2_8) OR FIREABLE(T-poll__handleAI2_9) OR FIREABLE(T-poll__handleAI2_10) OR FIREABLE(T-poll__handleAI2_11) OR FIREABLE(T-poll__handleAI2_12) OR FIREABLE(T-poll__handleAI2_13) OR FIREABLE(T-poll__handleAI2_14) OR FIREABLE(T-poll__handleAI2_15) OR FIREABLE(T-poll__handleAI2_16) OR FIREABLE(T-poll__handleAI2_17) OR FIREABLE... (shortened)
lola: processed formula length: 1902
lola: 32 rewrites
lola: closed formula file NeoElection-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 139 markings, 176 edges
lola: ========================================
FORMULA NeoElection-PT-2-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no no no no
lola: memory consumption: 15244 KB
lola: time consumption: 0 seconds
BK_STOP 1553033667305
--------------------
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="NeoElection-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2018"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is NeoElection-PT-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110-oct2-155272242200063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
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 ;