Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 151K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 585K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 212K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 232K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 873K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.9K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732583100251
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527442186215

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-PT-10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PhilosophersDyn-PT-10 @ 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: 2480/65536 symbol table entries, 65 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-PT-10-LTLCardinality.task
lola: A ((((1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) U (Neighbourhood_2_10 + Neighbourhood_7_10 + Neighbourhood_1_10 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_1_9 + Neighbourhood_6_10 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_2_9 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_3_9 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_4_9 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_5_7 + Neighbourhood_5_8 + Neighbourhood_5_9 + Neighbourhood_6_1 + Neighbourhood_6_2 + Neighbourhood_6_3 + Neighbourhood_6_4 + Neighbourhood_6_5 + Neighbourhood_6_6 + Neighbourhood_6_7 + Neighbourhood_6_8 + Neighbourhood_10_10 + Neighbourhood_7_1 + Neighbourhood_7_2 + Neighbourhood_7_3 + Neighbourhood_7_4 + Neighbourhood_7_5 + Neighbourhood_7_6 + Neighbourhood_7_7 + Neighbourhood_7_8 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_3_10 + Neighbourhood_8_10 + Neighbourhood_9_2 + Neighbourhood_9_1 + Neighbourhood_4_10 + Neighbourhood_7_9 + Neighbourhood_6_9 + Neighbourhood_5_10 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)) U F (G ((2 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1))))) : A ((3 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)) : A (X (G (F (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)))))) : A ((((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) U (2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)) U (2 <= Neighbourhood_2_10 + Neighbourhood_7_10 + Neighbourhood_1_10 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_1_9 + Neighbourhood_6_10 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_2_9 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_3_9 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_4_9 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_5_7 + Neighbourhood_5_8 + Neighbourhood_5_9 + Neighbourhood_6_1 + Neighbourhood_6_2 + Neighbourhood_6_3 + Neighbourhood_6_4 + Neighbourhood_6_5 + Neighbourhood_6_6 + Neighbourhood_6_7 + Neighbourhood_6_8 + Neighbourhood_10_10 + Neighbourhood_7_1 + Neighbourhood_7_2 + Neighbourhood_7_3 + Neighbourhood_7_4 + Neighbourhood_7_5 + Neighbourhood_7_6 + Neighbourhood_7_7 + Neighbourhood_7_8 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_3_10 + Neighbourhood_8_10 + Neighbourhood_9_2 + Neighbourhood_9_1 + Neighbourhood_4_10 + Neighbourhood_7_9 + Neighbourhood_6_9 + Neighbourhood_5_10))) : A (F ((Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1))) : A ((G ((2 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)) U (Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9))) : A (X ((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1))) : A (F (F (G (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)))))) : A ((X (X ((Neighbourhood_2_4 <= Neighbourhood_1_3))) U F ((Neighbourhood_2_5 <= Neighbourhood_8_4)))) : A ((G (F ((WaitLeft_7 <= Neighbourhood_8_4))) U ((Neighbourhood_5_1 <= Neighbourhood_4_7) U (Neighbourhood_5_3 <= Neighbourhood_9_4)))) : A (F (X (F (F ((Forks_6 <= Neighbourhood_1_4)))))) : A (X (X ((Neighbourhood_9_2 <= Neighbourhood_8_8)))) : A (G (F (X (G ((Neighbourhood_8_10 <= Neighbourhood_6_2)))))) : A ((Neighbourhood_10_8 <= HasRight_9)) : A (F ((Forks_2 <= Neighbourhood_5_1))) : A (G (X (X ((HasRight_3 <= WaitRight_3)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)
lola: processed formula length: 105
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.task
lola: processed formula with 1 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: ========================================
check_solution: Constraint R1 = 4.64195670767e-310 is above its upper bound -2
check_solution: Constraint R36 = 1.52783696985e-312 is above its equality of -1
check_solution: Constraint R37 = 1.57027688567e-312 is above its equality of -1
check_solution: Constraint R38 = 1.6127168015e-312 is above its equality of -1
check_solution: Constraint R39 = 1.65515671733e-312 is above its equality of -1
check_solution: Constraint R40 = 1.67637667525e-312 is above its equality of -1
check_solution: Constraint R41 = 1.71881659108e-312 is above its equality of -1
check_solution: Constraint R42 = 1.76125650691e-312 is above its equality of -1
check_solution: Constraint R158 = 4.13789179335e-312 is above its equality of -1
check_solution: Constraint R161 = 4.15911175126e-312 is above its equality of -1

Seriously low accuracy found ||*|| = 2 (rel. error 1)
check_solution: Constraint R1 = 6.90793347405e-310 is below its lower bound 1
check_solution: Constraint R36 = 0 is above its equality of -1
check_solution: Constraint R37 = 0 is above its equality of -1
check_solution: Constraint R38 = 0 is above its equality of -1
check_solution: Constraint R39 = 0 is above its equality of -1
check_solution: Constraint R40 = 0 is above its equality of -1
check_solution: Constraint R41 = 0 is above its equality of -1
check_solution: Constraint R42 = 0 is above its equality of -1
check_solution: Constraint R158 = 0 is above its equality of -1
check_solution: Constraint R161 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-PT-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Neighbourhood_10_8 <= HasRight_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Neighbourhood_10_8 <= HasRight_9)
lola: processed formula length: 34
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Forks_6 <= Neighbourhood_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Forks_6 <= Neighbourhood_1_4))))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46330 markings, 81454 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((Neighbourhood_9_2 <= Neighbourhood_8_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((Neighbourhood_9_2 <= Neighbourhood_8_8))))
lola: processed formula length: 52
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 38 markings, 38 edges

FORMULA PhilosophersDyn-PT-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1)))
lola: processed formula length: 250
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46 markings, 90 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((HasRight_3 <= WaitRight_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((HasRight_3 <= WaitRight_3)))))
lola: processed formula length: 43
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 119 markings, 222 edges

FORMULA PhilosophersDyn-PT-10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Forks_2 <= Neighbourhood_5_1)))
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: (Neighbourhood_5_1 + 1 <= Forks_2)
lola: processed formula length: 34
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges

FORMULA PhilosophersDyn-PT-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Neighbourhood_2_5 <= Neighbourhood_8_4)))
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: (Neighbourhood_8_4 + 1 <= Neighbourhood_2_5)
lola: processed formula length: 44
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1)))
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: (Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 + 1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: processed formula length: 226
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Neighbourhood_8_10 <= Neighbourhood_6_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Neighbourhood_8_10 <= Neighbourhood_6_2))))
lola: processed formula length: 53
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 10 markings, 11 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Neighbourhood_5_1 <= Neighbourhood_4_7) U (Neighbourhood_5_3 <= Neighbourhood_9_4)) OR (G (F ((WaitLeft_7 <= Neighbourhood_8_4))) AND F ((Neighbourhood_5_3 <= Neighbourhood_9_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Neighbourhood_5_1 <= Neighbourhood_4_7) U (Neighbourhood_5_3 <= Neighbourhood_9_4)) OR (G (F ((WaitLeft_7 <= Neighbourhood_8_4))) AND F ((Neighbourhood_5_3 <= Neighbourhood_9_4)))))
lola: processed formula length: 187
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1))))
lola: processed formula length: 117
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 8 markings, 9 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10))))
lola: processed formula length: 234
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 17 markings, 22 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10))))
lola: processed formula length: 234
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 17 markings, 22 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) OR (G ((2 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)) AND F ((Think_10 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) OR (G ((2 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)) AND F ((Think_10 + ... (shortened)
lola: processed formula length: 624
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) U (2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)) U (2 <= Neighbourhood_2_10 + Neig... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) U (2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)) U (2 <= Neighbourhood_2_10 + Neig... (shortened)
lola: processed formula length: 2395
lola: 19 rewrites
lola: closed formula file PhilosophersDyn-PT-10-LTLCardinality.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: 10 markings, 10 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes yes no yes yes yes no no yes yes no
lola:
preliminary result: no no no no yes yes yes no yes yes yes no no yes yes no
lola: memory consumption: 43860 KB
lola: time consumption: 72 seconds

BK_STOP 1527442258883

--------------------
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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="LTLCardinality"
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/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 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 PhilosophersDyn-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r256-csrt-152732583100251"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;