About the Execution of ITS-Tools for IOTPpurchase-PT-C05M04P03D02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15726.120 | 414332.00 | 438791.00 | 848.50 | TTFFTTFTFTFFFFFT | normal |
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-158940145000369.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000369
=====================================================================
--------------------
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 1589573398390
[2020-05-15 20:10:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:10:00] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-15 20:10:00] [INFO ] Transformed 111 places.
[2020-05-15 20:10:00] [INFO ] Transformed 45 transitions.
[2020-05-15 20:10:00] [INFO ] Parsed PT model containing 111 places and 45 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 228 ms. (steps per millisecond=438 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 45 rows 111 cols
[2020-05-15 20:10:00] [INFO ] Computed 67 place invariants in 8 ms
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-15 20:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
[2020-05-15 20:10:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-15 20:10:01] [INFO ] Flatten gal took : 48 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:10:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 20:10:01] [INFO ] Flatten gal took : 8 ms
[2020-05-15 20:10:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:10:01] [INFO ] Applying decomposition
[2020-05-15 20:10:01] [INFO ] Flatten gal took : 5 ms
[2020-05-15 20:10:01] [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/graph8184620529880931378.txt, -o, /tmp/graph8184620529880931378.bin, -w, /tmp/graph8184620529880931378.weights], 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:10:01] [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 = 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:01] [INFO ] Computed 67 place invariants in 6 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8184620529880931378.bin, -l, -1, -v, -w, /tmp/graph8184620529880931378.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:10:01] [INFO ] Decomposing Gal with order
[2020-05-15 20:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:10:01] [INFO ] Flatten gal took : 65 ms
[2020-05-15 20:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-15 20:10:01] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
[2020-05-15 20:10:01] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !(((F(("(gu10.PaySchemeData_p21_6>=1)")U("(gi5.gi0.gi1.gu22.Organization_p21_2<1)")))&&((G("(gu17.p11_8<=gu17.p11_7)"))||(F("(gu7.OfferResponce_p10<=gu7.Payment_p21_7)")))))
Formula 0 simplified : !(F("(gu10.PaySchemeData_p21_6>=1)" U "(gi5.gi0.gi1.gu22.Organization_p21_2<1)") & (G"(gu17.p11_8<=gu17.p11_7)" | F"(gu7.OfferResponce_p10<=gu7.Payment_p21_7)"))
[2020-05-15 20:10:02] [INFO ] Proved 111 variables to be positive in 372 ms
[2020-05-15 20:10:02] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2020-05-15 20:10:02] [INFO ] Computation of disable matrix completed :0/45 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:10:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:10:02] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2020-05-15 20:10:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:10:03] [INFO ] Computing symmetric co enabling matrix : 45 transitions.
[2020-05-15 20:10:05] [INFO ] Computation of co-enabling matrix(8/45) took 1385 ms. Total solver calls (SAT/UNSAT): 203(203/0)
[2020-05-15 20:10:07] [INFO ] Computation of Finished co-enabling matrix. took 3868 ms. Total solver calls (SAT/UNSAT): 531(523/8)
[2020-05-15 20:10:07] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2020-05-15 20:10:08] [INFO ] Computation of Completed DNA matrix. took 535 ms. Total solver calls (SAT/UNSAT): 53(0/53)
[2020-05-15 20:10:08] [INFO ] Built C files in 6581ms 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 847 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>(((LTLAP0==true))U((LTLAP1==true))) ) && ( ( []((LTLAP2==true))) || ( <>((LTLAP3==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, -p, --pins-guards, --when, --ltl, ( <>(((LTLAP0==true))U((LTLAP1==true))) ) && ( ( []((LTLAP2==true))) || ( <>((LTLAP3==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, -p, --pins-guards, --when, --ltl, ( <>(((LTLAP0==true))U((LTLAP1==true))) ) && ( ( []((LTLAP2==true))) || ( <>((LTLAP3==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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
20 unique states visited
0 strongly connected components in search stack
19 transitions explored
20 items max in DFS search stack
1239 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,12.44,283476,1,0,90,1.17788e+06,26,36,2595,633793,247
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((F(X(G("(gu20.Status_p21_5<=gu20.p3_6)"))))&&(X(G(X((F("(gi5.gi0.gi0.gu27.MerchantOffer_p2>=3)"))&&("(gi5.gi1.gi0.gu24.p3_10>=2)"))))))))
Formula 1 simplified : !X(FXG"(gu20.Status_p21_5<=gu20.p3_6)" & XGX("(gi5.gi1.gi0.gu24.p3_10>=2)" & F"(gi5.gi0.gi0.gu27.MerchantOffer_p2>=3)"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
3953 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,51.9727,1436724,1,0,838,7.20107e+06,45,292,2720,8.73558e+06,1547
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(("(gi5.gi1.gi0.gu24.p3_10>=1)")U(F(G("(gu4.DeliveryResponse_p12_6<=gu4.PaySchemeData_p11_10)"))))))
Formula 2 simplified : "(gi5.gi1.gi0.gu24.p3_10>=1)" U FG"(gu4.DeliveryResponse_p12_6<=gu4.PaySchemeData_p11_10)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
582 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,57.7938,1637088,1,0,1063,8.37194e+06,54,293,2725,9.89147e+06,2120
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(F((F(X("(gu10.PaySchemeData_p21_6<=gu10.Organization_p22_9)")))&&("(gu10.PaySchemeData_p21_6<=gu10.Organization_p22_9)"))))))
Formula 3 simplified : !FXF("(gu10.PaySchemeData_p21_6<=gu10.Organization_p22_9)" & FX"(gu10.PaySchemeData_p21_6<=gu10.Organization_p22_9)")
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,57.7946,1637344,1,0,1063,8.37194e+06,64,293,2729,9.89147e+06,2128
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((X("(gi7.gu18.p12_7<=gi7.gu18.p12_0)"))&&("(gi5.gi0.gu25.Status_p22_7>=1)"))))
Formula 4 simplified : !X("(gi5.gi0.gu25.Status_p22_7>=1)" & X"(gi7.gu18.p12_7<=gi7.gu18.p12_0)")
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,57.7951,1637344,1,0,1063,8.37194e+06,68,293,2730,9.89147e+06,2132
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((!(X("((gu4.DeliveryResponse_p12_6<=gu4.DeliveryRequest_p12_5)&&(gu10.PaySchemeData_p21_6<=gu10.p6_1))")))||(!(F(X("(gu4.DeliveryResponse_p12_6<=gu4.DeliveryRequest_p12_5)")))))))
Formula 5 simplified : !G(!X"((gu4.DeliveryResponse_p12_6<=gu4.DeliveryRequest_p12_5)&&(gu10.PaySchemeData_p21_6<=gu10.p6_1))" | !FX"(gu4.DeliveryResponse_p12_6<=gu4.DeliveryRequest_p12_5)")
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,57.7969,1637664,1,0,1063,8.37194e+06,81,293,2742,9.89148e+06,2139
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(G("(gi5.gi0.gi1.gu19.p3_4<1)")))))
Formula 6 simplified : !XFG"(gi5.gi0.gi1.gu19.p3_4<1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
20330 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,261.099,2745924,1,0,1476,1.49776e+07,15,438,1728,2.12609e+07,284
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(!(F("(gi7.gu26.Order_p22_3>=3)"))))||(G(X(F("((gi7.gu26.Order_p22_3>=3)&&(gu8.Order_p20<=gu8.PaymentAmount_p11_6))"))))))
Formula 7 simplified : !(G!F"(gi7.gu26.Order_p22_3>=3)" | GXF"((gi7.gu26.Order_p22_3>=3)&&(gu8.Order_p20<=gu8.PaymentAmount_p11_6))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
12896 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,390.073,3018528,1,0,1476,1.55262e+07,26,438,1825,2.14441e+07,960
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((G((X("(gu13.Status_p20_6<=gu13.Status_p21_14)"))U(G("(gu13.Status_p20_6<=gu13.Status_p21_14)"))))U("(gu9.Order_p22_10<=gu9.Organization_p20_2)"))&&(!(F(X("((gu3.Delivery_p20_10<=gu3.PayReceipt_p21_12)||(gu28.p11_13<=gu28.p8_1))"))))))
Formula 8 simplified : !((G(X"(gu13.Status_p20_6<=gu13.Status_p21_14)" U G"(gu13.Status_p20_6<=gu13.Status_p21_14)") U "(gu9.Order_p22_10<=gu9.Organization_p20_2)") & !FX"((gu3.Delivery_p20_10<=gu3.PayReceipt_p21_12)||(gu28.p11_13<=gu28.p8_1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
314 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,393.208,3019024,1,0,1476,1.55262e+07,39,438,2098,2.14441e+07,983
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C05M04P03D02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589573812722
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-158940145000369"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;