fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699300617
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for CSRepetitions-COL-03

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15728.080 178613.00 194778.00 1305.50 FTFFFFFTFFTFFTFT 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-158897699300617.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-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 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 3.9K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 14K 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-03-00
FORMULA_NAME CSRepetitions-COL-03-01
FORMULA_NAME CSRepetitions-COL-03-02
FORMULA_NAME CSRepetitions-COL-03-03
FORMULA_NAME CSRepetitions-COL-03-04
FORMULA_NAME CSRepetitions-COL-03-05
FORMULA_NAME CSRepetitions-COL-03-06
FORMULA_NAME CSRepetitions-COL-03-07
FORMULA_NAME CSRepetitions-COL-03-08
FORMULA_NAME CSRepetitions-COL-03-09
FORMULA_NAME CSRepetitions-COL-03-10
FORMULA_NAME CSRepetitions-COL-03-11
FORMULA_NAME CSRepetitions-COL-03-12
FORMULA_NAME CSRepetitions-COL-03-13
FORMULA_NAME CSRepetitions-COL-03-14
FORMULA_NAME CSRepetitions-COL-03-15

=== Now, execution of the tool begins

BK_START 1589259797365

[2020-05-12 05:03:18] [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:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 05:03:18] [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:03:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1186 ms
[2020-05-12 05:03:20] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-05-12 05:03:20] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 9 ms.
[2020-05-12 05:03:20] [INFO ] Computed order based on color domains.
[2020-05-12 05:03:20] [INFO ] Unfolded HLPN to a Petri net with 58 places and 81 transitions in 13 ms.
[2020-05-12 05:03:20] [INFO ] Unfolded HLPN properties in 0 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 3312 resets, run finished after 169 ms. (steps per millisecond=591 ) properties seen :[1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 81 rows 58 cols
[2020-05-12 05:03:20] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-12 05:03:20] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned unsat
[2020-05-12 05:03:20] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned unsat
[2020-05-12 05:03:20] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-12 05:03:20] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-12 05:03:20] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
[2020-05-12 05:03:20] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-12 05:03:20] [INFO ] Flatten gal took : 23 ms
FORMULA CSRepetitions-COL-03-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 05:03:20] [INFO ] Flatten gal took : 10 ms
[2020-05-12 05:03:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CSRepetitions-COL-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-12 05:03:20] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-12 05:03:20] [INFO ] Flatten gal took : 7 ms
[2020-05-12 05:03:20] [INFO ] Input system was already deterministic with 81 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 81 rows 58 cols
[2020-05-12 05:03:20] [INFO ] Computed 12 place invariants in 1 ms
inv : clientSending_4 + clientWaiting_4 = 1
inv : serverWaiting_1 + serverAnwering_1 + serverAnwering_4 + serverAnwering_7 + serverAnwering_10 + serverAnwering_13 + serverAnwering_16 + serverAnwering_19 + serverAnwering_22 + serverAnwering_25 = 1
inv : clientSending_6 + clientWaiting_6 = 1
inv : clientSending_2 + clientWaiting_2 = 1
inv : serverWaiting_2 + serverAnwering_2 + serverAnwering_5 + serverAnwering_8 + serverAnwering_11 + serverAnwering_14 + serverAnwering_17 + serverAnwering_20 + serverAnwering_23 + serverAnwering_26 = 1
inv : serverWaiting_0 + serverAnwering_0 + serverAnwering_3 + serverAnwering_6 + serverAnwering_9 + serverAnwering_12 + serverAnwering_15 + serverAnwering_18 + serverAnwering_21 + serverAnwering_24 = 1
inv : clientSending_8 + clientWaiting_8 = 1
inv : clientSending_0 + clientWaiting_0 = 1
inv : clientSending_5 + clientWaiting_5 = 1
inv : clientSending_3 + clientWaiting_3 = 1
inv : clientSending_7 + clientWaiting_7 = 1
inv : clientSending_1 + clientWaiting_1 = 1
Total of 12 invariants.
[2020-05-12 05:03:20] [INFO ] Computed 12 place invariants in 2 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/graph1516937423204839434.txt, -o, /tmp/graph1516937423204839434.bin, -w, /tmp/graph1516937423204839434.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/graph1516937423204839434.bin, -l, -1, -v, -w, /tmp/graph1516937423204839434.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 05:03:20] [INFO ] Decomposing Gal with order
[2020-05-12 05:03:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 05:03:20] [INFO ] Proved 58 variables to be positive in 85 ms
[2020-05-12 05:03:20] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2020-05-12 05:03:20] [INFO ] Computation of disable matrix completed :0/81 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:03:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:03:20] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2020-05-12 05:03:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 05:03:20] [INFO ] Removed a total of 102 redundant transitions.
[2020-05-12 05:03:20] [INFO ] Flatten gal took : 52 ms
[2020-05-12 05:03:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-12 05:03:20] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-12 05:03:20] [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 8 LTL properties
Checking formula 0 : !(((X(!(G(F("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8))")))))&&(G(!(G(F("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26))")))))))
Formula 0 simplified : !(X!GF"(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8))" & G!GF"(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26))")
[2020-05-12 05:03:23] [INFO ] Computing symmetric co enabling matrix : 81 transitions.
[2020-05-12 05:03:23] [INFO ] Computation of co-enabling matrix(22/81) took 385 ms. Total solver calls (SAT/UNSAT): 301(166/135)
[2020-05-12 05:03:24] [INFO ] Computation of Finished co-enabling matrix. took 1310 ms. Total solver calls (SAT/UNSAT): 639(252/387)
[2020-05-12 05:03:24] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
Reverse transition relation is NOT exact ! Due to transitions gi1.gu2.loseRequestc0, gi1.gu2.loseRequestc1, gi1.gu2.loseRequestc2, gi1.gu2.loseRequestc3, gi1.gu2.loseRequestc4, gi1.gu2.loseRequestc5, gi1.gu2.loseRequestc6, gi1.gu2.loseRequestc7, gi1.gu2.loseRequestc8, gi1.prepareRequestc8, gi1.prepareRequestc7, gi1.prepareRequestc6, gi1.prepareRequestc5, gi1.prepareRequestc4, gi1.prepareRequestc3, gi1.prepareRequestc2, gi1.prepareRequestc1, gi1.prepareRequestc0, sendAnswers0c0, sendAnswers0c1, sendAnswers0c2, sendAnswers0c3, sendAnswers0c4, sendAnswers0c5, sendAnswers0c6, sendAnswers0c7, sendAnswers0c8, sendAnswers1c0, sendAnswers1c1, sendAnswers1c2, sendAnswers1c3, sendAnswers1c4, sendAnswers1c5, sendAnswers1c6, sendAnswers1c7, sendAnswers1c8, sendAnswers2c0, sendAnswers2c1, sendAnswers2c2, sendAnswers2c3, sendAnswers2c4, sendAnswers2c5, sendAnswers2c6, sendAnswers2c7, sendAnswers2c8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/36/45/81
Computing Next relation with stutter on 1 deadlock states
[2020-05-12 05:03:26] [INFO ] Computation of Completed DNA matrix. took 2122 ms. Total solver calls (SAT/UNSAT): 468(0/468)
[2020-05-12 05:03:26] [INFO ] Built C files in 6243ms 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]
Compilation finished in 1189 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(!( [](<>((LTLAP0==true)))) ) ) && ( [](!( [](<>((LTLAP1==true)))) ) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(!( [](<>((LTLAP0==true)))) ) ) && ( [](!( [](<>((LTLAP1==true)))) ) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(!( [](<>((LTLAP0==true)))) ) ) && ( [](!( [](<>((LTLAP1==true)))) ) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10733 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,107.358,2229868,1,0,344,9.10531e+06,21,214,1222,1.57308e+07,126
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((X(((X(G("(((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8)<=((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8))")))||("(gi1.gu2.requestBufferSlots_0>=2)"))&&("(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=2)")))||(G("(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=2)"))))))
Formula 1 simplified : !GF(X("(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=2)" & ("(gi1.gu2.requestBufferSlots_0>=2)" | XG"(((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8)<=((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8))")) | G"(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=2)")
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
141 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,108.768,2230560,1,0,344,9.10531e+06,39,214,1551,1.57308e+07,176
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(((X((G("(gi1.gu2.requestBufferSlots_0<=((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8))"))&&("(((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26)<=((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8))")))U("(gi1.gu2.requestBufferSlots_0<=((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8))"))&&(!(G("(((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26)>=1)")))))))
Formula 2 simplified : X((X("(((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26)<=((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8))" & G"(gi1.gu2.requestBufferSlots_0<=((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8))") U "(gi1.gu2.requestBufferSlots_0<=((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8))") & !G"(((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26)>=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
38 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,109.152,2230748,1,0,344,9.10531e+06,57,214,1650,1.57308e+07,194
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(X(G(!(F((G("(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=3)"))&&("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26))")))))))))
Formula 3 simplified : !X!XG!F("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26))" & G"(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=3)")
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
1462 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,123.774,2230880,1,0,344,9.10531e+06,72,214,2096,1.57308e+07,374
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(X("(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=2)")))))
Formula 4 simplified : !GXX"(((gu1.serverWaiting_0+gu1.serverWaiting_1)+gu1.serverWaiting_2)>=2)"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
536 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,129.13,2230880,1,0,344,9.10531e+06,75,214,2096,1.57308e+07,497
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((G("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)>=2)"))&&("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)>gi1.gu2.requestBufferSlots_0)"))))
Formula 5 simplified : !X("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)>gi1.gu2.requestBufferSlots_0)" & G"(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)>=2)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
656 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,135.684,2230880,1,0,344,9.10531e+06,90,252,2229,1.57308e+07,660
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F("(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26))"))))
Formula 6 simplified : !XF"(((((((((gi1.gu2.clientWaiting_0+gi1.gu2.clientWaiting_1)+gi1.gu2.clientWaiting_2)+gi1.gu2.clientWaiting_3)+gi1.gu2.clientWaiting_4)+gi1.gu2.clientWaiting_5)+gi1.gu2.clientWaiting_6)+gi1.gu2.clientWaiting_7)+gi1.gu2.clientWaiting_8)<=((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26))"
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
2117 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,156.854,2230880,1,0,344,9.10531e+06,97,308,2885,1.57308e+07,817
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X((!(X((G("(((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8)<=gi1.gu2.requestBufferSlots_0)"))&&(G("(((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26)>=1)")))))&&(G("(((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8)>gi1.gu2.requestBufferSlots_0)"))))))
Formula 7 simplified : !GX(!X(G"(((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8)<=gi1.gu2.requestBufferSlots_0)" & G"(((((((((((((((((((((((((((gu3.serverAnwering_0+gu3.serverAnwering_1)+gu3.serverAnwering_2)+gu3.serverAnwering_3)+gu3.serverAnwering_4)+gu3.serverAnwering_5)+gu3.serverAnwering_6)+gu3.serverAnwering_7)+gu3.serverAnwering_8)+gu3.serverAnwering_9)+gu3.serverAnwering_10)+gu3.serverAnwering_11)+gu3.serverAnwering_12)+gu3.serverAnwering_13)+gu3.serverAnwering_14)+gu3.serverAnwering_15)+gu3.serverAnwering_16)+gu3.serverAnwering_17)+gu3.serverAnwering_18)+gu3.serverAnwering_19)+gu3.serverAnwering_20)+gu3.serverAnwering_21)+gu3.serverAnwering_22)+gu3.serverAnwering_23)+gu3.serverAnwering_24)+gu3.serverAnwering_25)+gu3.serverAnwering_26)>=1)") & G"(((((((((gi1.gu0.clientSending_0+gi1.gu0.clientSending_1)+gi1.gu0.clientSending_2)+gi1.gu0.clientSending_3)+gi1.gu0.clientSending_4)+gi1.gu0.clientSending_5)+gi1.gu0.clientSending_6)+gi1.gu0.clientSending_7)+gi1.gu0.clientSending_8)>gi1.gu2.requestBufferSlots_0)")
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
119 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,158.044,2253084,1,0,344,9.10531e+06,101,311,3132,1.57308e+07,829
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589259975978

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

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;