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)
...................
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 60K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is IOTPpurchase-PT-C03M03P03D03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264200322
=====================================================================

--------------------
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 IOTPpurchase-PT-C03M03P03D03-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527941926518

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph8373221045319563968.txt, -o, /tmp/graph8373221045319563968.bin, -w, /tmp/graph8373221045319563968.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph8373221045319563968.bin, -l, -1, -v, -w, /tmp/graph8373221045319563968.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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(G(X(X("((u12.p1_2>=1)&&(i9.u2.p10_2>=1))"))))))
Formula 0 simplified : !GXX"((u12.p1_2>=1)&&(i9.u2.p10_2>=1))"
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
invariant :i4:u8:PaymentNote_p21_13 + -1'i4:u8:p5_3 = 0
invariant :i9:u2:Delivery_p20 + -1'i9:u2:p2_2 = 0
invariant :u14:PaySchemeData_p21_6 + -1'u14:p3_7 = 0
invariant :u12:Payment_p20_9 + -1'u12:p1_3 = 0
invariant :u12:Status_p20_6 + -1'u12:p1_3 = 0
invariant :i6:u11:p12_0 + i6:u11:p6_2 + i6:u19:p12_3 + -1'i6:u19:p7_1 + -1'i6:u19:p7_2 = 2
invariant :i10:u1:p8_1 + i10:u1:p8_2 + i10:u21:DeliveryHandlerDelivery_p8_0 + i10:u21:p8_3 = 3
invariant :i6:u19:HowDeliver_p12_2 + i6:u19:p12_3 = 1
invariant :i6:u19:Organization_p22_2 + -1'i6:u19:p7_2 = 0
invariant :u18:p6_3 + u18:p6_4 + -1'i6:u11:Organization_p22_5 = 0
invariant :i0:u0:p4_3 + i0:u15:p4_1 + i0:u15:p4_2 + i1:u6:Payment_p21_3 + i1:u6:p3_5 + i1:u10:p11_4 + i6:u11:p6_2 + i6:u19:p12_3 + i7:u5:p3_8 + i7:u5:p3_9 + i7:u17:ConsumerDelivery_p6_0 + i7:u17:p3_10 + i7:u17:p6_1 + i9:u2:MerchantPayment_p4_0 + i9:u2:p2_1 + i9:u2:p2_2 + i9:u20:MerchantOffer_p2 + i9:u20:p7_3 = 5
invariant :i10:u1:DeliveryResponse_p12_6 + i10:u1:p12_7 = 1
invariant :i4:u8:PayReceipt_p21_12 + -1'i4:u8:p5_3 = 0
invariant :u14:p3_6 + u14:p3_7 + -1'i1:u6:Payment_p21_3 = 0
invariant :i0:u4:PaidFor_p11_1 + -1'i0:u4:p3_2 + -1'i0:u13:p3_3 + -1'i0:u13:p3_4 + -1'i1:u6:Payment_p21_3 + -1'i1:u6:p3_5 + -1'i6:u11:p6_2 + -1'i6:u19:p12_3 + -1'i7:u5:p3_8 + -1'i7:u5:p3_9 + -1'i7:u17:ConsumerDelivery_p6_0 + -1'i7:u17:p3_10 + -1'i7:u17:p6_1 + -1'i9:u2:MerchantPayment_p4_0 + -1'i9:u2:p2_1 + -1'i9:u2:p2_2 + -1'i9:u20:MerchantOffer_p2 + -1'i9:u20:p7_3 = -4
invariant :i1:u3:Organization_p21_2 + -1'i1:u3:p4_5 = 0
invariant :u12:Order_p20_8 + -1'u12:p1_3 = 0
invariant :u9:p6_5 + i10:u1:p12_4 + i10:u1:p12_7 + i10:u21:DeliveryHandlerDelivery_p8_0 + i10:u21:p8_3 = 5
invariant :i4:u8:PaymentResponse_p11_12 + i4:u8:p5_3 + i7:u5:p11_11 + -1'i7:u5:p3_9 = 1
invariant :i4:u16:Payment_p21_7 + -1'i4:u16:p5_1 = 0
invariant :i4:u8:PaySchemeData_p21_10 + -1'i4:u16:p5_1 + -1'i4:u16:p5_2 = 0
invariant :i6:u19:Delivery_p22_1 + -1'i6:u19:p7_2 = 0
invariant :i7:u17:PaymentNote_p21_16 + -1'i7:u17:p3_10 = 0
invariant :i4:u8:Status_p21_11 + -1'i4:u8:p5_3 = 0
invariant :i6:u19:Order_p22_3 + -1'i6:u19:p7_2 = 0
invariant :i9:u2:OfferResponce_p10 + i9:u2:p10_2 = 1
invariant :i9:u2:Status_p20 + -1'i9:u2:p2_2 = 0
invariant :i4:u16:Organization_p21_8 + -1'i4:u16:p5_1 = 0
invariant :u9:DeliveryNote_p22_14 + -1'u9:p6_6 = 0
invariant :i9:u2:OfferRequest_p10 + i9:u2:p10_0 = 1
invariant :i7:u5:PaySchemeData_p11_10 + i7:u5:p11_11 = 1
invariant :i4:u16:Status_p21_9 + -1'i4:u16:p5_1 = 0
invariant :i10:u1:Organization_p22_9 + i10:u1:p8_2 + i10:u21:DeliveryHandlerDelivery_p8_0 + i10:u21:p8_3 = 3
invariant :i4:u7:PaymentHandlerPayment_p5_0 + i4:u7:p5_4 + i4:u8:p5_3 + i4:u16:p5_1 + i4:u16:p5_2 = 3
invariant :u12:Delivery_p20_10 + -1'u12:p1_3 = 0
invariant :u12:Organization_p20_7 + -1'u12:p1_3 = 0
invariant :i4:u16:PaymentRequest_p11_9 + i4:u16:p5_1 + i4:u16:p5_2 + -1'i7:u5:p11_11 + -1'i7:u5:p3_8 = -1
invariant :i10:u1:Order_p22_10 + i10:u1:p8_2 + i10:u21:DeliveryHandlerDelivery_p8_0 + i10:u21:p8_3 = 3
invariant :i9:u2:Payment_p20 + -1'i9:u2:p2_2 = 0
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
invariant :i7:u17:Status_p21_14 + -1'i7:u17:p3_10 = 0
invariant :i0:u0:BrandList_p11_2 + i0:u13:p3_3 + i0:u13:p3_4 + i0:u15:p4_1 + i0:u15:p4_2 + i1:u6:Payment_p21_3 + i1:u6:p3_5 + i6:u11:p6_2 + i6:u19:p12_3 + i7:u5:p3_8 + i7:u5:p3_9 + i7:u17:ConsumerDelivery_p6_0 + i7:u17:p3_10 + i7:u17:p6_1 + i9:u2:MerchantPayment_p4_0 + i9:u2:p2_1 + i9:u2:p2_2 + i9:u20:MerchantOffer_p2 + i9:u20:p7_3 = 4
invariant :i10:u1:DeliveryRequest_p12_5 + i10:u1:p12_4 = 1
invariant :i4:u16:p11_8 + -1'i4:u16:p5_1 + -1'i4:u16:p5_2 + i7:u5:p11_11 + i7:u5:p3_8 = 2
invariant :i9:u2:Organization_p20_2 + -1'i9:u2:p2_2 = 0
invariant :i1:u6:PaymentAmount_p11_6 + i1:u6:p11_7 = 1
invariant :i1:u3:Payment_p21_1 + -1'i1:u3:p4_5 = 0
invariant :u18:Status_p22_7 + -1'u18:p6_4 = 0
invariant :i0:u0:p11_3 + -1'i0:u13:p3_3 + -1'i0:u13:p3_4 + -1'i0:u15:p4_1 + -1'i0:u15:p4_2 + -1'i1:u6:Payment_p21_3 + -1'i1:u6:p3_5 + -1'i6:u11:p6_2 + -1'i6:u19:p12_3 + -1'i7:u5:p3_8 + -1'i7:u5:p3_9 + -1'i7:u17:ConsumerDelivery_p6_0 + -1'i7:u17:p3_10 + -1'i7:u17:p6_1 + -1'i9:u2:MerchantPayment_p4_0 + -1'i9:u2:p2_1 + -1'i9:u2:p2_2 + -1'i9:u20:MerchantOffer_p2 + -1'i9:u20:p7_3 = -3
invariant :i10:u1:Status_p22_11 + i10:u21:DeliveryHandlerDelivery_p8_0 + i10:u21:p8_3 = 3
invariant :i0:u4:p11_0 + i0:u4:p3_2 + i0:u13:p3_3 + i0:u13:p3_4 + i1:u6:Payment_p21_3 + i1:u6:p3_5 + i6:u11:p6_2 + i6:u19:p12_3 + i7:u5:p3_8 + i7:u5:p3_9 + i7:u17:ConsumerDelivery_p6_0 + i7:u17:p3_10 + i7:u17:p6_1 + i9:u2:MerchantPayment_p4_0 + i9:u2:p2_1 + i9:u2:p2_2 + i9:u20:MerchantOffer_p2 + i9:u20:p7_3 = 5
invariant :u12:ConsumerPayment_p3 + u12:p1_3 + u12:p3_1 + i0:u4:p3_2 + i0:u13:p3_3 + i0:u13:p3_4 + i1:u6:Payment_p21_3 + i1:u6:p3_5 + i6:u11:p6_2 + i6:u19:p12_3 + i7:u5:p3_8 + i7:u5:p3_9 + i7:u17:ConsumerDelivery_p6_0 + i7:u17:p3_10 + i7:u17:p6_1 + i9:u2:p10_2 + i9:u2:p2_1 + i9:u2:p2_2 + i9:u20:MerchantOffer_p2 + i9:u20:p7_3 = 4
invariant :i1:u3:MerchantDelivery_p4_6 + -1'i1:u6:Payment_p21_3 + i1:u6:p11_7 + -1'i6:u11:p6_2 + -1'i6:u19:p12_3 + i6:u19:p7_1 + i6:u19:p7_2 + -1'i7:u5:p3_8 + -1'i7:u5:p3_9 + -1'i7:u17:ConsumerDelivery_p6_0 + -1'i7:u17:p3_10 + -1'i7:u17:p6_1 = 0
invariant :i6:u11:WhatDeliver_p12_1 + -1'i6:u11:p6_2 + -1'i6:u19:p12_3 + i6:u19:p7_1 + i6:u19:p7_2 = -1
invariant :i10:u1:DeliveryNote_p22_12 + -1'i10:u1:p8_2 = 0
invariant :u14:Status_p21_5 + -1'u14:p3_7 = 0
invariant :i1:u10:BrandSelection_p11_5 + i1:u10:p11_4 = 1
invariant :i6:u11:Order_p22_6 + -1'i6:u11:Organization_p22_5 = 0
invariant :i1:u6:Organization_p21_4 + -1'i1:u6:Payment_p21_3 = 0
invariant :i10:u1:Delivery_p22_8 + i10:u1:p8_2 + i10:u21:DeliveryHandlerDelivery_p8_0 + i10:u21:p8_3 = 3
invariant :i7:u17:PayReceipt_p21_15 + -1'i7:u17:p3_10 = 0
invariant :u12:p1_2 + i9:u2:p10_0 + -1'i9:u2:p10_2 + -1'i9:u2:p2_1 + -1'i9:u2:p2_2 = 1
invariant :u9:Status_p22_13 + -1'u9:p6_6 = 0
invariant :u9:ConsumerOffer_p1 + u9:p1_1 + u9:p6_6 + u9:p6_7 + i6:u11:Organization_p22_5 + -1'i6:u19:p12_3 + -1'i9:u2:p10_0 + -1'i9:u20:MerchantOffer_p2 + -1'i9:u20:p7_3 + -1'i10:u1:p12_4 + -1'i10:u1:p12_7 + -1'i10:u21:DeliveryHandlerDelivery_p8_0 + -1'i10:u21:p8_3 = -7
invariant :i1:u3:p4_4 + i1:u3:p4_5 + -1'i1:u6:p11_7 + -1'i1:u6:p3_5 + -1'i1:u10:p11_4 = -2
invariant :i9:u2:Order_p20 + -1'i9:u2:p2_2 = 0
invariant :i4:u8:p11_13 + -1'i4:u8:p5_3 + -1'i7:u5:p11_11 + i7:u5:p3_9 = 0
invariant :i6:u11:Delivery_p22_4 + -1'i6:u11:Organization_p22_5 = 0
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
31 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.340777,21948,1,0,10673,4450,786,14451,651,11421,20322
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X((X("((i10.u1.DeliveryResponse_p12_6>=1)&&(u9.p6_5>=1))"))U("(u14.p3_6>=1)")))))
Formula 1 simplified : !FX(X"((i10.u1.DeliveryResponse_p12_6>=1)&&(u9.p6_5>=1))" U "(u14.p3_6>=1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,0.411458,24248,1,0,16506,4649,820,18301,652,12895,32177
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("((((i1.u3.Payment_p21_1>=1)&&(i1.u3.Organization_p21_2>=1))&&(i1.u3.p4_5>=1))&&(i1.u6.p11_7>=1))"))))
Formula 2 simplified : !FG"((((i1.u3.Payment_p21_1>=1)&&(i1.u3.Organization_p21_2>=1))&&(i1.u3.p4_5>=1))&&(i1.u6.p11_7>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
264 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,3.05467,119640,1,0,253634,6432,869,203152,656,34159,269563
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(F(G(F("(u9.p6_7>=1)")))))))
Formula 3 simplified : !FXFGF"(u9.p6_7>=1)"
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
36 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,3.41258,132524,1,0,293327,6717,888,220823,657,37372,305290
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(X(("((((i4.u16.p5_1>=1)&&(i4.u16.Status_p21_9>=1))&&(i4.u16.Organization_p21_8>=1))&&(i4.u16.Payment_p21_7>=1))")U("(u18.p6_3>=1)"))))))
Formula 4 simplified : !XXX("((((i4.u16.p5_1>=1)&&(i4.u16.Status_p21_9>=1))&&(i4.u16.Organization_p21_8>=1))&&(i4.u16.Payment_p21_7>=1))" U "(u18.p6_3>=1)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,3.41519,133224,1,0,293382,6717,927,220870,670,37375,305511
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F("((i7.u5.p3_9>=1)&&(i4.u8.PaymentResponse_p11_12>=1))"))))
Formula 5 simplified : !GF"((i7.u5.p3_9>=1)&&(i4.u8.PaymentResponse_p11_12>=1))"
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]
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
38 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.79765,146424,1,0,329499,6749,961,240962,670,37969,344953
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(F(G(G("(u9.p6_7>=1)")))))))
Formula 6 simplified : !XGFG"(u9.p6_7>=1)"
Compilation finished in 1775 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X([](<>([]([]((LTLAP4==true)))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 28 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X([](<>([](X((LTLAP8==true)))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 15 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X((LTLAP6==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 19 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X((<>((LTLAP9==true)))U(X(X((LTLAP10==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
175 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,5.53727,197336,1,0,453480,8133,976,323453,670,57880,467145
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(F(G(X("((i7.u17.p6_1>=1)&&(i6.u11.p12_0>=1))")))))))
Formula 7 simplified : !XGFGX"((i7.u17.p6_1>=1)&&(i6.u11.p12_0>=1))"
3 unique states visited
2 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,5.55125,198068,1,0,454302,8147,1006,325237,670,58027,468585
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X("(u18.p6_3>=1)")))
Formula 8 simplified : !X"(u18.p6_3>=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,5.5522,198068,1,0,454322,8147,1006,325261,670,58053,468639
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((F("(((u9.Status_p22_13>=1)&&(u9.DeliveryNote_p22_14>=1))&&(u9.p6_6>=1))"))U(X(X("((i10.u21.DeliveryHandlerDelivery_p8_0>=1)&&(i10.u1.DeliveryRequest_p12_5>=1))"))))))
Formula 9 simplified : !X(F"(((u9.Status_p22_13>=1)&&(u9.DeliveryNote_p22_14>=1))&&(u9.p6_6>=1))" U XX"((i10.u21.DeliveryHandlerDelivery_p8_0>=1)&&(i10.u1.DeliveryRequest_p12_5>=1))")
443 unique states visited
0 strongly connected components in search stack
442 transitions explored
113 items max in DFS search stack
67 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.22415,217792,1,0,502151,8242,1048,367387,677,59405,546267
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("((i6.u11.p6_2>=1)&&(i6.u19.HowDeliver_p12_2>=1))"))
Formula 10 simplified : !"((i6.u11.p6_2>=1)&&(i6.u19.HowDeliver_p12_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,6.22525,218056,1,0,502151,8242,1057,367387,677,59405,546278
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("((((((u18.Status_p22_7>=1)&&(i6.u11.Order_p22_6>=1))&&(i6.u11.Organization_p22_5>=1))&&(i6.u11.Delivery_p22_4>=1))&&(u18.p6_4>=1))&&(i10.u1.p12_4>=1))"))
Formula 11 simplified : !"((((((u18.Status_p22_7>=1)&&(i6.u11.Order_p22_6>=1))&&(i6.u11.Organization_p22_5>=1))&&(i6.u11.Delivery_p22_4>=1))&&(u18.p6_4>=1))&&(i10.u1.p12_4>=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,6.22642,218056,1,0,502151,8242,1090,367387,683,59405,546290
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(G(("((i9.u20.MerchantOffer_p2>=1)&&(i9.u2.OfferRequest_p10>=1))")U("((((i10.u1.p12_7>=1)&&(i10.u1.DeliveryNote_p22_12>=1))&&(i10.u1.Status_p22_11>=1))&&(i10.u1.p8_2>=1))"))))))
Formula 12 simplified : !GXG("((i9.u20.MerchantOffer_p2>=1)&&(i9.u2.OfferRequest_p10>=1))" U "((((i10.u1.p12_7>=1)&&(i10.u1.DeliveryNote_p22_12>=1))&&(i10.u1.Status_p22_11>=1))&&(i10.u1.p8_2>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,6.22916,218236,1,0,502151,8242,1147,367387,697,59408,546325
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((i4.u7.PaymentHandlerPayment_p5_0>=1)&&(i4.u16.PaymentRequest_p11_9>=1))"))
Formula 13 simplified : !"((i4.u7.PaymentHandlerPayment_p5_0>=1)&&(i4.u16.PaymentRequest_p11_9>=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,6.22956,218236,1,0,502151,8242,1158,367387,697,59408,546338
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((G(G("(i6.u19.p7_1>=1)")))U(G(F("(i0.u13.p3_3>=1)"))))))
Formula 14 simplified : !X(G"(i6.u19.p7_1>=1)" U GF"(i0.u13.p3_3>=1)")
LTSmin run took 795 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, X(([]([]((LTLAP16==true))))U([](<>((LTLAP17==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
45 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.67356,235640,1,0,550417,8253,1198,391607,697,59489,592471
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(F(X(("((((((u18.Status_p22_7>=1)&&(i6.u11.Order_p22_6>=1))&&(i6.u11.Organization_p22_5>=1))&&(i6.u11.Delivery_p22_4>=1))&&(u18.p6_4>=1))&&(i10.u1.p12_4>=1))")U("((((((u12.Delivery_p20_10>=1)&&(u12.Payment_p20_9>=1))&&(u12.Order_p20_8>=1))&&(u12.Organization_p20_7>=1))&&(u12.Status_p20_6>=1))&&(u12.p1_3>=1))"))))))
Formula 15 simplified : !GFX("((((((u18.Status_p22_7>=1)&&(i6.u11.Order_p22_6>=1))&&(i6.u11.Organization_p22_5>=1))&&(i6.u11.Delivery_p22_4>=1))&&(u18.p6_4>=1))&&(i10.u1.p12_4>=1))" U "((((((u12.Delivery_p20_10>=1)&&(u12.Payment_p20_9>=1))&&(u12.Order_p20_8>=1))&&(u12.Organization_p20_7>=1))&&(u12.Status_p20_6>=1))&&(u12.p1_3>=1))")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13 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.81247,240912,1,0,564907,8279,1248,398544,714,60223,604525
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527941939422

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 02, 2018 12:18:49 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/, -louvain, -smt]
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Jun 02, 2018 12:18:49 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 57 ms
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
Begin: Sat Jun 2 12:18:49 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 12:18:49 2018
network size: 111 nodes, 496 links, 90 weight
quality increased from -0.011965 to 0.617442
end computation: Sat Jun 2 12:18:49 2018
level 1:
start computation: Sat Jun 2 12:18:49 2018
network size: 22 nodes, 110 links, 90 weight
quality increased from 0.617442 to 0.709745
end computation: Sat Jun 2 12:18:49 2018
level 2:
start computation: Sat Jun 2 12:18:49 2018
network size: 11 nodes, 53 links, 90 weight
quality increased from 0.709745 to 0.709745
end computation: Sat Jun 2 12:18:49 2018
End: Sat Jun 2 12:18:49 2018
Total duration: 0 sec
0.709745
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 38 ms
Jun 02, 2018 12:18:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 12:18:50 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Jun 02, 2018 12:18:50 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 45 transitions.
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 67 place invariants in 85 ms
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 111 variables to be positive in 362 ms
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/45 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
Jun 02, 2018 12:18:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:18:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 45 transitions.
Jun 02, 2018 12:18:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1407 ms. Total solver calls (SAT/UNSAT): 372(362/10)
Jun 02, 2018 12:18:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 45 transitions.
Jun 02, 2018 12:18:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1032 ms. Total solver calls (SAT/UNSAT): 51(0/51)
Jun 02, 2018 12:18:53 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3641ms 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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is IOTPpurchase-PT-C03M03P03D03, 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 r213-smll-152732264200322"
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 ;