fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r096-oct2-158940144900353
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for IOTPpurchase-PT-C01M01P01D01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.670 6532.00 13591.00 70.40 TFFTTTTFFTTFFTFT 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-158940144900353.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940144900353
=====================================================================

--------------------
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 1589573284541

[2020-05-15 20:08:06] [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:08:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:08:06] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-15 20:08:06] [INFO ] Transformed 111 places.
[2020-05-15 20:08:06] [INFO ] Transformed 45 transitions.
[2020-05-15 20:08:06] [INFO ] Found NUPN structural information;
[2020-05-15 20:08:06] [INFO ] Parsed PT model containing 111 places and 45 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 276 ms. (steps per millisecond=362 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 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 9 ms
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 26 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-05-15 20:08:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned unsat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 22 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-15 20:08:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned unsat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 12 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-15 20:08:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned unsat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 63 ms returned sat
[2020-05-15 20:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-15 20:08:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 16 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-15 20:08:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 54 ms returned unsat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive place invariants in 55 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 76 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-05-15 20:08:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive place invariants in 46 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 29 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-05-15 20:08:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 14 ms returned sat
[2020-05-15 20:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:08] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-15 20:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 73 ms returned unsat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 16 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-05-15 20:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 24 ms returned unsat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 14 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-15 20:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 28 ms returned unsat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 24 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-15 20:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 4 ms returned unsat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 17 ms returned sat
[2020-05-15 20:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 20:08:09] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-05-15 20:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 20:08:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
[2020-05-15 20:08:10] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-15 20:08:10] [INFO ] Flatten gal took : 28 ms
FORMULA IOTPpurchase-PT-C01M01P01D01-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:08:10] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
[2020-05-15 20:08:10] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-15 20:08:10] [INFO ] Flatten gal took : 16 ms
[2020-05-15 20:08:10] [INFO ] Input system was already deterministic with 45 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 111 cols
[2020-05-15 20:08:10] [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 = 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:10] [INFO ] Computed 67 place invariants in 9 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/graph4702609993463811548.txt, -o, /tmp/graph4702609993463811548.bin, -w, /tmp/graph4702609993463811548.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/graph4702609993463811548.bin, -l, -1, -v, -w, /tmp/graph4702609993463811548.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:08:10] [INFO ] Decomposing Gal with order
[2020-05-15 20:08:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:08:10] [INFO ] Flatten gal took : 68 ms
[2020-05-15 20:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 20:08:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-15 20:08:10] [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], 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
Read 6 LTL properties
Checking formula 0 : !((((("(u17.PaySchemeData_p21_6==1)")U("((i5.u6.p11_11==0)||(u10.p12_7==1))"))&&(!(("((i5.u6.p11_11==0)||(u10.p12_7==1))")U("(i8.u19.Organization_p21_2==1)"))))U(G("(i8.u19.Organization_p21_2==1)"))))
Formula 0 simplified : !((("(u17.PaySchemeData_p21_6==1)" U "((i5.u6.p11_11==0)||(u10.p12_7==1))") & !("((i5.u6.p11_11==0)||(u10.p12_7==1))" U "(i8.u19.Organization_p21_2==1)")) U G"(i8.u19.Organization_p21_2==1)")
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
21 unique states visited
21 strongly connected components in search stack
21 transitions explored
21 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.052044,18652,1,0,1696,757,805,1506,591,1195,6764
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(F("(u22.p8_2==1)")))||(F(!(G(F(X("((i4.u20.Status_p21_9==0)||(u22.p8_2==1))"))))))))
Formula 1 simplified : !(GF"(u22.p8_2==1)" | F!GFX"((i4.u20.Status_p21_9==0)||(u22.p8_2==1))")
124 unique states visited
0 strongly connected components in search stack
178 transitions explored
47 items max in DFS search stack
3 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.081852,20144,1,0,4403,783,854,5420,594,1540,14900
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(((F("((i1.u4.Order_p22_6==0)||(u10.Status_p22_13==1))"))U(G("((i1.u4.Order_p22_6==0)||(u10.Status_p22_13==1))")))U(G("((i1.u4.Order_p22_6!=0)&&(u10.Status_p22_13!=1))")))))
Formula 2 simplified : !G((F"((i1.u4.Order_p22_6==0)||(u10.Status_p22_13==1))" U G"((i1.u4.Order_p22_6==0)||(u10.Status_p22_13==1))") U G"((i1.u4.Order_p22_6!=0)&&(u10.Status_p22_13!=1))")
2 unique states visited
2 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.085277,20636,1,0,4617,784,902,5618,598,1556,15659
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(X("(u17.PaySchemeData_p21_6==1)")))))
Formula 3 simplified : FX"(u17.PaySchemeData_p21_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,0.086641,20896,1,0,4675,784,919,5674,598,1556,15936
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((F(X("((u9.Status_p22_7==1)&&((i5.u2.PaymentNote_p21_16==0)||(i5.u2.PaymentNote_p21_16==1)))")))&&("((u10.p12_7==0)||(i1.u13.p12_0==1))"))))
Formula 4 simplified : !X("((u10.p12_7==0)||(i1.u13.p12_0==1))" & FX"((u9.Status_p22_7==1)&&((i5.u2.PaymentNote_p21_16==0)||(i5.u2.PaymentNote_p21_16==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,0.090884,20896,1,0,5368,784,961,6114,601,1559,18315
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("((u17.PaySchemeData_p21_6==0)||(i5.u2.p6_1==1))")))
Formula 5 simplified : !G"((u17.PaySchemeData_p21_6==0)||(i5.u2.p6_1==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.092334,21160,1,0,5380,785,984,6137,602,1562,18472
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IOTPpurchase-PT-C01M01P01D01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-15 20:08:10] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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:10] [INFO ] Built C files in 467ms 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 1589573291073

--------------------
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-C01M01P01D01"
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-C01M01P01D01, 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-158940144900353"
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 [ "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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;