Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r201-csrt-155286433500007.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is SafeBus-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-csrt-155286433500007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 8 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 8 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 42K Mar 10 17:31 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 SafeBus-COL-03-LTLFireability-00
FORMULA_NAME SafeBus-COL-03-LTLFireability-01
FORMULA_NAME SafeBus-COL-03-LTLFireability-02
FORMULA_NAME SafeBus-COL-03-LTLFireability-03
FORMULA_NAME SafeBus-COL-03-LTLFireability-04
FORMULA_NAME SafeBus-COL-03-LTLFireability-05
FORMULA_NAME SafeBus-COL-03-LTLFireability-06
FORMULA_NAME SafeBus-COL-03-LTLFireability-07
FORMULA_NAME SafeBus-COL-03-LTLFireability-08
FORMULA_NAME SafeBus-COL-03-LTLFireability-09
FORMULA_NAME SafeBus-COL-03-LTLFireability-10
FORMULA_NAME SafeBus-COL-03-LTLFireability-11
FORMULA_NAME SafeBus-COL-03-LTLFireability-12
FORMULA_NAME SafeBus-COL-03-LTLFireability-13
FORMULA_NAME SafeBus-COL-03-LTLFireability-14
FORMULA_NAME SafeBus-COL-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553781989763

14:06:32.318 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
14:06:32.320 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((false))
Formula 0 simplified : 1
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 71
// Phase 1: matrix 71 rows 57 cols
invariant :Cpt1_0 + Cpt1_1 + Cpt1_2 = 1
invariant :cable_free_0 + wait_ack_0 + wait_ack_1 + wait_ack_2 + wait_ack_3 + wait_ack_4 + wait_ack_5 + wait_ack_6 + wait_ack_7 + wait_ack_8 + PMC_0 + PMC_1 + PMC_2 + -1'FMCb_0 = 0
invariant :wait_ack_0 + wait_ack_1 + wait_ack_2 + wait_cable_0 + listen_0 + wait_msg_0 + loop_em_0 = 1
invariant :Cpt2_1 + -1'Cpt1_1 + -2'AMC_1 + -1'AMC_2 + -2'AMC_4 + -1'AMC_5 + -2'AMC_7 + -1'AMC_8 + -1'wait_ack_0 + -1'wait_ack_1 + -1'wait_ack_2 + -1'wait_ack_3 + -1'wait_ack_4 + -1'wait_ack_5 + -1'wait_ack_6 + -1'wait_ack_7 + -1'wait_ack_8 + -1'listen_0 + -1'listen_1 + -1'listen_2 + -1'RMC_0 + -1'RMC_1 + -1'RMC_2 + -1'PMC_0 + -1'PMC_1 + -1'PMC_2 + -1'wait_msg_0 + -1'wait_msg_1 + -1'wait_msg_2 + -1'loop_em_0 + -1'loop_em_1 + -1'loop_em_2 = -3
invariant :Cpt2_0 + Cpt1_1 + Cpt1_2 + AMC_1 + 2'AMC_2 + AMC_4 + 2'AMC_5 + AMC_7 + 2'AMC_8 + wait_ack_0 + wait_ack_1 + wait_ack_2 + wait_ack_3 + wait_ack_4 + wait_ack_5 + wait_ack_6 + wait_ack_7 + wait_ack_8 + listen_0 + listen_1 + listen_2 + RMC_0 + RMC_1 + RMC_2 + PMC_0 + PMC_1 + PMC_2 + wait_msg_0 + wait_msg_1 + wait_msg_2 + loop_em_0 + loop_em_1 + loop_em_2 = 4
invariant :AMC_0 + AMC_1 + AMC_2 + wait_ack_0 + wait_ack_1 + wait_ack_2 + listen_0 + RMC_0 + PMC_0 + wait_msg_0 + loop_em_0 = 1
invariant :cable_used_1 + -1'FMC_1 + -1'wait_ack_3 + -1'wait_ack_4 + -1'wait_ack_5 + -1'PMC_1 = 0
invariant :FMC_0 + FMC_1 + FMC_2 + FMCb_0 = 1
invariant :wait_ack_3 + wait_ack_4 + wait_ack_5 + wait_cable_1 + listen_1 + wait_msg_1 + loop_em_1 = 1
invariant :wait_ack_6 + wait_ack_7 + wait_ack_8 + wait_cable_2 + listen_2 + wait_msg_2 + loop_em_2 = 1
invariant :Cpt2_2 + -1'Cpt1_2 + AMC_1 + -1'AMC_2 + AMC_4 + -1'AMC_5 + AMC_7 + -1'AMC_8 = 0
invariant :AMC_3 + AMC_4 + AMC_5 + wait_ack_3 + wait_ack_4 + wait_ack_5 + listen_1 + RMC_1 + PMC_1 + wait_msg_1 + loop_em_1 = 1
invariant :R_tout_0 + S_tout_0 = 1
invariant :-1'wait_ack_0 + -1'wait_ack_1 + -1'wait_ack_2 + -1'wait_ack_3 + -1'wait_ack_4 + -1'wait_ack_5 + -1'wait_ack_6 + -1'wait_ack_7 + -1'wait_ack_8 + ACK_0 + MSG_0 + MSG_1 + MSG_2 + T_out_0 = 0
invariant :AMC_6 + AMC_7 + AMC_8 + wait_ack_6 + wait_ack_7 + wait_ack_8 + listen_2 + RMC_2 + PMC_2 + wait_msg_2 + loop_em_2 = 1
invariant :cable_used_0 + FMC_1 + FMC_2 + -1'wait_ack_0 + -1'wait_ack_1 + -1'wait_ack_2 + -1'PMC_0 + FMCb_0 = 1
invariant :cable_used_2 + -1'FMC_2 + -1'wait_ack_6 + -1'wait_ack_7 + -1'wait_ack_8 + -1'PMC_2 = 0
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t6, t7, t8, t37, t38, t39, t49, t50, t51, t79, t80, t81, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :15/55/27/97
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
93 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.978956,41288,1,0,195,85747,202,82,2727,59603,195
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((false))
Formula 1 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.979245,41288,1,0,195,85747,202,82,2727,59603,195
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((FMC_0>=1)&&(S_tout_0>=1))||((FMC_1>=1)&&(S_tout_0>=1)))||((FMC_2>=1)&&(S_tout_0>=1)))")U(F(F(F("((((FMC_0>=1)&&(S_tout_0>=1))||((FMC_1>=1)&&(S_tout_0>=1)))||((FMC_2>=1)&&(S_tout_0>=1)))"))))))
Formula 2 simplified : !("((((FMC_0>=1)&&(S_tout_0>=1))||((FMC_1>=1)&&(S_tout_0>=1)))||((FMC_2>=1)&&(S_tout_0>=1)))" U F"((((FMC_0>=1)&&(S_tout_0>=1))||((FMC_1>=1)&&(S_tout_0>=1)))||((FMC_2>=1)&&(S_tout_0>=1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
77 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,1.74324,61604,1,0,263,148572,211,112,2736,154890,355
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((((((((((wait_ack_0>=1)&&(T_out_0>=1))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_1>=1)&&(T_out_0>=1)))||((wait_ack_4>=1)&&(T_out_0>=1)))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_8>=1)&&(T_out_0>=1)))")))
Formula 3 simplified : !G"((((((((((wait_ack_0>=1)&&(T_out_0>=1))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_1>=1)&&(T_out_0>=1)))||((wait_ack_4>=1)&&(T_out_0>=1)))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_8>=1)&&(T_out_0>=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,1.75189,61840,1,0,263,148826,217,112,2760,155276,362
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(X(G(G("((((((((((listen_0>=1)&&(Cpt1_0>=1))||((listen_1>=1)&&(Cpt1_0>=1)))||((listen_2>=1)&&(Cpt1_0>=1)))||((listen_0>=1)&&(Cpt1_1>=1)))||((listen_1>=1)&&(Cpt1_1>=1)))||((listen_2>=1)&&(Cpt1_1>=1)))||((listen_0>=1)&&(Cpt1_2>=1)))||((listen_1>=1)&&(Cpt1_2>=1)))||((listen_2>=1)&&(Cpt1_2>=1)))")))))))
Formula 4 simplified : !GXXG"((((((((((listen_0>=1)&&(Cpt1_0>=1))||((listen_1>=1)&&(Cpt1_0>=1)))||((listen_2>=1)&&(Cpt1_0>=1)))||((listen_0>=1)&&(Cpt1_1>=1)))||((listen_1>=1)&&(Cpt1_1>=1)))||((listen_2>=1)&&(Cpt1_1>=1)))||((listen_0>=1)&&(Cpt1_2>=1)))||((listen_1>=1)&&(Cpt1_2>=1)))||((listen_2>=1)&&(Cpt1_2>=1)))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
49 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,2.24088,76708,1,0,325,195774,223,135,2781,221613,491
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G(G(("((((wait_msg_0>=1)&&(MSG_0>=1))||((wait_msg_1>=1)&&(MSG_1>=1)))||((wait_msg_2>=1)&&(MSG_2>=1)))")U("(((((((PMC_1>=1)&&(wait_cable_1>=1))||((PMC_2>=1)&&(wait_cable_2>=1)))||((PMC_0>=1)&&(wait_cable_0>=1)))||((PMC_2>=1)&&(wait_cable_2>=1)))||((PMC_0>=1)&&(wait_cable_0>=1)))||((PMC_1>=1)&&(wait_cable_1>=1)))"))))))
Formula 5 simplified : !G("((((wait_msg_0>=1)&&(MSG_0>=1))||((wait_msg_1>=1)&&(MSG_1>=1)))||((wait_msg_2>=1)&&(MSG_2>=1)))" U "(((((((PMC_1>=1)&&(wait_cable_1>=1))||((PMC_2>=1)&&(wait_cable_2>=1)))||((PMC_0>=1)&&(wait_cable_0>=1)))||((PMC_2>=1)&&(wait_cable_2>=1)))||((PMC_0>=1)&&(wait_cable_0>=1)))||((PMC_1>=1)&&(wait_cable_1>=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,2.24612,77216,1,0,325,195774,239,135,2817,221624,498
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(X(X("((((((((((loop_em_0>=1)&&(Cpt1_0>=1))||((loop_em_1>=1)&&(Cpt1_0>=1)))||((loop_em_2>=1)&&(Cpt1_0>=1)))||((loop_em_0>=1)&&(Cpt1_1>=1)))||((loop_em_1>=1)&&(Cpt1_1>=1)))||((loop_em_2>=1)&&(Cpt1_1>=1)))||((loop_em_0>=1)&&(Cpt1_2>=1)))||((loop_em_1>=1)&&(Cpt1_2>=1)))||((loop_em_2>=1)&&(Cpt1_2>=1)))")))))))
Formula 6 simplified : !FXFXX"((((((((((loop_em_0>=1)&&(Cpt1_0>=1))||((loop_em_1>=1)&&(Cpt1_0>=1)))||((loop_em_2>=1)&&(Cpt1_0>=1)))||((loop_em_0>=1)&&(Cpt1_1>=1)))||((loop_em_1>=1)&&(Cpt1_1>=1)))||((loop_em_2>=1)&&(Cpt1_1>=1)))||((loop_em_0>=1)&&(Cpt1_2>=1)))||((loop_em_1>=1)&&(Cpt1_2>=1)))||((loop_em_2>=1)&&(Cpt1_2>=1)))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
41 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,2.66219,90128,1,0,387,226422,248,160,2834,276271,633
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("((ACK_0>=1)&&(R_tout_0>=1))")))
Formula 7 simplified : !F"((ACK_0>=1)&&(R_tout_0>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.76451,92504,1,0,461,236336,257,190,2837,297811,801
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G("((((((((((wait_ack_0>=1)&&(T_out_0>=1))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_1>=1)&&(T_out_0>=1)))||((wait_ack_4>=1)&&(T_out_0>=1)))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_8>=1)&&(T_out_0>=1)))"))))
Formula 8 simplified : !G"((((((((((wait_ack_0>=1)&&(T_out_0>=1))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_1>=1)&&(T_out_0>=1)))||((wait_ack_4>=1)&&(T_out_0>=1)))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_8>=1)&&(T_out_0>=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,2.76803,92768,1,0,461,236336,257,190,2837,297811,801
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G(X(("(((((((((((wait_ack_0>=1)&&(FMCb_0>=1))&&(ACK_0>=1))||(((wait_ack_3>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_6>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_1>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_4>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_7>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_2>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_5>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_8>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))")U("((ACK_0>=1)&&(R_tout_0>=1))"))))))
Formula 9 simplified : !FGX("(((((((((((wait_ack_0>=1)&&(FMCb_0>=1))&&(ACK_0>=1))||(((wait_ack_3>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_6>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_1>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_4>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_7>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_2>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_5>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))||(((wait_ack_8>=1)&&(FMCb_0>=1))&&(ACK_0>=1)))" U "((ACK_0>=1)&&(R_tout_0>=1))")
2 unique states visited
1 strongly connected components in search stack
3 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,2.78106,92948,1,0,463,236930,262,191,2860,299098,811
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((false))
Formula 10 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.78125,92948,1,0,463,236930,262,191,2860,299098,811
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(F(G(F("((((FMC_0>=1)&&(S_tout_0>=1))||((FMC_1>=1)&&(S_tout_0>=1)))||((FMC_2>=1)&&(S_tout_0>=1)))")))))))
Formula 11 simplified : !GXFGF"((((FMC_0>=1)&&(S_tout_0>=1))||((FMC_1>=1)&&(S_tout_0>=1)))||((FMC_2>=1)&&(S_tout_0>=1)))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,2.82624,94780,1,0,480,239556,262,192,2860,302371,858
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(F(G(F("((((MSG_0>=1)&&(R_tout_0>=1))||((MSG_1>=1)&&(R_tout_0>=1)))||((MSG_2>=1)&&(R_tout_0>=1)))")))))))
Formula 12 simplified : !XGFGF"((((MSG_0>=1)&&(R_tout_0>=1))||((MSG_1>=1)&&(R_tout_0>=1)))||((MSG_2>=1)&&(R_tout_0>=1)))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,2.85096,95744,1,0,497,241416,271,193,2865,305237,909
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F("((((wait_msg_0>=1)&&(MSG_0>=1))||((wait_msg_1>=1)&&(MSG_1>=1)))||((wait_msg_2>=1)&&(MSG_2>=1)))"))))
Formula 13 simplified : !GF"((((wait_msg_0>=1)&&(MSG_0>=1))||((wait_msg_1>=1)&&(MSG_1>=1)))||((wait_msg_2>=1)&&(MSG_2>=1)))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
6 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,2.912,97588,1,0,516,245986,278,194,2866,311946,965
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("((((wait_msg_0>=1)&&(MSG_0>=1))||((wait_msg_1>=1)&&(MSG_1>=1)))||((wait_msg_2>=1)&&(MSG_2>=1)))")))
Formula 14 simplified : !G"((((wait_msg_0>=1)&&(MSG_0>=1))||((wait_msg_1>=1)&&(MSG_1>=1)))||((wait_msg_2>=1)&&(MSG_2>=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,2.9135,97852,1,0,516,245986,281,194,2866,311946,970
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G((X("((((((((((wait_ack_0>=1)&&(T_out_0>=1))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_1>=1)&&(T_out_0>=1)))||((wait_ack_4>=1)&&(T_out_0>=1)))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_8>=1)&&(T_out_0>=1)))"))U(F("((ACK_0>=1)&&(R_tout_0>=1))"))))))
Formula 15 simplified : !XG(X"((((((((((wait_ack_0>=1)&&(T_out_0>=1))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_1>=1)&&(T_out_0>=1)))||((wait_ack_4>=1)&&(T_out_0>=1)))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_8>=1)&&(T_out_0>=1)))" U F"((ACK_0>=1)&&(R_tout_0>=1))")
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,2.91434,98048,1,0,516,245986,281,194,2866,311946,970
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SafeBus-COL-03-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1553781997227

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 28, 2019 2:06:31 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 28, 2019 2:06:31 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 28, 2019 2:06:31 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 959 ms
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 20 places.
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,

Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 14 transitions.
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 28, 2019 2:06:32 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $x and $y of transition C_refuse
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $j of transition C_free
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $x and $y of transition C_provide
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $r and $i of transition I_rec1
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $j of transition I_emit
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $j of transition I_refused
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $r and $i of transition I_rec2
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 1 fixed domain variables (out of 60 variables) in GAL type Document
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 3 constant array cells/variables (out of 60 variables) in type Document
Mar 28, 2019 2:06:32 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: msgl[0-2],
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 3.0 instantiations of transitions. Total transitions/syncs built is 112
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 1 fixed domain variables (out of 60 variables) in GAL type Document
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 3 constant array cells/variables (out of 60 variables) in type Document
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: msgl[0-2],
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed constant array :msgl[]
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 6 expressions due to constant valuations.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 104 ms
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 17 ms
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 22 transitions. Expanding to a total of 145 deterministic transitions.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 4 ms.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 57 places.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 97 transitions.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 22 transitions. Expanding to a total of 145 deterministic transitions.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 2 ms.
Mar 28, 2019 2:06:33 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 28, 2019 2:06:33 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 23 ms
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 57 variables to be positive in 200 ms
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 97 transitions.
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/97 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:06:33 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 97 transitions.
Mar 28, 2019 2:06:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:06:35 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 97 transitions.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 28, 2019 2:06:36 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3403ms conformant to PINS in folder :/home/mcc/execution

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="SafeBus-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is SafeBus-COL-03, 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 r201-csrt-155286433500007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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