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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.7K 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-COL-000005-00
FORMULA_NAME Philosophers-COL-000005-01
FORMULA_NAME Philosophers-COL-000005-02
FORMULA_NAME Philosophers-COL-000005-03
FORMULA_NAME Philosophers-COL-000005-04
FORMULA_NAME Philosophers-COL-000005-05
FORMULA_NAME Philosophers-COL-000005-06
FORMULA_NAME Philosophers-COL-000005-07
FORMULA_NAME Philosophers-COL-000005-08
FORMULA_NAME Philosophers-COL-000005-09
FORMULA_NAME Philosophers-COL-000005-10
FORMULA_NAME Philosophers-COL-000005-11
FORMULA_NAME Philosophers-COL-000005-12
FORMULA_NAME Philosophers-COL-000005-13
FORMULA_NAME Philosophers-COL-000005-14
FORMULA_NAME Philosophers-COL-000005-15

=== Now, execution of the tool begins

BK_START 1589780467423

[2020-05-18 05:41:09] [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 05:41:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:41:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 05:41:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2020-05-18 05:41:09] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-05-18 05:41:09] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 13 ms.
[2020-05-18 05:41:09] [INFO ] Computed order based on color domains.
[2020-05-18 05:41:09] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions in 5 ms.
[2020-05-18 05:41:09] [INFO ] Unfolded HLPN properties in 1 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 2739 resets, run finished after 264 ms. (steps per millisecond=378 ) 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, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 05:41:10] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
[2020-05-18 05:41:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 22 ms
FORMULA Philosophers-COL-000005-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 05:41:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 6 ms
[2020-05-18 05:41:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Philosophers-COL-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 05:41:10] [INFO ] Applying decomposition
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 4 ms
[2020-05-18 05:41:10] [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 05:41:10] [INFO ] Computed 10 place invariants in 2 ms
inv : think_3 + catch1_3 + catch2_3 + eat_3 = 1
inv : think_4 + catch1_4 + catch2_4 + eat_4 = 1
inv : fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
inv : fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
inv : fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
inv : fork_4 + catch1_0 + catch2_4 + eat_0 + eat_4 = 1
inv : think_2 + catch1_2 + catch2_2 + eat_2 = 1
inv : think_1 + catch1_1 + catch2_1 + eat_1 = 1
inv : think_0 + catch1_0 + catch2_0 + eat_0 = 1
inv : fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
Total of 10 invariants.
[2020-05-18 05:41:10] [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/graph14793877197037671315.txt, -o, /tmp/graph14793877197037671315.bin, -w, /tmp/graph14793877197037671315.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/graph14793877197037671315.bin, -l, -1, -v, -w, /tmp/graph14793877197037671315.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:41:10] [INFO ] Decomposing Gal with order
[2020-05-18 05:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 05:41:10] [INFO ] Proved 25 variables to be positive in 81 ms
[2020-05-18 05:41:10] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-18 05:41:10] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:10] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-18 05:41:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:10] [INFO ] Removed a total of 25 redundant transitions.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 61 ms
[2020-05-18 05:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-18 05:41:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-18 05:41:10] [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 9 LTL properties
Checking formula 0 : !((G(G("(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<3)"))))
Formula 0 simplified : !G"(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.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.036836,16984,1,0,20,3432,23,17,661,2960,50
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<=((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4))"))))
Formula 1 simplified : !FG"(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<=((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.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.053776,17540,1,0,39,5471,36,37,829,6882,110
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G("(((((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<0)&&(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)))||(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)>=3))"))U("(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<3)"))&&(X("(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))"))))
Formula 2 simplified : !((G"(((((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<0)&&(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4)))||(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)>=3))" U "(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<3)") & X"(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))")
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.065089,18776,1,0,47,6333,50,46,961,8274,145
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((G(X("(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)>=2)")))||(!(F(F(!(F(G("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)>=3)"))))))))))
Formula 3 simplified : !X(GX"(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)>=2)" | !F!FG"(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)>=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.074651,19608,1,0,61,7278,66,69,1007,10208,202
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(X("(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<=((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4))")))))
Formula 4 simplified : !F!X"(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<=((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.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.075594,19608,1,0,61,7278,75,69,1026,10208,206
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X(F(!((F("(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<=((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4))"))U("(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<=((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4))"))))))||(G("(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<1)"))))
Formula 5 simplified : !(GXF!(F"(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)<=((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4))" U "(((((gu0.think_0+gu0.think_1)+gu0.think_2)+gu0.think_3)+gu0.think_4)<=((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4))") | G"(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.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
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.11885,21272,1,0,111,13983,102,116,1334,20185,344
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((X(X(X(!(G("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)>=2)"))))))U(!(X((!(F("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)>=2)")))&&("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<2)")))))))
Formula 6 simplified : !F(XXX!G"(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)>=2)" U !X("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<2)" & !F"(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)>=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
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.123058,21536,1,0,118,14531,113,124,1349,21184,371
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(!((!(X("(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)>=1)")))U("(((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4)>((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4))")))))
Formula 7 simplified : !X!(!X"(((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)>=1)" U "(((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4)>((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4))")
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.131518,21792,1,0,132,15304,125,137,1427,22921,409
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G((!(F("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))")))U((X("((((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))&&(((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4)<=((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)))"))||(G("(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))")))))))
Formula 8 simplified : !FG(!F"(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))" U (X"((((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))&&(((((gi2.gu4.eat_0+gi2.gu4.eat_1)+gi2.gu4.eat_2)+gi2.gu4.eat_3)+gi2.gu4.eat_4)<=((((gi2.gu2.catch1_0+gi2.gu2.catch1_1)+gi2.gu2.catch1_2)+gi2.gu2.catch1_3)+gi2.gu2.catch1_4)))" | G"(((((gi1.gu3.catch2_0+gi1.gu3.catch2_1)+gi1.gu3.catch2_2)+gi1.gu3.catch2_3)+gi1.gu3.catch2_4)<=((((gi1.gu1.fork_0+gi1.gu1.fork_1)+gi1.gu1.fork_2)+gi1.gu1.fork_3)+gi1.gu1.fork_4))"))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
2 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.149501,22556,1,0,140,16319,141,146,1633,24466,440
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 05:41:11] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 3) 1) (>= (select s0 8) 1)) (= (store (store (store s0 3 (- (select s0 3) 1)) 8 (- (select s0 8) 1)) 18 (+ (select s0 18) 1)) s1))) with error
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: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 05:41:11] [INFO ] Built C files in 407ms 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 1589780471241

--------------------
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-COL-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-COL-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-158961389700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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