Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389800113.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r126-tajo-158961389800113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 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-00
FORMULA_NAME Philosophers-PT-000010-01
FORMULA_NAME Philosophers-PT-000010-02
FORMULA_NAME Philosophers-PT-000010-03
FORMULA_NAME Philosophers-PT-000010-04
FORMULA_NAME Philosophers-PT-000010-05
FORMULA_NAME Philosophers-PT-000010-06
FORMULA_NAME Philosophers-PT-000010-07
FORMULA_NAME Philosophers-PT-000010-08
FORMULA_NAME Philosophers-PT-000010-09
FORMULA_NAME Philosophers-PT-000010-10
FORMULA_NAME Philosophers-PT-000010-11
FORMULA_NAME Philosophers-PT-000010-12
FORMULA_NAME Philosophers-PT-000010-13
FORMULA_NAME Philosophers-PT-000010-14
FORMULA_NAME Philosophers-PT-000010-15

=== Now, execution of the tool begins

BK_START 1589786617779

[2020-05-18 07:23:39] [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, -timeout, 3600]
[2020-05-18 07:23:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:23:39] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-05-18 07:23:39] [INFO ] Transformed 50 places.
[2020-05-18 07:23:39] [INFO ] Transformed 50 transitions.
[2020-05-18 07:23:39] [INFO ] Parsed PT model containing 50 places and 50 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 663 resets, run finished after 213 ms. (steps per millisecond=469 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 50 rows 50 cols
[2020-05-18 07:23:39] [INFO ] Computed 20 place invariants in 8 ms
[2020-05-18 07:23:39] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned unsat
[2020-05-18 07:23:40] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
[2020-05-18 07:23:40] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-18 07:23:40] [INFO ] Flatten gal took : 25 ms
FORMULA Philosophers-PT-000010-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:23:40] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 07:23:40] [INFO ] Applying decomposition
[2020-05-18 07:23:40] [INFO ] Flatten gal took : 11 ms
[2020-05-18 07:23:40] [INFO ] Input system was already deterministic with 50 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
[2020-05-18 07:23:40] [INFO ] Computed 20 place invariants in 1 ms
inv : Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
inv : Fork_9 + Catch1_10 + Catch2_9 + Eat_9 + Eat_10 = 1
inv : Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
inv : Fork_2 + Catch1_3 + Catch2_2 + Eat_2 + Eat_3 = 1
inv : Fork_3 + Catch1_4 + Catch2_3 + Eat_4 + Eat_3 = 1
inv : Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
inv : Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
inv : Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
inv : Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
inv : Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
inv : Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
inv : Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
inv : Catch1_1 + Fork_10 + Catch2_10 + Eat_1 + Eat_10 = 1
inv : Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
inv : Fork_4 + Catch1_5 + Catch2_4 + Eat_4 + Eat_5 = 1
inv : Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
inv : Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
inv : Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
inv : Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
inv : Fork_7 + Catch1_8 + Catch2_7 + Eat_8 + Eat_7 = 1
Total of 20 invariants.
[2020-05-18 07:23:40] [INFO ] Computed 20 place invariants in 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph4421408716854054113.txt, -o, /tmp/graph4421408716854054113.bin, -w, /tmp/graph4421408716854054113.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4421408716854054113.bin, -l, -1, -v, -w, /tmp/graph4421408716854054113.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:23:40] [INFO ] Proved 50 variables to be positive in 70 ms
[2020-05-18 07:23:40] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2020-05-18 07:23:40] [INFO ] Computation of disable matrix completed :0/50 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:23:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:23:40] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2020-05-18 07:23:40] [INFO ] Decomposing Gal with order
[2020-05-18 07:23:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 07:23:40] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-18 07:23:40] [INFO ] Flatten gal took : 31 ms
[2020-05-18 07:23:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-18 07:23:40] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-18 07:23:40] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !((G(F(G(X(X((G(X(F("((((((((((gu0.Think_1+gu0.Think_2)+gu0.Think_3)+gu0.Think_4)+gu0.Think_5)+gu0.Think_6)+gu0.Think_7)+gu0.Think_8)+gu0.Think_9)+gu0.Think_10)<=(((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10))"))))U(G("((((((((((gu0.Think_1+gu0.Think_2)+gu0.Think_3)+gu0.Think_4)+gu0.Think_5)+gu0.Think_6)+gu0.Think_7)+gu0.Think_8)+gu0.Think_9)+gu0.Think_10)<=(((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10))")))))))))
Formula 0 simplified : !GFGXX(GXF"((((((((((gu0.Think_1+gu0.Think_2)+gu0.Think_3)+gu0.Think_4)+gu0.Think_5)+gu0.Think_6)+gu0.Think_7)+gu0.Think_8)+gu0.Think_9)+gu0.Think_10)<=(((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10))" U G"((((((((((gu0.Think_1+gu0.Think_2)+gu0.Think_3)+gu0.Think_4)+gu0.Think_5)+gu0.Think_6)+gu0.Think_7)+gu0.Think_8)+gu0.Think_9)+gu0.Think_10)<=(((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10))")
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
13 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.157262,23076,1,0,17,22913,21,12,2490,28784,37
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(!(F(!(F(("((((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10)>=2)")U(!(F((G("((((((((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_10)<=(((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10))"))&&("((((((((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_10)<=(((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10))"))))))))))))
Formula 1 simplified : G!F!F("((((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10)>=2)" U !F("((((((((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_10)<=(((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10))" & G"((((((((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_10)<=(((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.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
18 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.338337,29916,1,0,49,51507,34,48,3398,81772,141
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((!(("((((((((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_10)>=3)")U("((((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10)>=2)")))&&(!(F(G("(((((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10)>=2)&&((((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10)>=1))")))))))
Formula 2 simplified : !F(!("((((((((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_5)+gu1.Fork_4)+gu1.Fork_7)+gu1.Fork_6)+gu1.Fork_9)+gu1.Fork_8)+gu1.Fork_10)>=3)" U "((((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10)>=2)") & !FG"(((((((((((gu1.Eat_1+gu1.Eat_4)+gu1.Eat_5)+gu1.Eat_2)+gu1.Eat_3)+gu1.Eat_9)+gu1.Eat_8)+gu1.Eat_7)+gu1.Eat_6)+gu1.Eat_10)>=2)&&((((((((((gu0.Catch1_1+gu0.Catch1_3)+gu0.Catch1_2)+gu0.Catch1_5)+gu0.Catch1_4)+gu0.Catch1_7)+gu0.Catch1_6)+gu0.Catch1_9)+gu0.Catch1_8)+gu0.Catch1_10)>=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
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.504881,35576,1,0,72,75178,52,70,3578,125040,224
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F("(gu1.Eat_1>gu1.Catch2_4)")))
Formula 3 simplified : !F"(gu1.Eat_1>gu1.Catch2_4)"
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.51412,36104,1,0,81,76784,61,82,3584,127670,278
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(("(gu1.Catch2_8<=gu1.Eat_7)")U("(gu0.Catch1_4>=1)")))||(F(G(F("(gu1.Catch2_8<=gu1.Eat_7)"))))))
Formula 4 simplified : !(G("(gu1.Catch2_8<=gu1.Eat_7)" U "(gu0.Catch1_4>=1)") | FGF"(gu1.Catch2_8<=gu1.Eat_7)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
6 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.534261,37108,1,0,97,81019,81,97,3594,132895,353
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X(X(G(!(X(X("(gu0.Catch2_2<=gu0.Catch1_9)")))))))))
Formula 5 simplified : XXG!XX"(gu0.Catch2_2<=gu0.Catch1_9)"
Computing Next relation with stutter on 2 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.603728,39484,1,0,118,94104,90,114,3599,156324,402
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F(X((X(G(("(gu0.Catch2_2<=gu0.Think_1)")U("(gu0.Catch1_6<=gu1.Eat_4)"))))U("(gu1.Fork_7<=gu0.Think_9)"))))))
Formula 6 simplified : FX(XG("(gu0.Catch2_2<=gu0.Think_1)" U "(gu0.Catch1_6<=gu1.Eat_4)") U "(gu1.Fork_7<=gu0.Think_9)")
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.617279,39972,1,0,147,96744,98,135,3604,160321,462
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(((G("(gu1.Eat_8<=gu0.Catch1_7)"))U("(gu1.Fork_9>gu1.Eat_2)"))&&(G("(gu1.Eat_1>=1)"))))))
Formula 7 simplified : !FX((G"(gu1.Eat_8<=gu0.Catch1_7)" U "(gu1.Fork_9>gu1.Eat_2)") & G"(gu1.Eat_1>=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
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.646443,41384,1,0,168,100907,133,158,3636,167759,546
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 07:23:41] [INFO ] Built C files in 1016ms conformant to PINS in folder :/home/mcc/execution
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 1589786621535

--------------------
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 -timeout 3600
+ 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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r126-tajo-158961389800113"
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" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;