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-158940145000362.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-C03M03P03D03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.9K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 4.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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-C03M03P03D03-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-15

=== Now, execution of the tool begins

BK_START 1589573336363

[2020-05-15 20:08:57] [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:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:08:57] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-05-15 20:08:57] [INFO ] Transformed 111 places.
[2020-05-15 20:08:57] [INFO ] Transformed 45 transitions.
[2020-05-15 20:08:57] [INFO ] Parsed PT model containing 111 places and 45 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 228 steps, including 0 resets, run visited all 46 properties in 7 ms. (steps per millisecond=32 )
[2020-05-15 20:08:57] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-15 20:08:57] [INFO ] Flatten gal took : 31 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:08:57] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:08:57] [INFO ] Applying decomposition
[2020-05-15 20:08:57] [INFO ] Flatten gal took : 6 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/graph7681230730750976792.txt, -o, /tmp/graph7681230730750976792.bin, -w, /tmp/graph7681230730750976792.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/graph7681230730750976792.bin, -l, -1, -v, -w, /tmp/graph7681230730750976792.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:08:58] [INFO ] Input system was already deterministic with 45 transitions.
[2020-05-15 20:08:58] [INFO ] Decomposing Gal with order
[2020-05-15 20:08:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:08:58] [INFO ] Flatten gal took : 24 ms
[2020-05-15 20:08:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 20:08:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-15 20:08:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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]

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 8 LTL properties
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
Checking formula 0 : !((("(u2.ConsumerOffer_p1>=1)")U(F(((((G("(u2.ConsumerOffer_p1>=1)"))&&("(u3.DeliveryNote_p22_12>=1)"))&&("(u3.Status_p22_11>=1)"))&&("(u3.p12_7>=1)"))&&("(u3.p8_2>=1)")))))
Formula 0 simplified : !("(u2.ConsumerOffer_p1>=1)" U F("(u3.DeliveryNote_p22_12>=1)" & "(u3.Status_p22_11>=1)" & "(u3.p8_2>=1)" & "(u3.p12_7>=1)" & G"(u2.ConsumerOffer_p1>=1)"))
[2020-05-15 20:08:58] [INFO ] Computed 67 place invariants in 8 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 = 2
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 = 3
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 = 2
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 = 2
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 = 1
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 = 2
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 = 2
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 = 2
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 = 2
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:08:58] [INFO ] Computed 67 place invariants in 10 ms
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 20:08:58] [INFO ] Proved 111 variables to be positive in 163 ms
[2020-05-15 20:08:58] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2020-05-15 20:08:58] [INFO ] Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:08:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:08:58] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2020-05-15 20:08:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
26 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.288764,28992,1,0,24624,6881,810,30074,735,23785,43869
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(F(G((F("((i8.u9.p12_0>=1)&&(i5.u18.p6_1>=1))"))||("((i6.u0.p11_3>=1)&&(i6.u15.p4_2>=1))")))))U("((i6.u0.p11_3>=1)&&(i6.u15.p4_2>=1))")))
Formula 1 simplified : !(GFG("((i6.u0.p11_3>=1)&&(i6.u15.p4_2>=1))" | F"((i8.u9.p12_0>=1)&&(i5.u18.p6_1>=1))") U "((i6.u0.p11_3>=1)&&(i6.u15.p4_2>=1))")
[2020-05-15 20:08:59] [INFO ] Computing symmetric co enabling matrix : 45 transitions.
65 unique states visited
0 strongly connected components in search stack
95 transitions explored
33 items max in DFS search stack
222 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.5128,116740,1,0,242840,8589,918,184734,739,35238,386010
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((F(G(F("(((((i7.u17.PayReceipt_p21_12>=1)&&(i7.u17.PaymentNote_p21_13>=1))&&(i7.u17.Status_p21_11>=1))&&(i7.u17.p11_13>=1))&&(i7.u17.p5_3>=1))"))))&&(G(X("((i5.u11.PaySchemeData_p11_10>=1)&&(i5.u11.p3_8>=1))"))))&&(F("(((((i7.u17.PayReceipt_p21_12>=1)&&(i7.u17.PaymentNote_p21_13>=1))&&(i7.u17.Status_p21_11>=1))&&(i7.u17.p11_13>=1))&&(i7.u17.p5_3>=1))"))))
Formula 2 simplified : !(F"(((((i7.u17.PayReceipt_p21_12>=1)&&(i7.u17.PaymentNote_p21_13>=1))&&(i7.u17.Status_p21_11>=1))&&(i7.u17.p11_13>=1))&&(i7.u17.p5_3>=1))" & FGF"(((((i7.u17.PayReceipt_p21_12>=1)&&(i7.u17.PaymentNote_p21_13>=1))&&(i7.u17.Status_p21_11>=1))&&(i7.u17.p11_13>=1))&&(i7.u17.p5_3>=1))" & GX"((i5.u11.PaySchemeData_p11_10>=1)&&(i5.u11.p3_8>=1))")
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.5612,119308,1,0,248926,8590,1014,187354,760,35241,396866
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!((F("(u2.p6_7>=1)"))U((X("((i5.u11.PaySchemeData_p11_10>=1)&&(i5.u11.p3_8>=1))"))&&(("((i9.u12.p1_2<1)||(i9.u5.p10_2<1))")U("((i9.u12.p1_2>=1)&&(i9.u5.p10_2>=1))"))))))
Formula 3 simplified : F"(u2.p6_7>=1)" U (X"((i5.u11.PaySchemeData_p11_10>=1)&&(i5.u11.p3_8>=1))" & ("((i9.u12.p1_2<1)||(i9.u5.p10_2<1))" U "((i9.u12.p1_2>=1)&&(i9.u5.p10_2>=1))"))
7 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 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,2.70676,126112,1,0,262415,8917,1067,200307,760,38102,420799
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X((((((((X(!(("((((((i9.u12.Delivery_p20_10<1)||(i9.u12.Order_p20_8<1))||(i9.u12.Organization_p20_7<1))||(i9.u12.Payment_p20_9<1))||(i9.u12.Status_p20_6<1))||(i9.u12.p1_3<1))")U("((i6.u0.p11_3>=1)&&(i6.u15.p4_2>=1))"))))||("(i9.u12.Delivery_p20_10<1)"))||("(i9.u12.Order_p20_8<1)"))||("(i9.u12.Organization_p20_7<1)"))||("(i9.u12.Payment_p20_9<1)"))||("(i9.u12.Status_p20_6<1)"))||("(i9.u12.p1_3<1)"))||("((u2.p1_1>=1)&&(i9.u10.p10_0>=1))")))))
Formula 4 simplified : !FX("((u2.p1_1>=1)&&(i9.u10.p10_0>=1))" | "(i9.u12.Delivery_p20_10<1)" | "(i9.u12.Order_p20_8<1)" | "(i9.u12.Organization_p20_7<1)" | "(i9.u12.Payment_p20_9<1)" | "(i9.u12.Status_p20_6<1)" | "(i9.u12.p1_3<1)" | X!("((((((i9.u12.Delivery_p20_10<1)||(i9.u12.Order_p20_8<1))||(i9.u12.Organization_p20_7<1))||(i9.u12.Payment_p20_9<1))||(i9.u12.Status_p20_6<1))||(i9.u12.p1_3<1))" U "((i6.u0.p11_3>=1)&&(i6.u15.p4_2>=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,2.70893,126364,1,0,262415,8917,1139,200307,771,38102,420816
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(("(u2.p6_7>=1)")U("(i6.u15.p4_1>=1)")))))
Formula 5 simplified : !GF("(u2.p6_7>=1)" U "(i6.u15.p4_1>=1)")
[2020-05-15 20:09:01] [INFO ] Computation of Finished co-enabling matrix. took 1963 ms. Total solver calls (SAT/UNSAT): 531(523/8)
[2020-05-15 20:09:01] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
46 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.16922,139300,1,0,294925,8985,1155,224560,771,38910,455556
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(X(F(G((("((i3.u1.p11_4>=1)&&(i6.u13.p3_4>=1))")U(X(X("((i5.u11.PaySchemeData_p11_10>=1)&&(i5.u11.p3_8>=1))"))))||(G("(((i7.u17.PaySchemeData_p21_10>=1)&&(i5.u11.p11_11>=1))&&(i7.u16.p5_2>=1))")))))))))
Formula 6 simplified : !XGXFG(("((i3.u1.p11_4>=1)&&(i6.u13.p3_4>=1))" U XX"((i5.u11.PaySchemeData_p11_10>=1)&&(i5.u11.p3_8>=1))") | G"(((i7.u17.PaySchemeData_p21_10>=1)&&(i5.u11.p11_11>=1))&&(i7.u16.p5_2>=1))")
[2020-05-15 20:09:01] [INFO ] Computation of Completed DNA matrix. took 603 ms. Total solver calls (SAT/UNSAT): 53(0/53)
[2020-05-15 20:09:01] [INFO ] Built C files in 3923ms 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]
173 unique states visited
126 strongly connected components in search stack
175 transitions explored
170 items max in DFS search stack
189 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.07064,178108,1,0,386358,10100,1323,313697,773,48276,589624
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G((G(X("((((i5.u18.PayReceipt_p21_15>=1)&&(i5.u18.PaymentNote_p21_16>=1))&&(i5.u18.Status_p21_14>=1))&&(i5.u18.p3_10>=1))")))U(F(G(!(X(X("((((i5.u18.PayReceipt_p21_15>=1)&&(i5.u18.PaymentNote_p21_16>=1))&&(i5.u18.Status_p21_14>=1))&&(i5.u18.p3_10>=1))"))))))))))
Formula 7 simplified : !FG(GX"((((i5.u18.PayReceipt_p21_15>=1)&&(i5.u18.PaymentNote_p21_16>=1))&&(i5.u18.Status_p21_14>=1))&&(i5.u18.p3_10>=1))" U FG!XX"((((i5.u18.PayReceipt_p21_15>=1)&&(i5.u18.PaymentNote_p21_16>=1))&&(i5.u18.Status_p21_14>=1))&&(i5.u18.p3_10>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.07805,178368,1,0,386840,10107,1360,314405,782,48317,590331
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C03M03P03D03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Compilation finished in 1454 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 48 ms.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589573343769

--------------------
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-C03M03P03D03"
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-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 r096-oct2-158940145000362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 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 ;