Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698600132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 37K Mar 24 05:37 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 BridgeAndVehicles-COL-V04P05N02-CTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589207028073

[2020-05-11 14:23:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 14:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:23:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-11 14:23:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2020-05-11 14:23:52] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-05-11 14:23:52] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 32 ms.
[2020-05-11 14:23:52] [INFO ] Computed order based on color domains.
[2020-05-11 14:23:52] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 7 ms.
[2020-05-11 14:23:52] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Incomplete random walk after 100000 steps, including 2300 resets, run finished after 358 ms. (steps per millisecond=279 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
[2020-05-11 14:23:53] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 14:23:53] [INFO ] Computed 7 place invariants in 4 ms
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-11 14:23:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-11 14:23:53] [INFO ] [Real]Added 6 Read/Feed constraints in 7 ms returned sat
[2020-05-11 14:23:53] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 5 ms.
[2020-05-11 14:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:53] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-11 14:23:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2020-05-11 14:23:53] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 6 ms.
[2020-05-11 14:23:53] [INFO ] Added : 27 causal constraints over 6 iterations in 58 ms. Result :sat
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Real]Added 6 Read/Feed constraints in 7 ms returned sat
[2020-05-11 14:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:53] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2020-05-11 14:23:53] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2020-05-11 14:23:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-11 14:23:53] [INFO ] [Real]Added 6 Read/Feed constraints in 28 ms returned sat
[2020-05-11 14:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:54] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:54] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-05-11 14:23:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2020-05-11 14:23:54] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2020-05-11 14:23:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-05-11 14:23:54] [INFO ] Deduced a trap composed of 6 places in 46 ms
[2020-05-11 14:23:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2020-05-11 14:23:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:54] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-05-11 14:23:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 14:23:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 42 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 14:23:54] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2020-05-11 14:23:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 29 ms returned sat
[2020-05-11 14:23:54] [INFO ] Deduced a trap composed of 11 places in 12 ms
[2020-05-11 14:23:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2020-05-11 14:23:54] [INFO ] [Real]Absence check using 7 positive place invariants in 37 ms returned unsat
[2020-05-11 14:23:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-05-11 14:23:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-11 14:23:55] [INFO ] Flatten gal took : 50 ms
[2020-05-11 14:23:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-11 14:23:55] [INFO ] Flatten gal took : 20 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 14:23:55] [INFO ] Applying decomposition
[2020-05-11 14:23:55] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10068593022088962521.txt, -o, /tmp/graph10068593022088962521.bin, -w, /tmp/graph10068593022088962521.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10068593022088962521.bin, -l, -1, -v, -w, /tmp/graph10068593022088962521.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 14:23:55] [INFO ] Decomposing Gal with order
[2020-05-11 14:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 14:23:55] [INFO ] Removed a total of 77 redundant transitions.
[2020-05-11 14:23:55] [INFO ] Flatten gal took : 63 ms
[2020-05-11 14:23:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2020-05-11 14:23:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 1 ms
[2020-05-11 14:23:55] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
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,2874,0.057291,6008,602,268,4189,570,114,3049,61,1239,0


Converting to forward existential form...Done !
original formula: AF(((EG(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))) * (((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))) * (AF((((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_1>=1))||((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_0>=1)))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_1>=1)))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_0>=1)))) + (u0.SUR_PONT_A_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))) * (((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))) * (!(EG(!((((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_1>=1))||((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_0>=1)))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_1>=1)))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_0>=1)))))) + (u0.SUR_PONT_A_0>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions enregistrement_AcA0, basculements0, basculements1, enregistrement_BcB0, altern_cpts0cpt2, timeout_As0cpt0cA0cB4, timeout_As0cpt2cA0cB4, timeout_Bs1cpt0cA2cB0, timeout_Bs1cpt2cA2cB0, u0.liberation_A, u0.liberation_B, i2.altern_cpts1cpt2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :2/12/12/26
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.289573,14576,1,0,22590,2300,660,20090,408,7038,46389
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(!(AF((u0.SUR_PONT_A_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!(EG(!((u0.SUR_PONT_A_0>=1)))))))] = FALSE
dead was empty
(forward)formula 1,1,0.315274,15368,1,0,24261,2329,678,21762,409,7126,50446
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((EF((((((((u4.NB_ATTENTE_B_3<1)||(u4.ROUTE_B_0<1))&&((u4.NB_ATTENTE_B_2<1)||(u4.ROUTE_B_0<1)))&&((u4.NB_ATTENTE_B_4<1)||(u4.ROUTE_B_0<1)))&&((i2.u3.NB_ATTENTE_B_0<1)||(u4.ROUTE_B_0<1)))&&((u4.NB_ATTENTE_B_1<1)||(u4.ROUTE_B_0<1)))||(((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1))))) + ((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_3>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))) + ((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_1>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))) + ((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_4>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))) + ((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_2>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))))
=> equivalent forward existential formula: [(((((FwdU(Init,TRUE) * !(((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_2>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1)))) * !(((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_4>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1)))) * !(((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_1>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1)))) * !(((((u0.CAPACITE_0>=1)&&(u4.NB_ATTENTE_B_3>=1))&&(u4.ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1)))) * !(E(TRUE U (((((((u4.NB_ATTENTE_B_3<1)||(u4.ROUTE_B_0<1))&&((u4.NB_ATTENTE_B_2<1)||(u4.ROUTE_B_0<1)))&&((u4.NB_ATTENTE_B_4<1)||(u4.ROUTE_B_0<1)))&&((i2.u3.NB_ATTENTE_B_0<1)||(u4.ROUTE_B_0<1)))&&((u4.NB_ATTENTE_B_1<1)||(u4.ROUTE_B_0<1)))||(((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))))))] = FALSE
(forward)formula 2,1,0.324561,15896,1,0,24956,2391,752,23036,426,7199,51752
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(EG(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1))))) * AX((AX((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))) + (((((((((((((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1))))))
=> equivalent forward existential formula: ([(Init * !(EX(EG(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))))))] = FALSE * [(EY((EY(Init) * !((((((((((((((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1)))&&((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_0<1)))))) * !((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))))] = FALSE)
(forward)formula 3,0,0.333596,16160,1,0,25097,2400,808,23254,428,7295,52356
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))))] = FALSE
(forward)formula 4,0,0.383704,17480,1,0,28702,2406,823,25679,428,7302,60578
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((EF(((u0.SUR_PONT_B_0>=1)&&(u0.SUR_PONT_A_0>=1))) + A(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1))) U (u0.SUR_PONT_A_0>=1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * ((u0.SUR_PONT_B_0>=1)&&(u0.SUR_PONT_A_0>=1)))] != FALSE + [((EY(Init) * !(EG(!((u0.SUR_PONT_A_0>=1))))) * !(E(!((u0.SUR_PONT_A_0>=1)) U (!(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))) * !((u0.SUR_PONT_A_0>=1))))))] != FALSE)
(forward)formula 5,0,0.414874,18536,1,0,30284,2473,831,27229,430,7483,63187
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF((u0.SUR_PONT_A_0<1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (u0.SUR_PONT_A_0<1)))] != FALSE
(forward)formula 6,1,0.431636,18800,1,0,30720,2473,831,27895,430,7502,64199
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((!(AG((((u0.CAPACITE_0>=5)&&(u1.VIDANGE_1>=1))||((u0.CAPACITE_0>=5)&&(i2.u3.VIDANGE_0>=1))))) * (u0.SUR_PONT_B_0<1)))
=> equivalent forward existential formula: [FwdG(Init,(!(!(E(TRUE U !((((u0.CAPACITE_0>=5)&&(u1.VIDANGE_1>=1))||((u0.CAPACITE_0>=5)&&(i2.u3.VIDANGE_0>=1))))))) * (u0.SUR_PONT_B_0<1)))] != FALSE
(forward)formula 7,0,0.46857,19592,1,0,33560,2710,844,30915,430,8540,69235
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((((((((((EF(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * (((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))) * (((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))))
=> equivalent forward existential formula: [(FwdU(((((((((((FwdU(Init,TRUE) * (((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))) * (((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_4<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_3<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_2<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_2<1))) * ((((u1.NB_ATTENTE_A_0<1)||(u4.NB_ATTENTE_B_1<1))||(u1.CONTROLEUR_0<1))||(i2.u5.COMPTEUR_1<1))),TRUE) * ((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1))))] != FALSE
(forward)formula 8,0,0.48507,20120,1,0,33583,2711,921,30961,433,8564,69369
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((!(EG((((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))))) * ((((((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))||((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG((((((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_1>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_4>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_3>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1)))||((((u0.CAPACITE_0>=1)&&(u2.NB_ATTENTE_A_2>=1))&&(u2.ATTENTE_A_0>=1))&&(u1.CONTROLEUR_0>=1))))) * ((((((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))||((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))))] != FALSE
dead was empty
(forward)formula 9,0,0.502262,20120,1,0,33598,2711,937,31043,433,8564,69379
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A(AF((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))) U EG((((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG((((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))))) * !(!(EG(!((((u0.CHOIX_0>=1)&&(i2.u5.COMPTEUR_2>=1))||((i2.u3.CHOIX_1>=1)&&(i2.u5.COMPTEUR_2>=1)))))))) * !(EG((((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1))))))] != FALSE + [FwdG(Init,!(EG((((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1))))))] != FALSE)
(forward)formula 10,1,0.540655,21968,1,0,38496,2731,956,35058,433,8666,77412
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_3>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_4>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))||((((u2.NB_ATTENTE_A_1>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_1>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_0>=1)))||((((u2.NB_ATTENTE_A_2>=1)&&(i2.u3.NB_ATTENTE_B_0>=1))&&(i2.u3.CONTROLEUR_1>=1))&&(i2.u5.COMPTEUR_2>=1)))))] = FALSE
(forward)formula 11,0,0.578839,23024,1,0,41584,2734,970,37203,433,8748,84634
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(AG(((((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))||((u0.CAPACITE_0>=5)&&(u1.VIDANGE_1>=1)))||((u0.CAPACITE_0>=5)&&(i2.u3.VIDANGE_0>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1)))||((u0.CAPACITE_0>=5)&&(u1.VIDANGE_1>=1)))||((u0.CAPACITE_0>=5)&&(i2.u3.VIDANGE_0>=1)))))))] = FALSE
(forward)formula 12,1,0.600399,23288,1,0,42296,2734,973,38044,433,8861,85757
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((!(AG(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1))))) + ((((((u2.NB_ATTENTE_A_2<1)||(u2.ROUTE_A_0<1))&&((u2.NB_ATTENTE_A_3<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_4<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_1<1)||(u2.ROUTE_A_0<1)))&&((u1.NB_ATTENTE_A_0<1)||(u2.ROUTE_A_0<1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(!(E(TRUE U !(((((((u2.NB_ATTENTE_A_2>=1)&&(u2.ROUTE_A_0>=1))||((u2.NB_ATTENTE_A_3>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_4>=1)&&(u2.ROUTE_A_0>=1)))||((u2.NB_ATTENTE_A_1>=1)&&(u2.ROUTE_A_0>=1)))||((u1.NB_ATTENTE_A_0>=1)&&(u2.ROUTE_A_0>=1))))))) + ((((((u2.NB_ATTENTE_A_2<1)||(u2.ROUTE_A_0<1))&&((u2.NB_ATTENTE_A_3<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_4<1)||(u2.ROUTE_A_0<1)))&&((u2.NB_ATTENTE_A_1<1)||(u2.ROUTE_A_0<1)))&&((u1.NB_ATTENTE_A_0<1)||(u2.ROUTE_A_0<1)))))] != FALSE
(forward)formula 13,1,0.608878,23816,1,0,42597,2734,997,38405,440,8861,86582
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589207036245

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V04P05N02"
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"

# 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 BridgeAndVehicles-COL-V04P05N02, 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 r021-oct2-158897698600132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 ;