Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231500790.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231500790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.3K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 8 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.4K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 21K 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 Philosophers-PT-000005-LTLFireability-00
FORMULA_NAME Philosophers-PT-000005-LTLFireability-01
FORMULA_NAME Philosophers-PT-000005-LTLFireability-02
FORMULA_NAME Philosophers-PT-000005-LTLFireability-03
FORMULA_NAME Philosophers-PT-000005-LTLFireability-04
FORMULA_NAME Philosophers-PT-000005-LTLFireability-05
FORMULA_NAME Philosophers-PT-000005-LTLFireability-06
FORMULA_NAME Philosophers-PT-000005-LTLFireability-07
FORMULA_NAME Philosophers-PT-000005-LTLFireability-08
FORMULA_NAME Philosophers-PT-000005-LTLFireability-09
FORMULA_NAME Philosophers-PT-000005-LTLFireability-10
FORMULA_NAME Philosophers-PT-000005-LTLFireability-11
FORMULA_NAME Philosophers-PT-000005-LTLFireability-12
FORMULA_NAME Philosophers-PT-000005-LTLFireability-13
FORMULA_NAME Philosophers-PT-000005-LTLFireability-14
FORMULA_NAME Philosophers-PT-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553693365708

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 : !((X(F((G("((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))"))U(G("((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))"))))))
Formula 0 simplified : !XFG"((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.040124,17736,1,0,35,4967,24,30,635,6086,65
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((false))
Formula 1 simplified : 1
Computing Next relation with stutter on 2 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.041516,17736,1,0,35,4995,30,32,660,6276,76
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((("((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))")U(F(("((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))")U("((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))")))))
Formula 2 simplified : !("((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))" U F("((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))" U "((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))"))
Computing Next relation with stutter on 2 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.04767,17988,1,0,47,5841,36,44,660,7983,110
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F((F("((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))"))U("((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))")))))
Formula 3 simplified : !XF(F"((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))" U "((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.049737,18248,1,0,51,5998,36,48,660,8384,121
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((X(X("((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))")))U("((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))"))))
Formula 4 simplified : !G(XX"((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))" U "((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))")
Computing Next relation with stutter on 2 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.057292,18580,1,0,55,6624,39,52,680,9199,131
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((((G("(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))"))U(G("((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))")))U(F(G("(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))")))))
Formula 5 simplified : !((G"(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))" U G"((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))") U FG"(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))")
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.065623,19260,1,0,80,8322,52,77,693,12451,199
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F("((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))")))
Formula 6 simplified : !F"((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))"
Computing Next relation with stutter on 2 deadlock states
// Phase 1: matrix 25 rows 25 cols
invariant :Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
invariant :Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
invariant :Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
invariant :Fork_5 + Catch1_1 + Eat_1 + Catch2_5 + Eat_5 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
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.072667,19524,1,0,90,9385,61,88,713,14390,233
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(X(X(F("((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))"))))))
Formula 7 simplified : !FXXF"((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.073913,19524,1,0,91,9439,70,89,728,14437,240
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("((Fork_5>=1)&&(Catch1_5>=1))")U(G(G("((Fork_2>=1)&&(Think_3>=1))")))))
Formula 8 simplified : !("((Fork_5>=1)&&(Catch1_5>=1))" U G"((Fork_2>=1)&&(Think_3>=1))")
Computing Next relation with stutter on 2 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.076398,19976,1,0,103,9657,92,99,738,14782,280
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((F(F(X("((Fork_2>=1)&&(Catch2_3>=1))"))))U((X("((Fork_1>=1)&&(Catch2_2>=1))"))U(F("((Catch1_2>=1)&&(Fork_2>=1))")))))
Formula 9 simplified : !(FX"((Fork_2>=1)&&(Catch2_3>=1))" U (X"((Fork_1>=1)&&(Catch2_2>=1))" U F"((Catch1_2>=1)&&(Fork_2>=1))"))
Computing Next relation with stutter on 2 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.080656,20172,1,0,108,9953,101,107,738,15333,312
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F("((Fork_4>=1)&&(Think_4>=1))"))U(X(G(F("((Fork_1>=1)&&(Catch2_2>=1))"))))))
Formula 10 simplified : !(F"((Fork_4>=1)&&(Think_4>=1))" U XGF"((Fork_1>=1)&&(Catch2_2>=1))")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.082328,20316,1,0,109,10055,110,108,738,15471,323
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((false))
Formula 11 simplified : 1
Computing Next relation with stutter on 2 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.082536,20316,1,0,109,10055,110,108,738,15471,323
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(F((F("(Eat_3>=1)"))U("((Catch1_1>=1)&&(Fork_1>=1))")))))
Formula 12 simplified : !GF(F"(Eat_3>=1)" U "((Catch1_1>=1)&&(Fork_1>=1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.083702,20316,1,0,110,10166,119,109,738,15609,332
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X("((Catch2_4>=1)&&(Fork_3>=1))")))
Formula 13 simplified : !X"((Catch2_4>=1)&&(Fork_3>=1))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.084389,20316,1,0,111,10201,122,110,738,15645,339
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(X(F(G(F("((Fork_4>=1)&&(Think_4>=1))")))))))
Formula 14 simplified : !GXFGF"((Fork_4>=1)&&(Think_4>=1))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.085374,20316,1,0,113,10326,131,112,738,15786,350
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G("((Think_4>=1)&&(Fork_3>=1))")))
Formula 15 simplified : !G"((Think_4>=1)&&(Fork_3>=1))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.087324,20316,1,0,124,10676,137,122,738,16291,383
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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 1553693367874

--------------------
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 27, 2019 1:29:27 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 27, 2019 1:29:27 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 22 ms
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Mar 27, 2019 1:29:27 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 17 ms
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 places.
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 transitions.
Mar 27, 2019 1:29:27 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 27, 2019 1:29:27 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 27, 2019 1:29:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 9 ms
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 27, 2019 1:29:27 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 157ms 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="Philosophers-PT-000005"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is Philosophers-PT-000005, 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 r197-oct2-155272231500790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 ;