Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r198-smll-155272319100052.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstoolsm
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-smll-155272319100052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 7.3K Feb 12 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 12 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 8 08:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 8 08:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 1 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 1 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 87K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553548969005

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F(F("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"))))U(G("((((((((((((((((((((((((((((((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 0 simplified : !(GF"((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))" U G"((((((((((((((((((((((((((((((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)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 57
// Phase 1: matrix 57 rows 30 cols
invariant :Think_1 + HasLeft_1 + WaitLeft_1 + Outside_1 = 1
invariant :-1'WaitLeft_2 + HasRight_2 + WaitRight_2 + -1'HasLeft_2 = 0
invariant :Neighbourhood_1_1 + Neighbourhood_2_1 + Neighbourhood_3_1 + Outside_1 = 1
invariant :Neighbourhood_1_2 + Think_3 + Neighbourhood_2_2 + -1'Neighbourhood_3_3 + Neighbourhood_1_1 + Neighbourhood_2_1 + WaitRight_3 + HasRight_3 + Outside_2 + Outside_1 = 2
invariant :Neighbourhood_1_2 + Neighbourhood_1_1 + Neighbourhood_1_3 + Outside_1 = 1
invariant :WaitRight_1 + HasRight_1 + -1'HasLeft_1 + -1'WaitLeft_1 = 0
invariant :Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_1 + Outside_2 = 1
invariant :HasLeft_3 + WaitLeft_3 + -1'WaitRight_3 + -1'HasRight_3 = 0
invariant :WaitLeft_2 + Think_2 + HasLeft_2 + Outside_2 = 1
invariant :-1'Neighbourhood_1_2 + -1'Neighbourhood_2_2 + Outside_3 + Neighbourhood_3_3 + -1'Neighbourhood_1_1 + -1'Neighbourhood_2_1 + -1'Outside_2 + -1'Outside_1 = -1
invariant :Neighbourhood_1_2 + Neighbourhood_2_2 + Neighbourhood_3_2 + Outside_2 = 1
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t29, t33, t35, t39, t55, t60, t61, t62, t73, t82, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :42/30/12/84
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24 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.283129,23752,1,0,105,19160,155,49,2453,15793,163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G(("((((((((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("((((((((((((((((((((((((((((((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(("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))")U(G("(((Think_1>=1)||(Think_3>=1))||(Think_2>=1))")))))
Formula 1 simplified : !(G("((((((((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 "((((((((((((((((((((((((((((((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 ("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))" U G"(((Think_1>=1)||(Think_3>=1))||(Think_2>=1))"))
Computing Next relation with stutter on 45 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
20 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.488355,28692,1,0,138,25596,213,76,2526,25481,291
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X((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("(((((((((((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 2 simplified : !XX(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"(((((((((((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)))")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 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.586756,31328,1,0,166,32738,219,96,2568,35530,350
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(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 3 simplified : !FX"((((((((((((((((((((((((((((((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)))"
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 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.596048,31732,1,0,166,32738,225,96,2568,35532,354
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(G(X(G(F("(((((((((((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 4 simplified : !GXGF"(((((((((((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)))"
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 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.642458,33248,1,0,186,36520,231,111,2568,40955,403
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((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)))")))
Formula 5 simplified : !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)))"
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.706394,35360,1,0,217,40154,240,141,2595,46397,480
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(G(F(X(G("(((((((((((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 6 simplified : !GFXG"(((((((((((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)))"
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 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.741378,36408,1,0,222,42388,247,151,2595,51162,506
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(X((G("((((((((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(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)))"))))))
Formula 7 simplified : !XX(G"((((((((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 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)))")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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.766565,36672,1,0,232,42812,247,165,2595,52548,533
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(X(F(X("((((Forks_1>=1)&&(Forks_2>=1))&&(Neighbourhood_1_2>=1))&&(Outside_3>=1))"))))))
Formula 8 simplified : !GXFX"((((Forks_1>=1)&&(Forks_2>=1))&&(Neighbourhood_1_2>=1))&&(Outside_3>=1))"
Computing Next relation with stutter on 45 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,0.774848,36672,1,0,241,43247,256,174,2598,53173,561
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(G(("(((Forks_2>=2)&&(Neighbourhood_2_2>=1))&&(Outside_2>=1))")U("((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Think_3>=1))&&(Neighbourhood_2_3>=1))")))))
Formula 9 simplified : !XG("(((Forks_2>=2)&&(Neighbourhood_2_2>=1))&&(Outside_2>=1))" U "((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Think_3>=1))&&(Neighbourhood_2_3>=1))")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.785514,37200,1,0,241,43498,272,174,2611,53661,572
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((false))
Formula 10 simplified : 1
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 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.78579,37200,1,0,241,43498,272,174,2611,53661,573
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((false))
Formula 11 simplified : 1
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 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.785941,37200,1,0,241,43498,272,174,2611,53661,573
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(F("((Forks_3>=1)&&(WaitLeft_3>=1))"))))
Formula 12 simplified : !XF"((Forks_3>=1)&&(WaitLeft_3>=1))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 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.799835,37464,1,0,258,44345,281,189,2611,54883,610
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((X("((((Neighbourhood_2_1>=1)&&(Forks_1>=1))&&(Forks_2>=1))&&(Outside_2>=1))"))U(X(X("((((Forks_3>=1)&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1))&&(Think_3>=1))"))))))
Formula 13 simplified : !X(X"((((Neighbourhood_2_1>=1)&&(Forks_1>=1))&&(Forks_2>=1))&&(Outside_2>=1))" U XX"((((Forks_3>=1)&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1))&&(Think_3>=1))")
Computing Next relation with stutter on 45 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,0.860893,37992,1,0,260,44879,288,190,2616,55988,621
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((true))
Formula 14 simplified : 0
Computing Next relation with stutter on 45 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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.861135,37992,1,0,260,44879,288,190,2616,55988,621
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(X((F("(Think_2>=1)"))U(F("((((Forks_2>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Outside_3>=1))"))))))
Formula 15 simplified : !XX(F"(Think_2>=1)" U F"((((Forks_2>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Outside_3>=1))")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.868478,37992,1,0,261,45168,297,197,2619,56551,647
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1553548974577

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 25, 2019 9:22:51 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 25, 2019 9:22:51 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 25, 2019 9:22:51 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 74 ms
Mar 25, 2019 9:22:51 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
Mar 25, 2019 9:22:51 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
Mar 25, 2019 9:22:51 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 17 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 80 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 30 places.
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 84 transitions.
Mar 25, 2019 9:22:52 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
Mar 25, 2019 9:22:52 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 16 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 30 variables to be positive in 127 ms
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 84 transitions.
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/84 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 84 transitions.
Mar 25, 2019 9:22:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 25, 2019 9:22:53 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1098ms conformant to PINS in folder :/home/mcc/execution

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-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool itstoolsm"
echo " Input is 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 r198-smll-155272319100052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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