fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075407000482
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Kanban-PT-00005

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
241.331 4387.00 8678.00 189.40 FFFFTFFFTTTTFFFT normal

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-162075407000482.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 Kanban-PT-00005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00005-CTLFireability-00
FORMULA_NAME Kanban-PT-00005-CTLFireability-01
FORMULA_NAME Kanban-PT-00005-CTLFireability-02
FORMULA_NAME Kanban-PT-00005-CTLFireability-03
FORMULA_NAME Kanban-PT-00005-CTLFireability-04
FORMULA_NAME Kanban-PT-00005-CTLFireability-05
FORMULA_NAME Kanban-PT-00005-CTLFireability-06
FORMULA_NAME Kanban-PT-00005-CTLFireability-07
FORMULA_NAME Kanban-PT-00005-CTLFireability-08
FORMULA_NAME Kanban-PT-00005-CTLFireability-09
FORMULA_NAME Kanban-PT-00005-CTLFireability-10
FORMULA_NAME Kanban-PT-00005-CTLFireability-11
FORMULA_NAME Kanban-PT-00005-CTLFireability-12
FORMULA_NAME Kanban-PT-00005-CTLFireability-13
FORMULA_NAME Kanban-PT-00005-CTLFireability-14
FORMULA_NAME Kanban-PT-00005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620856950158

Running Version 0
[2021-05-12 22:02:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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 22:02:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:02:31] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 22:02:31] [INFO ] Transformed 16 places.
[2021-05-12 22:02:31] [INFO ] Transformed 16 transitions.
[2021-05-12 22:02:31] [INFO ] Parsed PT model containing 16 places and 16 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2021-05-12 22:02:31] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:02:31] [INFO ] Reduced 1 identical enabling conditions.
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:02:32] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-12 22:02:32] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:02:32] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:02:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:02:32] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-12 22:02:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 22 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 6 ms
[2021-05-12 22:02:32] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=500 ) properties (out of 85) seen :83
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:02:32] [INFO ] Computed 5 place invariants in 0 ms
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2021-05-12 22:02:32] [INFO ] Initial state test concluded for 1 properties.
FORMULA Kanban-PT-00005-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 7 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Input system was already deterministic with 15 transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6778141736631060778.gal : 1 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5538069191187967744.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/CTLFireability6778141736631060778.gal, -t, CGAL, -ctl, /tmp/CTLFireability5538069191187967744.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/CTLFireability6778141736631060778.gal -t CGAL -ctl /tmp/CTLFireability5538069191187967744.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,954912,0.020885,4692,2,85,5,4092,6,0,74,4324,0


Converting to forward existential form...Done !
original formula: EF(AG((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.027245,5192,1,0,6,4092,15,0,377,4324,5
FORMULA Kanban-PT-00005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15419481867221690825.gal : 1 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12762350601101035127.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/CTLFireability15419481867221690825.gal, -t, CGAL, -ctl, /tmp/CTLFireability12762350601101035127.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/CTLFireability15419481867221690825.gal -t CGAL -ctl /tmp/CTLFireability12762350601101035127.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,2.54643e+06,0.016804,4832,2,82,5,4002,6,0,83,4172,0


Converting to forward existential form...Done !
original formula: !(EF((((((((((AF(EG(((Pm4>=1)||(Pout1>=1)))) * (Pm3<1)) * (Pback3<1)) * (((Pout3<1)||(P1<1))||(Pout2<1))) * (P4<1)) * (Pm4<1)) * (Pback4<1)) * (Pm1<1)) * (((P3<1)||(Pout4<1))||(P2<1))) * (Pback2<1))))
=> equivalent forward existential formula: [((((((((((FwdU(Init,TRUE) * (Pback2<1)) * (((P3<1)||(Pout4<1))||(P2<1))) * (Pm1<1)) * (Pback4<1)) * (Pm4<1)) * (P4<1)) * (((Pout3<1)||(P1<1))||(Pout2<1))) * (Pback3<1)) * (Pm3<1)) * !(EG(!(EG(((Pm4>=1)||(Pout1>=1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.029648,5540,1,0,28,4002,32,12,449,4172,16
FORMULA Kanban-PT-00005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize gal into /tmp/CTLFireability932651471642795193.gal : 1 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize properties into /tmp/CTLFireability923650846319495179.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/CTLFireability932651471642795193.gal, -t, CGAL, -ctl, /tmp/CTLFireability923650846319495179.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/CTLFireability932651471642795193.gal -t CGAL -ctl /tmp/CTLFireability923650846319495179.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,2.54643e+06,0.01654,4792,2,82,5,4002,6,0,83,4172,0


Converting to forward existential form...Done !
original formula: A(AG(EF((((((((AG(((((((((P4>=1)||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) + A(((Pm4>=1)||(Pm1>=1)) U (Pm2>=1))) + (Pm4>=1)) + (Pback4>=1)) + (Pout1>=1)) + (Pm2>=1)) + (Pback2>=1)) + (((P3>=1)&&(Pout4>=1))&&(P2>=1))))) U ((((((EF(AG((Pback2>=1))) + (Pm3>=1)) + (Pm4>=1)) + (Pback4>=1)) + (Pm1>=1)) + (Pout1>=1)) + (Pm2>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((((((E(TRUE U !(E(TRUE U !((Pback2>=1))))) + (Pm3>=1)) + (Pm4>=1)) + (Pback4>=1)) + (Pm1>=1)) + (Pout1>=1)) + (Pm2>=1)))))) * !(E(!(((((((E(TRUE U !(E(TRUE U !((Pback2>=1))))) + (Pm3>=1)) + (Pm4>=1)) + (Pback4>=1)) + (Pm1>=1)) + (Pout1>=1)) + (Pm2>=1))) U (!(!(E(TRUE U !(E(TRUE U (((((((!(E(TRUE U !(((((((((P4>=1)||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))) + !((E(!((Pm2>=1)) U (!(((Pm4>=1)||(Pm1>=1))) * !((Pm2>=1)))) + EG(!((Pm2>=1)))))) + (Pm4>=1)) + (Pback4>=1)) + (Pout1>=1)) + (Pm2>=1)) + (Pback2>=1)) + (((P3>=1)&&(Pout4>=1))&&(P2>=1)))))))) * !(((((((E(TRUE U !(E(TRUE U !((Pback2>=1))))) + (Pm3>=1)) + (Pm4>=1)) + (Pback4>=1)) + (Pm1>=1)) + (Pout1>=1)) + (Pm2>=1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 12/0/4
Using saturation style SCC detection
(forward)formula 0,1,0.053382,6084,1,0,29,7078,43,15,496,7425,25
FORMULA Kanban-PT-00005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17911389354734120959.gal : 1 ms
[2021-05-12 22:02:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15441928575211339345.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/CTLFireability17911389354734120959.gal, -t, CGAL, -ctl, /tmp/CTLFireability15441928575211339345.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/CTLFireability17911389354734120959.gal -t CGAL -ctl /tmp/CTLFireability15441928575211339345.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,2.54643e+06,0.016904,4948,2,82,5,4002,6,0,83,4172,0


Converting to forward existential form...Done !
original formula: AG((!(EF((((((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))||(Pback3>=1))||(Pback4>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))) * ((((!(AF(((((Pback4>=1)||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) + (Pm3>=1)) + (Pback3>=1)) + (Pm1>=1)) + (Pm2>=1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * (((((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))||(Pback3>=1))||(Pback4>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))] = FALSE * [(((((FwdU(Init,TRUE) * !((Pm2>=1))) * !((Pm1>=1))) * !((Pback3>=1))) * !((Pm3>=1))) * !(EG(!(((((Pback4>=1)||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.045562,6120,1,0,19,8015,27,10,424,6722,10
FORMULA Kanban-PT-00005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-12 22:02:33] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:02:33] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:02:33] [INFO ] Applying decomposition
[2021-05-12 22:02:33] [INFO ] Flatten gal took : 3 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/graph6283683743753957831.txt, -o, /tmp/graph6283683743753957831.bin, -w, /tmp/graph6283683743753957831.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/graph6283683743753957831.bin, -l, -1, -v, -w, /tmp/graph6283683743753957831.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:02:33] [INFO ] Decomposing Gal with order
[2021-05-12 22:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:02:33] [INFO ] Flatten gal took : 24 ms
[2021-05-12 22:02:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 22:02:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16379055791404950752.gal : 1 ms
[2021-05-12 22:02:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10426120580925962926.ctl : 4 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/CTLFireability16379055791404950752.gal, -t, CGAL, -ctl, /tmp/CTLFireability10426120580925962926.ctl], 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/CTLFireability16379055791404950752.gal -t CGAL -ctl /tmp/CTLFireability10426120580925962926.ctl
No direction supplied, using forward translation only.
Parsed 11 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,2.54643e+06,0.007589,4348,36,72,293,426,55,295,34,671,0


Converting to forward existential form...Done !
original formula: !(AG(AF((A(((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(i2.u3.Pm1>=1))||(u4.Pm2>=1)) U (((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) * (AX(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) + EG((((((u0.Pm3>=1)||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!((E(!((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) U (!(((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))) * !((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + EG(!((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1)))))) * (!(EX(!(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))) + EG((((((u0.Pm3>=1)||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,0,0.054802,6696,1,0,2460,1598,202,7316,125,8734,2819
FORMULA Kanban-PT-00005-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E((EX(AG((u0.Pm3>=1))) + (!(E(((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pback2>=1)) U ((((u0.Pback3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1)))) * (((u0.Pback3>=1)||(u1.Pback4>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))) U (((u1.Pm4<1)&&(i2.u2.Pout1<1))&&(u4.Pback2<1))) * !(AG(EX((EF((((((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) * AF(((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))))))
=> equivalent forward existential formula: [(FwdU((Init * E((EX(!(E(TRUE U !((u0.Pm3>=1))))) + (!(E(((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pback2>=1)) U ((((u0.Pback3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1)))) * (((u0.Pback3>=1)||(u1.Pback4>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))) U (((u1.Pm4<1)&&(i2.u2.Pout1<1))&&(u4.Pback2<1)))),TRUE) * !(EX((E(TRUE U (((((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) * !(EG(!(((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))))))] != FALSE
(forward)formula 1,0,0.061054,7224,1,0,2574,1671,285,7450,140,8913,3280
FORMULA Kanban-PT-00005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EF(!(EF((((((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.P4<1))&&(i2.u3.Pm1<1))&&(i2.u3.Pback1<1))&&(((u4.P3<1)||(u1.Pout4<1))||(u0.P2<1)))&&(u4.Pback2<1))||((u1.Pm4<1)&&(i2.u3.Pm1<1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (((((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.P4<1))&&(i2.u3.Pm1<1))&&(i2.u3.Pback1<1))&&(((u4.P3<1)||(u1.Pout4<1))||(u0.P2<1)))&&(u4.Pback2<1))||((u1.Pm4<1)&&(i2.u3.Pm1<1))))))))] = FALSE
(forward)formula 2,0,0.065343,7224,1,0,2688,1805,328,7581,146,9166,3544
FORMULA Kanban-PT-00005-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((E(AX((((((((((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.P4>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))||(u0.Pm3>=1))||(u0.Pback3>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) U (((((((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))&&((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))&&(((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) + A(((((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)) U ((u0.Pm3>=1)||(u1.Pm4>=1)))) + AF(((u0.Pm3>=1)||(u1.Pm4>=1))))) + !(AG(EX(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))) + (E(EF((((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) U A(((((i2.u3.Pm1>=1)||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))) U (u1.Pm4<1))) * ((((u0.Pm3>=1)||(u1.Pback4>=1))||(u4.Pm2>=1)) + (!(EG(((i2.u3.Pm1>=1)||(i2.u2.Pout1>=1)))) * E((((u0.Pback3>=1)||(u1.P4>=1))&&((((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) U (((((u0.Pm3<1)&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pm1<1))&&(u4.Pm2<1))))))) U EX((!(EX((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u0.Pback3>=1))||(u1.Pm4>=1)))) * ((((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,((E(!(EX(!((((((((((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.P4>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))||(u0.Pm3>=1))||(u0.Pback3>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) U (((((((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))&&((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))&&(((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) + !((E(!(((u0.Pm3>=1)||(u1.Pm4>=1))) U (!(((((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) * !(((u0.Pm3>=1)||(u1.Pm4>=1))))) + EG(!(((u0.Pm3>=1)||(u1.Pm4>=1))))))) + !(EG(!(((u0.Pm3>=1)||(u1.Pm4>=1))))))) + !(!(E(TRUE U !(EX(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))))) + (E(E(TRUE U (((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) U !((E(!((u1.Pm4<1)) U (!(((((i2.u3.Pm1>=1)||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) * !((u1.Pm4<1)))) + EG(!((u1.Pm4<1)))))) * ((((u0.Pm3>=1)||(u1.Pback4>=1))||(u4.Pm2>=1)) + (!(EG(((i2.u3.Pm1>=1)||(i2.u2.Pout1>=1)))) * E((((u0.Pback3>=1)||(u1.P4>=1))&&((((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) U (((((u0.Pm3<1)&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pm1<1))&&(u4.Pm2<1))))))))) * ((((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))) * !(EX((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u0.Pback3>=1))||(u1.Pm4>=1)))))] != FALSE
(forward)formula 3,1,0.379762,16200,1,0,16284,5688,511,34790,158,33159,16695
FORMULA Kanban-PT-00005-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(E(AG(((((EG((((u0.Pm3>=1)||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) * (u1.P4<1)) * (u1.Pm4<1)) * (u4.Pm2<1)) * (i2.u3.Pm1<1))) U EG(E(EX(((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u2.Pout1>=1))||(u4.Pback2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) U AG((((u1.Pm4>=1)||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !(((((EG((((u0.Pm3>=1)||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) * (u1.P4<1)) * (u1.Pm4<1)) * (u4.Pm2<1)) * (i2.u3.Pm1<1))))) U EG(E(EX(((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u2.Pout1>=1))||(u4.Pback2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))) U !(E(TRUE U !((((u1.Pm4>=1)||(i2.u3.Pback1>=1))||(u4.Pm2>=1))))))))))] = FALSE
(forward)formula 4,0,0.387803,16464,1,0,16566,5762,534,35342,158,33587,17002
FORMULA Kanban-PT-00005-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(E(((((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pback2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))) U !(E(((((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pm1<1))&&(i2.u3.Pback1<1))||(((u1.P4<1)&&(u1.Pm4<1))&&(u4.Pback2<1))) U E((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1)) U ((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(((((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pback2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))) U !(E(((((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pm1<1))&&(i2.u3.Pback1<1))||(((u1.P4<1)&&(u1.Pm4<1))&&(u4.Pback2<1))) U E((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1)) U ((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))))))))] = FALSE
(forward)formula 5,0,0.398026,16464,1,0,16657,5806,564,35693,158,33974,17116
FORMULA Kanban-PT-00005-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E((i2.u3.Pback1>=1) U EX((AF((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))) + EG(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))) * ((!(EX(!(E(AG(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) U AX((((u0.Pm3>=1)||(u1.Pm4>=1))||(i2.u3.Pback1>=1))))))) + E((((u1.Pm4>=1)||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1)) U E(EX(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))) U ((((((((((u1.P4>=1)||(i2.u3.Pm1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u0.Pm3>=1))||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))) + EF(!(AF(((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(u0.Pback3>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))
=> equivalent forward existential formula: ([(Init * !(E((i2.u3.Pback1>=1) U EX((!(EG(!((((((u0.Pm3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))))) + EG(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))))))))] = FALSE * [(EY(((Init * !(E(TRUE U !(!(EG(!(((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(u0.Pback3>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))))))))) * !(E((((u1.Pm4>=1)||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1)) U E(EX(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))) U ((((((((((u1.P4>=1)||(i2.u3.Pm1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u0.Pm3>=1))||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))))) * !(E(!(E(TRUE U !(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))))) U !(EX(!((((u0.Pm3>=1)||(u1.Pm4>=1))||(i2.u3.Pback1>=1))))))))] = FALSE)
(forward)formula 6,1,0.413719,16992,1,0,17184,6110,622,36769,158,34903,17669
FORMULA Kanban-PT-00005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((EX(((((((((((((u0.Pm3<1)&&(i2.u2.Pout1<1))&&(u4.Pm2<1))||((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.P4<1))&&(u1.Pm4<1))&&(u1.Pback4<1)))||(u0.Pm3>=1))||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))&&((((((((((((((((((((u0.Pback3>=1)||(u4.Pm2>=1))||(u4.Pback2>=1))||(u0.Pm3>=1))||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))||(u0.Pm3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))||((u1.Pm4<1)&&(u1.Pback4<1)))||((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.Pm4<1))&&(i2.u3.Pm1<1))&&(i2.u2.Pout1<1))))) + A((((u0.Pm3>=1)||(i2.u3.Pm1>=1))||(u4.Pm2>=1)) U ((AG(EX((u0.Pback3>=1))) + (u1.Pback4>=1)) + (i2.u2.Pout1>=1)))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * ((((((((((((u0.Pm3<1)&&(i2.u2.Pout1<1))&&(u4.Pm2<1))||((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.P4<1))&&(u1.Pm4<1))&&(u1.Pback4<1)))||(u0.Pm3>=1))||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))&&((((((((((((((((((((u0.Pback3>=1)||(u4.Pm2>=1))||(u4.Pback2>=1))||(u0.Pm3>=1))||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(i2.u3.Pback1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))||(u0.Pm3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))||((u1.Pm4<1)&&(u1.Pback4<1)))||((((((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))&&(u1.Pm4<1))&&(i2.u3.Pm1<1))&&(i2.u2.Pout1<1)))))] != FALSE + [((EY(Init) * !(EG(!(((!(E(TRUE U !(EX((u0.Pback3>=1))))) + (u1.Pback4>=1)) + (i2.u2.Pout1>=1)))))) * !(E(!(((!(E(TRUE U !(EX((u0.Pback3>=1))))) + (u1.Pback4>=1)) + (i2.u2.Pout1>=1))) U (!((((u0.Pm3>=1)||(i2.u3.Pm1>=1))||(u4.Pm2>=1))) * !(((!(E(TRUE U !(EX((u0.Pback3>=1))))) + (u1.Pback4>=1)) + (i2.u2.Pout1>=1)))))))] != FALSE)
(forward)formula 7,1,0.422162,16992,1,0,17324,6117,675,37013,164,34987,17986
FORMULA Kanban-PT-00005-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((((i2.u3.Pback1>=1) + ((AX((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))) * EX(AG(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))))) * (A(A(((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)) U (((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))) U (((((u0.Pm3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) + (EX((((i2.u3.Pm1>=1)||(i2.u3.Pback1>=1))&&(u4.Pback2>=1))) * ((((AF(((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pback2>=1))) + (u0.Pm3>=1)) + (i2.u3.Pback1>=1)) + (((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))) + (((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))&&(((((((u0.Pm3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))))) + (((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))
=> equivalent forward existential formula: (([(EY(Init) * (i2.u3.Pback1>=1))] != FALSE + ([(((EY(Init) * (!(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))))) * EX(!(E(TRUE U !(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))) * !(EG(!((((((u0.Pm3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))))) * !(E(!((((((u0.Pm3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) U (!(!((E(!((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))) U (!(((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))) * !((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))))) + EG(!((((((u0.Pm3>=1)||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))))))) * !((((((u0.Pm3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))))))] != FALSE + (((([(((EY(Init) * (!(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))))) * EX(!(E(TRUE U !(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))) * EX((((i2.u3.Pm1>=1)||(i2.u3.Pback1>=1))&&(u4.Pback2>=1)))) * !(EG(!(((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pback2>=1))))))] != FALSE + [(((EY(Init) * (!(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))))) * EX(!(E(TRUE U !(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))) * EX((((i2.u3.Pm1>=1)||(i2.u3.Pback1>=1))&&(u4.Pback2>=1)))) * (u0.Pm3>=1))] != FALSE) + [(((EY(Init) * (!(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))))) * EX(!(E(TRUE U !(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))) * EX((((i2.u3.Pm1>=1)||(i2.u3.Pback1>=1))&&(u4.Pback2>=1)))) * (i2.u3.Pback1>=1))] != FALSE) + [(((EY(Init) * (!(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))))) * EX(!(E(TRUE U !(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))) * EX((((i2.u3.Pm1>=1)||(i2.u3.Pback1>=1))&&(u4.Pback2>=1)))) * (((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))] != FALSE) + [(((EY(Init) * (!(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))))) * EX(!(E(TRUE U !(((((((((u0.Pback3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))) * EX((((i2.u3.Pm1>=1)||(i2.u3.Pback1>=1))&&(u4.Pback2>=1)))) * (((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))&&(((((((u0.Pm3>=1)||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))] != FALSE))) + [(EY(Init) * (((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))] != FALSE)
(forward)formula 8,0,0.462936,17784,1,0,19599,6345,734,39137,164,35869,21140
FORMULA Kanban-PT-00005-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AX(((u1.Pm4>=1)||(i2.u3.Pm1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((u1.Pm4>=1)||(i2.u3.Pm1>=1))))))] != FALSE
(forward)formula 9,0,0.463971,17784,1,0,19671,6357,738,39241,164,35900,21189
FORMULA Kanban-PT-00005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(A((!(EF(((((((u0.Pm3<1)&&(((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1)))&&(i2.u3.Pm1<1))&&(i2.u2.Pout1<1))&&(i2.u3.Pback1<1))&&(u4.Pm2<1)))) * (!(EG((((((u0.Pback3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))) + (((((((((((!(EG((((((((u0.Pback3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))) * (u0.Pm3<1)) * (u0.Pback3<1)) * (u1.P4<1)) * (u1.Pm4<1)) * (u1.Pback4<1)) * (i2.u3.Pm1<1)) * (u4.Pm2<1)) * (u4.Pback2<1)) * (i2.u3.Pback1<1)) * (((u4.P3<1)||(u1.Pout4<1))||(u0.P2<1))) * (((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))))) U ((((((((AG(((((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) + (u0.Pm3>=1)) + (u1.P4>=1)) + (u1.Pm4>=1)) + (i2.u3.Pm1>=1)) + (i2.u3.Pback1>=1)) + (u4.Pm2>=1)) + (u4.Pback2>=1)) + (((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))))
=> equivalent forward existential formula: ([(FwdU((((((((((FwdU(EY(Init),!(((((((((!(E(TRUE U !(((((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + (u0.Pm3>=1)) + (u1.P4>=1)) + (u1.Pm4>=1)) + (i2.u3.Pm1>=1)) + (i2.u3.Pback1>=1)) + (u4.Pm2>=1)) + (u4.Pback2>=1)) + (((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))))) * !((!(E(TRUE U ((((((u0.Pm3<1)&&(((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1)))&&(i2.u3.Pm1<1))&&(i2.u2.Pout1<1))&&(i2.u3.Pback1<1))&&(u4.Pm2<1)))) * (!(EG((((((u0.Pback3>=1)||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))) + (((((((((((!(EG((((((((u0.Pback3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))) * (u0.Pm3<1)) * (u0.Pback3<1)) * (u1.P4<1)) * (u1.Pm4<1)) * (u1.Pback4<1)) * (i2.u3.Pm1<1)) * (u4.Pm2<1)) * (u4.Pback2<1)) * (i2.u3.Pback1<1)) * (((u4.P3<1)||(u1.Pout4<1))||(u0.P2<1))) * (((u0.Pout3<1)||(i2.u2.P1<1))||(u4.Pout2<1))))))) * !((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))) * !((u4.Pback2>=1))) * !((u4.Pm2>=1))) * !((i2.u3.Pback1>=1))) * !((i2.u3.Pm1>=1))) * !((u1.Pm4>=1))) * !((u1.P4>=1))) * !((u0.Pm3>=1))),TRUE) * !(((((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))] = FALSE * [FwdG(EY(Init),!(((((((((!(E(TRUE U !(((((((((((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + (u0.Pm3>=1)) + (u1.P4>=1)) + (u1.Pm4>=1)) + (i2.u3.Pm1>=1)) + (i2.u3.Pback1>=1)) + (u4.Pm2>=1)) + (u4.Pback2>=1)) + (((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))))] = FALSE)
(forward)formula 10,1,0.489496,18312,1,0,20057,6479,785,39862,164,36376,21813
FORMULA Kanban-PT-00005-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620856954545

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="Kanban-PT-00005"
export BK_EXAMINATION="CTLFireability"
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 Kanban-PT-00005, examination is CTLFireability"
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-162075407000482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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