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)
.................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169kn-ebro-146433129601005
=====================================================================

--------------------
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-COL-03-LTLFireability-0
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-1
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-15
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-2
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-3
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-4
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-5
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-6
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-7
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-8
FORMULA_NAME PhilosophersDyn-COL-03-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464409599126


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((((((((((("WaitRight_1>=1")&&("Neighbourhood_1_1>=1"))&&("Forks_1>=1"))||((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("WaitRight_2>=1")))||((("Neighbourhood_2_1>=1")&&("WaitRight_2>=1"))&&("Forks_1>=1")))||((("Forks_1>=1")&&("Neighbourhood_3_1>=1"))&&("WaitRight_3>=1")))||((("Neighbourhood_1_3>=1")&&("Forks_3>=1"))&&("WaitRight_1>=1")))||((("WaitRight_3>=1")&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1")))||((("WaitRight_1>=1")&&("Neighbourhood_1_2>=1"))&&("Forks_2>=1")))||((("Forks_2>=1")&&("Neighbourhood_2_2>=1"))&&("WaitRight_2>=1")))||((("Neighbourhood_3_3>=1")&&("WaitRight_3>=1"))&&("Forks_3>=1"))))
Formula 0 simplified : !(("Forks_1>=1" & "Neighbourhood_1_1>=1" & "WaitRight_1>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "WaitRight_2>=1") | ("Forks_1>=1" & "Neighbourhood_2_1>=1" & "WaitRight_2>=1") | ("Forks_1>=1" & "Neighbourhood_3_1>=1" & "WaitRight_3>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "WaitRight_1>=1") | ("Forks_2>=1" & "Neighbourhood_3_2>=1" & "WaitRight_3>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "WaitRight_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "WaitRight_2>=1") | ("Forks_3>=1" & "Neighbourhood_3_3>=1" & "WaitRight_3>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.791287,30344,1,0,100,12252,424,44,2669,10859,149
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(F((F(((((((("Outside_3>=1")&&("Outside_1>=1"))&&("Outside_2>=1"))||((("Outside_1>=1")&&("Outside_2>=1"))&&("Outside_3>=1")))||((("Outside_3>=1")&&("Outside_2>=1"))&&("Outside_1>=1")))||((("Outside_2>=1")&&("Outside_1>=1"))&&("Outside_3>=1")))||((("Outside_1>=1")&&("Outside_3>=1"))&&("Outside_2>=1")))||((("Outside_3>=1")&&("Outside_2>=1"))&&("Outside_1>=1"))))U(X((((((((((("WaitRight_1>=1")&&("Neighbourhood_1_1>=1"))&&("Forks_1>=1"))||((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("WaitRight_2>=1")))||((("Neighbourhood_2_1>=1")&&("WaitRight_2>=1"))&&("Forks_1>=1")))||((("Forks_1>=1")&&("Neighbourhood_3_1>=1"))&&("WaitRight_3>=1")))||((("Neighbourhood_1_3>=1")&&("Forks_3>=1"))&&("WaitRight_1>=1")))||((("WaitRight_3>=1")&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1")))||((("WaitRight_1>=1")&&("Neighbourhood_1_2>=1"))&&("Forks_2>=1")))||((("Forks_2>=1")&&("Neighbourhood_2_2>=1"))&&("WaitRight_2>=1")))||((("Neighbourhood_3_3>=1")&&("WaitRight_3>=1"))&&("Forks_3>=1"))))))))
Formula 1 simplified : !F(F("Outside_1>=1" & "Outside_2>=1" & "Outside_3>=1") U X(("Forks_1>=1" & "Neighbourhood_1_1>=1" & "WaitRight_1>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "WaitRight_2>=1") | ("Forks_1>=1" & "Neighbourhood_2_1>=1" & "WaitRight_2>=1") | ("Forks_1>=1" & "Neighbourhood_3_1>=1" & "WaitRight_3>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "WaitRight_1>=1") | ("Forks_2>=1" & "Neighbourhood_3_2>=1" & "WaitRight_3>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "WaitRight_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "WaitRight_2>=1") | ("Forks_3>=1" & "Neighbourhood_3_3>=1" & "WaitRight_3>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.47262,33948,1,0,132,18236,430,72,2676,17305,220
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(F(F(X(((("Forks_3>=1")&&("WaitLeft_3>=1"))||(("WaitLeft_1>=1")&&("Forks_1>=1")))||(("Forks_2>=1")&&("WaitLeft_2>=1")))))))))
Formula 2 simplified : !XGFX(("Forks_3>=1" & "WaitLeft_3>=1") | ("Forks_1>=1" & "WaitLeft_1>=1") | ("Forks_2>=1" & "WaitLeft_2>=1"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.52915,33964,1,0,155,22441,460,89,2698,23577,271
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G((((((((((("HasRight_3>=1")&&("HasLeft_3>=1"))&&("Neighbourhood_3_2>=1"))||((("HasRight_1>=1")&&("Neighbourhood_1_3>=1"))&&("HasLeft_1>=1")))||((("HasRight_1>=1")&&("HasLeft_1>=1"))&&("Neighbourhood_1_2>=1")))||((("Neighbourhood_2_2>=1")&&("HasLeft_2>=1"))&&("HasRight_2>=1")))||((("Neighbourhood_3_1>=1")&&("HasLeft_3>=1"))&&("HasRight_3>=1")))||((("HasRight_2>=1")&&("HasLeft_2>=1"))&&("Neighbourhood_2_1>=1")))||((("HasRight_2>=1")&&("Neighbourhood_2_3>=1"))&&("HasLeft_2>=1")))||((("HasRight_1>=1")&&("Neighbourhood_1_1>=1"))&&("HasLeft_1>=1")))||((("HasRight_3>=1")&&("Neighbourhood_3_3>=1"))&&("HasLeft_3>=1")))))
Formula 3 simplified : !G(("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_2>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_3>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_2>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_2>=1") | ("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_1>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_1>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_3>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_1>=1") | ("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_3>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.58737,35356,1,0,155,22441,769,89,2997,23578,276
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((((((((((((((((((((((((((((((("Neighbourhood_1_2>=1")&&("Outside_2>=1"))&&("Forks_2>=1"))&&("Forks_1>=1"))||((("Forks_1>=2")&&("Neighbourhood_1_1>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_3_2>=1")&&("Forks_2>=1"))&&("Forks_3>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_1_2>=1")&&("Forks_2>=1"))&&("Forks_1>=1"))&&("Outside_1>=1")))||((("Forks_1>=2")&&("Outside_3>=1"))&&("Neighbourhood_1_1>=1")))||(((("Forks_2>=1")&&("Forks_3>=1"))&&("Neighbourhood_2_3>=1"))&&("Outside_3>=1")))||(((("Forks_2>=1")&&("Forks_1>=1"))&&("Outside_1>=1"))&&("Neighbourhood_2_1>=1")))||(((("Outside_3>=1")&&("Neighbourhood_3_2>=1"))&&("Forks_3>=1"))&&("Forks_2>=1")))||(((("Neighbourhood_3_1>=1")&&("Outside_3>=1"))&&("Forks_3>=1"))&&("Forks_1>=1")))||(((("Forks_2>=1")&&("Outside_2>=1"))&&("Neighbourhood_2_3>=1"))&&("Forks_3>=1")))||(((("Forks_1>=1")&&("Outside_2>=1"))&&("Forks_3>=1"))&&("Neighbourhood_3_1>=1")))||((("Neighbourhood_2_2>=1")&&("Forks_2>=2"))&&("Outside_3>=1")))||(((("Neighbourhood_3_1>=1")&&("Forks_3>=1"))&&("Outside_1>=1"))&&("Forks_1>=1")))||((("Neighbourhood_3_3>=1")&&("Forks_3>=2"))&&("Outside_1>=1")))||(((("Neighbourhood_3_2>=1")&&("Outside_1>=1"))&&("Forks_3>=1"))&&("Forks_2>=1")))||((("Outside_1>=1")&&("Neighbourhood_2_2>=1"))&&("Forks_2>=2")))||(((("Forks_1>=1")&&("Outside_2>=1"))&&("Neighbourhood_1_3>=1"))&&("Forks_3>=1")))||(((("Forks_1>=1")&&("Neighbourhood_2_1>=1"))&&("Forks_2>=1"))&&("Outside_3>=1")))||((("Forks_2>=2")&&("Neighbourhood_2_2>=1"))&&("Outside_2>=1")))||((("Neighbourhood_3_3>=1")&&("Outside_2>=1"))&&("Forks_3>=2")))||(((("Neighbourhood_2_1>=1")&&("Forks_1>=1"))&&("Forks_2>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_1_3>=1")&&("Outside_1>=1"))&&("Forks_1>=1"))&&("Forks_3>=1")))||((("Neighbourhood_3_3>=1")&&("Forks_3>=2"))&&("Outside_3>=1")))||(((("Outside_1>=1")&&("Forks_3>=1"))&&("Neighbourhood_2_3>=1"))&&("Forks_2>=1")))||((("Outside_1>=1")&&("Neighbourhood_1_1>=1"))&&("Forks_1>=2")))||(((("Outside_3>=1")&&("Forks_1>=1"))&&("Forks_3>=1"))&&("Neighbourhood_1_3>=1")))||(((("Forks_1>=1")&&("Forks_2>=1"))&&("Neighbourhood_1_2>=1"))&&("Outside_3>=1"))))
Formula 4 simplified : !(("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_2>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_2>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_1>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_1>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_2>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_1>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_1>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_1>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_1>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_3>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_2>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_1>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_1>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_1>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_3>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0786,50112,1,0,155,22441,1024,89,3247,23579,278
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G(G(G(X(((((((((((((((((((((((((((((("Think_2>=1")&&("Neighbourhood_2_1>=1"))&&("Neighbourhood_1_2>=1"))&&("Forks_2>=1"))||(((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("Neighbourhood_3_3>=1"))&&("Think_3>=1")))||(((("Neighbourhood_1_1>=1")&&("Neighbourhood_1_2>=1"))&&("Think_1>=1"))&&("Forks_1>=1")))||(((("Forks_3>=1")&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_1>=1"))&&("Think_3>=1")))||(((("Forks_3>=1")&&("Neighbourhood_3_3>=1"))&&("Think_3>=1"))&&("Neighbourhood_3_2>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_1_1>=1"))&&("Neighbourhood_2_1>=1")))||(((("Neighbourhood_1_3>=1")&&("Think_1>=1"))&&("Neighbourhood_1_1>=1"))&&("Forks_1>=1")))||(((("Neighbourhood_2_3>=1")&&("Neighbourhood_2_2>=1"))&&("Forks_2>=1"))&&("Think_2>=1")))||(((("Neighbourhood_3_1>=1")&&("Neighbourhood_3_3>=1"))&&("Forks_3>=1"))&&("Think_3>=1")))||(((("Neighbourhood_3_2>=1")&&("Forks_2>=1"))&&("Think_2>=1"))&&("Neighbourhood_2_3>=1")))||(((("Think_2>=1")&&("Forks_2>=1"))&&("Neighbourhood_2_2>=1"))&&("Neighbourhood_2_1>=1")))||(((("Think_1>=1")&&("Neighbourhood_1_2>=1"))&&("Neighbourhood_3_1>=1"))&&("Forks_1>=1")))||(((("Think_2>=1")&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1"))&&("Neighbourhood_2_1>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_1>=1")))||(((("Neighbourhood_2_2>=1")&&("Think_2>=1"))&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1")))||(((("Neighbourhood_1_1>=1")&&("Think_1>=1"))&&("Neighbourhood_3_1>=1"))&&("Forks_1>=1")))||(((("Forks_3>=1")&&("Think_3>=1"))&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_3>=1")))||(((("Neighbourhood_1_2>=1")&&("Neighbourhood_2_1>=1"))&&("Think_1>=1"))&&("Forks_1>=1")))||((("Think_3>=1")&&("Forks_3>=1"))&&("Neighbourhood_3_3>=2")))||(((("Neighbourhood_3_1>=1")&&("Forks_3>=1"))&&("Think_3>=1"))&&("Neighbourhood_2_3>=1")))||(((("Neighbourhood_1_2>=1")&&("Neighbourhood_2_3>=1"))&&("Think_2>=1"))&&("Forks_2>=1")))||(((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("Neighbourhood_3_2>=1"))&&("Think_3>=1")))||((("Forks_2>=1")&&("Think_2>=1"))&&("Neighbourhood_2_2>=2")))||(((("Neighbourhood_1_3>=1")&&("Forks_3>=1"))&&("Neighbourhood_3_2>=1"))&&("Think_3>=1")))||((("Neighbourhood_1_1>=2")&&("Think_1>=1"))&&("Forks_1>=1")))||(((("Forks_2>=1")&&("Think_2>=1"))&&("Neighbourhood_2_2>=1"))&&("Neighbourhood_1_2>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_2_1>=1"))&&("Neighbourhood_1_3>=1")))))))))
Formula 5 simplified : !XGX(("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_1>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_1_2>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_1>=1" & "Think_3>=1") | ("Forks_3>=1" & "Neighbourhood_3_2>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_1_3>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "Neighbourhood_2_3>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_3_1>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_2>=1" & "Neighbourhood_2_1>=1" & "Neighbourhood_2_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_1>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_3_3>=2" & "Think_3>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_1>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_3>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_2>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=2" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_2>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=2" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.162,81908,1,0,172,27639,2542,102,4789,31945,314
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(G((G(((("Forks_3>=1")&&("WaitLeft_3>=1"))||(("WaitLeft_1>=1")&&("Forks_1>=1")))||(("Forks_2>=1")&&("WaitLeft_2>=1"))))U(X(((("Forks_3>=1")&&("WaitLeft_3>=1"))||(("WaitLeft_1>=1")&&("Forks_1>=1")))||(("Forks_2>=1")&&("WaitLeft_2>=1"))))))))
Formula 6 simplified : !FG(G(("Forks_3>=1" & "WaitLeft_3>=1") | ("Forks_1>=1" & "WaitLeft_1>=1") | ("Forks_2>=1" & "WaitLeft_2>=1")) U X(("Forks_3>=1" & "WaitLeft_3>=1") | ("Forks_1>=1" & "WaitLeft_1>=1") | ("Forks_2>=1" & "WaitLeft_2>=1")))
4 unique states visited
2 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.3011,81908,1,0,200,30776,2561,126,4808,39628,372
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(X(((((((((((((((((((((((((((((("Think_2>=1")&&("Neighbourhood_2_1>=1"))&&("Neighbourhood_1_2>=1"))&&("Forks_2>=1"))||(((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("Neighbourhood_3_3>=1"))&&("Think_3>=1")))||(((("Neighbourhood_1_1>=1")&&("Neighbourhood_1_2>=1"))&&("Think_1>=1"))&&("Forks_1>=1")))||(((("Forks_3>=1")&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_1>=1"))&&("Think_3>=1")))||(((("Forks_3>=1")&&("Neighbourhood_3_3>=1"))&&("Think_3>=1"))&&("Neighbourhood_3_2>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_1_1>=1"))&&("Neighbourhood_2_1>=1")))||(((("Neighbourhood_1_3>=1")&&("Think_1>=1"))&&("Neighbourhood_1_1>=1"))&&("Forks_1>=1")))||(((("Neighbourhood_2_3>=1")&&("Neighbourhood_2_2>=1"))&&("Forks_2>=1"))&&("Think_2>=1")))||(((("Neighbourhood_3_1>=1")&&("Neighbourhood_3_3>=1"))&&("Forks_3>=1"))&&("Think_3>=1")))||(((("Neighbourhood_3_2>=1")&&("Forks_2>=1"))&&("Think_2>=1"))&&("Neighbourhood_2_3>=1")))||(((("Think_2>=1")&&("Forks_2>=1"))&&("Neighbourhood_2_2>=1"))&&("Neighbourhood_2_1>=1")))||(((("Think_1>=1")&&("Neighbourhood_1_2>=1"))&&("Neighbourhood_3_1>=1"))&&("Forks_1>=1")))||(((("Think_2>=1")&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1"))&&("Neighbourhood_2_1>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_1>=1")))||(((("Neighbourhood_2_2>=1")&&("Think_2>=1"))&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1")))||(((("Neighbourhood_1_1>=1")&&("Think_1>=1"))&&("Neighbourhood_3_1>=1"))&&("Forks_1>=1")))||(((("Forks_3>=1")&&("Think_3>=1"))&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_3>=1")))||(((("Neighbourhood_1_2>=1")&&("Neighbourhood_2_1>=1"))&&("Think_1>=1"))&&("Forks_1>=1")))||((("Think_3>=1")&&("Forks_3>=1"))&&("Neighbourhood_3_3>=2")))||(((("Neighbourhood_3_1>=1")&&("Forks_3>=1"))&&("Think_3>=1"))&&("Neighbourhood_2_3>=1")))||(((("Neighbourhood_1_2>=1")&&("Neighbourhood_2_3>=1"))&&("Think_2>=1"))&&("Forks_2>=1")))||(((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("Neighbourhood_3_2>=1"))&&("Think_3>=1")))||((("Forks_2>=1")&&("Think_2>=1"))&&("Neighbourhood_2_2>=2")))||(((("Neighbourhood_1_3>=1")&&("Forks_3>=1"))&&("Neighbourhood_3_2>=1"))&&("Think_3>=1")))||((("Neighbourhood_1_1>=2")&&("Think_1>=1"))&&("Forks_1>=1")))||(((("Forks_2>=1")&&("Think_2>=1"))&&("Neighbourhood_2_2>=1"))&&("Neighbourhood_1_2>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_2_1>=1"))&&("Neighbourhood_1_3>=1"))))))
Formula 7 simplified : !GX(("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_1>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_1_2>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_1>=1" & "Think_3>=1") | ("Forks_3>=1" & "Neighbourhood_3_2>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_1_3>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "Neighbourhood_2_3>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_3_1>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_2>=1" & "Neighbourhood_2_1>=1" & "Neighbourhood_2_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_1>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_3_3>=2" & "Think_3>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_1>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_3>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_2>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=2" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_2>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=2" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,71.4974,75432,1,0,207,31374,2561,135,4812,41077,400
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X((G(((((((((((((((((((((((((((((("Neighbourhood_1_2>=1")&&("Outside_2>=1"))&&("Forks_2>=1"))&&("Forks_1>=1"))||((("Forks_1>=2")&&("Neighbourhood_1_1>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_3_2>=1")&&("Forks_2>=1"))&&("Forks_3>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_1_2>=1")&&("Forks_2>=1"))&&("Forks_1>=1"))&&("Outside_1>=1")))||((("Forks_1>=2")&&("Outside_3>=1"))&&("Neighbourhood_1_1>=1")))||(((("Forks_2>=1")&&("Forks_3>=1"))&&("Neighbourhood_2_3>=1"))&&("Outside_3>=1")))||(((("Forks_2>=1")&&("Forks_1>=1"))&&("Outside_1>=1"))&&("Neighbourhood_2_1>=1")))||(((("Outside_3>=1")&&("Neighbourhood_3_2>=1"))&&("Forks_3>=1"))&&("Forks_2>=1")))||(((("Neighbourhood_3_1>=1")&&("Outside_3>=1"))&&("Forks_3>=1"))&&("Forks_1>=1")))||(((("Forks_2>=1")&&("Outside_2>=1"))&&("Neighbourhood_2_3>=1"))&&("Forks_3>=1")))||(((("Forks_1>=1")&&("Outside_2>=1"))&&("Forks_3>=1"))&&("Neighbourhood_3_1>=1")))||((("Neighbourhood_2_2>=1")&&("Forks_2>=2"))&&("Outside_3>=1")))||(((("Neighbourhood_3_1>=1")&&("Forks_3>=1"))&&("Outside_1>=1"))&&("Forks_1>=1")))||((("Neighbourhood_3_3>=1")&&("Forks_3>=2"))&&("Outside_1>=1")))||(((("Neighbourhood_3_2>=1")&&("Outside_1>=1"))&&("Forks_3>=1"))&&("Forks_2>=1")))||((("Outside_1>=1")&&("Neighbourhood_2_2>=1"))&&("Forks_2>=2")))||(((("Forks_1>=1")&&("Outside_2>=1"))&&("Neighbourhood_1_3>=1"))&&("Forks_3>=1")))||(((("Forks_1>=1")&&("Neighbourhood_2_1>=1"))&&("Forks_2>=1"))&&("Outside_3>=1")))||((("Forks_2>=2")&&("Neighbourhood_2_2>=1"))&&("Outside_2>=1")))||((("Neighbourhood_3_3>=1")&&("Outside_2>=1"))&&("Forks_3>=2")))||(((("Neighbourhood_2_1>=1")&&("Forks_1>=1"))&&("Forks_2>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_1_3>=1")&&("Outside_1>=1"))&&("Forks_1>=1"))&&("Forks_3>=1")))||((("Neighbourhood_3_3>=1")&&("Forks_3>=2"))&&("Outside_3>=1")))||(((("Outside_1>=1")&&("Forks_3>=1"))&&("Neighbourhood_2_3>=1"))&&("Forks_2>=1")))||((("Outside_1>=1")&&("Neighbourhood_1_1>=1"))&&("Forks_1>=2")))||(((("Outside_3>=1")&&("Forks_1>=1"))&&("Forks_3>=1"))&&("Neighbourhood_1_3>=1")))||(((("Forks_1>=1")&&("Forks_2>=1"))&&("Neighbourhood_1_2>=1"))&&("Outside_3>=1"))))U((((((((((("WaitRight_1>=1")&&("Neighbourhood_1_1>=1"))&&("Forks_1>=1"))||((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("WaitRight_2>=1")))||((("Neighbourhood_2_1>=1")&&("WaitRight_2>=1"))&&("Forks_1>=1")))||((("Forks_1>=1")&&("Neighbourhood_3_1>=1"))&&("WaitRight_3>=1")))||((("Neighbourhood_1_3>=1")&&("Forks_3>=1"))&&("WaitRight_1>=1")))||((("WaitRight_3>=1")&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1")))||((("WaitRight_1>=1")&&("Neighbourhood_1_2>=1"))&&("Forks_2>=1")))||((("Forks_2>=1")&&("Neighbourhood_2_2>=1"))&&("WaitRight_2>=1")))||((("Neighbourhood_3_3>=1")&&("WaitRight_3>=1"))&&("Forks_3>=1"))))))
Formula 8 simplified : !X(G(("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_2>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_2>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_1>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_1>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_2>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_1>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_1>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_1>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_1>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_3>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_2>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_1>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_1>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_1>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_3>=1")) U (("Forks_1>=1" & "Neighbourhood_1_1>=1" & "WaitRight_1>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "WaitRight_2>=1") | ("Forks_1>=1" & "Neighbourhood_2_1>=1" & "WaitRight_2>=1") | ("Forks_1>=1" & "Neighbourhood_3_1>=1" & "WaitRight_3>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "WaitRight_1>=1") | ("Forks_2>=1" & "Neighbourhood_3_2>=1" & "WaitRight_3>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "WaitRight_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "WaitRight_2>=1") | ("Forks_3>=1" & "Neighbourhood_3_3>=1" & "WaitRight_3>=1")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,748.095,285920,1,0,219,32560,4838,146,7100,43117,442
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((((G(((((((((((((((((((((((((((((("Neighbourhood_1_2>=1")&&("Outside_2>=1"))&&("Forks_2>=1"))&&("Forks_1>=1"))||((("Forks_1>=2")&&("Neighbourhood_1_1>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_3_2>=1")&&("Forks_2>=1"))&&("Forks_3>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_1_2>=1")&&("Forks_2>=1"))&&("Forks_1>=1"))&&("Outside_1>=1")))||((("Forks_1>=2")&&("Outside_3>=1"))&&("Neighbourhood_1_1>=1")))||(((("Forks_2>=1")&&("Forks_3>=1"))&&("Neighbourhood_2_3>=1"))&&("Outside_3>=1")))||(((("Forks_2>=1")&&("Forks_1>=1"))&&("Outside_1>=1"))&&("Neighbourhood_2_1>=1")))||(((("Outside_3>=1")&&("Neighbourhood_3_2>=1"))&&("Forks_3>=1"))&&("Forks_2>=1")))||(((("Neighbourhood_3_1>=1")&&("Outside_3>=1"))&&("Forks_3>=1"))&&("Forks_1>=1")))||(((("Forks_2>=1")&&("Outside_2>=1"))&&("Neighbourhood_2_3>=1"))&&("Forks_3>=1")))||(((("Forks_1>=1")&&("Outside_2>=1"))&&("Forks_3>=1"))&&("Neighbourhood_3_1>=1")))||((("Neighbourhood_2_2>=1")&&("Forks_2>=2"))&&("Outside_3>=1")))||(((("Neighbourhood_3_1>=1")&&("Forks_3>=1"))&&("Outside_1>=1"))&&("Forks_1>=1")))||((("Neighbourhood_3_3>=1")&&("Forks_3>=2"))&&("Outside_1>=1")))||(((("Neighbourhood_3_2>=1")&&("Outside_1>=1"))&&("Forks_3>=1"))&&("Forks_2>=1")))||((("Outside_1>=1")&&("Neighbourhood_2_2>=1"))&&("Forks_2>=2")))||(((("Forks_1>=1")&&("Outside_2>=1"))&&("Neighbourhood_1_3>=1"))&&("Forks_3>=1")))||(((("Forks_1>=1")&&("Neighbourhood_2_1>=1"))&&("Forks_2>=1"))&&("Outside_3>=1")))||((("Forks_2>=2")&&("Neighbourhood_2_2>=1"))&&("Outside_2>=1")))||((("Neighbourhood_3_3>=1")&&("Outside_2>=1"))&&("Forks_3>=2")))||(((("Neighbourhood_2_1>=1")&&("Forks_1>=1"))&&("Forks_2>=1"))&&("Outside_2>=1")))||(((("Neighbourhood_1_3>=1")&&("Outside_1>=1"))&&("Forks_1>=1"))&&("Forks_3>=1")))||((("Neighbourhood_3_3>=1")&&("Forks_3>=2"))&&("Outside_3>=1")))||(((("Outside_1>=1")&&("Forks_3>=1"))&&("Neighbourhood_2_3>=1"))&&("Forks_2>=1")))||((("Outside_1>=1")&&("Neighbourhood_1_1>=1"))&&("Forks_1>=2")))||(((("Outside_3>=1")&&("Forks_1>=1"))&&("Forks_3>=1"))&&("Neighbourhood_1_3>=1")))||(((("Forks_1>=1")&&("Forks_2>=1"))&&("Neighbourhood_1_2>=1"))&&("Outside_3>=1"))))U(F(((((((((((((((((((((((((((((("Think_2>=1")&&("Neighbourhood_2_1>=1"))&&("Neighbourhood_1_2>=1"))&&("Forks_2>=1"))||(((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("Neighbourhood_3_3>=1"))&&("Think_3>=1")))||(((("Neighbourhood_1_1>=1")&&("Neighbourhood_1_2>=1"))&&("Think_1>=1"))&&("Forks_1>=1")))||(((("Forks_3>=1")&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_1>=1"))&&("Think_3>=1")))||(((("Forks_3>=1")&&("Neighbourhood_3_3>=1"))&&("Think_3>=1"))&&("Neighbourhood_3_2>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_1_1>=1"))&&("Neighbourhood_2_1>=1")))||(((("Neighbourhood_1_3>=1")&&("Think_1>=1"))&&("Neighbourhood_1_1>=1"))&&("Forks_1>=1")))||(((("Neighbourhood_2_3>=1")&&("Neighbourhood_2_2>=1"))&&("Forks_2>=1"))&&("Think_2>=1")))||(((("Neighbourhood_3_1>=1")&&("Neighbourhood_3_3>=1"))&&("Forks_3>=1"))&&("Think_3>=1")))||(((("Neighbourhood_3_2>=1")&&("Forks_2>=1"))&&("Think_2>=1"))&&("Neighbourhood_2_3>=1")))||(((("Think_2>=1")&&("Forks_2>=1"))&&("Neighbourhood_2_2>=1"))&&("Neighbourhood_2_1>=1")))||(((("Think_1>=1")&&("Neighbourhood_1_2>=1"))&&("Neighbourhood_3_1>=1"))&&("Forks_1>=1")))||(((("Think_2>=1")&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1"))&&("Neighbourhood_2_1>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_1>=1")))||(((("Neighbourhood_2_2>=1")&&("Think_2>=1"))&&("Forks_2>=1"))&&("Neighbourhood_3_2>=1")))||(((("Neighbourhood_1_1>=1")&&("Think_1>=1"))&&("Neighbourhood_3_1>=1"))&&("Forks_1>=1")))||(((("Forks_3>=1")&&("Think_3>=1"))&&("Neighbourhood_1_3>=1"))&&("Neighbourhood_3_3>=1")))||(((("Neighbourhood_1_2>=1")&&("Neighbourhood_2_1>=1"))&&("Think_1>=1"))&&("Forks_1>=1")))||((("Think_3>=1")&&("Forks_3>=1"))&&("Neighbourhood_3_3>=2")))||(((("Neighbourhood_3_1>=1")&&("Forks_3>=1"))&&("Think_3>=1"))&&("Neighbourhood_2_3>=1")))||(((("Neighbourhood_1_2>=1")&&("Neighbourhood_2_3>=1"))&&("Think_2>=1"))&&("Forks_2>=1")))||(((("Forks_3>=1")&&("Neighbourhood_2_3>=1"))&&("Neighbourhood_3_2>=1"))&&("Think_3>=1")))||((("Forks_2>=1")&&("Think_2>=1"))&&("Neighbourhood_2_2>=2")))||(((("Neighbourhood_1_3>=1")&&("Forks_3>=1"))&&("Neighbourhood_3_2>=1"))&&("Think_3>=1")))||((("Neighbourhood_1_1>=2")&&("Think_1>=1"))&&("Forks_1>=1")))||(((("Forks_2>=1")&&("Think_2>=1"))&&("Neighbourhood_2_2>=1"))&&("Neighbourhood_1_2>=1")))||(((("Think_1>=1")&&("Forks_1>=1"))&&("Neighbourhood_2_1>=1"))&&("Neighbourhood_1_3>=1")))))U((F((((((((((("HasRight_3>=1")&&("HasLeft_3>=1"))&&("Neighbourhood_3_2>=1"))||((("HasRight_1>=1")&&("Neighbourhood_1_3>=1"))&&("HasLeft_1>=1")))||((("HasRight_1>=1")&&("HasLeft_1>=1"))&&("Neighbourhood_1_2>=1")))||((("Neighbourhood_2_2>=1")&&("HasLeft_2>=1"))&&("HasRight_2>=1")))||((("Neighbourhood_3_1>=1")&&("HasLeft_3>=1"))&&("HasRight_3>=1")))||((("HasRight_2>=1")&&("HasLeft_2>=1"))&&("Neighbourhood_2_1>=1")))||((("HasRight_2>=1")&&("Neighbourhood_2_3>=1"))&&("HasLeft_2>=1")))||((("HasRight_1>=1")&&("Neighbourhood_1_1>=1"))&&("HasLeft_1>=1")))||((("HasRight_3>=1")&&("Neighbourhood_3_3>=1"))&&("HasLeft_3>=1"))))U(G((((((((((("HasRight_3>=1")&&("HasLeft_3>=1"))&&("Neighbourhood_3_2>=1"))||((("HasRight_1>=1")&&("Neighbourhood_1_3>=1"))&&("HasLeft_1>=1")))||((("HasRight_1>=1")&&("HasLeft_1>=1"))&&("Neighbourhood_1_2>=1")))||((("Neighbourhood_2_2>=1")&&("HasLeft_2>=1"))&&("HasRight_2>=1")))||((("Neighbourhood_3_1>=1")&&("HasLeft_3>=1"))&&("HasRight_3>=1")))||((("HasRight_2>=1")&&("HasLeft_2>=1"))&&("Neighbourhood_2_1>=1")))||((("HasRight_2>=1")&&("Neighbourhood_2_3>=1"))&&("HasLeft_2>=1")))||((("HasRight_1>=1")&&("Neighbourhood_1_1>=1"))&&("HasLeft_1>=1")))||((("HasRight_3>=1")&&("Neighbourhood_3_3>=1"))&&("HasLeft_3>=1")))))))
Formula 9 simplified : !((G(("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_2>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_2>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_1>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_1>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_2>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_3_1>=1" & "Outside_1>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_1>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_3_2>=1" & "Outside_1>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_1>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_3>=1") | ("Forks_2>=2" & "Neighbourhood_2_2>=1" & "Outside_2>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_2_1>=1" & "Outside_2>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_1>=1") | ("Forks_3>=2" & "Neighbourhood_3_3>=1" & "Outside_3>=1") | ("Forks_2>=1" & "Forks_3>=1" & "Neighbourhood_2_3>=1" & "Outside_1>=1") | ("Forks_1>=2" & "Neighbourhood_1_1>=1" & "Outside_1>=1") | ("Forks_1>=1" & "Forks_3>=1" & "Neighbourhood_1_3>=1" & "Outside_3>=1") | ("Forks_1>=1" & "Forks_2>=1" & "Neighbourhood_1_2>=1" & "Outside_3>=1")) U F(("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_1>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_1_2>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_1>=1" & "Think_3>=1") | ("Forks_3>=1" & "Neighbourhood_3_2>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_1_3>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "Neighbourhood_2_3>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_3_1>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_2>=1" & "Neighbourhood_2_1>=1" & "Neighbourhood_2_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_1>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=1" & "Neighbourhood_3_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=1" & "Neighbourhood_3_1>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_3>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1") | ("Forks_3>=1" & "Neighbourhood_3_3>=2" & "Think_3>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_1>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_3>=1" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_2_3>=1" & "Neighbourhood_3_2>=1" & "Think_3>=1") | ("Forks_2>=1" & "Neighbourhood_2_2>=2" & "Think_2>=1") | ("Forks_3>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_3_2>=1" & "Think_3>=1") | ("Forks_1>=1" & "Neighbourhood_1_1>=2" & "Think_1>=1") | ("Forks_2>=1" & "Neighbourhood_1_2>=1" & "Neighbourhood_2_2>=1" & "Think_2>=1") | ("Forks_1>=1" & "Neighbourhood_1_3>=1" & "Neighbourhood_2_1>=1" & "Think_1>=1"))) U (F(("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_2>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_3>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_2>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_2>=1") | ("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_1>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_1>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_3>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_1>=1") | ("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_3>=1")) U G(("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_2>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_3>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_2>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_2>=1") | ("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_1>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_1>=1") | ("HasLeft_2>=1" & "HasRight_2>=1" & "Neighbourhood_2_3>=1") | ("HasLeft_1>=1" & "HasRight_1>=1" & "Neighbourhood_1_1>=1") | ("HasLeft_3>=1" & "HasRight_3>=1" & "Neighbourhood_3_3>=1"))))
COULD_NOT_COMPUTE

BK_STOP 1464413116987

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 28, 2016 4:26:44 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2016 4:26:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 86 ms
May 28, 2016 4:26:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
May 28, 2016 4:26:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
May 28, 2016 4:26:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 329 ms
May 28, 2016 4:26:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 25 ms
May 28, 2016 4:26:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 16 ms
May 28, 2016 5:25:13 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
java.io.IOException: Pipe broken
at java.io.PipedInputStream.read(PipedInputStream.java:321)
at java.io.PipedInputStream.read(PipedInputStream.java:377)
at sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.io.InputStreamReader.read(InputStreamReader.java:184)
at java.io.BufferedReader.fill(BufferedReader.java:161)
at java.io.BufferedReader.readLine(BufferedReader.java:324)
at java.io.BufferedReader.readLine(BufferedReader.java:389)
at fr.lip6.move.gal.application.Application$ITSInterpreter.run(Application.java:460)
at java.lang.Thread.run(Thread.java:745)

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="S_PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/users/gast00/fkordon/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/S_PhilosophersDyn-PT-03.tgz
mv S_PhilosophersDyn-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_PhilosophersDyn-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169kn-ebro-146433129601005"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.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 ;