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-158897699300610.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300610
=====================================================================

--------------------
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 1589259665787

[2020-05-12 05:01:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 05:01:08] [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:01:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2020-05-12 05:01:09] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-05-12 05:01:09] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 11 ms.
[2020-05-12 05:01:09] [INFO ] Computed order based on color domains.
[2020-05-12 05:01:09] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 7 ms.
[2020-05-12 05:01:09] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 98 steps, including 6 resets, run visited all 34 properties in 5 ms. (steps per millisecond=19 )
[2020-05-12 05:01:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-12 05:01:09] [INFO ] Flatten gal took : 25 ms
FORMULA CSRepetitions-COL-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 05:01:09] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 05:01:09] [INFO ] Applying decomposition
[2020-05-12 05:01:09] [INFO ] Flatten gal took : 5 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/graph11893530708652852111.txt, -o, /tmp/graph11893530708652852111.bin, -w, /tmp/graph11893530708652852111.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/graph11893530708652852111.bin, -l, -1, -v, -w, /tmp/graph11893530708652852111.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 05:01:09] [INFO ] Input system was already deterministic with 28 transitions.
[2020-05-12 05:01:09] [INFO ] Decomposing Gal with order
[2020-05-12 05:01:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 05:01:10] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-12 05:01:10] [INFO ] Flatten gal took : 100 ms
[2020-05-12 05:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-12 05:01:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-12 05:01:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.

// Phase 1: matrix 28 rows 23 cols
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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((F((F(((F("(((((((((u6.clientSending_1<1)||(u4.serverAnwering_2<1))&&((u1.clientSending_0<1)||(u5.serverAnwering_1<1)))&&((u1.clientSending_0<1)||(u4.serverAnwering_0<1)))&&((u3.clientSending_3<1)||(u4.serverAnwering_6<1)))&&((u3.clientSending_3<1)||(u5.serverAnwering_7<1)))&&((u6.clientSending_1<1)||(u5.serverAnwering_3<1)))&&((u2.clientSending_2<1)||(u5.serverAnwering_5<1)))&&((u2.clientSending_2<1)||(u4.serverAnwering_4<1)))"))&&("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))&&("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")))||(X(G(("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")U("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))")))))))
Formula 0 simplified : !F(F("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))" & "((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))" & F"(((((((((u6.clientSending_1<1)||(u4.serverAnwering_2<1))&&((u1.clientSending_0<1)||(u5.serverAnwering_1<1)))&&((u1.clientSending_0<1)||(u4.serverAnwering_0<1)))&&((u3.clientSending_3<1)||(u4.serverAnwering_6<1)))&&((u3.clientSending_3<1)||(u5.serverAnwering_7<1)))&&((u6.clientSending_1<1)||(u5.serverAnwering_3<1)))&&((u2.clientSending_2<1)||(u5.serverAnwering_5<1)))&&((u2.clientSending_2<1)||(u4.serverAnwering_4<1)))") | XG("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))" U "(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))"))
built 14 ordering constraints for composite.
[2020-05-12 05:01:10] [INFO ] Computed 6 place invariants in 9 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:01:10] [INFO ] Computed 6 place invariants in 10 ms
Reverse transition relation is NOT exact ! Due to transitions sendAnswers0c0, sendAnswers0c1, sendAnswers0c2, sendAnswers0c3, sendAnswers1c0, sendAnswers1c1, sendAnswers1c2, sendAnswers1c3, u0.loseRequestc0, u0.loseRequestc1, u0.loseRequestc2, u0.loseRequestc3, u1.prepareRequestc0, u2.prepareRequestc2, u3.prepareRequestc3, u6.prepareRequestc1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
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
21 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.236395,30528,1,0,25783,5595,505,36823,192,34592,38857
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((X(("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")U(X("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))))&&(F("((((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))&&((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1)))&&(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1))))")))))
Formula 1 simplified : !G(X("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))" U X"((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))") & F"((((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))&&((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1)))&&(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1))))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
5 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.28232,32640,1,0,29295,6202,560,44231,193,40240,46709
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 : !(((X("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))"))U((G((((((G("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))"))&&("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))"))||("((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))"))||("((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1))"))||("((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1))"))||("((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1))")))&&(("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")U(X("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))"))))))
Formula 2 simplified : !(X"(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))" U (G("((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1))" | "((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1))" | "((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))" | "((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1))" | ("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))" & G"(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")) & ("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))" U X"(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.380269,37560,1,0,37854,7292,611,58697,193,50985,62464
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X(!(G("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))")))))&&(("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))")U("((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))"))))
Formula 3 simplified : !(!X!G"(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))" & ("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))" U "((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))"))
Computing Next relation with stutter on 1 deadlock states
[2020-05-12 05:01:10] [INFO ] Proved 23 variables to be positive in 382 ms
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.390916,38088,1,0,38524,7450,633,60083,193,51964,64422
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(((((G("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))"))||("(u1.clientWaiting_0>=1)"))||("(u6.clientWaiting_1>=1)"))||("(u2.clientWaiting_2>=1)"))||("(u3.clientWaiting_3>=1)"))))
Formula 4 simplified : !G("(u1.clientWaiting_0>=1)" | "(u2.clientWaiting_2>=1)" | "(u3.clientWaiting_3>=1)" | "(u6.clientWaiting_1>=1)" | G"(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")
Computing Next relation with stutter on 1 deadlock states
[2020-05-12 05:01:10] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2020-05-12 05:01:10] [INFO ] Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:01:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:01:10] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2020-05-12 05:01:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.484906,43632,1,0,48469,8780,683,79240,193,67063,79978
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(G(X(!(G((X("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))||("((((u0.requestBuffer_0<1)&&(u0.requestBuffer_1<1))&&(u0.requestBuffer_2<1))&&(u0.requestBuffer_3<1))")))))))||(F("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))"))))
Formula 5 simplified : !(!GX!G("((((u0.requestBuffer_0<1)&&(u0.requestBuffer_1<1))&&(u0.requestBuffer_2<1))&&(u0.requestBuffer_3<1))" | X"((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))") | F"(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
6 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.488053,43632,1,0,48629,8780,715,79596,196,67067,80645
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(G(X(X(G(F((F(!(F("((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))"))))&&(X("((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))")))))))))))
Formula 6 simplified : !GXGXXGF(F!F"((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))" & X"((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))")
Computing Next relation with stutter on 1 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.488914,43632,1,0,48629,8780,715,79596,196,67067,80645
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(F("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")))||(!(X(!(X(X("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))"))))))))
Formula 7 simplified : !(!F"(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))" | !X!XX"(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")
Computing Next relation with stutter on 1 deadlock states
12 unique states visited
11 strongly connected components in search stack
13 transitions explored
11 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.516777,44952,1,0,51432,8826,722,84164,196,69059,89230
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((!(F(X("(((((((((u6.clientSending_1<1)||(u4.serverAnwering_2<1))&&((u1.clientSending_0<1)||(u5.serverAnwering_1<1)))&&((u1.clientSending_0<1)||(u4.serverAnwering_0<1)))&&((u3.clientSending_3<1)||(u4.serverAnwering_6<1)))&&((u3.clientSending_3<1)||(u5.serverAnwering_7<1)))&&((u6.clientSending_1<1)||(u5.serverAnwering_3<1)))&&((u2.clientSending_2<1)||(u5.serverAnwering_5<1)))&&((u2.clientSending_2<1)||(u4.serverAnwering_4<1)))"))))&&(G("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")))&&(("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")U("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))")))))
Formula 8 simplified : !X(!FX"(((((((((u6.clientSending_1<1)||(u4.serverAnwering_2<1))&&((u1.clientSending_0<1)||(u5.serverAnwering_1<1)))&&((u1.clientSending_0<1)||(u4.serverAnwering_0<1)))&&((u3.clientSending_3<1)||(u4.serverAnwering_6<1)))&&((u3.clientSending_3<1)||(u5.serverAnwering_7<1)))&&((u6.clientSending_1<1)||(u5.serverAnwering_3<1)))&&((u2.clientSending_2<1)||(u5.serverAnwering_5<1)))&&((u2.clientSending_2<1)||(u4.serverAnwering_4<1)))" & G"(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))" & ("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))" U "((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))
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
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.520404,45480,1,0,51432,8826,740,84164,196,69059,89238
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X((((((!(G("(((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))&&((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1)))")))||(G("((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))")))||("(u1.clientWaiting_0>=1)"))||("(u6.clientWaiting_1>=1)"))||("(u2.clientWaiting_2>=1)"))||("(u3.clientWaiting_3>=1)")))))
Formula 9 simplified : !XX("(u1.clientWaiting_0>=1)" | "(u2.clientWaiting_2>=1)" | "(u3.clientWaiting_3>=1)" | "(u6.clientWaiting_1>=1)" | !G"(((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))&&((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1)))" | G"((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.52192,45480,1,0,51432,8826,763,84164,196,69059,89255
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(((((((X((G("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))"))U(F("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))))||(F("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))")))||(G("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")))||("(u1.clientWaiting_0>=1)"))||("(u6.clientWaiting_1>=1)"))||("(u2.clientWaiting_2>=1)"))||("(u3.clientWaiting_3>=1)"))))
Formula 10 simplified : !G("(u1.clientWaiting_0>=1)" | "(u2.clientWaiting_2>=1)" | "(u3.clientWaiting_3>=1)" | "(u6.clientWaiting_1>=1)" | F"((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))" | X(G"(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))" U F"((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))") | G"(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=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
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.528811,45480,1,0,51812,8829,811,84448,196,69104,90222
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(X("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")))U(X("(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))"))))
Formula 11 simplified : !(FX"(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))" U X"(((((((((u0.requestBuffer_0>=1)&&(u5.serverWaiting_1>=1))||((u0.requestBuffer_3>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_0>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_1>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_3>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u4.serverWaiting_0>=1)))||((u0.requestBuffer_2>=1)&&(u5.serverWaiting_1>=1)))||((u0.requestBuffer_1>=1)&&(u5.serverWaiting_1>=1)))")
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.559418,45744,1,0,53072,8910,815,86381,196,70120,94425
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(X((((((((((!(X("(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))")))&&("((u0.requestBuffer_0<1)||(u5.serverWaiting_1<1))"))&&("((u0.requestBuffer_3<1)||(u5.serverWaiting_1<1))"))&&("((u0.requestBuffer_0<1)||(u4.serverWaiting_0<1))"))&&("((u0.requestBuffer_1<1)||(u4.serverWaiting_0<1))"))&&("((u0.requestBuffer_3<1)||(u4.serverWaiting_0<1))"))&&("((u0.requestBuffer_2<1)||(u4.serverWaiting_0<1))"))&&("((u0.requestBuffer_2<1)||(u5.serverWaiting_1<1))"))&&("((u0.requestBuffer_1<1)||(u5.serverWaiting_1<1))"))||("((((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))&&(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1))))&&(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1))))"))))))
Formula 12 simplified : !XGX("((((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))&&(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1))))&&(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1))))" | ("((u0.requestBuffer_0<1)||(u4.serverWaiting_0<1))" & "((u0.requestBuffer_0<1)||(u5.serverWaiting_1<1))" & "((u0.requestBuffer_1<1)||(u4.serverWaiting_0<1))" & "((u0.requestBuffer_1<1)||(u5.serverWaiting_1<1))" & "((u0.requestBuffer_2<1)||(u4.serverWaiting_0<1))" & "((u0.requestBuffer_2<1)||(u5.serverWaiting_1<1))" & "((u0.requestBuffer_3<1)||(u4.serverWaiting_0<1))" & "((u0.requestBuffer_3<1)||(u5.serverWaiting_1<1))" & !X"(((((((((u6.clientSending_1>=1)&&(u4.serverAnwering_2>=1))||((u1.clientSending_0>=1)&&(u5.serverAnwering_1>=1)))||((u1.clientSending_0>=1)&&(u4.serverAnwering_0>=1)))||((u3.clientSending_3>=1)&&(u4.serverAnwering_6>=1)))||((u3.clientSending_3>=1)&&(u5.serverAnwering_7>=1)))||((u6.clientSending_1>=1)&&(u5.serverAnwering_3>=1)))||((u2.clientSending_2>=1)&&(u5.serverAnwering_5>=1)))||((u2.clientSending_2>=1)&&(u4.serverAnwering_4>=1)))"))
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.605458,46616,1,0,54798,9085,933,89308,197,71492,99480
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G((F(G(!(("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))")U(F("((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))"))))))&&((!(X("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))")))||(F("((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))))))
Formula 13 simplified : !G(FG!("(((((u0.requestBufferSlots_0>=1)&&(u3.clientSending_3>=1))||((u0.requestBufferSlots_0>=1)&&(u1.clientSending_0>=1)))||((u0.requestBufferSlots_0>=1)&&(u2.clientSending_2>=1)))||((u0.requestBufferSlots_0>=1)&&(u6.clientSending_1>=1)))" U F"((((u1.clientWaiting_0>=1)||(u6.clientWaiting_1>=1))||(u2.clientWaiting_2>=1))||(u3.clientWaiting_3>=1))") & (!X"((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))" | F"((((u0.requestBuffer_0>=1)||(u0.requestBuffer_1>=1))||(u0.requestBuffer_2>=1))||(u0.requestBuffer_3>=1))"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.732611,51896,1,0,63625,10351,947,107748,197,86821,111548
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-12 05:01:11] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 6) 1) (>= (select s0 10) 1)) (= (store (store (store (store s0 6 (- (select s0 6) 1)) 0 (+ (select s0 0) 1)) 10 (- (select s0 10) 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-12 05:01:11] [INFO ] Built C files in 1116ms 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 1589259671386

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-158897699300610"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;