About the Execution of ITS-Tools for PhilosophersDyn-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.520 | 6515.00 | 9976.00 | 761.10 | TFFTFTFFFFFFTFTF | normal |
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-158961390000233.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 PhilosophersDyn-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390000233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-00
FORMULA_NAME PhilosophersDyn-PT-03-01
FORMULA_NAME PhilosophersDyn-PT-03-02
FORMULA_NAME PhilosophersDyn-PT-03-03
FORMULA_NAME PhilosophersDyn-PT-03-04
FORMULA_NAME PhilosophersDyn-PT-03-05
FORMULA_NAME PhilosophersDyn-PT-03-06
FORMULA_NAME PhilosophersDyn-PT-03-07
FORMULA_NAME PhilosophersDyn-PT-03-08
FORMULA_NAME PhilosophersDyn-PT-03-09
FORMULA_NAME PhilosophersDyn-PT-03-10
FORMULA_NAME PhilosophersDyn-PT-03-11
FORMULA_NAME PhilosophersDyn-PT-03-12
FORMULA_NAME PhilosophersDyn-PT-03-13
FORMULA_NAME PhilosophersDyn-PT-03-14
FORMULA_NAME PhilosophersDyn-PT-03-15
=== Now, execution of the tool begins
BK_START 1589795458501
[2020-05-18 09:51:00] [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 09:51:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 09:51:01] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-05-18 09:51:01] [INFO ] Transformed 30 places.
[2020-05-18 09:51:01] [INFO ] Transformed 84 transitions.
[2020-05-18 09:51:01] [INFO ] Parsed PT model containing 30 places and 84 transitions in 103 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
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 14317 resets, run finished after 312 ms. (steps per millisecond=320 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1]
[2020-05-18 09:51:01] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 09:51:01] [INFO ] Computed 11 place invariants in 4 ms
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-18 09:51:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-05-18 09:51:01] [INFO ] [Real]Added 36 Read/Feed constraints in 7 ms returned sat
[2020-05-18 09:51:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 09:51:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-18 09:51:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-18 09:51:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 09:51:01] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 12 ms.
[2020-05-18 09:51:01] [INFO ] Added : 31 causal constraints over 7 iterations in 89 ms. Result :sat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2020-05-18 09:51:02] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-18 09:51:02] [INFO ] Flatten gal took : 38 ms
FORMULA PhilosophersDyn-PT-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 09:51:02] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 09:51:02] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 09:51:02] [INFO ] Flatten gal took : 22 ms
[2020-05-18 09:51:02] [INFO ] Input system was already deterministic with 81 transitions.
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/graph3047256965425497381.txt, -o, /tmp/graph3047256965425497381.bin, -w, /tmp/graph3047256965425497381.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/graph3047256965425497381.bin, -l, -1, -v, -w, /tmp/graph3047256965425497381.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 09:51:02] [INFO ] Decomposing Gal with order
[2020-05-18 09:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 09:51:02] [INFO ] Computed 11 place invariants in 7 ms
inv : Neighbourhood_1_1 + Neighbourhood_2_1 + Neighbourhood_3_1 + Outside_1 = 1
inv : WaitLeft_2 + Think_2 + HasLeft_2 + Outside_2 = 1
inv : Outside_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 = 1
inv : Think_3 + Outside_3 + HasLeft_3 + WaitLeft_3 = 1
inv : Think_3 + Outside_3 + WaitRight_3 + HasRight_3 = 1
inv : Neighbourhood_1_2 - Neighbourhood_2_1 + Neighbourhood_1_3 - Neighbourhood_3_1 = 0
inv : Neighbourhood_2_3 + Neighbourhood_1_3 - Neighbourhood_3_2 - Neighbourhood_3_1 = 0
inv : WaitRight_1 + Think_1 + HasRight_1 + Outside_1 = 1
inv : Neighbourhood_2_2 + Neighbourhood_2_1 - Neighbourhood_1_3 + Neighbourhood_3_2 + Neighbourhood_3_1 + Outside_2 = 1
inv : Think_1 + HasLeft_1 + WaitLeft_1 + Outside_1 = 1
inv : HasRight_2 + Think_2 + WaitRight_2 + Outside_2 = 1
Total of 11 invariants.
[2020-05-18 09:51:02] [INFO ] Computed 11 place invariants in 8 ms
[2020-05-18 09:51:02] [INFO ] Removed a total of 122 redundant transitions.
[2020-05-18 09:51:02] [INFO ] Flatten gal took : 46 ms
[2020-05-18 09:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2020-05-18 09:51:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-18 09:51:02] [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(F(!(G(("(((((((((gu4.Neighbourhood_1_2+gu4.Neighbourhood_2_2)+gu4.Neighbourhood_3_3)+gu4.Neighbourhood_1_1)+gu4.Neighbourhood_2_3)+gu4.Neighbourhood_2_1)+gu4.Neighbourhood_1_3)+gu4.Neighbourhood_3_2)+gu4.Neighbourhood_3_1)<=((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1))")U("(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)<=((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3))")))))))
Formula 0 simplified : !GF!G("(((((((((gu4.Neighbourhood_1_2+gu4.Neighbourhood_2_2)+gu4.Neighbourhood_3_3)+gu4.Neighbourhood_1_1)+gu4.Neighbourhood_2_3)+gu4.Neighbourhood_2_1)+gu4.Neighbourhood_1_3)+gu4.Neighbourhood_3_2)+gu4.Neighbourhood_3_1)<=((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1))" U "(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)<=((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3))")
[2020-05-18 09:51:02] [INFO ] Proved 30 variables to be positive in 133 ms
[2020-05-18 09:51:02] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2020-05-18 09:51:02] [INFO ] Computation of disable matrix completed :0/81 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 09:51:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 09:51:02] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2020-05-18 09:51:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions Leave_2_1_1, Leave_1_1_2, Leave_3_3_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :18/27/3/48
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
9 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.120241,20016,1,0,82,13678,116,47,2128,12839,150
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G((X(G("(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)>=1)")))||("(((gu2.Outside_3+gu2.Outside_2)+gu2.Outside_1)<3)")))))
Formula 1 simplified : !XG("(((gu2.Outside_3+gu2.Outside_2)+gu2.Outside_1)<3)" | XG"(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)>=1)")
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.143427,21012,1,0,94,16575,122,63,2140,17885,189
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((F("(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)<=((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1))"))U(F(((G(X("(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)>=2)")))&&("(((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1)>=3)"))&&("(((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1)>((gi3.gu5.HasRight_2+gi3.gu5.HasRight_1)+gi3.gu5.HasRight_3))"))))))
Formula 2 simplified : !X(F"(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)<=((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1))" U F("(((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1)>((gi3.gu5.HasRight_2+gi3.gu5.HasRight_1)+gi3.gu5.HasRight_3))" & "(((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1)>=3)" & GX"(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)>=2)"))
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.166235,23196,1,0,104,19033,142,77,2223,20863,236
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((G((G(F("(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)<=((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1))")))&&("(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)>((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1))")))||("(((((((((gu4.Neighbourhood_1_2+gu4.Neighbourhood_2_2)+gu4.Neighbourhood_3_3)+gu4.Neighbourhood_1_1)+gu4.Neighbourhood_2_3)+gu4.Neighbourhood_2_1)+gu4.Neighbourhood_1_3)+gu4.Neighbourhood_3_2)+gu4.Neighbourhood_3_1)<1)")))))
Formula 3 simplified : !XF("(((((((((gu4.Neighbourhood_1_2+gu4.Neighbourhood_2_2)+gu4.Neighbourhood_3_3)+gu4.Neighbourhood_1_1)+gu4.Neighbourhood_2_3)+gu4.Neighbourhood_2_1)+gu4.Neighbourhood_1_3)+gu4.Neighbourhood_3_2)+gu4.Neighbourhood_3_1)<1)" | G("(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)>((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1))" & GF"(((gi3.gu1.WaitRight_1+gi3.gu1.WaitRight_2)+gi3.gu1.WaitRight_3)<=((gi3.gu5.WaitLeft_2+gi3.gu5.WaitLeft_3)+gi3.gu5.WaitLeft_1))"))
Computing Next relation with stutter on 45 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.197602,23936,1,0,114,21599,160,87,2333,25277,278
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X("(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)>=2)"))U(F("((((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)>=3)&&(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)>=2))")))))
Formula 4 simplified : !F(X"(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)>=2)" U F"((((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)>=3)&&(((gi0.gu3.HasLeft_2+gi0.gu3.HasLeft_3)+gi0.gu3.HasLeft_1)>=2))")
Computing Next relation with stutter on 45 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.204589,24200,1,0,120,21781,169,101,2349,26000,320
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X("(gi3.gu1.WaitRight_3>=1)"))))
Formula 5 simplified : !FX"(gi3.gu1.WaitRight_3>=1)"
Computing Next relation with stutter on 45 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.206145,24200,1,0,135,21825,178,114,2350,26116,354
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(!(G("(gi0.gu3.HasLeft_2<=gi0.gu0.Think_1)"))))))
Formula 6 simplified : !XF!G"(gi0.gu3.HasLeft_2<=gi0.gu0.Think_1)"
Computing Next relation with stutter on 45 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.22226,24464,1,0,144,22671,187,123,2354,27416,388
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F("(gi3.gu5.Forks_2<=gi3.gu5.WaitLeft_1)"))&&((G(("(gi3.gu5.WaitLeft_1>gu2.Outside_1)")U("(gi0.gu0.Forks_1<=gi0.gu0.Think_1)")))||(X("(gi3.gu5.HasRight_1<=gi3.gu1.WaitRight_2)")))))
Formula 7 simplified : !(F"(gi3.gu5.Forks_2<=gi3.gu5.WaitLeft_1)" & (G("(gi3.gu5.WaitLeft_1>gu2.Outside_1)" U "(gi0.gu0.Forks_1<=gi0.gu0.Think_1)") | X"(gi3.gu5.HasRight_1<=gi3.gu1.WaitRight_2)"))
Computing Next relation with stutter on 45 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.226021,24988,1,0,144,22671,219,123,2386,27417,400
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!((F("(gi3.gu5.HasRight_2>gi3.gu5.WaitLeft_3)"))U("(gi0.gu0.Think_1<1)")))||((!(X(G("(gu4.Think_2<=gu4.Neighbourhood_1_2)"))))&&(!(G("(gu4.Think_2<=gu4.Neighbourhood_1_2)"))))))
Formula 8 simplified : !(!(F"(gi3.gu5.HasRight_2>gi3.gu5.WaitLeft_3)" U "(gi0.gu0.Think_1<1)") | (!XG"(gu4.Think_2<=gu4.Neighbourhood_1_2)" & !G"(gu4.Think_2<=gu4.Neighbourhood_1_2)"))
Computing Next relation with stutter on 45 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.24079,24988,1,0,168,24752,239,142,2397,31175,451
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 09:51:02] [INFO ] Built C files in 551ms 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 1589795465016
--------------------
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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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-158961390000233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 '
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 ;