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-155272231500798.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-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231500798
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 6.6K Feb 12 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 12 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 8 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 8 03:50 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 4.5K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 41K 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-000010-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553693438566

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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
invariant :Fork_9 + Catch1_10 + Catch2_9 + Eat_9 + Eat_10 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
invariant :Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
invariant :Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
invariant :Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
invariant :Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
invariant :Catch1_1 + Fork_10 + Catch2_10 + Eat_1 + Eat_10 = 1
invariant :Fork_7 + Catch1_8 + Catch2_7 + Eat_8 + Eat_7 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
invariant :Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
invariant :Fork_4 + Catch1_5 + Catch2_4 + Eat_4 + Eat_5 = 1
invariant :Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_4 + Eat_3 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_2 + Eat_3 = 1
invariant :Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
invariant :Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
invariant :Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
invariant :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1

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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.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("((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)>=3)"))U(X("((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))"))))
Formula 0 simplified : !(G"((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)>=3)" U X"((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.045753,18784,1,0,8,7051,18,3,1288,1669,11
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G("((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)<=(((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9))"))))
Formula 1 simplified : !G"((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)<=(((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9))"
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.050949,19040,1,0,8,7172,30,5,1383,2576,27
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X("((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)<=(((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10))"))))
Formula 2 simplified : !FX"((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)<=(((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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.053482,19040,1,0,8,7172,39,5,1457,2576,31
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(F(("((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)>=2)")U("((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)<=(((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10))")))))
Formula 3 simplified : !F("((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)>=2)" U "((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)<=(((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10))")
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
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.11465,20888,1,0,22,15613,48,24,1922,14760,85
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(F(("((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10))")U("((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=1)")))))
Formula 4 simplified : !GF("((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10))" U "((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=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.118496,21232,1,0,22,15614,57,24,1978,14766,98
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(F(G("((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)>=3)"))))))
Formula 5 simplified : !XFG"((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)>=3)"
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
26 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.373754,31556,1,0,87,59180,70,82,2140,107792,245
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X((X("((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10))"))U(X("((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))")))))
Formula 6 simplified : !X(X"((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10))" U X"((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))")
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
22 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.595749,39700,1,0,108,88011,80,99,3774,158303,301
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G("((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=2)")))
Formula 7 simplified : !G"((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=2)"
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
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.613885,40228,1,0,114,89616,86,107,3884,160770,344
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F("(Catch2_1<=Catch2_8)")))
Formula 8 simplified : !F"(Catch2_1<=Catch2_8)"
Computing Next relation with stutter on 2 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.614345,40492,1,0,114,89616,95,107,3888,160771,348
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(("(Catch1_1<=Think_5)")U("(Catch1_9<=Fork_3)")))))
Formula 9 simplified : !XX("(Catch1_1<=Think_5)" U "(Catch1_9<=Fork_3)")
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
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.638796,41252,1,0,136,95219,107,126,3902,169689,406
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((X(X("(Catch2_6<=Catch2_4)")))U(G(F("(Fork_5<=Catch2_5)")))))
Formula 10 simplified : !(XX"(Catch2_6<=Catch2_4)" U GF"(Fork_5<=Catch2_5)")
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.640024,41612,1,0,137,95234,116,127,3906,169715,415
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("(Catch1_8<=Catch1_1)")))
Formula 11 simplified : !X"(Catch1_8<=Catch1_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.640814,41612,1,0,139,95290,119,128,3910,169739,422
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("(Eat_5<=Catch1_9)")))
Formula 12 simplified : !G"(Eat_5<=Catch1_9)"
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.647206,41876,1,0,150,96365,125,139,3914,171136,480
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F((F("(Think_2<=Catch1_6)"))U("(Eat_8<=Fork_6)"))))
Formula 13 simplified : !F(F"(Think_2<=Catch1_6)" U "(Eat_8<=Fork_6)")
Computing Next relation with stutter on 2 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.647557,41876,1,0,150,96365,134,139,3917,171136,484
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(G(G("(Fork_5<=Catch2_6)")))))
Formula 14 simplified : !FG"(Fork_5<=Catch2_6)"
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
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.65432,41876,1,0,198,97605,147,182,3922,174182,597
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G("(Fork_10<=Catch2_5)")))
Formula 15 simplified : !G"(Fork_10<=Catch2_5)"
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.655304,42140,1,0,198,97605,153,182,3926,174182,602
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-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 1553693441631

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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:30:40 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:30:40 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
Mar 27, 2019 1:30:40 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 37 ms
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 50 places.
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 50 transitions.
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
Mar 27, 2019 1:30:40 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 0 ms
Mar 27, 2019 1:30:40 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 27, 2019 1:30:40 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 10 ms
Mar 27, 2019 1:30:41 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
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.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
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:30:41 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 911ms 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-000010"
export BK_EXAMINATION="LTLCardinality"
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-000010, examination is LTLCardinality"
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-155272231500798"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;