About the Execution of ITS-Tools for DrinkVendingMachine-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.040 | 4211.00 | 10100.00 | 53.60 | FTFFFFTTTTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814900809.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DrinkVendingMachine-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814900809
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K Mar 24 05:37 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 DrinkVendingMachine-COL-02-00
FORMULA_NAME DrinkVendingMachine-COL-02-01
FORMULA_NAME DrinkVendingMachine-COL-02-02
FORMULA_NAME DrinkVendingMachine-COL-02-03
FORMULA_NAME DrinkVendingMachine-COL-02-04
FORMULA_NAME DrinkVendingMachine-COL-02-05
FORMULA_NAME DrinkVendingMachine-COL-02-06
FORMULA_NAME DrinkVendingMachine-COL-02-07
FORMULA_NAME DrinkVendingMachine-COL-02-08
FORMULA_NAME DrinkVendingMachine-COL-02-09
FORMULA_NAME DrinkVendingMachine-COL-02-10
FORMULA_NAME DrinkVendingMachine-COL-02-11
FORMULA_NAME DrinkVendingMachine-COL-02-12
FORMULA_NAME DrinkVendingMachine-COL-02-13
FORMULA_NAME DrinkVendingMachine-COL-02-14
FORMULA_NAME DrinkVendingMachine-COL-02-15
=== Now, execution of the tool begins
BK_START 1590139711860
[2020-05-22 09:28:33] [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-22 09:28:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 09:28:33] [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-22 09:28:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2020-05-22 09:28:33] [INFO ] sort/places :
Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,
[2020-05-22 09:28:33] [INFO ] o3 symmetric to o1 in transition elaborate3
[2020-05-22 09:28:33] [INFO ] o1 symmetric to o2 in transition elaborate3
[2020-05-22 09:28:33] [INFO ] o1 symmetric to o2 in transition elaborate2
[2020-05-22 09:28:33] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 15 ms.
[2020-05-22 09:28:33] [INFO ] Computed order based on color domains.
[2020-05-22 09:28:33] [INFO ] Unfolded HLPN to a Petri net with 24 places and 52 transitions in 12 ms.
[2020-05-22 09:28:33] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=367 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 09:28:34] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned unsat
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-22 09:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-05-22 09:28:34] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-05-22 09:28:34] [INFO ] Added : 36 causal constraints over 8 iterations in 65 ms. Result :sat
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-22 09:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-05-22 09:28:34] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-05-22 09:28:34] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-22 09:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-22 09:28:34] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-05-22 09:28:34] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-05-22 09:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 09:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:34] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-05-22 09:28:35] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2020-05-22 09:28:35] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
[2020-05-22 09:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2020-05-22 09:28:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 09:28:35] [INFO ] Flatten gal took : 31 ms
FORMULA DrinkVendingMachine-COL-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 09:28:35] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 09:28:35] [INFO ] Applying decomposition
[2020-05-22 09:28:35] [INFO ] Flatten gal took : 7 ms
Built C files in :
/home/mcc/execution
[2020-05-22 09:28:35] [INFO ] Input system was already deterministic with 52 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 09:28:35] [INFO ] Computed 12 place invariants in 1 ms
inv : theOptions_0 + optionSlots_0 = 1
inv : ready_5 + wait_5 = 1
inv : theOptions_1 + optionSlots_1 = 1
inv : theProducts_0 + productSlots_0 = 1
inv : ready_4 + wait_4 = 1
inv : ready_0 + wait_0 = 1
inv : theProducts_1 + productSlots_1 = 1
inv : ready_1 + wait_1 = 1
inv : ready_7 + wait_7 = 1
inv : ready_3 + wait_3 = 1
inv : ready_2 + wait_2 = 1
inv : ready_6 + wait_6 = 1
Total of 12 invariants.
[2020-05-22 09:28:35] [INFO ] Computed 12 place invariants in 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/graph8438781214605315810.txt, -o, /tmp/graph8438781214605315810.bin, -w, /tmp/graph8438781214605315810.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/graph8438781214605315810.bin, -l, -1, -v, -w, /tmp/graph8438781214605315810.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 09:28:35] [INFO ] Decomposing Gal with order
[2020-05-22 09:28:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 09:28:35] [INFO ] Proved 24 variables to be positive in 95 ms
[2020-05-22 09:28:35] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-22 09:28:35] [INFO ] Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 09:28:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 09:28:35] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-22 09:28:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 09:28:35] [INFO ] Removed a total of 148 redundant transitions.
[2020-05-22 09:28:35] [INFO ] Flatten gal took : 65 ms
[2020-05-22 09:28:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 09:28:35] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-22 09:28:35] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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 13 LTL properties
Checking formula 0 : !((("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)>(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))")U(X(F(("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)>=1)")U("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))"))))))
Formula 0 simplified : !("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)>(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))" U XF("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)>=1)" U "((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4 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.058163,17516,1,0,25,7023,20,11,827,7555,67
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((!((F("((gi1.gu3.theOptions_0+gi1.gu3.theOptions_1)>=2)"))&&("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gu1.theProducts_0+gu1.theProducts_1))")))U(X("(((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))||((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gu1.theProducts_0+gu1.theProducts_1)))")))))
Formula 1 simplified : !X(!("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gu1.theProducts_0+gu1.theProducts_1))" & F"((gi1.gu3.theOptions_0+gi1.gu3.theOptions_1)>=2)") U X"(((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))||((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gu1.theProducts_0+gu1.theProducts_1)))")
5 unique states visited
0 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.067589,19360,1,0,29,7358,47,11,915,7751,89
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)>=2)")U("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)<=(gi1.gu3.theOptions_0+gi1.gu3.theOptions_1))"))))
Formula 2 simplified : !X("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)>=2)" U "((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)<=(gi1.gu3.theOptions_0+gi1.gu3.theOptions_1))")
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.07006,19360,1,0,31,7568,63,11,964,7945,106
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((F(!(X("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)<2)"))))||("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))")))))
Formula 3 simplified : !XF("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))" | F!X"((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)<2)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.088485,19880,1,0,52,10767,72,21,966,13174,163
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(G(((X("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))"))&&("((gu1.theProducts_0+gu1.theProducts_1)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))"))&&("((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))"))))))
Formula 4 simplified : !GXG("((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))" & "((gu1.theProducts_0+gu1.theProducts_1)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))" & X"((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
4 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.123856,21780,1,0,79,15997,94,32,1087,19964,233
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(F((G((("((gu1.theProducts_0+gu1.theProducts_1)<=(gi1.gu2.productSlots_0+gi1.gu2.productSlots_1))")U("((gu1.theProducts_0+gu1.theProducts_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))"))||("((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)>=2)")))&&(G(X(X("((gu1.theProducts_0+gu1.theProducts_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))")))))))))
Formula 5 simplified : !F!F(G("((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)>=2)" | ("((gu1.theProducts_0+gu1.theProducts_1)<=(gi1.gu2.productSlots_0+gi1.gu2.productSlots_1))" U "((gu1.theProducts_0+gu1.theProducts_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))")) & GXX"((gu1.theProducts_0+gu1.theProducts_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))")
4 unique states visited
4 strongly connected components in search stack
5 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.130646,22288,1,0,79,16081,120,32,1218,20064,247
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(!(X(F(X(F(!(F(X((G("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))"))||("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)>=1)")))))))))))))
Formula 6 simplified : !XG!XFXF!FX("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)>=1)" | G"((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.165203,23300,1,0,111,21858,139,42,1358,27613,336
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(X(F(X("((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)>=1)")))))))
Formula 7 simplified : !XXXFX"((gi1.gu2.productSlots_0+gi1.gu2.productSlots_1)>=1)"
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 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.179969,24092,1,0,126,25300,146,46,1358,31760,380
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(F(!(X(G("((gu1.theProducts_0+gu1.theProducts_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))"))))))))
Formula 8 simplified : XF!XG"((gu1.theProducts_0+gu1.theProducts_1)<=(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))"
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.197497,24884,1,0,137,26526,147,58,1358,33516,454
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))&&((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)>=2))")U(!(G(("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))")U((!(X(F("((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))"))))U("((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)>(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))")))))))
Formula 9 simplified : !("(((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))&&((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)>=2))" U !G("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1))" U (!XF"((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)<=(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))" U "((gi2.gu4.optionSlots_0+gi2.gu4.optionSlots_1)>(((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7))")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.215944,25360,1,0,157,27819,175,65,1454,35245,533
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(G(("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gi1.gu2.productSlots_0+gi1.gu2.productSlots_1))")U((G("((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(gu1.theProducts_0+gu1.theProducts_1))"))U(F("((gu1.theProducts_0+gu1.theProducts_1)>(gi1.gu3.theOptions_0+gi1.gu3.theOptions_1))"))))))))
Formula 10 simplified : !G!G("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<=(gi1.gu2.productSlots_0+gi1.gu2.productSlots_1))" U (G"((((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7)<=(gu1.theProducts_0+gu1.theProducts_1))" U F"((gu1.theProducts_0+gu1.theProducts_1)>(gi1.gu3.theOptions_0+gi1.gu3.theOptions_1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.250592,26644,1,0,205,33657,188,92,1472,42953,663
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G("((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<2)")))
Formula 11 simplified : !G"((((((((gi2.gu0.ready_0+gi2.gu0.ready_1)+gi2.gu0.ready_2)+gi2.gu0.ready_3)+gi2.gu0.ready_4)+gi2.gu0.ready_5)+gi2.gu0.ready_6)+gi2.gu0.ready_7)<2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.263728,27172,1,0,215,35573,194,97,1506,45452,701
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G((X(X("((gu1.theProducts_0+gu1.theProducts_1)>=1)")))U("((gu1.theProducts_0+gu1.theProducts_1)>(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))"))))
Formula 12 simplified : !G(XX"((gu1.theProducts_0+gu1.theProducts_1)>=1)" U "((gu1.theProducts_0+gu1.theProducts_1)>(((((((gu1.wait_0+gu1.wait_1)+gu1.wait_2)+gu1.wait_3)+gu1.wait_4)+gu1.wait_5)+gu1.wait_6)+gu1.wait_7))")
2 unique states visited
2 strongly connected components in search stack
3 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.264903,27172,1,0,215,35573,194,97,1506,45452,701
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 09:28:35] [INFO ] Built C files in 612ms 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 1590139716071
--------------------
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="DrinkVendingMachine-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814900809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;