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-158961389800105.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-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389800105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 5.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K 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 21K 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-000005-00
FORMULA_NAME Philosophers-PT-000005-01
FORMULA_NAME Philosophers-PT-000005-02
FORMULA_NAME Philosophers-PT-000005-03
FORMULA_NAME Philosophers-PT-000005-04
FORMULA_NAME Philosophers-PT-000005-05
FORMULA_NAME Philosophers-PT-000005-06
FORMULA_NAME Philosophers-PT-000005-07
FORMULA_NAME Philosophers-PT-000005-08
FORMULA_NAME Philosophers-PT-000005-09
FORMULA_NAME Philosophers-PT-000005-10
FORMULA_NAME Philosophers-PT-000005-11
FORMULA_NAME Philosophers-PT-000005-12
FORMULA_NAME Philosophers-PT-000005-13
FORMULA_NAME Philosophers-PT-000005-14
FORMULA_NAME Philosophers-PT-000005-15

=== Now, execution of the tool begins

BK_START 1589786517029

[2020-05-18 07:21:58] [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:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:21:58] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2020-05-18 07:21:58] [INFO ] Transformed 25 places.
[2020-05-18 07:21:58] [INFO ] Transformed 25 transitions.
[2020-05-18 07:21:58] [INFO ] Parsed PT model containing 25 places and 25 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2737 resets, run finished after 189 ms. (steps per millisecond=529 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 07:21:58] [INFO ] Computed 10 place invariants in 3 ms
[2020-05-18 07:21:58] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned unsat
[2020-05-18 07:21:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 07:21:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 07:21:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 07:21:58] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-05-18 07:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:21:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-18 07:21:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:21:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2020-05-18 07:21:59] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-18 07:21:59] [INFO ] Flatten gal took : 21 ms
FORMULA Philosophers-PT-000005-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:21:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 07:21:59] [INFO ] Flatten gal took : 4 ms
[2020-05-18 07:21:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Philosophers-PT-000005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 07:21:59] [INFO ] Applying decomposition
[2020-05-18 07:21:59] [INFO ] Flatten gal took : 4 ms
[2020-05-18 07:21:59] [INFO ] Input system was already deterministic with 25 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 07:21:59] [INFO ] Computed 10 place invariants in 1 ms
inv : Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
inv : Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
inv : Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
inv : Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
inv : Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
inv : Fork_5 + Catch1_1 + Eat_1 + Catch2_5 + Eat_5 = 1
inv : Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
inv : Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
inv : Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
inv : Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
Total of 10 invariants.
[2020-05-18 07:21:59] [INFO ] Computed 10 place invariants in 3 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/graph16099196900442702323.txt, -o, /tmp/graph16099196900442702323.bin, -w, /tmp/graph16099196900442702323.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/graph16099196900442702323.bin, -l, -1, -v, -w, /tmp/graph16099196900442702323.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:21:59] [INFO ] Decomposing Gal with order
[2020-05-18 07:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 07:21:59] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-18 07:21:59] [INFO ] Proved 25 variables to be positive in 84 ms
[2020-05-18 07:21:59] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-18 07:21:59] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:21:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:21:59] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-18 07:21:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:21:59] [INFO ] Flatten gal took : 36 ms
[2020-05-18 07:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-18 07:21:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-18 07:21:59] [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 11 LTL properties
Checking formula 0 : !((G(G("(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<3)"))))
Formula 0 simplified : !G"(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<3)"
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
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.031555,16648,1,0,20,3300,23,17,666,2967,50
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<=((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4))"))))
Formula 1 simplified : !FG"(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<=((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_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
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.04601,17568,1,0,39,5260,36,37,837,7026,108
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G("(((((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<0)&&(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<=((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_4)+gu1.Fork_5)))||(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)>=3))"))U("(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<3)"))&&(X("(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<=((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_4)+gu1.Fork_5))"))))
Formula 2 simplified : !((G"(((((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<0)&&(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<=((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_4)+gu1.Fork_5)))||(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)>=3))" U "(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<3)") & X"(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<=((((gu1.Fork_1+gu1.Fork_2)+gu1.Fork_3)+gu1.Fork_4)+gu1.Fork_5))")
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.059535,19068,1,0,47,6109,50,46,1064,8484,143
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((G(X("(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)>=2)")))||(!(F(F(!(F(G("(((((gi0.gu2.Catch2_2+gi0.gu2.Catch2_1)+gi0.gu2.Catch2_4)+gi0.gu2.Catch2_3)+gi0.gu2.Catch2_5)>=3)"))))))))))
Formula 3 simplified : !X(GX"(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)>=2)" | !F!FG"(((((gi0.gu2.Catch2_2+gi0.gu2.Catch2_1)+gi0.gu2.Catch2_4)+gi0.gu2.Catch2_3)+gi0.gu2.Catch2_5)>=3)")
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.069907,19636,1,0,61,7043,66,69,1112,10495,200
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(X("(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<=((((gu3.Eat_1+gu3.Eat_3)+gu3.Eat_2)+gu3.Eat_5)+gu3.Eat_4))")))))
Formula 4 simplified : !F!X"(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<=((((gu3.Eat_1+gu3.Eat_3)+gu3.Eat_2)+gu3.Eat_5)+gu3.Eat_4))"
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
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.070728,19636,1,0,61,7043,75,69,1129,10495,204
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X(F(!((F("(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<=((((gu3.Eat_1+gu3.Eat_3)+gu3.Eat_2)+gu3.Eat_5)+gu3.Eat_4))"))U("(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<=((((gi0.gu2.Catch2_2+gi0.gu2.Catch2_1)+gi0.gu2.Catch2_4)+gi0.gu2.Catch2_3)+gi0.gu2.Catch2_5))"))))))||(G("(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<1)"))))
Formula 5 simplified : !(GXF!(F"(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<=((((gu3.Eat_1+gu3.Eat_3)+gu3.Eat_2)+gu3.Eat_5)+gu3.Eat_4))" U "(((((gi0.gu0.Think_1+gi0.gu0.Think_2)+gi0.gu0.Think_3)+gi0.gu0.Think_4)+gi0.gu0.Think_5)<=((((gi0.gu2.Catch2_2+gi0.gu2.Catch2_1)+gi0.gu2.Catch2_4)+gi0.gu2.Catch2_3)+gi0.gu2.Catch2_5))") | G"(((((gu1.Catch1_1+gu1.Catch1_2)+gu1.Catch1_3)+gu1.Catch1_5)+gu1.Catch1_4)<1)")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 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.11073,21300,1,0,111,13370,102,116,1456,20618,342
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G("(gu3.Eat_2<=gi0.gu0.Think_5)"))U("(gi0.gu2.Catch2_3>=1)")))
Formula 6 simplified : !(G"(gu3.Eat_2<=gi0.gu0.Think_5)" U "(gi0.gu2.Catch2_3>=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
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.116482,22064,1,0,124,14208,117,130,1466,21761,400
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(X(F(F(X(F("(gu3.Eat_1>gu1.Fork_1)")))))))U("(gu3.Eat_1>gu1.Fork_1)")))
Formula 7 simplified : !(FXFXF"(gu3.Eat_1>gu1.Fork_1)" U "(gu3.Eat_1>gu1.Fork_1)")
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.121441,22064,1,0,135,14865,127,141,1472,23043,447
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F((("(gu3.Eat_1>=1)")U("(gi0.gu2.Catch2_3<=gu1.Fork_1)"))||(X("(gu1.Catch1_4>=1)"))))))
Formula 8 simplified : !GF(("(gu3.Eat_1>=1)" U "(gi0.gu2.Catch2_3<=gu1.Fork_1)") | X"(gu1.Catch1_4>=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
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.12363,22304,1,0,137,15044,141,143,1479,23255,460
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(!(F("(gu1.Catch1_3<=gu3.Eat_1)")))))
Formula 9 simplified : !X!F"(gu1.Catch1_3<=gu3.Eat_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.131823,22304,1,0,152,16012,147,155,1483,24712,496
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(!((X("(gu1.Catch1_4<=gu3.Eat_5)"))U(F(X(F("(gu1.Catch1_4<=gu3.Eat_5)"))))))))
Formula 10 simplified : !X!(X"(gu1.Catch1_4<=gu3.Eat_5)" U FXF"(gu1.Catch1_4<=gu3.Eat_5)")
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 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.134994,22564,1,0,164,16430,153,165,1488,25372,527
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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:768)
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: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:21:59] [INFO ] Built C files in 358ms 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 1589786520415

--------------------
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-000005"
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-000005, 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-158961389800105"
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 [ "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 ;