fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r213-smll-152732264200324
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for IOTPpurchase-PT-C05M04P03D02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15751.260 32359.00 65601.00 389.80 TFFFTFTTTFFTFFTF normal

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 236K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 18K 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.3K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-C05M04P03D02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264200324
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527941990857

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/graph7472308142314745699.txt, -o, /tmp/graph7472308142314745699.bin, -w, /tmp/graph7472308142314745699.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/graph7472308142314745699.bin, -l, -1, -v, -w, /tmp/graph7472308142314745699.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 : !((F(X(G(F(F("(i6.u10.p5_4>=1)")))))))
Formula 0 simplified : !FXGF"(i6.u10.p5_4>=1)"
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
invariant :i0:u0:BrandList_p11_2 + i0:u18:p4_1 + i0:u18:p4_2 + i3:u22:p7_1 + i3:u22:p7_2 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p11_7 + i4:u16:p3_3 + i4:u16:p3_4 + i4:u17:p3_5 + i9:u14:MerchantPayment_p4_0 + i9:u14:p2_1 + i9:u14:p2_2 + i9:u23:MerchantOffer_p2 + i9:u23:p7_3 = 5
invariant :i6:u11:PaymentNote_p21_13 + -1'i6:u11:p5_3 = 0
invariant :i3:u4:Delivery_p22_4 + -1'i3:u21:p6_3 + -1'i3:u21:p6_4 = 0
invariant :u15:Delivery_p20_10 + -1'u15:p1_3 = 0
invariant :i3:u13:WhatDeliver_p12_1 + -1'i4:u6:MerchantDelivery_p4_6 + -1'i4:u6:p11_7 + i4:u17:Payment_p21_3 + i5:u20:ConsumerDelivery_p6_0 + i5:u20:p3_10 + i5:u20:p6_1 + -1'i6:u11:p11_13 + i6:u11:p5_3 + -1'i6:u19:p11_8 + i6:u19:p5_1 + i6:u19:p5_2 = -3
invariant :i9:u14:Organization_p20_2 + -1'i9:u14:p2_2 = 0
invariant :i6:u19:Status_p21_9 + -1'i6:u19:p5_1 = 0
invariant :i3:u22:Order_p22_3 + -1'i3:u22:p7_2 = 0
invariant :u9:PaySchemeData_p21_6 + -1'u9:p3_7 = 0
invariant :i9:u14:OfferResponce_p10 + i9:u14:p10_2 = 1
invariant :u15:p1_2 + i9:u5:p10_0 + -1'i9:u14:p10_2 + -1'i9:u14:p2_1 + -1'i9:u14:p2_2 = 1
invariant :i4:u6:Organization_p21_2 + -1'i4:u6:p4_5 = 0
invariant :i3:u13:p12_0 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p11_7 + -1'i4:u17:Payment_p21_3 + -1'i5:u20:ConsumerDelivery_p6_0 + -1'i5:u20:p3_10 + -1'i5:u20:p6_1 + i6:u11:p11_13 + -1'i6:u11:p5_3 + i6:u19:p11_8 + -1'i6:u19:p5_1 + -1'i6:u19:p5_2 = 4
invariant :i3:u22:Delivery_p22_1 + -1'i3:u22:p7_2 = 0
invariant :u15:Status_p20_6 + -1'u15:p1_3 = 0
invariant :i0:u0:p4_3 + i0:u18:p4_1 + i0:u18:p4_2 + i3:u22:p7_1 + i3:u22:p7_2 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p4_4 + i4:u6:p4_5 + i9:u14:MerchantPayment_p4_0 + i9:u14:p2_1 + i9:u14:p2_2 + i9:u23:MerchantOffer_p2 + i9:u23:p7_3 = 4
invariant :i6:u19:Payment_p21_7 + -1'i6:u19:p5_1 = 0
invariant :i5:u8:p11_11 + -1'i5:u8:p3_9 + -1'i6:u11:p11_13 + i6:u11:p5_3 = 0
invariant :i3:u4:HowDeliver_p12_2 + -1'i3:u4:p6_2 + i3:u22:p7_1 + i3:u22:p7_2 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p11_7 + -1'i4:u17:Payment_p21_3 + -1'i5:u20:ConsumerDelivery_p6_0 + -1'i5:u20:p3_10 + -1'i5:u20:p6_1 + i6:u11:p11_13 + -1'i6:u11:p5_3 + i6:u19:p11_8 + -1'i6:u19:p5_1 + -1'i6:u19:p5_2 = 3
invariant :i6:u10:PaymentHandlerPayment_p5_0 + i6:u10:p5_4 + i6:u11:p5_3 + i6:u19:p5_1 + i6:u19:p5_2 = 3
invariant :u15:Organization_p20_7 + -1'u15:p1_3 = 0
invariant :u3:DeliveryResponse_p12_6 + u3:p8_1 + u3:p8_2 + i1:u2:p6_6 + i1:u2:p6_7 + i1:u12:ConsumerOffer_p1 + i1:u12:p1_1 + -1'i3:u4:p12_4 + i3:u4:p6_2 + i3:u21:p6_3 + i3:u21:p6_4 + -1'i3:u22:p7_1 + -1'i3:u22:p7_2 + -1'i4:u6:MerchantDelivery_p4_6 + -1'i4:u6:p11_7 + i4:u17:Payment_p21_3 + i5:u20:ConsumerDelivery_p6_0 + i5:u20:p3_10 + i5:u20:p6_1 + -1'i6:u11:p11_13 + i6:u11:p5_3 + -1'i6:u19:p11_8 + i6:u19:p5_1 + i6:u19:p5_2 + -1'i9:u5:p10_0 + -1'i9:u23:MerchantOffer_p2 + -1'i9:u23:p7_3 = -4
invariant :i6:u11:PaymentResponse_p11_12 + i6:u11:p11_13 = 1
invariant :i9:u14:Order_p20 + -1'i9:u14:p2_2 = 0
invariant :u3:Delivery_p22_8 + -1'u3:p8_1 = 0
invariant :i3:u4:DeliveryRequest_p12_5 + i3:u4:p12_4 = 1
invariant :i3:u21:Status_p22_7 + -1'i3:u21:p6_4 = 0
invariant :i0:u0:p11_3 + -1'i0:u18:p4_1 + -1'i0:u18:p4_2 + -1'i3:u22:p7_1 + -1'i3:u22:p7_2 + -1'i4:u6:MerchantDelivery_p4_6 + -1'i4:u6:p11_7 + -1'i4:u16:p3_3 + -1'i4:u16:p3_4 + -1'i4:u17:p3_5 + -1'i9:u14:MerchantPayment_p4_0 + -1'i9:u14:p2_1 + -1'i9:u14:p2_2 + -1'i9:u23:MerchantOffer_p2 + -1'i9:u23:p7_3 = -4
invariant :i3:u4:Organization_p22_5 + -1'i3:u21:p6_3 + -1'i3:u21:p6_4 = 0
invariant :i4:u6:Payment_p21_1 + -1'i4:u6:p4_5 = 0
invariant :i3:u4:Order_p22_6 + -1'i3:u21:p6_3 + -1'i3:u21:p6_4 = 0
invariant :i4:u17:Organization_p21_4 + -1'i4:u17:Payment_p21_3 = 0
invariant :i3:u4:p12_3 + i3:u4:p6_2 + -1'i3:u22:p7_1 + -1'i3:u22:p7_2 + -1'i4:u6:MerchantDelivery_p4_6 + -1'i4:u6:p11_7 + i4:u17:Payment_p21_3 + i5:u20:ConsumerDelivery_p6_0 + i5:u20:p3_10 + i5:u20:p6_1 + -1'i6:u11:p11_13 + i6:u11:p5_3 + -1'i6:u19:p11_8 + i6:u19:p5_1 + i6:u19:p5_2 = -2
invariant :i5:u8:p3_8 + i5:u8:p3_9 + i6:u11:p11_13 + -1'i6:u11:p5_3 + i6:u19:p11_8 + -1'i6:u19:p5_1 + -1'i6:u19:p5_2 = 2
invariant :i6:u11:PaySchemeData_p21_10 + -1'i6:u19:p5_1 + -1'i6:u19:p5_2 = 0
invariant :i5:u20:PayReceipt_p21_15 + -1'i5:u20:p3_10 = 0
invariant :u3:DeliveryNote_p22_12 + -1'u3:p8_2 = 0
invariant :i9:u14:Status_p20 + -1'i9:u14:p2_2 = 0
invariant :i0:u7:p11_0 + i0:u7:p3_2 + i3:u22:p7_1 + i3:u22:p7_2 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p11_7 + i4:u16:p3_3 + i4:u16:p3_4 + i4:u17:p3_5 + i9:u14:MerchantPayment_p4_0 + i9:u14:p2_1 + i9:u14:p2_2 + i9:u23:MerchantOffer_p2 + i9:u23:p7_3 = 6
invariant :u3:DeliveryHandlerDelivery_p8_0 + u3:p8_1 + u3:p8_2 + u3:p8_3 = 2
invariant :u3:Order_p22_10 + -1'u3:p8_1 = 0
invariant :i6:u19:Organization_p21_8 + -1'i6:u19:p5_1 = 0
invariant :i9:u5:OfferRequest_p10 + i9:u5:p10_0 = 1
invariant :i6:u11:Status_p21_11 + -1'i6:u11:p5_3 = 0
invariant :i5:u8:PaySchemeData_p11_10 + i5:u8:p3_9 + i6:u11:p11_13 + -1'i6:u11:p5_3 = 1
invariant :u9:p3_6 + u9:p3_7 + -1'i4:u17:Payment_p21_3 = 0
invariant :i9:u14:Payment_p20 + -1'i9:u14:p2_2 = 0
invariant :u3:Organization_p22_9 + -1'u3:p8_1 = 0
invariant :i5:u20:Status_p21_14 + -1'i5:u20:p3_10 = 0
invariant :u15:ConsumerPayment_p3 + u15:p1_3 + u15:p3_1 + i0:u7:p3_2 + i3:u22:p7_1 + i3:u22:p7_2 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p11_7 + i4:u16:p3_3 + i4:u16:p3_4 + i4:u17:p3_5 + i9:u14:p10_2 + i9:u14:p2_1 + i9:u14:p2_2 + i9:u23:MerchantOffer_p2 + i9:u23:p7_3 = 5
invariant :u9:Status_p21_5 + -1'u9:p3_7 = 0
invariant :i9:u14:Delivery_p20 + -1'i9:u14:p2_2 = 0
invariant :i6:u19:PaymentRequest_p11_9 + i6:u19:p11_8 = 1
invariant :i0:u7:PaidFor_p11_1 + -1'i0:u7:p3_2 + -1'i3:u22:p7_1 + -1'i3:u22:p7_2 + -1'i4:u6:MerchantDelivery_p4_6 + -1'i4:u6:p11_7 + -1'i4:u16:p3_3 + -1'i4:u16:p3_4 + -1'i4:u17:p3_5 + -1'i9:u14:MerchantPayment_p4_0 + -1'i9:u14:p2_1 + -1'i9:u14:p2_2 + -1'i9:u23:MerchantOffer_p2 + -1'i9:u23:p7_3 = -5
invariant :i6:u11:PayReceipt_p21_12 + -1'i6:u11:p5_3 = 0
invariant :u3:Status_p22_11 + -1'u3:p8_1 + -1'u3:p8_2 = 0
invariant :i4:u1:BrandSelection_p11_5 + -1'i4:u6:p11_7 + i4:u6:p4_4 + i4:u6:p4_5 + -1'i4:u17:p3_5 = -1
invariant :i3:u22:Organization_p22_2 + -1'i3:u22:p7_2 = 0
invariant :i1:u2:DeliveryNote_p22_14 + -1'i1:u2:p6_6 = 0
invariant :u15:Payment_p20_9 + -1'u15:p1_3 = 0
invariant :i4:u1:p11_4 + i4:u6:p11_7 + -1'i4:u6:p4_4 + -1'i4:u6:p4_5 + i4:u17:p3_5 = 2
invariant :i4:u6:PaymentAmount_p11_6 + i4:u6:p11_7 = 1
invariant :i1:u2:p6_5 + i1:u2:p6_6 + i1:u2:p6_7 + i1:u12:ConsumerOffer_p1 + i1:u12:p1_1 + i3:u4:p6_2 + i3:u21:p6_3 + i3:u21:p6_4 + -1'i3:u22:p7_1 + -1'i3:u22:p7_2 + -1'i4:u6:MerchantDelivery_p4_6 + -1'i4:u6:p11_7 + i4:u17:Payment_p21_3 + i5:u20:ConsumerDelivery_p6_0 + i5:u20:p3_10 + i5:u20:p6_1 + -1'i6:u11:p11_13 + i6:u11:p5_3 + -1'i6:u19:p11_8 + i6:u19:p5_1 + i6:u19:p5_2 + -1'i9:u5:p10_0 + -1'i9:u23:MerchantOffer_p2 + -1'i9:u23:p7_3 = -3
invariant :i5:u20:PaymentNote_p21_16 + -1'i5:u20:p3_10 = 0
invariant :i1:u2:Status_p22_13 + -1'i1:u2:p6_6 = 0
invariant :u15:Order_p20_8 + -1'u15:p1_3 = 0
invariant :u3:p12_7 + -1'u3:p8_1 + -1'u3:p8_2 + -1'i1:u2:p6_6 + -1'i1:u2:p6_7 + -1'i1:u12:ConsumerOffer_p1 + -1'i1:u12:p1_1 + i3:u4:p12_4 + -1'i3:u4:p6_2 + -1'i3:u21:p6_3 + -1'i3:u21:p6_4 + i3:u22:p7_1 + i3:u22:p7_2 + i4:u6:MerchantDelivery_p4_6 + i4:u6:p11_7 + -1'i4:u17:Payment_p21_3 + -1'i5:u20:ConsumerDelivery_p6_0 + -1'i5:u20:p3_10 + -1'i5:u20:p6_1 + i6:u11:p11_13 + -1'i6:u11:p5_3 + i6:u19:p11_8 + -1'i6:u19:p5_1 + -1'i6:u19:p5_2 + i9:u5:p10_0 + i9:u23:MerchantOffer_p2 + i9:u23:p7_3 = 5
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
308 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.11139,91960,1,0,199521,7733,763,223361,776,41495,153056
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("((u3.DeliveryHandlerDelivery_p8_0>=1)&&(i3.u4.DeliveryRequest_p12_5>=1))")U("((u3.DeliveryResponse_p12_6>=1)&&(i1.u2.p6_5>=1))")))
Formula 1 simplified : !("((u3.DeliveryHandlerDelivery_p8_0>=1)&&(i3.u4.DeliveryRequest_p12_5>=1))" U "((u3.DeliveryResponse_p12_6>=1)&&(i1.u2.p6_5>=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,3.11514,92864,1,0,199521,7733,790,223361,776,41495,153090
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(F(G("((i9.u14.MerchantPayment_p4_0>=1)&&(i0.u7.PaidFor_p11_1>=1))"))))))
Formula 2 simplified : !XXFG"((i9.u14.MerchantPayment_p4_0>=1)&&(i0.u7.PaidFor_p11_1>=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]
Compilation finished in 1765 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(X(<>([]((LTLAP3==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 28 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 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, -p, --pins-guards, --when, --ltl, (LTLAP4==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 19 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 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(<>((LTLAP5==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1460 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,17.7066,433336,1,0,1.09688e+06,9062,821,812331,776,70406,695634
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((i3.u22.p7_2>=1)&&(i3.u4.p12_3>=1))&&(i3.u22.Delivery_p22_1>=1))&&(i3.u22.Organization_p22_2>=1))&&(i3.u22.Order_p22_3>=1))"))
Formula 3 simplified : !"(((((i3.u22.p7_2>=1)&&(i3.u4.p12_3>=1))&&(i3.u22.Delivery_p22_1>=1))&&(i3.u22.Organization_p22_2>=1))&&(i3.u22.Order_p22_3>=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,17.7077,433864,1,0,1.09688e+06,9062,860,812331,783,70406,695647
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F("(((((u3.Order_p22_10>=1)&&(u3.Organization_p22_9>=1))&&(u3.Delivery_p22_8>=1))&&(u3.Status_p22_11>=1))&&(u3.p8_1>=1))"))))
Formula 4 simplified : !XF"(((((u3.Order_p22_10>=1)&&(u3.Organization_p22_9>=1))&&(u3.Delivery_p22_8>=1))&&(u3.Status_p22_11>=1))&&(u3.p8_1>=1))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
317 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,20.8822,508652,1,0,1.28709e+06,9092,919,922581,800,72018,831150
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(u15.ConsumerPayment_p3>=1)"))
Formula 5 simplified : !"(u15.ConsumerPayment_p3>=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,20.8827,508652,1,0,1.28709e+06,9092,922,922581,800,72018,831158
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(F(F("(i3.u21.p6_3>=1)")))))
Formula 6 simplified : !F"(i3.u21.p6_3>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
229 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.1707,567900,1,0,1.43403e+06,9093,957,999247,801,72210,943744
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(i1.u12.ConsumerOffer_p1>=1)"))
Formula 7 simplified : !"(i1.u12.ConsumerOffer_p1>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.1711,568164,1,0,1.43403e+06,9093,962,999247,801,72210,943756
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G(F("(i3.u22.p7_1>=1)")))))
Formula 8 simplified : !XGF"(i3.u22.p7_1>=1)"
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
177 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,24.9422,610656,1,0,1.53485e+06,9111,978,1.0501e+06,801,72478,1019255
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((("(i5.u20.ConsumerDelivery_p6_0>=1)")U("((((u3.p12_7>=1)&&(u3.DeliveryNote_p22_12>=1))&&(u3.Status_p22_11>=1))&&(u3.p8_2>=1))"))U(("(((((u3.Order_p22_10>=1)&&(u3.Organization_p22_9>=1))&&(u3.Delivery_p22_8>=1))&&(u3.Status_p22_11>=1))&&(u3.p8_1>=1))")U("((i4.u6.MerchantDelivery_p4_6>=1)&&(i3.u13.WhatDeliver_p12_1>=1))")))))
Formula 9 simplified : !X(("(i5.u20.ConsumerDelivery_p6_0>=1)" U "((((u3.p12_7>=1)&&(u3.DeliveryNote_p22_12>=1))&&(u3.Status_p22_11>=1))&&(u3.p8_2>=1))") U ("(((((u3.Order_p22_10>=1)&&(u3.Organization_p22_9>=1))&&(u3.Delivery_p22_8>=1))&&(u3.Status_p22_11>=1))&&(u3.p8_1>=1))" U "((i4.u6.MerchantDelivery_p4_6>=1)&&(i3.u13.WhatDeliver_p12_1>=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,24.9508,612048,1,0,1.53495e+06,9112,1063,1.0502e+06,823,72486,1019613
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(X(("((i5.u20.p6_1>=1)&&(i3.u13.p12_0>=1))")U("((((((i3.u21.Status_p22_7>=1)&&(i3.u4.Order_p22_6>=1))&&(i3.u4.Organization_p22_5>=1))&&(i3.u4.Delivery_p22_4>=1))&&(i3.u21.p6_4>=1))&&(i3.u4.p12_4>=1))"))))))
Formula 10 simplified : !FGX("((i5.u20.p6_1>=1)&&(i3.u13.p12_0>=1))" U "((((((i3.u21.Status_p22_7>=1)&&(i3.u4.Order_p22_6>=1))&&(i3.u4.Organization_p22_5>=1))&&(i3.u4.Delivery_p22_4>=1))&&(i3.u21.p6_4>=1))&&(i3.u4.p12_4>=1))")
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
7 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,25.0173,613876,1,0,1.53987e+06,9135,1123,1.05856e+06,832,72846,1026175
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("(i4.u16.p3_3>=1)"))U("((u15.p1_2>=1)&&(i9.u14.p10_2>=1))")))
Formula 11 simplified : !(F"(i4.u16.p3_3>=1)" U "((u15.p1_2>=1)&&(i9.u14.p10_2>=1))")
39 unique states visited
0 strongly connected components in search stack
38 transitions explored
20 items max in DFS search stack
22 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,25.2454,620736,1,0,1.55552e+06,9264,1174,1.06863e+06,832,74744,1057673
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(G(X(("(i4.u16.p3_3>=1)")U("(u9.p3_6>=1)"))))))
Formula 12 simplified : !GX("(i4.u16.p3_3>=1)" U "(u9.p3_6>=1)")
149 unique states visited
149 strongly connected components in search stack
150 transitions explored
149 items max in DFS search stack
160 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,26.845,657952,1,0,1.64658e+06,9505,1197,1.17982e+06,832,78858,1146495
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F(G(("(i0.u18.p4_1>=1)")U("((((i4.u6.Payment_p21_1>=1)&&(i4.u6.Organization_p21_2>=1))&&(i4.u6.p4_5>=1))&&(i4.u6.p11_7>=1))"))))))
Formula 13 simplified : !GFG("(i0.u18.p4_1>=1)" U "((((i4.u6.Payment_p21_1>=1)&&(i4.u6.Organization_p21_2>=1))&&(i4.u6.p4_5>=1))&&(i4.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
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,26.9071,660256,1,0,1.65006e+06,9561,1252,1.19662e+06,841,79637,1151092
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F((X("((i5.u8.p3_8>=1)&&(i5.u8.PaySchemeData_p11_10>=1))"))U(X("(i4.u16.p3_3>=1)"))))))
Formula 14 simplified : !F(X"((i5.u8.p3_8>=1)&&(i5.u8.PaySchemeData_p11_10>=1))" U X"(i4.u16.p3_3>=1)")
2 unique states visited
0 strongly connected components in search stack
1 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,26.9077,660520,1,0,1.65006e+06,9561,1255,1.19662e+06,841,79637,1151092
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((("(((((((i9.u14.Status_p20>=1)&&(i9.u14.Organization_p20_2>=1))&&(i9.u14.Order_p20>=1))&&(i9.u14.Payment_p20>=1))&&(i9.u14.Delivery_p20>=1))&&(i9.u14.p2_2>=1))&&(i9.u14.OfferResponce_p10>=1))")U(F(G("((((i6.u19.p5_1>=1)&&(i6.u19.Status_p21_9>=1))&&(i6.u19.Organization_p21_8>=1))&&(i6.u19.Payment_p21_7>=1))")))))
Formula 15 simplified : !("(((((((i9.u14.Status_p20>=1)&&(i9.u14.Organization_p20_2>=1))&&(i9.u14.Order_p20>=1))&&(i9.u14.Payment_p20>=1))&&(i9.u14.Delivery_p20>=1))&&(i9.u14.p2_2>=1))&&(i9.u14.OfferResponce_p10>=1))" U FG"((((i6.u19.p5_1>=1)&&(i6.u19.Status_p21_9>=1))&&(i6.u19.Organization_p21_8>=1))&&(i6.u19.Payment_p21_7>=1))")
LTSmin run took 21786 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-04 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, -p, --pins-guards, --when, --ltl, ((LTLAP21==true))U(<>([]((LTLAP22==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 19 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527942023216

--------------------
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:19:53 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:19:53 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 12:19:53 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
Jun 02, 2018 12:19:53 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 111 places.
Jun 02, 2018 12:19:53 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Jun 02, 2018 12:19:53 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 02, 2018 12:19:53 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 12:19:53 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 51 ms
Jun 02, 2018 12:19:54 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 26 ms
Begin: Sat Jun 2 12:19:54 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 12:19:54 2018
network size: 111 nodes, 496 links, 90 weight
quality increased from -0.011965 to 0.607757
end computation: Sat Jun 2 12:19:54 2018
level 1:
start computation: Sat Jun 2 12:19:54 2018
network size: 24 nodes, 124 links, 90 weight
quality increased from 0.607757 to 0.705331
end computation: Sat Jun 2 12:19:54 2018
level 2:
start computation: Sat Jun 2 12:19:54 2018
network size: 10 nodes, 46 links, 90 weight
quality increased from 0.705331 to 0.705331
end computation: Sat Jun 2 12:19:54 2018
End: Sat Jun 2 12:19:54 2018
Total duration: 0 sec
0.705331
Jun 02, 2018 12:19:54 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 12:19:54 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
Jun 02, 2018 12:19:54 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 12:19:54 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 02, 2018 12:19:54 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 12:19:54 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 45 transitions.
Jun 02, 2018 12:19:54 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 67 place invariants in 37 ms
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 111 variables to be positive in 468 ms
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:19:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 45 transitions.
Jun 02, 2018 12:19:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1604 ms. Total solver calls (SAT/UNSAT): 451(442/9)
Jun 02, 2018 12:19:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 45 transitions.
Jun 02, 2018 12:19:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 962 ms. Total solver calls (SAT/UNSAT): 52(0/52)
Jun 02, 2018 12:19:58 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3999ms 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-C05M04P03D02"
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-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 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-C05M04P03D02, 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-152732264200324"
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 ;