Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3253
Executing tool itstools
Input is ClientsAndServers-PT-N0002P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-ebro-149580922200168
=====================================================================

--------------------
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 ClientsAndServers-PT-N0002P1-LTLFireability-0
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-1
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-15
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-2
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-3
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-4
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-5
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-6
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-7
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-8
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496639162193


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(X(G(G(("CA>=1")&&("CwA>=1")))))))
Formula 0 simplified : !GXG("CA>=1" & "CwA>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
invariant : -1'SR + -1'SG + -1'MpG + -1'MwU + 1'SwG= 0
invariant : -1'SA + -1'SF + -1'MpA + -1'MtF + 1'SwA= 0
invariant : -1'SR + -1'CG + -1'CR + -1'SG + -1'MpG + -1'MwU + -1'StR + -1'SpG + 1'CwG= 0
invariant : 1'SR + -1'CA + -1'CF + 1'SG + 1'MpG + 1'MwU + 1'Si + 1'StR + 1'SpG + 1'CwA= 4
invariant : 1'Uf + 1'SF + 1'CF + 1'StF + 1'CG + 1'MtF + 1'SG + 1'MpG + 1'SpG + 1'Cb= 16
invariant : -1'Uf + -1'SF + 1'CA + -1'StF + 1'CR + -1'MtF + -1'SG + -1'MpG + -1'Si + -1'SpG + 1'Ci= -4
invariant : 1'SA + 1'SF + 1'SR + 1'StF + 1'MpA + 1'MtF + 1'SG + 1'MpG + 1'MwU + 1'Si + 1'StR + 1'SpG + 1'SpA= 4
invariant : 1'MpA + 1'MtF + 1'MpG + 1'MwU + 1'Mi= 3
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-0 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-1 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-2 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-3 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-4 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-5 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
628 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,6.3136,82212,1,0,7,317155,30,0,758,318418,23
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F(X(X("MtF>=1"))))U(F((("Mi>=1")&&("SF>=1"))U("MpG>=1")))))
Formula 1 simplified : !(FXX"MtF>=1" U F(("Mi>=1" & "SF>=1") U "MpG>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.42782,85584,1,0,139,329881,39,29,759,331540,301
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X((("Uf>=1")&&("MwU>=1"))U(("SR>=1")&&("Mi>=1"))))U(X(("SA>=1")&&("SwA>=1")))))
Formula 2 simplified : !(X(("MwU>=1" & "Uf>=1") U ("Mi>=1" & "SR>=1")) U X("SA>=1" & "SwA>=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,6.43901,89212,1,0,139,329881,91,29,805,331545,308
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((X(X("Ci>=1")))U(G(X(("Si>=1")&&("CF>=1"))))))
Formula 3 simplified : !(XX"Ci>=1" U GX("CF>=1" & "Si>=1"))
195 unique states visited
194 strongly connected components in search stack
195 transitions explored
194 items max in DFS search stack
1746 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,23.9139,331916,1,0,522,1.72675e+06,116,218,821,1.94269e+06,1467
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X(("Uf>=1")&&("MwU>=1")))U(X(F(X("Ci>=1"))))))
Formula 4 simplified : !(X("MwU>=1" & "Uf>=1") U XFX"Ci>=1")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.9153,331972,1,0,522,1.72675e+06,123,218,821,1.94269e+06,1471
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("SpG>=1"))
Formula 5 simplified : !"SpG>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.9169,331976,1,0,522,1.72679e+06,126,218,822,1.94275e+06,1475
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(("SA>=1")&&("SwA>=1")))))
Formula 6 simplified : !FX("SA>=1" & "SwA>=1")
Exit code :0
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-6 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1396 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,37.8685,533468,1,0,1371,2.89116e+06,133,393,822,3.1421e+06,3213
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(G(F(X(("SA>=1")&&("SwA>=1")))))))
Formula 7 simplified : !GFX("SA>=1" & "SwA>=1")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1033 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,48.2005,616508,1,0,1739,3.35631e+06,133,394,822,3.57475e+06,4137
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("SR>=1")&&("Mi>=1")))
Formula 8 simplified : !("Mi>=1" & "SR>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,48.2014,616508,1,0,1739,3.35631e+06,137,394,825,3.57475e+06,4139
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F((F("Cb>=1"))U(F(("SA>=1")&&("SwA>=1")))))))
Formula 9 simplified : !GF(F"Cb>=1" U F("SA>=1" & "SwA>=1"))
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,48.2069,616512,1,0,1739,3.35642e+06,137,395,825,3.57511e+06,4141
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(X(F(X(G(("Si>=1")&&("CF>=1"))))))))
Formula 10 simplified : !XXFXG("CF>=1" & "Si>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
8274 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,130.952,1730816,1,0,3171,9.65538e+06,147,893,825,1.17265e+07,6602
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((G(X(("CA>=1")&&("CwA>=1"))))U((("CR>=1")&&("Si>=1"))U("MtF>=1")))))
Formula 11 simplified : !X(GX("CA>=1" & "CwA>=1") U (("CR>=1" & "Si>=1") U "MtF>=1"))
173 unique states visited
172 strongly connected components in search stack
173 transitions explored
172 items max in DFS search stack
600 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,136.951,1815436,1,0,4287,1.00492e+07,167,1227,840,1.234e+07,9308
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("StR>=1")))
Formula 12 simplified : !G"StR>=1"
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,136.952,1815556,1,0,4287,1.00492e+07,173,1227,841,1.234e+07,9313
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((F(F(G(("Si>=1")&&("CF>=1")))))U((F(("SG>=1")&&("SwG>=1")))U(X("SpA>=1")))))
Formula 13 simplified : !(FG("CF>=1" & "Si>=1") U (F("SG>=1" & "SwG>=1") U X"SpA>=1"))
Exit code :1
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
543 unique states visited
0 strongly connected components in search stack
542 transitions explored
182 items max in DFS search stack
134317 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,1480.13,3934356,1,0,33768,2.00091e+07,27,15987,541,3.10522e+07,65646
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((G(F(G(("SA>=1")&&("SwA>=1")))))U(G(("CA>=1")&&("CwA>=1")))))
Formula 14 simplified : !(GFG("SA>=1" & "SwA>=1") U G("CA>=1" & "CwA>=1"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
805 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,1488.18,3934356,1,0,34065,2.00091e+07,55,16085,656,3.10522e+07,66173
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((("Uf>=1")&&("MwU>=1")))
Formula 15 simplified : !("MwU>=1" & "Uf>=1")
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,1488.22,3934356,1,0,34065,2.00091e+07,65,16085,661,3.10522e+07,66180
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496640695842

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 5:06:04 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 53 ms
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 18 transitions.
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 38 ms
Jun 05, 2017 5:06:05 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
Jun 05, 2017 5:06:05 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 8 place invariants in 139 ms
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 25 variables to be positive in 198 ms
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 18 transitions.
Jun 05, 2017 5:06:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/18 took 2 ms. Total solver calls (SAT/UNSAT): 2(1/1)
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 53(22/31)
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 18 transitions.
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 53(26/27)
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 18 transitions.
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 80 ms. Total solver calls (SAT/UNSAT): 171(171/0)
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 18 transitions.
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 340 ms. Total solver calls (SAT/UNSAT): 33(0/33)
Jun 05, 2017 5:06:06 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 814ms conformant to PINS in folder :/home/mcc/execution
Jun 05, 2017 5:06:07 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, [](X([]([]((LTLAP0==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.002: Loading model from ./gal.so
pins2lts-seq, 0.002: library has no initializer
pins2lts-seq, 0.002: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: [](X([]([]((LTLAP0==true)))))
pins2lts-seq, 0.003: Expression is: ([] (X ([] ([] (LTLAP0 == true )))))
pins2lts-seq, 0.003: buchi has 4 states
pins2lts-seq, 0.003: state 0: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: state 1: non-accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.003: state 2: accepting
pins2lts-seq, 0.003: -> 2, | true
pins2lts-seq, 0.003: state 3: non-accepting
pins2lts-seq, 0.003: -> 3, | true
pins2lts-seq, 0.003: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.003: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 26, there are 25 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

Jun 05, 2017 5:06:07 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (<>(X(X((LTLAP1==true)))))U(<>(((LTLAP2==true))U((LTLAP3==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (<>(X(X((LTLAP1==true)))))U(<>(((LTLAP2==true))U((LTLAP3==true))))
pins2lts-seq, 0.000: Expression is: ((<> (X (X (LTLAP1 == true )))) U (<> ((LTLAP2 == true ) U (LTLAP3 == true ))))
pins2lts-seq, 0.000: buchi has 1 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 0, | !(LTLAP3 == true )
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 19 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.009: state space 29 levels, 739 states 1517 transitions

Jun 05, 2017 5:06:07 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X(((LTLAP4==true))U((LTLAP5==true))))U(X((LTLAP6==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (X(((LTLAP4==true))U((LTLAP5==true))))U(X((LTLAP6==true)))
pins2lts-seq, 0.000: Expression is: ((X ((LTLAP4 == true ) U (LTLAP5 == true ))) U (X (LTLAP6 == true )))
pins2lts-seq, 0.000: buchi has 4 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP6 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP6 == true ) && !(LTLAP5 == true ) && !(LTLAP4 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP6 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP5 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP5 == true ) && !(LTLAP4 == true )
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 25 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

Jun 05, 2017 5:06:07 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X(X((LTLAP7==true))))U([](X((LTLAP8==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (X(X((LTLAP7==true))))U([](X((LTLAP8==true))))
pins2lts-seq, 0.000: Expression is: ((X (X (LTLAP7 == true ))) U ([] (X (LTLAP8 == true ))))
pins2lts-seq, 0.000: buchi has 7 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP8 == true )
pins2lts-seq, 0.001: -> 4, | true
pins2lts-seq, 0.001: -> 5, | true
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 3, | !(LTLAP7 == true )
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.001: state 4: non-accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP8 == true )
pins2lts-seq, 0.001: -> 4, | true
pins2lts-seq, 0.001: -> 5, | true
pins2lts-seq, 0.001: state 5: non-accepting
pins2lts-seq, 0.001: -> 6, | !(LTLAP7 == true )
pins2lts-seq, 0.001: -> 3, | !(LTLAP8 == true ) && !(LTLAP7 == true )
pins2lts-seq, 0.001: state 6: non-accepting
pins2lts-seq, 0.001: -> 6, | true
pins2lts-seq, 0.001: -> 3, | !(LTLAP8 == true )
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 33 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

Jun 05, 2017 5:06:07 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X((LTLAP4==true)))U(X(<>(X((LTLAP7==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (X((LTLAP4==true)))U(X(<>(X((LTLAP7==true)))))
pins2lts-seq, 0.000: Expression is: ((X (LTLAP4 == true )) U (X (<> (X (LTLAP7 == true )))))
pins2lts-seq, 0.000: buchi has 4 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.000: -> 3, | !(LTLAP4 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | !(LTLAP7 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP7 == true ) && !(LTLAP4 == true )
pins2lts-seq, 0.000: state 3: accepting
pins2lts-seq, 0.000: -> 3, | !(LTLAP7 == true )
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 24 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.003: state space 3 levels, 6 states 5 transitions

Jun 05, 2017 5:06:07 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP9==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 33, guards 18
pins2lts-seq, 0.001: LTL layer: formula: (LTLAP9==true)
pins2lts-seq, 0.001: Expression is: (LTLAP9 == true )
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP9 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 26, there are 20 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.002: Visible groups: 0 / 20, labels: 1 / 34
pins2lts-seq, 0.002: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.006: accepting cycle found!
pins2lts-seq, 0.006: exiting now

Jun 05, 2017 5:06:39 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>(X((LTLAP6==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: <>(X((LTLAP6==true)))
pins2lts-seq, 0.000: Expression is: (<> (X (LTLAP6 == true )))
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP6 == true )
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 20 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.075: explored 176 levels ~10000 states ~19564 transitions
pins2lts-seq, 0.156: explored 176 levels ~20000 states ~42940 transitions
pins2lts-seq, 0.307: explored 176 levels ~40000 states ~91097 transitions
pins2lts-seq, 0.675: explored 176 levels ~80000 states ~189400 transitions
pins2lts-seq, 1.373: explored 176 levels ~160000 states ~394126 transitions
pins2lts-seq, 2.829: explored 176 levels ~320000 states ~842435 transitions
pins2lts-seq, 5.918: explored 176 levels ~640000 states ~1795006 transitions
pins2lts-seq, 13.335: explored 176 levels ~1280000 states ~4251539 transitions
pins2lts-seq, 31.709: state space 176 levels, 2502481 states 11052840 transitions

Jun 05, 2017 5:10:24 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 05, 2017 5:10:24 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 5:10:24 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTSmin timed out on command CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, []([](<>(X((LTLAP6==true)))))], workingDir=/home/mcc/execution]
Jun 05, 2017 5:14:09 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 05, 2017 5:14:09 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 5:14:09 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTSmin timed out on command CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (<>(<>([]((LTLAP8==true)))))U((<>((LTLAP13==true)))U(X((LTLAP14==true))))], workingDir=/home/mcc/execution]
Jun 05, 2017 5:14:09 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, ([](<>([]((LTLAP6==true)))))U([]((LTLAP0==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 33, guards 18
pins2lts-seq, 0.001: LTL layer: formula: ([](<>([]((LTLAP6==true)))))U([]((LTLAP0==true)))
pins2lts-seq, 0.001: Expression is: (([] (<> ([] (LTLAP6 == true )))) U ([] (LTLAP0 == true )))
pins2lts-seq, 0.001: buchi has 5 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: -> 4, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: -> 4, | true
pins2lts-seq, 0.002: state 2: non-accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP6 == true )
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.002: state 3: accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP6 == true )
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.002: state 4: non-accepting
pins2lts-seq, 0.002: -> 4, | true
pins2lts-seq, 0.002: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.002: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.003: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 26, there are 32 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.003: Visible groups: 0 / 32, labels: 2 / 34
pins2lts-seq, 0.003: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.009: accepting cycle found!
pins2lts-seq, 0.009: exiting now

Jun 05, 2017 5:14:10 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP4==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 33, guards 18
pins2lts-seq, 0.000: LTL layer: formula: (LTLAP4==true)
pins2lts-seq, 0.000: Expression is: (LTLAP4 == true )
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP4 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 26, there are 20 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 20, labels: 1 / 34
pins2lts-seq, 0.001: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

Jun 05, 2017 5:31:35 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0002P1.tgz
mv ClientsAndServers-PT-N0002P1 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0002P1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-ebro-149580922200168"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;