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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 63K 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-C01M01P01D01-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-15

=== Now, execution of the tool begins

BK_START 1589573285464

[2020-05-15 20:08:07] [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:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:08:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-05-15 20:08:07] [INFO ] Transformed 111 places.
[2020-05-15 20:08:07] [INFO ] Transformed 45 transitions.
[2020-05-15 20:08:07] [INFO ] Found NUPN structural information;
[2020-05-15 20:08:07] [INFO ] Parsed PT model containing 111 places and 45 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 152 ms. (steps per millisecond=657 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 45 rows 111 cols
[2020-05-15 20:08:07] [INFO ] Computed 67 place invariants in 6 ms
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 7 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 20:08:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-15 20:08:08] [INFO ] Flatten gal took : 31 ms
FORMULA IOTPpurchase-PT-C01M01P01D01-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:08:08] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:08:08] [INFO ] Applying decomposition
[2020-05-15 20:08:08] [INFO ] Flatten gal took : 8 ms
[2020-05-15 20:08:08] [INFO ] Input system was already deterministic with 45 transitions.
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/graph9329696302752725530.txt, -o, /tmp/graph9329696302752725530.bin, -w, /tmp/graph9329696302752725530.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/graph9329696302752725530.bin, -l, -1, -v, -w, /tmp/graph9329696302752725530.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
[2020-05-15 20:08:08] [INFO ] Computed 67 place invariants in 3 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 = 0
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 = 1
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 = 1
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 = 0
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 = 0
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 = 0
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 = 0
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 = 0
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:08] [INFO ] Computed 67 place invariants in 5 ms
[2020-05-15 20:08:08] [INFO ] Decomposing Gal with order
[2020-05-15 20:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:08:08] [INFO ] Flatten gal took : 48 ms
[2020-05-15 20:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 20:08:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-15 20:08:08] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 15 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 14 LTL properties
Checking formula 0 : !((("((i6.u8.PaymentResponse_p11_12==1)&&(i2.u7.p3_9==1))")U(X(((G("((((((i8.u2.Delivery_p22_4!=1)||(i8.u2.Order_p22_6!=1))||(i8.u2.Organization_p22_5!=1))||(u20.Status_p22_7!=1))||(i8.u2.p12_4!=1))||(u20.p6_4!=1))"))&&(!(G("((i0.u0.BrandList_p11_2==1)&&(i0.u4.p3_2==1))"))))&&("((i6.u8.PaymentResponse_p11_12!=1)||(i2.u7.p3_9!=1))")))))
Formula 0 simplified : !("((i6.u8.PaymentResponse_p11_12==1)&&(i2.u7.p3_9==1))" U X("((i6.u8.PaymentResponse_p11_12!=1)||(i2.u7.p3_9!=1))" & G"((((((i8.u2.Delivery_p22_4!=1)||(i8.u2.Order_p22_6!=1))||(i8.u2.Organization_p22_5!=1))||(u20.Status_p22_7!=1))||(i8.u2.p12_4!=1))||(u20.p6_4!=1))" & !G"((i0.u0.BrandList_p11_2==1)&&(i0.u4.p3_2==1))"))
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 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.
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2 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.049594,19216,1,0,1335,626,851,1339,595,1002,4452
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("((((((i3.u13.Delivery_p20_10==1)&&(i3.u13.Order_p20_8==1))&&(i3.u13.Organization_p20_7==1))&&(i3.u13.Payment_p20_9==1))&&(i3.u13.Status_p20_6==1))&&(i3.u13.p1_3==1))"))U(!(F((X("(u5.ConsumerOffer_p1==1)"))||(X("((((u22.DeliveryNote_p22_12!=1)||(u22.Status_p22_11!=1))||(u22.p12_7!=1))||(u22.p8_2!=1))")))))))
Formula 1 simplified : !(G"((((((i3.u13.Delivery_p20_10==1)&&(i3.u13.Order_p20_8==1))&&(i3.u13.Organization_p20_7==1))&&(i3.u13.Payment_p20_9==1))&&(i3.u13.Status_p20_6==1))&&(i3.u13.p1_3==1))" U !F(X"(u5.ConsumerOffer_p1==1)" | X"((((u22.DeliveryNote_p22_12!=1)||(u22.Status_p22_11!=1))||(u22.p12_7!=1))||(u22.p8_2!=1))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.054765,19716,1,0,1567,640,943,1591,624,1167,5137
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(F(G(("((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))")U(G("((i8.u11.p12_0==1)&&(i2.u1.p6_1==1))"))))))||(F(G("((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))")))))
Formula 2 simplified : !(!FG("((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))" U G"((i8.u11.p12_0==1)&&(i2.u1.p6_1==1))") | FG"((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.056995,19716,1,0,1602,640,997,1608,625,1167,5423
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(X((!(G("((u5.p1_1==1)&&(i3.u6.p10_0==1))")))&&(((!(("(i5.u17.p4_4==1)")U("(i5.u17.p4_4!=1)")))||("(u5.p1_1!=1)"))||("(i3.u6.p10_0!=1)")))))))
Formula 3 simplified : GX(!G"((u5.p1_1==1)&&(i3.u6.p10_0==1))" & ("(i3.u6.p10_0!=1)" | "(u5.p1_1!=1)" | !("(i5.u17.p4_4==1)" U "(i5.u17.p4_4!=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,0.058936,19716,1,0,1602,640,1068,1608,626,1167,5484
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((X(G("(u5.ConsumerOffer_p1==1)")))U(((("(u5.ConsumerOffer_p1==1)")U("(((u5.DeliveryNote_p22_14==1)&&(u5.Status_p22_13==1))&&(u5.p6_6==1))"))&&("((((i5.u17.Organization_p21_2!=1)||(i5.u17.Payment_p21_1!=1))||(i5.u10.p11_7!=1))||(i5.u17.p4_5!=1))"))U("(u5.ConsumerOffer_p1==1)")))))
Formula 4 simplified : !X(XG"(u5.ConsumerOffer_p1==1)" U (("((((i5.u17.Organization_p21_2!=1)||(i5.u17.Payment_p21_1!=1))||(i5.u10.p11_7!=1))||(i5.u17.p4_5!=1))" & ("(u5.ConsumerOffer_p1==1)" U "(((u5.DeliveryNote_p22_14==1)&&(u5.Status_p22_13==1))&&(u5.p6_6==1))")) U "(u5.ConsumerOffer_p1==1)"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.061176,19716,1,0,1619,640,1130,1631,636,1168,5604
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((((X("(((((i5.u17.Organization_p21_2==1)&&(i5.u17.Payment_p21_1==1))&&(i5.u10.p11_7==1))&&(i5.u17.p4_5==1))||(u15.p3_6==1))"))U("((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))"))||(G("((((((i8.u2.Delivery_p22_4==1)&&(i8.u2.Order_p22_6==1))&&(i8.u2.Organization_p22_5==1))&&(u20.Status_p22_7==1))&&(i8.u2.p12_4==1))&&(u20.p6_4==1))")))||(F("((((((i8.u2.Delivery_p22_4==1)&&(i8.u2.Order_p22_6==1))&&(i8.u2.Organization_p22_5==1))&&(u20.Status_p22_7==1))&&(i8.u2.p12_4==1))&&(u20.p6_4==1))"))))
Formula 5 simplified : !((X"(((((i5.u17.Organization_p21_2==1)&&(i5.u17.Payment_p21_1==1))&&(i5.u10.p11_7==1))&&(i5.u17.p4_5==1))||(u15.p3_6==1))" U "((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))") | G"((((((i8.u2.Delivery_p22_4==1)&&(i8.u2.Order_p22_6==1))&&(i8.u2.Organization_p22_5==1))&&(u20.Status_p22_7==1))&&(i8.u2.p12_4==1))&&(u20.p6_4==1))" | F"((((((i8.u2.Delivery_p22_4==1)&&(i8.u2.Order_p22_6==1))&&(i8.u2.Organization_p22_5==1))&&(u20.Status_p22_7==1))&&(i8.u2.p12_4==1))&&(u20.p6_4==1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.066568,19716,1,0,2317,641,1213,1960,646,1174,8234
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((i2.u7.PaySchemeData_p11_10==1)&&(i2.u7.p3_8==1))")U(G(F(X(X("((i8.u3.MerchantOffer_p2==1)&&(i3.u6.OfferRequest_p10==1))")))))))
Formula 6 simplified : !("((i2.u7.PaySchemeData_p11_10==1)&&(i2.u7.p3_8==1))" U GFXX"((i8.u3.MerchantOffer_p2==1)&&(i3.u6.OfferRequest_p10==1))")
3 unique states visited
0 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,0.073807,20220,1,0,3398,642,1250,2854,646,1251,10887
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(("((i6.u19.PaymentHandlerPayment_p5_0==1)&&(i6.u18.PaymentRequest_p11_9==1))")U(F("((i6.u19.PaymentHandlerPayment_p5_0==1)&&(i6.u18.PaymentRequest_p11_9==1))")))))
Formula 7 simplified : !F("((i6.u19.PaymentHandlerPayment_p5_0==1)&&(i6.u18.PaymentRequest_p11_9==1))" U F"((i6.u19.PaymentHandlerPayment_p5_0==1)&&(i6.u18.PaymentRequest_p11_9==1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.075924,20484,1,0,3762,642,1288,2966,646,1251,12270
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(G(X(X(X((X("((i3.u12.MerchantPayment_p4_0==1)&&(i0.u4.PaidFor_p11_1==1))"))&&(X(G("((u5.p1_1==1)&&(i3.u6.p10_0==1))"))))))))))
Formula 8 simplified : GXXX(X"((i3.u12.MerchantPayment_p4_0==1)&&(i0.u4.PaidFor_p11_1==1))" & XG"((u5.p1_1==1)&&(i3.u6.p10_0==1))")
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.076693,20748,1,0,3780,642,1327,2966,646,1251,12371
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(G((!(X("((i6.u8.PaymentResponse_p11_12==1)&&(i2.u7.p3_9==1))")))&&("((i6.u8.PaymentResponse_p11_12!=1)||(i2.u7.p3_9!=1))"))))U(F("(u15.p3_6==1)"))))
Formula 9 simplified : !(!G("((i6.u8.PaymentResponse_p11_12!=1)||(i2.u7.p3_9!=1))" & !X"((i6.u8.PaymentResponse_p11_12==1)&&(i2.u7.p3_9==1))") U F"(u15.p3_6==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,0.079029,20748,1,0,4007,642,1350,3012,646,1251,13380
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(X(G(F((!(F(X("((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))"))))&&(G(F("((i3.u13.p1_2!=1)||(i3.u12.p10_2!=1))")))))))))
Formula 10 simplified : XGF(!FX"((i3.u13.p1_2==1)&&(i3.u12.p10_2==1))" & GF"((i3.u13.p1_2!=1)||(i3.u12.p10_2!=1))")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.086149,21012,1,0,5295,642,1389,4060,647,1281,16704
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((F(X(!(F("((i2.u7.PaySchemeData_p11_10==1)&&(i2.u7.p3_8==1))")))))&&(("(((((i6.u8.PaySchemeData_p21_10==1)&&(i2.u7.p11_11==1))&&(i6.u18.p5_2==1))||(i2.u7.PaySchemeData_p11_10!=1))||(i2.u7.p3_8!=1))")U("((((i6.u8.PaySchemeData_p21_10==1)&&(i2.u7.p11_11==1))&&(i6.u18.p5_2==1))||((i2.u7.PaySchemeData_p11_10==1)&&(i2.u7.p3_8==1)))")))))
Formula 11 simplified : !G(FX!F"((i2.u7.PaySchemeData_p11_10==1)&&(i2.u7.p3_8==1))" & ("(((((i6.u8.PaySchemeData_p21_10==1)&&(i2.u7.p11_11==1))&&(i6.u18.p5_2==1))||(i2.u7.PaySchemeData_p11_10!=1))||(i2.u7.p3_8!=1))" U "((((i6.u8.PaySchemeData_p21_10==1)&&(i2.u7.p11_11==1))&&(i6.u18.p5_2==1))||((i2.u7.PaySchemeData_p11_10==1)&&(i2.u7.p3_8==1)))"))
47 unique states visited
3 strongly connected components in search stack
48 transitions explored
45 items max in DFS search stack
2 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.114016,22592,1,0,8520,647,1496,7749,650,1465,26721
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(((F("((((((i8.u2.Delivery_p22_4==1)&&(i8.u2.Order_p22_6==1))&&(i8.u2.Organization_p22_5==1))&&(u20.Status_p22_7==1))&&(i8.u2.p12_4==1))&&(u20.p6_4==1))"))||(G(X("((i0.u0.BrandList_p11_2==1)&&(i0.u4.p3_2==1))"))))||(!(("(((i6.u8.PaySchemeData_p21_10==1)&&(i2.u7.p11_11==1))&&(i6.u18.p5_2==1))")U(X(X("((i0.u4.p11_0!=1)||(i3.u13.p3_1!=1))"))))))))
Formula 12 simplified : !F(F"((((((i8.u2.Delivery_p22_4==1)&&(i8.u2.Order_p22_6==1))&&(i8.u2.Organization_p22_5==1))&&(u20.Status_p22_7==1))&&(i8.u2.p12_4==1))&&(u20.p6_4==1))" | GX"((i0.u0.BrandList_p11_2==1)&&(i0.u4.p3_2==1))" | !("(((i6.u8.PaySchemeData_p21_10==1)&&(i2.u7.p11_11==1))&&(i6.u18.p5_2==1))" U XX"((i0.u4.p11_0!=1)||(i3.u13.p3_1!=1))"))
[2020-05-15 20:08:08] [INFO ] Proved 111 variables to be positive in 348 ms
[2020-05-15 20:08:08] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2020-05-15 20:08:08] [INFO ] Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:08:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:08:08] [INFO ] Computing symmetric may enable matrix : 45 transitions.
17 unique states visited
0 strongly connected components in search stack
16 transitions explored
9 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.121577,23116,1,0,8713,647,1627,7931,650,1469,28158
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(!(F((F("((i8.u3.MerchantOffer_p2==1)&&(i3.u6.OfferRequest_p10==1))"))U(((((!(X("((i0.u4.p11_0==1)&&(i3.u13.p3_1==1))")))||("(i2.u1.PayReceipt_p21_15!=1)"))||("(i2.u1.PaymentNote_p21_16!=1)"))||("(i2.u1.Status_p21_14!=1)"))||("(i2.u1.p3_10!=1)")))))))
Formula 13 simplified : !X!F(F"((i8.u3.MerchantOffer_p2==1)&&(i3.u6.OfferRequest_p10==1))" U ("(i2.u1.PayReceipt_p21_15!=1)" | "(i2.u1.PaymentNote_p21_16!=1)" | "(i2.u1.Status_p21_14!=1)" | "(i2.u1.p3_10!=1)" | !X"((i0.u4.p11_0==1)&&(i3.u13.p3_1==1))"))
[2020-05-15 20:08:08] [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
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.124772,23116,1,0,8730,647,1683,7959,666,1469,28266
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 20:08:08] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-15 20:08:08] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-15 20:08:08] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 37) 1) (>= (select s0 87) 1)) (= (store (store (store (store s0 37 (- (select s0 37) 1)) 67 (+ (select s0 67) 1)) 88 (+ (select s0 88) 1)) 87 (- (select s0 87) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 37) 1) (>= (select s0 87) 1)) (= (store (store (store (store s0 37 (- (select s0 37) 1)) 67 (+ (select s0 67) 1)) 88 (+ (select s0 88) 1)) 87 (- (select s0 87) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 20:08:08] [INFO ] Built C files in 593ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589573289339

--------------------
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-C01M01P01D01"
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-C01M01P01D01, 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-158940144900354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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