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.7M
-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 15K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 132K May 15 18:54 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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470100878
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527065807406

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ 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-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always true: (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 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)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= HasRight_2)
lola: LP says that atomic proposition is always false: (2 <= Neighbourhood_6_10)
lola: LP says that atomic proposition is always false: (3 <= Neighbourhood_7_1)
lola: LP says that atomic proposition is always false: (3 <= Neighbourhood_10_9)
lola: LP says that atomic proposition is always false: (2 <= Neighbourhood_8_6)
lola: LP says that atomic proposition is always false: (3 <= HasRight_3)
lola: LP says that atomic proposition is always false: (2 <= Neighbourhood_5_5)
check_solution: Variable C2314 = -10 is below its lower bound 0
check_solution: Variable C2474 = -10 is below its lower bound 0
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 1e+30)
check_solution: Variable C453 = -1.07075826449 is below its lower bound 0
check_solution: Variable C454 = -1.07075826449 is below its lower bound 0
check_solution: Variable C455 = -1.07075826449 is below its lower bound 0
check_solution: Variable C456 = -1.07075826449 is below its lower bound 0
check_solution: Variable C457 = -1.07075826449 is below its lower bound 0
check_solution: Variable C458 = -1.07075826449 is below its lower bound 0
check_solution: Variable C459 = -1.07075826449 is below its lower bound 0
check_solution: Variable C460 = -1.07075826449 is below its lower bound 0
check_solution: Variable C461 = -1.07075826449 is below its lower bound 0
check_solution: Variable C462 = -1.07075826449 is below its lower bound 0

Seriously low accuracy found ||*|| = 22.7793 (rel. error 22.7793)
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
check_solution: Constraint R162 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 0.0792805)
check_solution: Constraint R1 = 4.63831593995e-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. errorlola: LP says that atomic proposition is always false: (2 <= Outside_3)
lola: NOT(E (G (TRUE))) : A ((A (F ((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))) U ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 + 1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) AND (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 2)))) : NOT(E (F (((WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) AND (3 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10))))) : E (G (NOT(A (X ((Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)))))) : NOT(A (F (A (F ((3 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)))))) : ((A (F ((3 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1))) AND A (F (FALSE))) AND E (X (((HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 2))))) : NOT(E (F (A (G (TRUE))))) : (E ((((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) OR (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)) U ((Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) AND (2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)))) AND (E (F ((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= 1))) AND ((1 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) OR (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 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1) OR ((Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) AND (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)) OR (1 <= 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) OR (1 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) OR (2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) OR (1 <= 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 (((Forks_2 <= Outside_4)))) OR NOT(E (F ((Neighbourhood_10_9 <= HasRight_7))))) AND ((A (F ((Outside_10 <= HasLeft_3))) AND (Neighbourhood_6_8 <= Neighbourhood_10_3)) OR (((WaitLeft_4 <= Neighbourhood_1_4) AND (1 <= Think_10) AND (1 <= Neighbourhood_2_10))))) : A (G (())) : E (F (FALSE)) : E (G ((WaitRight_9 <= Neighbourhood_1_7))) : ((FALSE OR NOT(E (X ((Neighbourhood_8_1 <= Neighbourhood_3_4))))) OR E (G ((Neighbourhood_10_8 <= Neighbourhood_3_9)))) : (E (F (A (G ((Neighbourhood_3_6 <= Neighbourhood_10_8))))) AND NOT((A (X ((Neighbourhood_2_1 <= Neighbourhood_4_5))) OR (Outside_4 <= WaitRight_2)))) : E (X ((E (G ((Neighbourhood_10_5 <= Neighbourhood_6_6))) AND (HasRight_6 <= Neighbourhood_3_4)))) : A (F ((((Neighbourhood_7_8 + 1 <= WaitRight_4) AND ((Neighbourhood_3_10 <= Outside_4))) AND A (X ((Neighbourhood_10_10 <= Outside_1))))))
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:279
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 213 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: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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
1)

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

FORMULA PhilosophersDyn-PT-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 244 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: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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 PhilosophersDyn-PT-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 263 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: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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 PhilosophersDyn-PT-10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 285 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: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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

FORMULA PhilosophersDyn-PT-10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 + 1 <= 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 CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 + 1 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1)))))
lola: processed formula length: 280
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: 8 markings, 8 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((Neighbourhood_3_4 + 1 <= Neighbourhood_8_1))) OR E (G ((Neighbourhood_10_8 <= Neighbourhood_3_9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((Neighbourhood_10_8 <= Neighbourhood_3_9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Neighbourhood_10_8 <= Neighbourhood_3_9)))
lola: processed formula length: 49
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA PhilosophersDyn-PT-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((Neighbourhood_3_6 <= Neighbourhood_10_8))))) AND (E (X ((Neighbourhood_4_5 + 1 <= Neighbourhood_2_1))) AND (WaitRight_2 + 1 <= Outside_4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (WaitRight_2 + 1 <= Outside_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (WaitRight_2 + 1 <= Outside_4)
lola: processed formula length: 30
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Neighbourhood_3_6 <= Neighbourhood_10_8)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Neighbourhood_10_8 + 1 <= Neighbourhood_3_6)
lola: processed formula length: 45
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((Neighbourhood_4_5 + 1 <= Neighbourhood_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((Neighbourhood_4_5 + 1 <= Neighbourhood_2_1))
lola: processed formula length: 48
lola: 45 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G ((Neighbourhood_10_5 <= Neighbourhood_6_6))) AND (HasRight_6 <= Neighbourhood_3_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(A(TRUE U (Neighbourhood_6_6 + 1 <= Neighbourhood_10_5))) AND (HasRight_6 <= Neighbourhood_3_4)))
lola: processed formula length: 104
lola: 47 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((Neighbourhood_7_8 + 1 <= WaitRight_4) AND ((Neighbourhood_3_10 <= Outside_4))) AND A (X ((Neighbourhood_10_10 <= Outside_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (((Neighbourhood_7_8 + 1 <= WaitRight_4) AND ((Neighbourhood_3_10 <= Outside_4))) AND AX((Neighbourhood_10_10 <= Outside_1))))
lola: processed formula length: 135
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7 markings, 6 edges

FORMULA PhilosophersDyn-PT-10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 + 1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10) OR (HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <=... (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 (((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 + 1 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10) OR (HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <=... (shortened)
lola: processed formula length: 406
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: ((WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) AND (3 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 15669 markings, 37953 edges, 3134 markings/sec, 0 secs
lola: sara is running 5 secs || 31252 markings, 78856 edges, 3117 markings/sec, 5 secs
lola: sara is running 10 secs || 47016 markings, 120702 edges, 3153 markings/sec, 10 secs
lola: sara is running 15 secs || 62026 markings, 162847 edges, 3002 markings/sec, 15 secs
lola: sara is running 20 secs || 77808 markings, 206348 edges, 3156 markings/sec, 20 secs
lola: sara is running 25 secs || 93812 markings, 251811 edges, 3201 markings/sec, 25 secs
lola: sara is running 30 secs || 109621 markings, 296683 edges, 3162 markings/sec, 30 secs
lola: sara is running 35 secs || 124816 markings, 340647 edges, 3039 markings/sec, 35 secs
lola: sara is running 40 secs || 140525 markings, 385175 edges, 3142 markings/sec, 40 secs
lola: sara is running 45 secs || 156087 markings, 430366 edges, 3112 markings/sec, 45 secs
lola: sara is running 50 secs || 171250 markings, 474819 edges, 3033 markings/sec, 50 secs
lola: sara is running 55 secs || 186573 markings, 519784 edges, 3065 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 199051 markings, 555908 edges

FORMULA PhilosophersDyn-PT-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((WaitRight_9 <= Neighbourhood_1_7)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((WaitRight_9 <= Neighbourhood_1_7)))
lola: processed formula length: 42
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: 5 markings, 4 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= 2)))
lola: processed formula length: 113
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: 7 markings, 6 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1119 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(A(TRUE 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 +... (shortened)
lola: processed formula length: 2408
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 63 markings, 122 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F (((Forks_2 <= Outside_4)))) OR A (G ((HasRight_7 + 1 <= Neighbourhood_10_9)))) AND ((A (F ((Outside_10 <= HasLeft_3))) AND (Neighbourhood_6_8 <= Neighbourhood_10_3)) OR (((WaitLeft_4 <= Neighbourhood_1_4) AND (1 <= Think_10) AND (1 <= Neighbourhood_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((HasRight_7 + 1 <= Neighbourhood_10_9)))
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 ((HasRight_7 + 1 <= Neighbourhood_10_9)))
lola: processed formula length: 46
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: (Neighbourhood_10_9 <= HasRight_7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-CTLCardinality-14-0.sara
lola: ========================================
lola: subprocess 15 will run for 3358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Forks_2 <= Outside_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: ((Outside_4 + 1 <= Forks_2))
lola: processed formula length: 28
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((WaitLeft_4 <= Neighbourhood_1_4) AND (1 <= Think_10) AND (1 <= Neighbourhood_2_10)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((WaitLeft_4 <= Neighbourhood_1_4) AND (1 <= Think_10) AND (1 <= Neighbourhood_2_10)))
lola: processed formula length: 87
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-PT-10-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Outside_10 <= HasLeft_3)))
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: (HasLeft_3 + 1 <= Outside_10)
lola: processed formula length: 29
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-PT-10-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: 7 markings, 6 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA PhilosophersDyn-PT-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((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) OR (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= Forks_9 + Fork... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no yes yes yes no no unknown no yes no yes yes yes yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 54932 KB
lola: time consumption: 3570 seconds
lola: time limit reached - aborting
lola:
preliminary result: no no yes yes yes no no unknown no yes no yes yes yes yes no
lola:
preliminary result: no no yes yes yes no no unknown no yes no yes yes yes yes no
lola: memory consumption: 54932 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="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/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 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 r112-csrt-152666470100878"
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 ;