fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.760 321589.00 356484.00 364.80 FTFFFFFTFFFTFFFT 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-158897699300665.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-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699300665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 71K 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-PT-03-00
FORMULA_NAME CSRepetitions-PT-03-01
FORMULA_NAME CSRepetitions-PT-03-02
FORMULA_NAME CSRepetitions-PT-03-03
FORMULA_NAME CSRepetitions-PT-03-04
FORMULA_NAME CSRepetitions-PT-03-05
FORMULA_NAME CSRepetitions-PT-03-06
FORMULA_NAME CSRepetitions-PT-03-07
FORMULA_NAME CSRepetitions-PT-03-08
FORMULA_NAME CSRepetitions-PT-03-09
FORMULA_NAME CSRepetitions-PT-03-10
FORMULA_NAME CSRepetitions-PT-03-11
FORMULA_NAME CSRepetitions-PT-03-12
FORMULA_NAME CSRepetitions-PT-03-13
FORMULA_NAME CSRepetitions-PT-03-14
FORMULA_NAME CSRepetitions-PT-03-15

=== Now, execution of the tool begins

BK_START 1589263472586

[2020-05-12 06:04:35] [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 06:04:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 06:04:35] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-12 06:04:35] [INFO ] Transformed 58 places.
[2020-05-12 06:04:35] [INFO ] Transformed 81 transitions.
[2020-05-12 06:04:35] [INFO ] Parsed PT model containing 58 places and 81 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3279 resets, run finished after 290 ms. (steps per millisecond=344 ) properties seen :[1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0]
// Phase 1: matrix 81 rows 58 cols
[2020-05-12 06:04:35] [INFO ] Computed 12 place invariants in 3 ms
[2020-05-12 06:04:35] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned unsat
[2020-05-12 06:04:35] [INFO ] [Real]Absence check using 12 positive place invariants in 34 ms returned unsat
[2020-05-12 06:04:35] [INFO ] [Real]Absence check using 12 positive place invariants in 31 ms returned unsat
[2020-05-12 06:04:35] [INFO ] [Real]Absence check using 12 positive place invariants in 30 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 32 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 48 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-12 06:04:36] [INFO ] [Real]Absence check using 12 positive place invariants in 28 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
[2020-05-12 06:04:36] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-12 06:04:36] [INFO ] Flatten gal took : 31 ms
FORMULA CSRepetitions-PT-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 06:04:36] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
[2020-05-12 06:04:36] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-12 06:04:36] [INFO ] Flatten gal took : 22 ms
[2020-05-12 06:04:36] [INFO ] Input system was already deterministic with 81 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph8473174381590827581.txt, -o, /tmp/graph8473174381590827581.bin, -w, /tmp/graph8473174381590827581.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/graph8473174381590827581.bin, -l, -1, -v, -w, /tmp/graph8473174381590827581.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 06:04:36] [INFO ] Decomposing Gal with order
[2020-05-12 06:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 81 rows 58 cols
[2020-05-12 06:04:36] [INFO ] Computed 12 place invariants in 1 ms
inv : Client_Waiting_4 + Client_Sending_4 = 1
inv : Server_Anwering_1_2 + Server_Anwering_9_2 + Server_Anwering_2_2 + Server_Anwering_3_2 + Server_Anwering_8_2 + Server_Anwering_7_2 + Server_Anwering_6_2 + Server_Anwering_5_2 + Server_Anwering_4_2 + Server_Waiting_2 = 1
inv : Client_Waiting_5 + Client_Sending_5 = 1
inv : Client_Sending_9 + Client_Waiting_9 = 1
inv : Server_Anwering_1_1 + Server_Anwering_4_1 + Server_Anwering_3_1 + Server_Anwering_6_1 + Server_Anwering_5_1 + Server_Waiting_1 + Server_Anwering_7_1 + Server_Anwering_8_1 + Server_Anwering_2_1 + Server_Anwering_9_1 = 1
inv : Client_Sending_7 + Client_Waiting_7 = 1
inv : Server_Anwering_1_3 + Server_Anwering_7_3 + Server_Anwering_8_3 + Server_Anwering_5_3 + Server_Anwering_6_3 + Server_Anwering_3_3 + Server_Anwering_4_3 + Server_Anwering_9_3 + Server_Waiting_3 + Server_Anwering_2_3 = 1
inv : Client_Sending_1 + Client_Waiting_1 = 1
inv : Client_Sending_2 + Client_Waiting_2 = 1
inv : Client_Waiting_3 + Client_Sending_3 = 1
inv : Client_Sending_8 + Client_Waiting_8 = 1
inv : Client_Waiting_6 + Client_Sending_6 = 1
Total of 12 invariants.
[2020-05-12 06:04:36] [INFO ] Computed 12 place invariants in 2 ms
[2020-05-12 06:04:36] [INFO ] Removed a total of 102 redundant transitions.
[2020-05-12 06:04:36] [INFO ] Flatten gal took : 71 ms
[2020-05-12 06:04:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-12 06:04:36] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-12 06:04:36] [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("(((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1)<=((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3))")))))&&(G(!(G(F("(((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1)<=((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3))")))))))
Formula 0 simplified : !(X!GF"(((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1)<=((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3))" & G!GF"(((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1)<=((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3))")
[2020-05-12 06:04:37] [INFO ] Proved 58 variables to be positive in 644 ms
[2020-05-12 06:04:37] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2020-05-12 06:04:37] [INFO ] Computation of disable matrix completed :0/81 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:04:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:04:37] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2020-05-12 06:04:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 06:04:40] [INFO ] Computing symmetric co enabling matrix : 81 transitions.
[2020-05-12 06:04:40] [INFO ] Computation of co-enabling matrix(6/81) took 241 ms. Total solver calls (SAT/UNSAT): 105(47/58)
[2020-05-12 06:04:42] [INFO ] Computation of Finished co-enabling matrix. took 2565 ms. Total solver calls (SAT/UNSAT): 639(252/387)
[2020-05-12 06:04:42] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
Reverse transition relation is NOT exact ! Due to transitions gi0.gu2.Lose_Request_7, gi0.gu2.Lose_Request_4, gi0.gu2.Lose_Request_5, gi0.gu2.Lose_Request_2, gi0.gu2.Lose_Request_3, gi0.gu2.Lose_Request_1, gi0.gu2.Lose_Request_8, gi0.gu2.Lose_Request_9, gi0.gu2.Lose_Request_6, gi0.Prepare_Request_6, gi0.Prepare_Request_5, gi0.Prepare_Request_4, gi0.Prepare_Request_3, gi0.Prepare_Request_1, gi0.Prepare_Request_9, gi0.Prepare_Request_2, gi0.Prepare_Request_8, gi0.Prepare_Request_7, Send_Answer_8_2, Send_Answer_2_2, Send_Answer_9_2, Send_Answer_7_3, Send_Answer_5_1, Send_Answer_1_3, Send_Answer_6_1, Send_Answer_1_2, Send_Answer_4_2, Send_Answer_2_3, Send_Answer_3_1, Send_Answer_6_3, Send_Answer_5_3, Send_Answer_3_2, Send_Answer_3_3, Send_Answer_4_3, Send_Answer_4_1, Send_Answer_8_1, Send_Answer_5_2, Send_Answer_7_1, Send_Answer_2_1, Send_Answer_1_1, Send_Answer_6_2, Send_Answer_9_3, Send_Answer_7_2, Send_Answer_8_3, Send_Answer_9_1, 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 06:04:46] [INFO ] Computation of Completed DNA matrix. took 3681 ms. Total solver calls (SAT/UNSAT): 468(0/468)
[2020-05-12 06:04:46] [INFO ] Built C files in 9909ms 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 3647 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 287 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
15644 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.481,2242376,1,0,304,9.85295e+06,24,175,6435,1.55563e+07,229
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((X(((X(G("(((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)<=((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1))")))||("(gi0.gu2.RequestBufferSlots>=2)"))&&("(((gu3.Server_Waiting_1+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)>=2)")))||(G("(((gu3.Server_Waiting_1+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)>=2)"))))))
Formula 1 simplified : !GF(X("(((gu3.Server_Waiting_1+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)>=2)" & ("(gi0.gu2.RequestBufferSlots>=2)" | XG"(((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3)<=((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1))")) | G"(((gu3.Server_Waiting_1+gu3.Server_Waiting_3)+gu3.Server_Waiting_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
334 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,159.843,2243084,1,0,304,9.85295e+06,42,175,6769,1.55563e+07,279
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(((X((G("(gi0.gu2.RequestBufferSlots<=((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1))"))&&("(((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3)<=((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3))")))U("(gi0.gu2.RequestBufferSlots<=((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1))"))&&(!(G("(((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3)>=1)")))))))
Formula 2 simplified : X((X("(((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3)<=((((((((gi0.gu0.Client_Sending_1+gi0.gu0.Client_Sending_9)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_8)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_3))" & G"(gi0.gu2.RequestBufferSlots<=((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1))") U "(gi0.gu2.RequestBufferSlots<=((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1))") & !G"(((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_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
129 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,161.169,2243404,1,0,304,9.85295e+06,60,175,6868,1.55563e+07,297
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(X(G(!(F((G("(((gu3.Server_Waiting_1+gu3.Server_Waiting_3)+gu3.Server_Waiting_2)>=3)"))&&("(((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1)<=((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3))")))))))))
Formula 3 simplified : !X!XG!F("(((((((((gi0.gu2.Client_Waiting_4+gi0.gu2.Client_Waiting_3)+gi0.gu2.Client_Waiting_5)+gi0.gu2.Client_Waiting_6)+gi0.gu2.Client_Waiting_7)+gi0.gu2.Client_Waiting_8)+gi0.gu2.Client_Waiting_9)+gi0.gu2.Client_Waiting_2)+gi0.gu2.Client_Waiting_1)<=((((((((((((((((((((((((((gu1.Server_Anwering_1_3+gu1.Server_Anwering_1_1)+gu1.Server_Anwering_1_2)+gu1.Server_Anwering_7_3)+gu1.Server_Anwering_9_2)+gu1.Server_Anwering_2_2)+gu1.Server_Anwering_4_1)+gu1.Server_Anwering_3_1)+gu1.Server_Anwering_3_2)+gu1.Server_Anwering_8_3)+gu1.Server_Anwering_8_2)+gu1.Server_Anwering_7_2)+gu1.Server_Anwering_5_3)+gu1.Server_Anwering_6_1)+gu1.Server_Anwering_6_2)+gu1.Server_Anwering_6_3)+gu1.Server_Anwering_5_1)+gu1.Server_Anwering_3_3)+gu1.Server_Anwering_5_2)+gu1.Server_Anwering_7_1)+gu1.Server_Anwering_4_3)+gu1.Server_Anwering_4_2)+gu1.Server_Anwering_8_1)+gu1.Server_Anwering_9_3)+gu1.Server_Anwering_2_1)+gu1.Server_Anwering_9_1)+gu1.Server_Anwering_2_3))" & G"(((gu3.Server_Waiting_1+gu3.Server_Waiting_3)+gu3.Server_Waiting_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
4168 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,202.858,2468820,1,0,304,9.85295e+06,23,175,1414,1.69825e+07,70
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X(F("((gi0.gu2.RequestBufferSlots<=gu3.Server_Waiting_1)||(gi0.gu2.Client_Waiting_8>=1))")))))
Formula 4 simplified : XF"((gi0.gu2.RequestBufferSlots<=gu3.Server_Waiting_1)||(gi0.gu2.Client_Waiting_8>=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
1538 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,218.253,2468820,1,0,304,9.85295e+06,37,175,1741,1.69825e+07,247
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F(!(("(gu1.Server_Anwering_8_1<=gu3.Server_Waiting_1)")U(F("(gi0.gu2.Client_Waiting_1<=gi0.gu0.Client_Sending_7)")))))||(F(X("(gi0.gu2.Client_Waiting_1>gi0.gu0.Client_Sending_7)"))))))
Formula 5 simplified : !X(F!("(gu1.Server_Anwering_8_1<=gu3.Server_Waiting_1)" U F"(gi0.gu2.Client_Waiting_1<=gi0.gu0.Client_Sending_7)") | FX"(gi0.gu2.Client_Waiting_1>gi0.gu0.Client_Sending_7)")
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
3392 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,252.18,2507984,1,0,304,1.1267e+07,56,178,1754,1.75697e+07,488
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(!(F(G(F("(gi0.gu2.RequestBufferSlots<=gu3.Server_Waiting_3)"))))))))
Formula 6 simplified : !XX!FGF"(gi0.gu2.RequestBufferSlots<=gu3.Server_Waiting_3)"
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
4926 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,301.453,2721756,1,0,304,1.23836e+07,22,207,958,1.90713e+07,159
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((X("(gi0.gu2.RequestBufferSlots<=gu3.Server_Waiting_2)"))||("(gi0.gu2.Client_Waiting_2<=gi0.gu0.Client_Sending_8)"))))
Formula 7 simplified : !G("(gi0.gu2.Client_Waiting_2<=gi0.gu0.Client_Sending_8)" | X"(gi0.gu2.RequestBufferSlots<=gu3.Server_Waiting_2)")
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
376 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,305.27,2721756,1,0,304,1.23836e+07,47,207,1287,1.90713e+07,192
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-PT-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589263794175

--------------------
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-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699300665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-03.tgz
mv CSRepetitions-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;