Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145000370.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r096-oct2-158940145000370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 13 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 60K Apr 27 14:36 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 IOTPpurchase-PT-C05M04P03D02-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-15

=== Now, execution of the tool begins

BK_START 1589573413651

[2020-05-15 20:10:15] [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, -timeout, 3600]
[2020-05-15 20:10:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:10:15] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-05-15 20:10:15] [INFO ] Transformed 111 places.
[2020-05-15 20:10:15] [INFO ] Transformed 45 transitions.
[2020-05-15 20:10:15] [INFO ] Parsed PT model containing 111 places and 45 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 317 steps, including 0 resets, run visited all 39 properties in 8 ms. (steps per millisecond=39 )
[2020-05-15 20:10:15] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-15 20:10:15] [INFO ] Flatten gal took : 40 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:10:15] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:10:15] [INFO ] Applying decomposition
[2020-05-15 20:10:15] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph8706166345408169637.txt, -o, /tmp/graph8706166345408169637.bin, -w, /tmp/graph8706166345408169637.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8706166345408169637.bin, -l, -1, -v, -w, /tmp/graph8706166345408169637.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:10:16] [INFO ] Input system was already deterministic with 45 transitions.
[2020-05-15 20:10:16] [INFO ] Decomposing Gal with order
[2020-05-15 20:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:10:16] [INFO ] Flatten gal took : 69 ms
[2020-05-15 20:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 20:10:16] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-15 20:10:16] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols

[2020-05-15 20:10:16] [INFO ] Computed 67 place invariants in 14 ms
inv : BrandList_p11_2 + p11_7 + p3_3 + p3_4 + p3_5 - p4_3 - p4_4 - p4_5 = 1
inv : PayReceipt_p21_12 - p5_3 = 0
inv : Delivery_p20 - p2_2 = 0
inv : Delivery_p22_1 - p7_2 = 0
inv : DeliveryNote_p22_14 - p6_6 = 0
inv : DeliveryNote_p22_12 - p8_2 = 0
inv : p12_4 + p12_7 + p6_5 - p8_1 - p8_2 = 2
inv : PaymentResponse_p11_12 - p11_8 - p3_8 - p3_9 + p5_1 + p5_2 + p5_3 = -1
inv : Status_p21_11 - p5_3 = 0
inv : Status_p22_11 - p8_1 - p8_2 = 0
inv : Delivery_p22_4 - p6_3 - p6_4 = 0
inv : PaymentAmount_p11_6 + p11_7 = 1
inv : OfferResponce_p10 + p10_2 = 1
inv : Organization_p22_9 - p8_1 = 0
inv : Order_p22_6 - p6_3 - p6_4 = 0
inv : p11_11 + p11_8 + p3_8 - p5_1 - p5_2 = 2
inv : Organization_p20_2 - p2_2 = 0
inv : p11_3 - p11_7 - p3_3 - p3_4 - p3_5 + p4_3 + p4_4 + p4_5 = 0
inv : Organization_p22_2 - p7_2 = 0
inv : DeliveryResponse_p12_6 + p12_7 = 1
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + ConsumerPayment_p3 + Delivery_p20_10 + p1_1 - p10_0 + p10_2 + p2_1 + p2_2 + p3_1 + p3_10 + p3_2 + p3_3 + p3_4 + p3_5 + p3_6 + p3_7 + p3_8 + p3_9 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 4
inv : PaidFor_p11_1 - p11_7 - p3_2 - p3_3 - p3_4 - p3_5 + p4_1 + p4_2 + p4_3 + p4_4 + p4_5 = -1
inv : WhatDeliver_p12_1 - p12_3 - p6_2 + p7_1 + p7_2 = -1
inv : Order_p22_10 - p8_1 = 0
inv : PaymentHandlerPayment_p5_0 + p5_1 + p5_2 + p5_3 + p5_4 = 3
inv : Status_p22_13 - p6_6 = 0
inv : OfferRequest_p10 + p10_0 = 1
inv : Payment_p20 - p2_2 = 0
inv : Status_p21_9 - p5_1 = 0
inv : Status_p22_7 - p6_4 = 0
inv : PaymentNote_p21_16 - p3_10 = 0
inv : p1_2 + p10_0 - p10_2 - p2_1 - p2_2 = 1
inv : Status_p21_14 - p3_10 = 0
inv : Payment_p21_7 - p5_1 = 0
inv : Status_p21_5 - p3_7 = 0
inv : Organization_p21_4 - p3_6 - p3_7 = 0
inv : PaySchemeData_p21_10 - p5_1 - p5_2 = 0
inv : -ConsumerDelivery_p6_0 + MerchantDelivery_p4_6 + p11_7 - p12_3 - p3_10 - p3_6 - p3_7 - p3_8 - p3_9 - p6_1 - p6_2 + p7_1 + p7_2 = 0
inv : Organization_p21_2 - p4_5 = 0
inv : PaySchemeData_p11_10 - p11_8 - p3_8 + p5_1 + p5_2 = -1
inv : DeliveryHandlerDelivery_p8_0 + p8_1 + p8_2 + p8_3 = 2
inv : Delivery_p22_8 - p8_1 = 0
inv : p11_13 + p11_8 + p3_8 + p3_9 - p5_1 - p5_2 - p5_3 = 2
inv : Status_p20 - p2_2 = 0
inv : PayReceipt_p21_15 - p3_10 = 0
inv : Payment_p21_3 - p3_6 - p3_7 = 0
inv : Order_p22_3 - p7_2 = 0
inv : p11_4 + p11_7 + p3_5 - p4_4 - p4_5 = 2
inv : HowDeliver_p12_2 + p12_3 = 1
inv : PaymentRequest_p11_9 + p11_8 = 1
inv : Organization_p22_5 - p6_3 - p6_4 = 0
inv : -ConsumerOffer_p1 + MerchantOffer_p2 - p1_1 + p10_0 + p12_3 - p6_3 - p6_4 - p6_5 - p6_6 - p6_7 + p7_3 = 1
inv : Organization_p21_8 - p5_1 = 0
inv : PaySchemeData_p21_6 - p3_7 = 0
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + ConsumerPayment_p3 + Order_p20_8 + p1_1 - p10_0 + p10_2 + p2_1 + p2_2 + p3_1 + p3_10 + p3_2 + p3_3 + p3_4 + p3_5 + p3_6 + p3_7 + p3_8 + p3_9 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 4
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + MerchantPayment_p4_0 + p1_1 - p10_0 - p11_7 + p2_1 + p2_2 + p3_10 + p3_6 + p3_7 + p3_8 + p3_9 + p4_1 + p4_2 + p4_3 + p4_4 + p4_5 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 3
inv : Order_p20 - p2_2 = 0
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + ConsumerPayment_p3 + p1_1 + p1_3 - p10_0 + p10_2 + p2_1 + p2_2 + p3_1 + p3_10 + p3_2 + p3_3 + p3_4 + p3_5 + p3_6 + p3_7 + p3_8 + p3_9 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 4
inv : DeliveryRequest_p12_5 - p12_7 - p6_5 + p8_1 + p8_2 = -1
inv : p12_0 + p12_3 + p6_2 - p7_1 - p7_2 = 2
inv : Payment_p21_1 - p4_5 = 0
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + ConsumerPayment_p3 + Payment_p20_9 + p1_1 - p10_0 + p10_2 + p2_1 + p2_2 + p3_1 + p3_10 + p3_2 + p3_3 + p3_4 + p3_5 + p3_6 + p3_7 + p3_8 + p3_9 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 4
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + ConsumerPayment_p3 + Organization_p20_7 + p1_1 - p10_0 + p10_2 + p2_1 + p2_2 + p3_1 + p3_10 + p3_2 + p3_3 + p3_4 + p3_5 + p3_6 + p3_7 + p3_8 + p3_9 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 4
inv : BrandSelection_p11_5 - p11_7 - p3_5 + p4_4 + p4_5 = -1
inv : ConsumerDelivery_p6_0 + ConsumerOffer_p1 + ConsumerPayment_p3 + Status_p20_6 + p1_1 - p10_0 + p10_2 + p2_1 + p2_2 + p3_1 + p3_10 + p3_2 + p3_3 + p3_4 + p3_5 + p3_6 + p3_7 + p3_8 + p3_9 + p6_1 + p6_2 + p6_3 + p6_4 + p6_5 + p6_6 + p6_7 = 4
inv : p11_0 + p11_7 + p3_2 + p3_3 + p3_4 + p3_5 - p4_1 - p4_2 - p4_3 - p4_4 - p4_5 = 2
inv : PaymentNote_p21_13 - p5_3 = 0
Total of 67 invariants.
[2020-05-15 20:10:16] [INFO ] Computed 67 place invariants in 17 ms
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !(((!((X("((i7.u10.PaymentResponse_p11_12>=1)&&(i3.u8.p3_9>=1))"))U((X(G("((((((i6.u15.Organization_p21_4>=1)&&(u9.PaySchemeData_p21_6>=1))&&(i6.u15.Payment_p21_3>=1))&&(u9.Status_p21_5>=1))&&(i7.u18.p11_8>=1))&&(u9.p3_7>=1))")))&&(G("((i7.u10.PaymentResponse_p11_12<1)||(i3.u8.p3_9<1))")))))&&(!(F("((i6.u0.BrandList_p11_2>=1)&&(i6.u0.p3_2>=1))")))))
Formula 0 simplified : !(!(X"((i7.u10.PaymentResponse_p11_12>=1)&&(i3.u8.p3_9>=1))" U (XG"((((((i6.u15.Organization_p21_4>=1)&&(u9.PaySchemeData_p21_6>=1))&&(i6.u15.Payment_p21_3>=1))&&(u9.Status_p21_5>=1))&&(i7.u18.p11_8>=1))&&(u9.p3_7>=1))" & G"((i7.u10.PaymentResponse_p11_12<1)||(i3.u8.p3_9<1))")) & !F"((i6.u0.BrandList_p11_2>=1)&&(i6.u0.p3_2>=1))")
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 20:10:16] [INFO ] Proved 111 variables to be positive in 337 ms
[2020-05-15 20:10:16] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2020-05-15 20:10:16] [INFO ] Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:10:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:10:16] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2020-05-15 20:10:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
35 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.36899,29488,1,0,23431,9626,763,33222,830,27789,37080
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(X(X(!(X(G((F("((((u21.DeliveryNote_p22_12>=1)&&(u21.Status_p22_11>=1))&&(u21.p12_7>=1))&&(u21.p8_2>=1))"))||("((((((i4.u4.Delivery_p20_10>=1)&&(i4.u4.Order_p20_8>=1))&&(i4.u4.Organization_p20_7>=1))&&(i4.u4.Payment_p20_9>=1))&&(i4.u4.Status_p20_6>=1))&&(i4.u4.p1_3>=1))"))))))))U(!(G(F("((((u21.DeliveryNote_p22_12>=1)&&(u21.Status_p22_11>=1))&&(u21.p12_7>=1))&&(u21.p8_2>=1))"))))))
Formula 1 simplified : !(!XX!XG("((((((i4.u4.Delivery_p20_10>=1)&&(i4.u4.Order_p20_8>=1))&&(i4.u4.Organization_p20_7>=1))&&(i4.u4.Payment_p20_9>=1))&&(i4.u4.Status_p20_6>=1))&&(i4.u4.p1_3>=1))" | F"((((u21.DeliveryNote_p22_12>=1)&&(u21.Status_p22_11>=1))&&(u21.p12_7>=1))&&(u21.p8_2>=1))") U !GF"((((u21.DeliveryNote_p22_12>=1)&&(u21.Status_p22_11>=1))&&(u21.p12_7>=1))&&(u21.p8_2>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
111 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.48135,69644,1,0,94200,16698,802,189702,844,95244,105635
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(F((((((G(((("((i4.u4.p1_2>=1)&&(i4.u4.p10_2>=1))")U(("(((((i7.u10.PayReceipt_p21_12>=1)&&(i7.u10.PaymentNote_p21_13>=1))&&(i7.u10.Status_p21_11>=1))&&(i7.u10.p11_13>=1))&&(i7.u10.p5_3>=1))")U("((i1.u13.p12_0>=1)&&(i3.u2.p6_1>=1))")))&&("(i6.u1.p11_4>=1)"))&&("(i6.u15.p3_4>=1)")))&&("(i7.u10.PayReceipt_p21_12>=1)"))&&("(i7.u10.PaymentNote_p21_13>=1)"))&&("(i7.u10.Status_p21_11>=1)"))&&("(i7.u10.p11_13>=1)"))&&("(i7.u10.p5_3>=1)"))))))
Formula 2 simplified : !XGF("(i7.u10.PayReceipt_p21_12>=1)" & "(i7.u10.PaymentNote_p21_13>=1)" & "(i7.u10.Status_p21_11>=1)" & "(i7.u10.p5_3>=1)" & "(i7.u10.p11_13>=1)" & G("(i6.u1.p11_4>=1)" & "(i6.u15.p3_4>=1)" & ("((i4.u4.p1_2>=1)&&(i4.u4.p10_2>=1))" U ("(((((i7.u10.PayReceipt_p21_12>=1)&&(i7.u10.PaymentNote_p21_13>=1))&&(i7.u10.Status_p21_11>=1))&&(i7.u10.p11_13>=1))&&(i7.u10.p5_3>=1))" U "((i1.u13.p12_0>=1)&&(i3.u2.p6_1>=1))"))))
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 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,1.85248,79224,1,0,115141,16929,1042,218272,892,96771,135656
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(G((X(X(X(F(X("(u21.p8_3>=1)"))))))&&(X("(i6.u17.p4_4>=1)")))))))
Formula 3 simplified : XG(XXXFX"(u21.p8_3>=1)" & X"(i6.u17.p4_4>=1)")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.85356,79224,1,0,115150,16934,1055,218274,892,96778,135693
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(!(X((F("((i7.u10.PaymentResponse_p11_12<1)||(i3.u8.p3_9<1))"))||(G("((((i6.u17.Organization_p21_2>=1)&&(i6.u17.Payment_p21_1>=1))&&(i6.u17.p11_7>=1))&&(i6.u17.p4_5>=1))"))))))&&(X("((((((i1.u14.Delivery_p22_4>=1)&&(i1.u14.Order_p22_6>=1))&&(i1.u14.Organization_p22_5>=1))&&(u20.Status_p22_7>=1))&&(u21.p12_4>=1))&&(u20.p6_4>=1))"))))
Formula 4 simplified : !(X!X(F"((i7.u10.PaymentResponse_p11_12<1)||(i3.u8.p3_9<1))" | G"((((i6.u17.Organization_p21_2>=1)&&(i6.u17.Payment_p21_1>=1))&&(i6.u17.p11_7>=1))&&(i6.u17.p4_5>=1))") & X"((((((i1.u14.Delivery_p22_4>=1)&&(i1.u14.Order_p22_6>=1))&&(i1.u14.Organization_p22_5>=1))&&(u20.Status_p22_7>=1))&&(u21.p12_4>=1))&&(u20.p6_4>=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,1.85543,79488,1,0,115175,16940,1093,218303,897,96821,135752
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((("((i3.u8.PaySchemeData_p11_10>=1)&&(i3.u8.p3_8>=1))")U(((G(X("((i3.u8.PaySchemeData_p11_10>=1)&&(i3.u8.p3_8>=1))")))||(G(!(G("(((((i7.u10.PayReceipt_p21_12>=1)&&(i7.u10.PaymentNote_p21_13>=1))&&(i7.u10.Status_p21_11>=1))&&(i7.u10.p11_13>=1))&&(i7.u10.p5_3>=1))")))))||("((i3.u8.PaySchemeData_p11_10>=1)&&(i3.u8.p3_8>=1))"))))
Formula 5 simplified : !("((i3.u8.PaySchemeData_p11_10>=1)&&(i3.u8.p3_8>=1))" U ("((i3.u8.PaySchemeData_p11_10>=1)&&(i3.u8.p3_8>=1))" | GX"((i3.u8.PaySchemeData_p11_10>=1)&&(i3.u8.p3_8>=1))" | G!G"(((((i7.u10.PayReceipt_p21_12>=1)&&(i7.u10.PaymentNote_p21_13>=1))&&(i7.u10.Status_p21_11>=1))&&(i7.u10.p11_13>=1))&&(i7.u10.p5_3>=1))"))
[2020-05-15 20:10:20] [INFO ] Computing symmetric co enabling matrix : 45 transitions.
[2020-05-15 20:10:20] [INFO ] Computation of co-enabling matrix(0/45) took 428 ms. Total solver calls (SAT/UNSAT): 27(27/0)
[2020-05-15 20:10:23] [INFO ] Computation of co-enabling matrix(14/45) took 3691 ms. Total solver calls (SAT/UNSAT): 303(302/1)
287 unique states visited
0 strongly connected components in search stack
288 transitions explored
147 items max in DFS search stack
625 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,8.11648,279864,1,0,590648,22305,1174,642215,900,160020,590935
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F(((X("((i6.u1.p11_4>=1)&&(i6.u15.p3_4>=1))"))&&("(i3.u8.PaySchemeData_p11_10>=1)"))&&("(i3.u8.p3_8>=1)")))))
Formula 6 simplified : F("(i3.u8.PaySchemeData_p11_10>=1)" & "(i3.u8.p3_8>=1)" & X"((i6.u1.p11_4>=1)&&(i6.u15.p3_4>=1))")
[2020-05-15 20:10:26] [INFO ] Computation of co-enabling matrix(33/45) took 6784 ms. Total solver calls (SAT/UNSAT): 503(495/8)
[2020-05-15 20:10:27] [INFO ] Computation of Finished co-enabling matrix. took 7326 ms. Total solver calls (SAT/UNSAT): 531(523/8)
[2020-05-15 20:10:27] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2020-05-15 20:10:28] [INFO ] Computation of Completed DNA matrix. took 1149 ms. Total solver calls (SAT/UNSAT): 53(0/53)
[2020-05-15 20:10:28] [INFO ] Built C files in 12490ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 940 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(( ( X((LTLAP21==true)) ) && ( (LTLAP22==true) ) ) && ( (LTLAP23==true) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(( ( X((LTLAP21==true)) ) && ( (LTLAP22==true) ) ) && ( (LTLAP23==true) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(( ( X((LTLAP21==true)) ) && ( (LTLAP22==true) ) ) && ( (LTLAP23==true) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
1912 unique states visited
96 strongly connected components in search stack
2734 transitions explored
1912 items max in DFS search stack
9937 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,107.48,2353184,1,0,4.11803e+06,51445,647,5.26899e+06,461,444775,15247
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(X("(u20.p6_3>=1)")))||(("((u3.p1_1>=1)&&(i4.u11.p10_0>=1))")U("((i7.u19.PaymentHandlerPayment_p5_0>=1)&&(i7.u18.PaymentRequest_p11_9>=1))"))))
Formula 7 simplified : !(XX"(u20.p6_3>=1)" | ("((u3.p1_1>=1)&&(i4.u11.p10_0>=1))" U "((i7.u19.PaymentHandlerPayment_p5_0>=1)&&(i7.u18.PaymentRequest_p11_9>=1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,107.614,2353184,1,0,4.11803e+06,51445,720,5.26899e+06,544,444775,33895
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X("((i6.u0.BrandList_p11_2>=1)&&(i6.u0.p3_2>=1))"))U((X(F(X("(u9.p3_6>=1)"))))&&("(u20.p6_3>=1)"))))
Formula 8 simplified : !(X"((i6.u0.BrandList_p11_2>=1)&&(i6.u0.p3_2>=1))" U ("(u20.p6_3>=1)" & XFX"(u9.p3_6>=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,107.616,2353184,1,0,4.11803e+06,51445,741,5.26899e+06,548,444775,33992
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(("(((((i3.u2.PayReceipt_p21_15<1)||(i3.u2.PaymentNote_p21_16<1))||(i3.u2.Status_p21_14<1))||(i3.u2.p3_10<1))&&((i1.u14.HowDeliver_p12_2<1)||(i1.u14.p6_2<1)))")U(F("((i7.u10.PaymentResponse_p11_12>=1)&&(i3.u8.p3_9>=1))")))))
Formula 9 simplified : !F("(((((i3.u2.PayReceipt_p21_15<1)||(i3.u2.PaymentNote_p21_16<1))||(i3.u2.Status_p21_14<1))||(i3.u2.p3_10<1))&&((i1.u14.HowDeliver_p12_2<1)||(i1.u14.p6_2<1)))" U F"((i7.u10.PaymentResponse_p11_12>=1)&&(i3.u8.p3_9>=1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,108.061,2353184,1,0,4.11803e+06,51445,779,5.26899e+06,548,444775,84266
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F((G("((i1.u6.MerchantOffer_p2>=1)&&(i4.u11.OfferRequest_p10>=1))"))U(G("((i1.u14.HowDeliver_p12_2<1)||(i1.u14.p6_2<1))"))))))
Formula 10 simplified : F(G"((i1.u6.MerchantOffer_p2>=1)&&(i4.u11.OfferRequest_p10>=1))" U G"((i1.u14.HowDeliver_p12_2<1)||(i1.u14.p6_2<1))")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
137 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,109.432,2353184,1,0,4.11803e+06,51445,816,5.26899e+06,550,444775,196681
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G(X(("((i6.u1.p11_4>=1)&&(i6.u15.p3_4>=1))")U(X(X(!((X("(((i1.u14.HowDeliver_p12_2>=1)&&(i1.u14.p6_2>=1))||(((i7.u10.PaySchemeData_p21_10>=1)&&(i3.u8.p11_11>=1))&&(i7.u18.p5_2>=1)))"))U("((i1.u14.HowDeliver_p12_2>=1)&&(i1.u14.p6_2>=1))"))))))))))
Formula 11 simplified : !XGX("((i6.u1.p11_4>=1)&&(i6.u15.p3_4>=1))" U XX!(X"(((i1.u14.HowDeliver_p12_2>=1)&&(i1.u14.p6_2>=1))||(((i7.u10.PaySchemeData_p21_10>=1)&&(i3.u8.p11_11>=1))&&(i7.u18.p5_2>=1)))" U "((i1.u14.HowDeliver_p12_2>=1)&&(i1.u14.p6_2>=1))"))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,109.498,2353184,1,0,4.11803e+06,51445,871,5.26899e+06,551,444775,207521
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X((F("((((((i1.u14.Delivery_p22_4>=1)&&(i1.u14.Order_p22_6>=1))&&(i1.u14.Organization_p22_5>=1))&&(u20.Status_p22_7>=1))&&(u21.p12_4>=1))&&(u20.p6_4>=1))"))U(!((X((F("((((((i1.u14.Delivery_p22_4>=1)&&(i1.u14.Order_p22_6>=1))&&(i1.u14.Organization_p22_5>=1))&&(u20.Status_p22_7>=1))&&(u21.p12_4>=1))&&(u20.p6_4>=1))"))U("(((i7.u10.PaySchemeData_p21_10>=1)&&(i3.u8.p11_11>=1))&&(i7.u18.p5_2>=1))")))U(("((i6.u0.BrandList_p11_2>=1)&&(i6.u0.p3_2>=1))")U("((i4.u12.p11_0>=1)&&(i4.u4.p3_1>=1))"))))))))
Formula 12 simplified : !XX(F"((((((i1.u14.Delivery_p22_4>=1)&&(i1.u14.Order_p22_6>=1))&&(i1.u14.Organization_p22_5>=1))&&(u20.Status_p22_7>=1))&&(u21.p12_4>=1))&&(u20.p6_4>=1))" U !(X(F"((((((i1.u14.Delivery_p22_4>=1)&&(i1.u14.Order_p22_6>=1))&&(i1.u14.Organization_p22_5>=1))&&(u20.Status_p22_7>=1))&&(u21.p12_4>=1))&&(u20.p6_4>=1))" U "(((i7.u10.PaySchemeData_p21_10>=1)&&(i3.u8.p11_11>=1))&&(i7.u18.p5_2>=1))") U ("((i6.u0.BrandList_p11_2>=1)&&(i6.u0.p3_2>=1))" U "((i4.u12.p11_0>=1)&&(i4.u4.p3_1>=1))")))
257 unique states visited
72 strongly connected components in search stack
257 transitions explored
257 items max in DFS search stack
158 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,111.087,2353184,1,0,4.11803e+06,51445,1142,5.26899e+06,558,444775,522040
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589573529200

--------------------
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 -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination 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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r096-oct2-158940145000370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;