About the Execution of ITS-Tools for CSRepetitions-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15727.860 | 3403.00 | 9031.00 | 47.30 | FFTFFFFTTFTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r021-oct2-158897699300609.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300609
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 13K 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 CSRepetitions-COL-02-00
FORMULA_NAME CSRepetitions-COL-02-01
FORMULA_NAME CSRepetitions-COL-02-02
FORMULA_NAME CSRepetitions-COL-02-03
FORMULA_NAME CSRepetitions-COL-02-04
FORMULA_NAME CSRepetitions-COL-02-05
FORMULA_NAME CSRepetitions-COL-02-06
FORMULA_NAME CSRepetitions-COL-02-07
FORMULA_NAME CSRepetitions-COL-02-08
FORMULA_NAME CSRepetitions-COL-02-09
FORMULA_NAME CSRepetitions-COL-02-10
FORMULA_NAME CSRepetitions-COL-02-11
FORMULA_NAME CSRepetitions-COL-02-12
FORMULA_NAME CSRepetitions-COL-02-13
FORMULA_NAME CSRepetitions-COL-02-14
FORMULA_NAME CSRepetitions-COL-02-15
=== Now, execution of the tool begins
BK_START 1589259647269
[2020-05-12 05:00:48] [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-12 05:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 05:00:48] [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-12 05:00:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 425 ms
[2020-05-12 05:00:49] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,
[2020-05-12 05:00:49] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 10 ms.
[2020-05-12 05:00:49] [INFO ] Computed order based on color domains.
[2020-05-12 05:00:49] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 12 ms.
[2020-05-12 05:00:49] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5618 resets, run finished after 160 ms. (steps per millisecond=625 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 28 rows 23 cols
[2020-05-12 05:00:49] [INFO ] Computed 6 place invariants in 3 ms
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-05-12 05:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-05-12 05:00:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-05-12 05:00:49] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 05:00:49] [INFO ] Flatten gal took : 17 ms
FORMULA CSRepetitions-COL-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 05:00:49] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 05:00:49] [INFO ] Applying decomposition
[2020-05-12 05:00:49] [INFO ] Flatten gal took : 4 ms
[2020-05-12 05:00:49] [INFO ] Input system was already deterministic with 28 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/graph4876628567149455496.txt, -o, /tmp/graph4876628567149455496.bin, -w, /tmp/graph4876628567149455496.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
[2020-05-12 05:00:49] [INFO ] Computed 6 place invariants in 1 ms
inv : serverWaiting_1 + serverAnwering_1 + serverAnwering_3 + serverAnwering_5 + serverAnwering_7 = 1
inv : clientSending_3 + clientWaiting_3 = 1
inv : serverWaiting_0 + serverAnwering_0 + serverAnwering_2 + serverAnwering_4 + serverAnwering_6 = 1
inv : clientSending_0 + clientWaiting_0 = 1
inv : clientSending_2 + clientWaiting_2 = 1
inv : clientSending_1 + clientWaiting_1 = 1
Total of 6 invariants.
[2020-05-12 05:00:49] [INFO ] Computed 6 place invariants in 1 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4876628567149455496.bin, -l, -1, -v, -w, /tmp/graph4876628567149455496.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 05:00:49] [INFO ] Decomposing Gal with order
[2020-05-12 05:00:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 05:00:49] [INFO ] Proved 23 variables to be positive in 38 ms
[2020-05-12 05:00:49] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2020-05-12 05:00:49] [INFO ] Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:00:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:00:49] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2020-05-12 05:00:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:00:49] [INFO ] Removed a total of 17 redundant transitions.
[2020-05-12 05:00:49] [INFO ] Flatten gal took : 31 ms
[2020-05-12 05:00:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2020-05-12 05:00:49] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-12 05:00:49] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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(F(X(!(F("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))")))))))
Formula 0 simplified : !GFX!F"((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))"
Reverse transition relation is NOT exact ! Due to transitions gu0.loseRequestc0, gu0.loseRequestc1, gu0.loseRequestc2, gu0.loseRequestc3, prepareRequestc0, prepareRequestc1, prepareRequestc2, prepareRequestc3, sendAnswers0c0, sendAnswers0c1, sendAnswers0c2, sendAnswers0c3, sendAnswers1c0, sendAnswers1c1, sendAnswers1c2, sendAnswers1c3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/16/25
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.145602,22184,1,0,94,28748,84,51,923,41233,113
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)>=3)")U(X("(gu1.requestBufferSlots_0<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))")))))
Formula 1 simplified : !G("((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)>=3)" U X"(gu1.requestBufferSlots_0<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.168552,23492,1,0,98,32747,92,53,983,47859,127
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(!(G((("(gu1.requestBufferSlots_0>=2)")U("((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))"))||((("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(gu1.serverWaiting_0+gu1.serverWaiting_1))")U("(gu1.requestBufferSlots_0>=2)"))U(F("((gu1.serverWaiting_0+gu1.serverWaiting_1)<1)")))))))))
Formula 2 simplified : !GF!G(("(gu1.requestBufferSlots_0>=2)" U "((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))") | (("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(gu1.serverWaiting_0+gu1.serverWaiting_1))" U "(gu1.requestBufferSlots_0>=2)") U F"((gu1.serverWaiting_0+gu1.serverWaiting_1)<1)"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 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.183011,25736,1,0,108,34605,114,60,1060,50204,156
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G((!(G("(gu1.requestBufferSlots_0>=1)")))||("((gu1.requestBufferSlots_0<1)&&((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>(((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)))"))))))
Formula 3 simplified : !XFG("((gu1.requestBufferSlots_0<1)&&((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>(((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)))" | !G"(gu1.requestBufferSlots_0>=1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.205685,25996,1,0,118,36791,133,66,1094,53966,205
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((!(X(!(G("(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))")))))&&(!(G(!(F("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)>=1)"))))))&&(!(G("(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))")))))
Formula 4 simplified : !(!G"(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))" & !X!G"(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))" & !G!F"((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)>=1)")
Computing Next relation with stutter on 1 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.210923,26484,1,0,119,37391,144,67,1123,55217,216
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F((("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)<=gu1.requestBufferSlots_0)")&&((G("((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)>=2)"))||("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))")))U("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)<=gu1.requestBufferSlots_0)")))U(!(F("((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)>=2)")))))
Formula 5 simplified : !(F(("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)<=gu1.requestBufferSlots_0)" & ("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))" | G"((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)>=2)")) U "((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)<=gu1.requestBufferSlots_0)") U !F"((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)>=2)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
11 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.325078,31480,1,0,165,60975,155,111,1194,94929,341
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((G("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(gu1.serverWaiting_0+gu1.serverWaiting_1))"))&&("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>(gu1.serverWaiting_0+gu1.serverWaiting_1))"))U(X((X(G("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(gu1.serverWaiting_0+gu1.serverWaiting_1))")))||("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)<2)")))))
Formula 6 simplified : !(("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>(gu1.serverWaiting_0+gu1.serverWaiting_1))" & G"((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(gu1.serverWaiting_0+gu1.serverWaiting_1))") U X("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)<2)" | XG"((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(gu1.serverWaiting_0+gu1.serverWaiting_1))"))
Computing Next relation with stutter on 1 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.325987,31480,1,0,165,60975,158,111,1203,94929,343
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(((F("(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))"))U(X("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=gu1.requestBufferSlots_0)")))&&("(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))")))))
Formula 7 simplified : F("(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))" & (F"(gu1.requestBufferSlots_0<=(((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3))" U X"((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=gu1.requestBufferSlots_0)"))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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.48215,37532,1,0,206,86740,169,152,1249,138656,455
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F("(((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))&&(gu1.requestBufferSlots_0<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)))"))))
Formula 8 simplified : !XF"(((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))&&(gu1.requestBufferSlots_0<=(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 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.584072,40944,1,0,241,102396,178,189,1255,164248,557
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X((!(X(X(X("((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)>=2)")))))||(!(X("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))")))))))
Formula 9 simplified : !FX(!XXX"((((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7)>=2)" | !X"((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>(((((((gu2.serverAnwering_0+gu2.serverAnwering_1)+gu2.serverAnwering_2)+gu2.serverAnwering_3)+gu2.serverAnwering_4)+gu2.serverAnwering_5)+gu2.serverAnwering_6)+gu2.serverAnwering_7))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 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.58663,41208,1,0,243,102630,187,191,1264,164561,571
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X(G(("(gu1.requestBufferSlots_0<=(gu1.serverWaiting_0+gu1.serverWaiting_1))")U(F(!(X((X("(((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)<1)&&((gu1.serverWaiting_0+gu1.serverWaiting_1)>gu1.requestBufferSlots_0))"))||("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>=3)"))))))))))
Formula 10 simplified : XG("(gu1.requestBufferSlots_0<=(gu1.serverWaiting_0+gu1.serverWaiting_1))" U F!X("((((gu1.clientWaiting_0+gu1.clientWaiting_1)+gu1.clientWaiting_2)+gu1.clientWaiting_3)>=3)" | X"(((((gu0.clientSending_0+gu0.clientSending_1)+gu0.clientSending_2)+gu0.clientSending_3)<1)&&((gu1.serverWaiting_0+gu1.serverWaiting_1)>gu1.requestBufferSlots_0))"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
1 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.595599,41468,1,0,243,103336,198,193,1301,166020,583
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-12 05:00:50] [INFO ] Built C files in 833ms 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 1589259650672
--------------------
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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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 r021-oct2-158897699300609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;