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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470100880
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527065905383

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 ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ 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-ReachabilityCardinality.task
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: 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)
check_solution: Constraint R1 = 6.90119780575e-310 is below its lower bound 1
check_solution: Constraint R158 = 0 is above its equality of -1

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

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R1 = 0 is above its upper bound -2
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 ||*|| = 2 (rel. error 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 R99 = 1e+30 is above its equality of 0
check_solution: Constraint R100 = 1e+30 is above its equality of 0
check_solution: Constraint R101 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 1e+30)
check_solution: Constraint R1 = 0 is above its upper bound -2
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: Constralola: LP says that atomic proposition is always false: (2 <= HasRight_3)
lola: LP says that atomic proposition is always false: (3 <= Neighbourhood_10_1)
lola: LP says that atomic proposition is always false: (3 <= Neighbourhood_10_7)
lola: LP says that atomic proposition is always false: (2 <= Neighbourhood_5_3)
lola: LP says that atomic proposition is always false: (2 <= Neighbourhood_5_2)
lola: LP says that atomic proposition is always false: (2 <= WaitLeft_5)
lola: LP says that atomic proposition is always false: (3 <= Neighbourhood_9_1)
lola: LP says that atomic proposition is always false: (2 <= Think_9)
lola: LP says that atomic proposition is always false: (2 <= Neighbourhood_10_8)
lola: E (F (((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 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10) AND (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 (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 1) AND (1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)))) : A (G ((((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= 0) AND (Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + 1 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)) OR ((2 <= Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1) AND (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) AND (HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1))))) : E (F ((Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9))) : A (G (())) : E (F ((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))) : A (G ((((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 + 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) AND (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 + 1 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9)) OR ((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= 2) AND (HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= 1))))) : A (G (((2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) OR (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) OR (WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 <= 1) 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 (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) OR ((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 (G ((HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 2))) : E (F (FALSE)) : A (G (((Think_4 <= Neighbourhood_6_9) OR (WaitLeft_4 <= Forks_7) OR (Neighbourhood_6_3 <= Neighbourhood_10_6) OR (1 <= Neighbourhood_3_6)))) : E (F (())) : E (F (())) : E (F (FALSE)) : E (F (FALSE)) : A (G (((Neighbourhood_5_3 <= Neighbourhood_2_3) OR (Neighbourhood_9_1 <= Outside_5)))) : E (F (()))
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 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: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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: ========================================
int R158 = 0 is above its equality of -1
check_solution: Constraint R161 = 0 is above its equality of -1

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

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-3 TRUE 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: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
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: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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-ReachabilityCardinality-10 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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-ReachabilityCardinality-11 FALSE 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: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 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: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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-ReachabilityCardinality-13 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Neighbourhood_5_3 <= Neighbourhood_2_3) OR (Neighbourhood_9_1 <= Outside_5))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Neighbourhood_5_3 <= Neighbourhood_2_3) OR (Neighbourhood_9_1 <= Outside_5))))
lola: processed formula length: 87
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Neighbourhood_2_3 + 1 <= Neighbourhood_5_3) AND (Outside_5 + 1 <= Neighbourhood_9_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 15576 markings, 33135 edges, 3115 markings/sec, 0 secs
lola: sara is running 5 secs || 31468 markings, 71624 edges, 3178 markings/sec, 5 secs
lola: sara is running 10 secs || 47363 markings, 109479 edges, 3179 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 54671 markings, 127731 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Think_4 <= Neighbourhood_6_9) OR (WaitLeft_4 <= Forks_7) OR (Neighbourhood_6_3 <= Neighbourhood_10_6) OR (1 <= Neighbourhood_3_6))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Think_4 <= Neighbourhood_6_9) OR (WaitLeft_4 <= Forks_7) OR (Neighbourhood_6_3 <= Neighbourhood_10_6) OR (1 <= Neighbourhood_3_6))))
lola: processed formula length: 143
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Neighbourhood_6_9 + 1 <= Think_4) AND (Forks_7 + 1 <= WaitLeft_4) AND (Neighbourhood_10_6 + 1 <= Neighbourhood_6_3) AND (Neighbourhood_3_6 <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 2)))
lola: processed formula length: 143
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16079 markings, 35198 edges, 3216 markings/sec, 0 secs
lola: sara is running 5 secs || 32095 markings, 73757 edges, 3203 markings/sec, 5 secs
lola: sara is running 10 secs || 48246 markings, 112819 edges, 3230 markings/sec, 10 secs
lola: sara is running 15 secs || 63360 markings, 152976 edges, 3023 markings/sec, 15 secs
lola: sara is running 20 secs || 78652 markings, 192867 edges, 3058 markings/sec, 20 secs
lola: sara is running 25 secs || 93922 markings, 233598 edges, 3054 markings/sec, 25 secs
lola: sara is running 30 secs || 109263 markings, 270011 edges, 3068 markings/sec, 30 secs
lola: sara is running 35 secs || 125050 markings, 308186 edges, 3157 markings/sec, 35 secs
lola: sara is running 40 secs || 141277 markings, 347083 edges, 3245 markings/sec, 40 secs
sara: warning, failure of lp_solve (at job 156)
lola: sara is running 45 secs || 157148 markings, 385503 edges, 3174 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 163483 markings, 400995 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((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)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((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)))
lola: processed formula length: 260
lola: 22 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (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)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16943 markings, 37892 edges, 3389 markings/sec, 0 secs
lola: sara is running 5 secs || 34321 markings, 76550 edges, 3476 markings/sec, 5 secs
lola: sara is running 10 secs || 51222 markings, 117096 edges, 3380 markings/sec, 10 secs
lola: sara is running 15 secs || 67693 markings, 157454 edges, 3294 markings/sec, 15 secs
lola: sara is running 20 secs || 84570 markings, 197782 edges, 3375 markings/sec, 20 secs
lola: sara is running 25 secs || 101321 markings, 241033 edges, 3350 markings/sec, 25 secs
lola: sara is running 30 secs || 117604 markings, 283939 edges, 3257 markings/sec, 30 secs
lola: sara is running 35 secs || 134449 markings, 328691 edges, 3369 markings/sec, 35 secs
lola: sara is running 40 secs || 151249 markings, 370494 edges, 3360 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 163483 markings, 400591 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_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: 230
lola: 22 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16190 markings, 35172 edges, 3238 markings/sec, 0 secs
lola: sara is running 5 secs || 32796 markings, 71088 edges, 3321 markings/sec, 5 secs
lola: sara is running 10 secs || 49383 markings, 109576 edges, 3317 markings/sec, 10 secs
lola: sara is running 15 secs || 65505 markings, 147910 edges, 3224 markings/sec, 15 secs
lola: sara is running 20 secs || 82155 markings, 187315 edges, 3330 markings/sec, 20 secs
lola: sara is running 25 secs || 98657 markings, 230410 edges, 3300 markings/sec, 25 secs
lola: sara is running 30 secs || 114771 markings, 271062 edges, 3223 markings/sec, 30 secs
lola: sara is running 35 secs || 131065 markings, 313279 edges, 3259 markings/sec, 35 secs
lola: sara is running 40 secs || 147287 markings, 352146 edges, 3244 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 154195 markings, 369030 edges

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 814 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 <= 0) AND (Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + 1 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)) OR ((2 <= Outside_3 + Outside_4 + Outside_5 + Outside... (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:694
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 <= 0) AND (Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + 1 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)) OR ((2 <= Outside_3 + Outside_4 + Outside_5 + Outside... (shortened)
lola: processed formula length: 944
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 + 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 + N... (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:694
lola: processed formula: A (G ((((Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 + 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 + N... (shortened)
lola: processed formula length: 2640
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((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 (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)) AND ((3 <= 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)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) OR (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) OR (WaitLeft_10 + WaitLeft_1 ... (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:694
lola: processed formula: A (G (((2 <= HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) OR (Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) OR (WaitLeft_10 + WaitLeft_1 ... (shortened)
lola: processed formula length: 4779
lola: 23 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10 <= 1) AND (WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9 + 1 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1) AND (2 <= WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) AND (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 <= 0) AND (Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + 1 <= Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1) AND ((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 <= 1)))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((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 + Neighbou... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((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 + Neighbou... (shortened)
lola: processed formula length: 2678
lola: 22 rewrites
lola: closed formula file PhilosophersDyn-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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 <= WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10) AND (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 (HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9 <= 1) AND (1 <= Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-PT-10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-PT-10-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 13852 markings, 36820 edges, 2770 markings/sec, 0 secs
lola: sara is running 5 secs || 28177 markings, 75473 edges, 2865 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA PhilosophersDyn-PT-10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes yes no yes no no no no no no
lola:
preliminary result: no no no yes no no yes yes no yes no no no no no no
lola: memory consumption: 59272 KB
lola: time consumption: 327 seconds

BK_STOP 1527066232298

--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-152666470100880"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;