Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406800361.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620838141059

Running Version 0
[2021-05-12 16:49:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:49:03] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-12 16:49:03] [INFO ] Transformed 111 places.
[2021-05-12 16:49:03] [INFO ] Transformed 45 transitions.
[2021-05-12 16:49:03] [INFO ] Parsed PT model containing 111 places and 45 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 111 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 111 cols
[2021-05-12 16:49:03] [INFO ] Computed 67 place invariants in 14 ms
[2021-05-12 16:49:04] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 45 rows 111 cols
[2021-05-12 16:49:04] [INFO ] Computed 67 place invariants in 8 ms
[2021-05-12 16:49:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:49:04] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 111 cols
[2021-05-12 16:49:04] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-12 16:49:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/111 places, 45/45 transitions.
[2021-05-12 16:49:04] [INFO ] Flatten gal took : 30 ms
[2021-05-12 16:49:04] [INFO ] Flatten gal took : 11 ms
[2021-05-12 16:49:04] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1992 ms. (steps per millisecond=50 ) properties (out of 89) seen :35
Running SMT prover for 54 properties.
// Phase 1: matrix 45 rows 111 cols
[2021-05-12 16:49:06] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-12 16:49:06] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-12 16:49:06] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 12 ms returned sat
[2021-05-12 16:49:06] [INFO ] SMT Verify possible in real domain returnedunsat :4 sat :0 real:50
[2021-05-12 16:49:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-12 16:49:06] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned sat
[2021-05-12 16:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:49:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned unsat :48 sat :6
[2021-05-12 16:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-12 16:49:06] [INFO ] SMT Verify possible in nat domain returned unsat :48 sat :6
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
[2021-05-12 16:49:06] [INFO ] Initial state test concluded for 4 properties.
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ensure Unique test removed 34 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 71 transition count 43
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 68 transition count 42
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 67 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 66 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 15 place count 66 transition count 38
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 23 place count 61 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 35 place count 54 transition count 33
Applied a total of 35 rules in 25 ms. Remains 54 /111 variables (removed 57) and now considering 33/45 (removed 12) transitions.
[2021-05-12 16:49:07] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:49:07] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:07] [INFO ] Input system was already deterministic with 33 transitions.
[2021-05-12 16:49:07] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:49:07] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6157914247272118209.gal : 2 ms
[2021-05-12 16:49:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14258047220950184082.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality6157914247272118209.gal, -t, CGAL, -ctl, /tmp/CTLCardinality14258047220950184082.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality6157914247272118209.gal -t CGAL -ctl /tmp/CTLCardinality14258047220950184082.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,23202,0.044818,5776,2,892,5,9058,6,0,252,8426,0


Converting to forward existential form...Done !
original formula: EG(EF((((((((((p11_4+DeliveryRequest_p12_5)+PaymentNote_p21_16)+p7_1)+PaymentRequest_p11_9)+Organization_p21_8)+Payment_p21_7)+p1_2)<=3)||((((((((((Payment_p21_1+PaymentNote_p21_16)+Order_p22_10)+Delivery_p22_1)+Delivery_p22_8)+ConsumerDelivery_p6_0)+PaySchemeData_p21_10)+PaymentResponse_p11_12)+p3_3)+WhatDeliver_p12_1)<=(((((((((Order_p20+p1_3)+p12_0)+p3_9)+p4_2)+p8_3)+p6_2)+p12_3)+Delivery_p22_8)+PaySchemeData_p11_10)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((((((((p11_4+DeliveryRequest_p12_5)+PaymentNote_p21_16)+p7_1)+PaymentRequest_p11_9)+Organization_p21_8)+Payment_p21_7)+p1_2)<=3)||((((((((((Payment_p21_1+PaymentNote_p21_16)+Order_p22_10)+Delivery_p22_1)+Delivery_p22_8)+ConsumerDelivery_p6_0)+PaySchemeData_p21_10)+PaymentResponse_p11_12)+p3_3)+WhatDeliver_p12_1)<=(((((((((Order_p20+p1_3)+p12_0)+p3_9)+p4_2)+p8_3)+p6_2)+p12_3)+Delivery_p22_8)+PaySchemeData_p11_10)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.269247,11496,1,0,6,24967,18,1,4422,15119,10
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Ensure Unique test removed 28 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 43
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 73 transition count 41
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 71 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 69 transition count 39
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 20 place count 69 transition count 35
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 31 place count 62 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 34 place count 60 transition count 34
Applied a total of 34 rules in 11 ms. Remains 60 /111 variables (removed 51) and now considering 34/45 (removed 11) transitions.
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:09] [INFO ] Input system was already deterministic with 34 transitions.
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2756888122573222887.gal : 1 ms
[2021-05-12 16:49:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6751320870077733389.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality2756888122573222887.gal, -t, CGAL, -ctl, /tmp/CTLCardinality6751320870077733389.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality2756888122573222887.gal -t CGAL -ctl /tmp/CTLCardinality6751320870077733389.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,133912,0.123297,9112,2,1455,5,23977,6,0,277,24961,0


Converting to forward existential form...Done !
original formula: EG((AF(((((((((((MerchantOffer_p2+p10_0)+p1_2)+p6_2)+ConsumerDelivery_p6_0)+Payment_p20)+Organization_p21_2)+p8_1)+p11_11)>((HowDeliver_p12_2+Delivery_p20_10)+PaySchemeData_p21_10))||(((MerchantDelivery_p4_6+p3_9)+p8_3)>13))) + !(AF(((((((((((PaymentResponse_p11_12+p3_7)+p6_6)+Status_p21_11)+Status_p21_5)+Organization_p22_2)+p1_2)+p2_2)+p12_3)+p5_1)<=((((((Status_p21_14+p3_10)+PayReceipt_p21_12)+p4_1)+Status_p20)+Order_p22_10)+Status_p22_11))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((((((((((MerchantOffer_p2+p10_0)+p1_2)+p6_2)+ConsumerDelivery_p6_0)+Payment_p20)+Organization_p21_2)+p8_1)+p11_11)>((HowDeliver_p12_2+Delivery_p20_10)+PaySchemeData_p21_10))||(((MerchantDelivery_p4_6+p3_9)+p8_3)>13))))) + !(!(EG(!(((((((((((PaymentResponse_p11_12+p3_7)+p6_6)+Status_p21_11)+Status_p21_5)+Organization_p22_2)+p1_2)+p2_2)+p12_3)+p5_1)<=((((((Status_p21_14+p3_10)+PayReceipt_p21_12)+p4_1)+Status_p20)+Order_p22_10)+Status_p22_11))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.761647,27188,1,0,8,125668,29,2,2941,87272,10
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Ensure Unique test removed 31 places
Discarding 7 places :
Implicit places reduction removed 7 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 72 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 72 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 67 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 67 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 66 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 62 transition count 37
Applied a total of 26 rules in 8 ms. Remains 62 /111 variables (removed 49) and now considering 37/45 (removed 8) transitions.
[2021-05-12 16:49:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 12 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:49:09] [INFO ] Input system was already deterministic with 37 transitions.
Ensure Unique test removed 36 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 67 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 56 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 42 place count 48 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 42 place count 48 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 71 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 71 place count 30 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 27 transition count 16
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 97 place count 15 transition count 8
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 13 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 99 place count 13 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 104 place count 10 transition count 6
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 10 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 8 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 110 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 110 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 113 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 116 place count 2 transition count 2
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 117 place count 2 transition count 1
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 119 place count 0 transition count 1
Applied a total of 119 rules in 9 ms. Remains 0 /111 variables (removed 111) and now considering 1/45 (removed 44) transitions.
[2021-05-12 16:49:09] [INFO ] Removed 1 GAL types that were empty due to variable simplifications.
petri,
[2021-05-12 16:49:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 1 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:49:09] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:49:09] [INFO ] Input system was already deterministic with 1 transitions.
[2021-05-12 16:49:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-12 16:49:10] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:49:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:49:10] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:49:10] [INFO ] Applying decomposition
[2021-05-12 16:49:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7171621830289887069.txt, -o, /tmp/graph7171621830289887069.bin, -w, /tmp/graph7171621830289887069.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7171621830289887069.bin, -l, -1, -v, -w, /tmp/graph7171621830289887069.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:49:10] [INFO ] Decomposing Gal with order
[2021-05-12 16:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:49:10] [INFO ] Flatten gal took : 34 ms
[2021-05-12 16:49:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-12 16:49:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14587527601263562031.gal : 3 ms
[2021-05-12 16:49:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality15634064821609956535.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality14587527601263562031.gal, -t, CGAL, -ctl, /tmp/CTLCardinality15634064821609956535.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality14587527601263562031.gal -t CGAL -ctl /tmp/CTLCardinality15634064821609956535.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,354176,0.590315,24156,2,13466,5,95939,6,0,492,95049,0


Converting to forward existential form...Done !
original formula: AG((!(EX((((((((((((gi1.gu4.Status_p20+gi2.gu0.WhatDeliver_p12_1)+gi0.gu2.Status_p21_5)+gi0.gu2.p12_4)+gi2.gu7.p6_7)+gi0.gu2.p3_8)+gi2.gu7.Status_p21_11)+gi0.gu2.p11_11)+gi0.gu2.Status_p21_9)+gi0.gu2.p4_5)>(((((gi0.gu2.Delivery_p22_1+gi3.gu8.Organization_p21_2)+gi0.gu2.p11_8)+gi0.gu2.p4_5)+gi0.gu2.p3_7)+gi0.gu2.Status_p21_14))&&(((gi3.gu8.p6_1+gi0.gu2.p11_11)<=35)||(((gi1.gu5.DeliveryResponse_p12_6+gi1.gu5.Order_p22_10)+gi1.gu5.p11_13)<=((gi0.gu2.p3_8+gi1.gu5.p11_7)+gi1.gu5.p3_5)))))) + (((!(EX(TRUE)) * (((((((gi0.gu2.Status_p21_9+gi0.gu3.p3_10)+gi3.gu8.DeliveryRequest_p12_5)+gi0.gu3.Order_p20_8)+gi0.gu3.p10_0)+gi0.gu3.Status_p22_13)+gi3.gu8.p6_1)<=gi0.gu2.Order_p22_3)) * (((((((((gi3.gu8.Payment_p20+gi3.gu8.p8_2)+gi3.gu8.HowDeliver_p12_2)+gi3.gu8.p6_1)+gi3.gu8.p4_2)+gi3.gu8.Delivery_p20)+gi3.gu8.Organization_p21_2)+gi3.gu8.PaySchemeData_p21_6)+gi3.gu8.p12_7)<=((((gi3.gu8.p6_3+gi3.gu8.p3_3)+gi3.gu8.DeliveryRequest_p12_5)+gi3.gu8.BrandSelection_p11_5)+gi3.gu8.p7_1))) * (((((gi3.gu8.p12_7+gi2.gu0.Payment_p21_3)+gi2.gu0.p2_1)+gi1.gu4.DeliveryNote_p22_12)<12)||((((((gi3.gu8.p12_7+gi3.gu8.Order_p22_6)+gi3.gu8.Delivery_p20)+gi0.gu3.p12_3)+gi1.gu4.PaidFor_p11_1)+gi1.gu4.Organization_p20_7)<44)))))
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * !(!(EX((((((((((((gi1.gu4.Status_p20+gi2.gu0.WhatDeliver_p12_1)+gi0.gu2.Status_p21_5)+gi0.gu2.p12_4)+gi2.gu7.p6_7)+gi0.gu2.p3_8)+gi2.gu7.Status_p21_11)+gi0.gu2.p11_11)+gi0.gu2.Status_p21_9)+gi0.gu2.p4_5)>(((((gi0.gu2.Delivery_p22_1+gi3.gu8.Organization_p21_2)+gi0.gu2.p11_8)+gi0.gu2.p4_5)+gi0.gu2.p3_7)+gi0.gu2.Status_p21_14))&&(((gi3.gu8.p6_1+gi0.gu2.p11_11)<=35)||(((gi1.gu5.DeliveryResponse_p12_6+gi1.gu5.Order_p22_10)+gi1.gu5.p11_13)<=((gi0.gu2.p3_8+gi1.gu5.p11_7)+gi1.gu5.p3_5))))))))) * TRUE)] = FALSE * [((FwdU(Init,TRUE) * !(!(EX((((((((((((gi1.gu4.Status_p20+gi2.gu0.WhatDeliver_p12_1)+gi0.gu2.Status_p21_5)+gi0.gu2.p12_4)+gi2.gu7.p6_7)+gi0.gu2.p3_8)+gi2.gu7.Status_p21_11)+gi0.gu2.p11_11)+gi0.gu2.Status_p21_9)+gi0.gu2.p4_5)>(((((gi0.gu2.Delivery_p22_1+gi3.gu8.Organization_p21_2)+gi0.gu2.p11_8)+gi0.gu2.p4_5)+gi0.gu2.p3_7)+gi0.gu2.Status_p21_14))&&(((gi3.gu8.p6_1+gi0.gu2.p11_11)<=35)||(((gi1.gu5.DeliveryResponse_p12_6+gi1.gu5.Order_p22_10)+gi1.gu5.p11_13)<=((gi0.gu2.p3_8+gi1.gu5.p11_7)+gi1.gu5.p3_5)))))))) * !((((((((gi0.gu2.Status_p21_9+gi0.gu3.p3_10)+gi3.gu8.DeliveryRequest_p12_5)+gi0.gu3.Order_p20_8)+gi0.gu3.p10_0)+gi0.gu3.Status_p22_13)+gi3.gu8.p6_1)<=gi0.gu2.Order_p22_3)))] = FALSE) * [((FwdU(Init,TRUE) * !(!(EX((((((((((((gi1.gu4.Status_p20+gi2.gu0.WhatDeliver_p12_1)+gi0.gu2.Status_p21_5)+gi0.gu2.p12_4)+gi2.gu7.p6_7)+gi0.gu2.p3_8)+gi2.gu7.Status_p21_11)+gi0.gu2.p11_11)+gi0.gu2.Status_p21_9)+gi0.gu2.p4_5)>(((((gi0.gu2.Delivery_p22_1+gi3.gu8.Organization_p21_2)+gi0.gu2.p11_8)+gi0.gu2.p4_5)+gi0.gu2.p3_7)+gi0.gu2.Status_p21_14))&&(((gi3.gu8.p6_1+gi0.gu2.p11_11)<=35)||(((gi1.gu5.DeliveryResponse_p12_6+gi1.gu5.Order_p22_10)+gi1.gu5.p11_13)<=((gi0.gu2.p3_8+gi1.gu5.p11_7)+gi1.gu5.p3_5)))))))) * !((((((((((gi3.gu8.Payment_p20+gi3.gu8.p8_2)+gi3.gu8.HowDeliver_p12_2)+gi3.gu8.p6_1)+gi3.gu8.p4_2)+gi3.gu8.Delivery_p20)+gi3.gu8.Organization_p21_2)+gi3.gu8.PaySchemeData_p21_6)+gi3.gu8.p12_7)<=((((gi3.gu8.p6_3+gi3.gu8.p3_3)+gi3.gu8.DeliveryRequest_p12_5)+gi3.gu8.BrandSelection_p11_5)+gi3.gu8.p7_1))))] = FALSE) * [((FwdU(Init,TRUE) * !(!(EX((((((((((((gi1.gu4.Status_p20+gi2.gu0.WhatDeliver_p12_1)+gi0.gu2.Status_p21_5)+gi0.gu2.p12_4)+gi2.gu7.p6_7)+gi0.gu2.p3_8)+gi2.gu7.Status_p21_11)+gi0.gu2.p11_11)+gi0.gu2.Status_p21_9)+gi0.gu2.p4_5)>(((((gi0.gu2.Delivery_p22_1+gi3.gu8.Organization_p21_2)+gi0.gu2.p11_8)+gi0.gu2.p4_5)+gi0.gu2.p3_7)+gi0.gu2.Status_p21_14))&&(((gi3.gu8.p6_1+gi0.gu2.p11_11)<=35)||(((gi1.gu5.DeliveryResponse_p12_6+gi1.gu5.Order_p22_10)+gi1.gu5.p11_13)<=((gi0.gu2.p3_8+gi1.gu5.p11_7)+gi1.gu5.p3_5)))))))) * !((((((gi3.gu8.p12_7+gi2.gu0.Payment_p21_3)+gi2.gu0.p2_1)+gi1.gu4.DeliveryNote_p22_12)<12)||((((((gi3.gu8.p12_7+gi3.gu8.Order_p22_6)+gi3.gu8.Delivery_p20)+gi0.gu3.p12_3)+gi1.gu4.PaidFor_p11_1)+gi1.gu4.Organization_p20_7)<44))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.68535,101836,1,0,11,409642,14,3,3708,121366,5
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EF(AX((((((((((gi1.gu4.DeliveryNote_p22_14+gi2.gu0.p8_1)+gi3.gu8.DeliveryRequest_p12_5)+gi1.gu5.p3_5)+gi1.gu5.p6_4)+gi1.gu4.DeliveryNote_p22_12)+gi1.gu5.DeliveryResponse_p12_6)+gi1.gu4.PaySchemeData_p11_10)>=4)||(gi2.gu0.p2_2<=(((((gi3.gu8.p7_1+gi0.gu3.Order_p20_8)+gi2.gu0.p3_6)+gi1.gu4.PaySchemeData_p11_10)+gi1.gu4.PaymentNote_p21_16)+gi2.gu0.Organization_p22_9))))) * EF((!(EF(((((((((gi1.gu4.Organization_p22_2+gi3.gu8.p6_1)+gi1.gu4.DeliveryHandlerDelivery_p8_0)+gi1.gu4.PaymentAmount_p11_6)+gi3.gu8.Payment_p20)+gi1.gu4.p11_3)+gi1.gu4.PaySchemeData_p11_10)+gi1.gu4.Organization_p20_7)<=(((((((((gi1.gu4.Delivery_p22_4+gi1.gu4.p11_3)+gi1.gu4.PaymentRequest_p11_9)+gi3.gu8.p8_2)+gi1.gu4.Status_p20)+gi1.gu4.DeliveryNote_p22_12)+gi1.gu4.Delivery_p20_10)+gi1.gu4.PaymentAmount_p11_6)+gi1.gu4.p3_2)+gi1.gu4.PaidFor_p11_1)))) * AF(!(AX(((((((gi2.gu7.p4_1+gi3.gu8.p7_1)+gi2.gu7.Order_p20)+gi2.gu7.Payment_p21_7)+gi2.gu7.Status_p21_11)+gi2.gu0.p6_5)<=(((((((gi1.gu4.Delivery_p20_10+gi2.gu0.p7_3)+gi3.gu8.p6_1)+gi2.gu7.p12_0)+gi2.gu7.p5_3)+gi2.gu0.p4_3)+gi2.gu7.p6_7)+gi3.gu8.Delivery_p20))))))))
=> equivalent forward existential formula: [((FwdU((Init * E(TRUE U !(EX(!((((((((((gi1.gu4.DeliveryNote_p22_14+gi2.gu0.p8_1)+gi3.gu8.DeliveryRequest_p12_5)+gi1.gu5.p3_5)+gi1.gu5.p6_4)+gi1.gu4.DeliveryNote_p22_12)+gi1.gu5.DeliveryResponse_p12_6)+gi1.gu4.PaySchemeData_p11_10)>=4)||(gi2.gu0.p2_2<=(((((gi3.gu8.p7_1+gi0.gu3.Order_p20_8)+gi2.gu0.p3_6)+gi1.gu4.PaySchemeData_p11_10)+gi1.gu4.PaymentNote_p21_16)+gi2.gu0.Organization_p22_9)))))))),TRUE) * !(E(TRUE U ((((((((gi1.gu4.Organization_p22_2+gi3.gu8.p6_1)+gi1.gu4.DeliveryHandlerDelivery_p8_0)+gi1.gu4.PaymentAmount_p11_6)+gi3.gu8.Payment_p20)+gi1.gu4.p11_3)+gi1.gu4.PaySchemeData_p11_10)+gi1.gu4.Organization_p20_7)<=(((((((((gi1.gu4.Delivery_p22_4+gi1.gu4.p11_3)+gi1.gu4.PaymentRequest_p11_9)+gi3.gu8.p8_2)+gi1.gu4.Status_p20)+gi1.gu4.DeliveryNote_p22_12)+gi1.gu4.Delivery_p20_10)+gi1.gu4.PaymentAmount_p11_6)+gi1.gu4.p3_2)+gi1.gu4.PaidFor_p11_1))))) * !(EG(!(!(!(EX(!(((((((gi2.gu7.p4_1+gi3.gu8.p7_1)+gi2.gu7.Order_p20)+gi2.gu7.Payment_p21_7)+gi2.gu7.Status_p21_11)+gi2.gu0.p6_5)<=(((((((gi1.gu4.Delivery_p20_10+gi2.gu0.p7_3)+gi3.gu8.p6_1)+gi2.gu7.p12_0)+gi2.gu7.p5_3)+gi2.gu0.p4_3)+gi2.gu7.p6_7)+gi3.gu8.Delivery_p20))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 1,0,44.5827,1116588,1,0,17,7.49831e+06,28,5,5870,4.71496e+06,13
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A((EG(EF(AX(((((((((gi1.gu4.PaymentNote_p21_16+gi1.gu4.p1_1)+gi2.gu0.WhatDeliver_p12_1)+gi1.gu4.DeliveryNote_p22_14)+gi1.gu4.PaymentRequest_p11_9)+gi1.gu4.p3_2)+gi2.gu7.p6_7)+gi1.gu5.Order_p22_10)<=gi1.gu4.p6_6)))) + ((((((((gi0.gu2.Status_p21_5+gi2.gu0.p8_1)+gi0.gu2.p3_1)+gi0.gu2.Status_p20_6)+gi0.gu2.p11_11)+gi0.gu2.Order_p22_3)+gi3.gu8.p7_1)+gi0.gu2.p5_4)<=((((gi0.gu2.OfferRequest_p10+gi2.gu0.p3_4)+gi0.gu2.Status_p21_14)+gi0.gu2.ConsumerDelivery_p6_0)+gi1.gu4.DeliveryNote_p22_12))) U AX(((((gi0.gu3.p5_1+gi0.gu3.p12_3)+gi0.gu2.p3_1)+gi0.gu3.p10_0)<=((((gi0.gu2.p4_5+gi3.gu8.p12_7)+gi1.gu4.PaymentRequest_p11_9)+gi0.gu3.Status_p22_13)+gi2.gu7.Order_p20))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((((gi0.gu3.p5_1+gi0.gu3.p12_3)+gi0.gu2.p3_1)+gi0.gu3.p10_0)<=((((gi0.gu2.p4_5+gi3.gu8.p12_7)+gi1.gu4.PaymentRequest_p11_9)+gi0.gu3.Status_p22_13)+gi2.gu7.Order_p20))))))))) * !(E(!(!(EX(!(((((gi0.gu3.p5_1+gi0.gu3.p12_3)+gi0.gu2.p3_1)+gi0.gu3.p10_0)<=((((gi0.gu2.p4_5+gi3.gu8.p12_7)+gi1.gu4.PaymentRequest_p11_9)+gi0.gu3.Status_p22_13)+gi2.gu7.Order_p20)))))) U (!((EG(E(TRUE U !(EX(!(((((((((gi1.gu4.PaymentNote_p21_16+gi1.gu4.p1_1)+gi2.gu0.WhatDeliver_p12_1)+gi1.gu4.DeliveryNote_p22_14)+gi1.gu4.PaymentRequest_p11_9)+gi1.gu4.p3_2)+gi2.gu7.p6_7)+gi1.gu5.Order_p22_10)<=gi1.gu4.p6_6)))))) + ((((((((gi0.gu2.Status_p21_5+gi2.gu0.p8_1)+gi0.gu2.p3_1)+gi0.gu2.Status_p20_6)+gi0.gu2.p11_11)+gi0.gu2.Order_p22_3)+gi3.gu8.p7_1)+gi0.gu2.p5_4)<=((((gi0.gu2.OfferRequest_p10+gi2.gu0.p3_4)+gi0.gu2.Status_p21_14)+gi0.gu2.ConsumerDelivery_p6_0)+gi1.gu4.DeliveryNote_p22_12)))) * !(!(EX(!(((((gi0.gu3.p5_1+gi0.gu3.p12_3)+gi0.gu2.p3_1)+gi0.gu3.p10_0)<=((((gi0.gu2.p4_5+gi3.gu8.p12_7)+gi1.gu4.PaymentRequest_p11_9)+gi0.gu3.Status_p22_13)+gi2.gu7.Order_p20))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 2,0,76.4096,1906236,1,0,25,1.28426e+07,37,9,6882,8.14113e+06,22
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(AX(((gi2.gu0.p8_1+gi0.gu2.Status_p21_9)<=1)))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(((gi2.gu0.p8_1+gi0.gu2.Status_p21_9)<=1)))] = FALSE
(forward)formula 3,1,76.4251,1906236,1,0,30,1.28439e+07,39,11,6889,8.14282e+06,25
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AX(EF(EX(AX(FALSE)))) * A(!(AX(EX(TRUE))) U EF(EG((((((((((gi2.gu0.Organization_p22_9+gi2.gu0.p3_4)+gi2.gu0.p3_6)+gi2.gu0.p4_3)+gi1.gu4.p11_3)+gi2.gu0.p7_3)+gi2.gu0.Payment_p21_3)+gi2.gu0.PayReceipt_p21_15)+gi2.gu0.WhatDeliver_p12_1)<=((gi2.gu0.p6_5+gi2.gu0.WhatDeliver_p12_1)+gi2.gu0.p8_1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EX(!(EX(!(FALSE)))))))] = FALSE * ([((FwdU(Init,!(E(TRUE U EG((((((((((gi2.gu0.Organization_p22_9+gi2.gu0.p3_4)+gi2.gu0.p3_6)+gi2.gu0.p4_3)+gi1.gu4.p11_3)+gi2.gu0.p7_3)+gi2.gu0.Payment_p21_3)+gi2.gu0.PayReceipt_p21_15)+gi2.gu0.WhatDeliver_p12_1)<=((gi2.gu0.p6_5+gi2.gu0.WhatDeliver_p12_1)+gi2.gu0.p8_1)))))) * !(!(!(EX(!(EX(TRUE))))))) * !(E(TRUE U EG((((((((((gi2.gu0.Organization_p22_9+gi2.gu0.p3_4)+gi2.gu0.p3_6)+gi2.gu0.p4_3)+gi1.gu4.p11_3)+gi2.gu0.p7_3)+gi2.gu0.Payment_p21_3)+gi2.gu0.PayReceipt_p21_15)+gi2.gu0.WhatDeliver_p12_1)<=((gi2.gu0.p6_5+gi2.gu0.WhatDeliver_p12_1)+gi2.gu0.p8_1))))))] = FALSE * [FwdG(Init,!(E(TRUE U EG((((((((((gi2.gu0.Organization_p22_9+gi2.gu0.p3_4)+gi2.gu0.p3_6)+gi2.gu0.p4_3)+gi1.gu4.p11_3)+gi2.gu0.p7_3)+gi2.gu0.Payment_p21_3)+gi2.gu0.PayReceipt_p21_15)+gi2.gu0.WhatDeliver_p12_1)<=((gi2.gu0.p6_5+gi2.gu0.WhatDeliver_p12_1)+gi2.gu0.p8_1))))))] = FALSE))
(forward)formula 4,0,85.2724,2012676,1,0,31,1.36148e+07,48,12,7476,8.58018e+06,29
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1620838237069

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406800361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;