About the Execution of ITS-Tools for BridgeAndVehicles-PT-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
391.020 | 12310.00 | 19904.00 | 194.30 | TFTFFTFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r001kn-ebro-146347648700258
=====================================================================
--------------------
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-LTLFireability-0
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-1
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-15
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-2
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-3
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-4
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-5
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-6
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-7
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-8
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1464007721823
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(F(("SUR_PONT_A>=1")U(F("SUR_PONT_A>=1"))))))
Formula 0 simplified : !XF("SUR_PONT_A>=1" U F"SUR_PONT_A>=1")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
108 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.13097,43648,1,0,265,62381,118,138,1370,78671,412
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((F(X((((((("NB_ATTENTE_A_1>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1"))||(((("NB_ATTENTE_A_2>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1")))||(((("NB_ATTENTE_A_3>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1")))||(((("NB_ATTENTE_A_4>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1")))))U(((((("NB_ATTENTE_B_0>=1")&&("ROUTE_B>=1"))||(("NB_ATTENTE_B_1>=1")&&("ROUTE_B>=1")))||(("NB_ATTENTE_B_2>=1")&&("ROUTE_B>=1")))||(("NB_ATTENTE_B_3>=1")&&("ROUTE_B>=1")))||(("NB_ATTENTE_B_4>=1")&&("ROUTE_B>=1"))))))
Formula 1 simplified : !G(FX(("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_1>=1") | ("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_2>=1") | ("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_3>=1") | ("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_4>=1")) U (("NB_ATTENTE_B_0>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_1>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_2>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_3>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_4>=1" & "ROUTE_B>=1")))
59 unique states visited
59 strongly connected components in search stack
60 transitions explored
59 items max in DFS search stack
56 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.12741,58312,1,0,406,85810,195,348,1465,129746,1018
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F("SUR_PONT_A>=1"))U(X(G((((((((((((((("NB_ATTENTE_A_1>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1"))||(((("NB_ATTENTE_A_1>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_1>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_2>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_2>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_2>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_3>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_3>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_3>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_4>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_4>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_4>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))))))
Formula 2 simplified : !(F"SUR_PONT_A>=1" U XG(("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_1>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_1>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_1>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_2>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_2>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_2>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_3>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_3>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_3>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_4>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_4>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_4>=1" & "NB_ATTENTE_B_0>=1")))
10 unique states visited
6 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
20 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.42747,63008,1,0,617,97482,285,534,1554,145571,1501
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(G(G((((("CHOIX_1>=1")&&("COMPTEUR_0>=1"))||(("CHOIX_1>=1")&&("COMPTEUR_1>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_0>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_1>=1")))))))
Formula 3 simplified : !XG(("CHOIX_1>=1" & "COMPTEUR_0>=1") | ("CHOIX_1>=1" & "COMPTEUR_1>=1") | ("CHOIX_2>=1" & "COMPTEUR_0>=1") | ("CHOIX_2>=1" & "COMPTEUR_1>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.45547,63700,1,0,650,98446,325,567,1584,146944,1583
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(G(X(G(X((((((("NB_ATTENTE_A_1>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1"))||(((("NB_ATTENTE_A_2>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1")))||(((("NB_ATTENTE_A_3>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1")))||(((("NB_ATTENTE_A_4>=1")&&("ATTENTE_A>=1"))&&("CAPACITE>=1"))&&("CONTROLEUR_1>=1")))))))))
Formula 4 simplified : !FGXGX(("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_1>=1") | ("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_2>=1") | ("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_3>=1") | ("ATTENTE_A>=1" & "CAPACITE>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_4>=1"))
60 unique states visited
59 strongly connected components in search stack
62 transitions explored
60 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.48876,63984,1,0,650,98477,348,567,1604,146977,1588
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((G(((((((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_1>=1"))&&("ATTENTE_B>=1"))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_2>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_3>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_4>=1"))&&("ATTENTE_B>=1")))U(((((("NB_ATTENTE_B_0>=1")&&("ROUTE_B>=1"))||(("NB_ATTENTE_B_1>=1")&&("ROUTE_B>=1")))||(("NB_ATTENTE_B_2>=1")&&("ROUTE_B>=1")))||(("NB_ATTENTE_B_3>=1")&&("ROUTE_B>=1")))||(("NB_ATTENTE_B_4>=1")&&("ROUTE_B>=1")))))U(X(((("CHOIX_1>=1")&&("COMPTEUR_2>=1"))||(("CHOIX_2>=1")&&("COMPTEUR_2>=1")))U((("CHOIX_1>=1")&&("COMPTEUR_2>=1"))||(("CHOIX_2>=1")&&("COMPTEUR_2>=1")))))))
Formula 5 simplified : !(G((("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_1>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_2>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_3>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_4>=1")) U (("NB_ATTENTE_B_0>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_1>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_2>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_3>=1" & "ROUTE_B>=1") | ("NB_ATTENTE_B_4>=1" & "ROUTE_B>=1"))) U X(("CHOIX_1>=1" & "COMPTEUR_2>=1") | ("CHOIX_2>=1" & "COMPTEUR_2>=1")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
87 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.37855,74148,1,0,830,126366,618,740,1871,200999,1953
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(((((((("ROUTE_A>=1")&&("NB_ATTENTE_A_0>=1"))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_1>=1")))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_2>=1")))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_3>=1")))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_4>=1")))U("SUR_PONT_A>=1"))U(F(X((((((((((((((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_0>=1"))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_2>=1"))))))))
Formula 6 simplified : !G(((("NB_ATTENTE_A_0>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_1>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_2>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_3>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_4>=1" & "ROUTE_A>=1")) U "SUR_PONT_A>=1") U FX(("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1")))
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.68772,75500,1,0,830,126366,651,740,1902,201011,1959
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(((("CAPACITE>=5")&&("VIDANGE_1>=1"))||(("CAPACITE>=5")&&("VIDANGE_2>=1")))U((((("CHOIX_1>=1")&&("COMPTEUR_0>=1"))||(("CHOIX_1>=1")&&("COMPTEUR_1>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_0>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_1>=1"))))))
Formula 7 simplified : !G((("CAPACITE>=5" & "VIDANGE_1>=1") | ("CAPACITE>=5" & "VIDANGE_2>=1")) U (("CHOIX_1>=1" & "COMPTEUR_0>=1") | ("CHOIX_1>=1" & "COMPTEUR_1>=1") | ("CHOIX_2>=1" & "COMPTEUR_0>=1") | ("CHOIX_2>=1" & "COMPTEUR_1>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.70489,75504,1,0,847,126476,681,758,1926,201383,2009
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(G(((((((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_1>=1"))&&("ATTENTE_B>=1"))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_2>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_3>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_4>=1"))&&("ATTENTE_B>=1")))U(X((((((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_1>=1"))&&("ATTENTE_B>=1"))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_2>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_3>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_4>=1"))&&("ATTENTE_B>=1"))))))))
Formula 8 simplified : !FG((("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_1>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_2>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_3>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_4>=1")) U X(("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_1>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_2>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_3>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_4>=1")))
40 unique states visited
39 strongly connected components in search stack
41 transitions explored
40 items max in DFS search stack
36 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.08339,78252,1,0,1072,139172,716,1042,1954,234758,2661
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((((((((((((((((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_0>=1"))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_2>=1")))U(((("CAPACITE>=5")&&("VIDANGE_1>=1"))||(("CAPACITE>=5")&&("VIDANGE_2>=1")))U((((("CHOIX_1>=1")&&("COMPTEUR_0>=1"))||(("CHOIX_1>=1")&&("COMPTEUR_1>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_0>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_1>=1"))))))
Formula 9 simplified : !((("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1")) U ((("CAPACITE>=5" & "VIDANGE_1>=1") | ("CAPACITE>=5" & "VIDANGE_2>=1")) U (("CHOIX_1>=1" & "COMPTEUR_0>=1") | ("CHOIX_1>=1" & "COMPTEUR_1>=1") | ("CHOIX_2>=1" & "COMPTEUR_0>=1") | ("CHOIX_2>=1" & "COMPTEUR_1>=1"))))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.4154,83796,1,0,1072,139172,902,1042,2141,234758,2667
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((("SUR_PONT_B>=1")U(F(((((("CHOIX_1>=1")&&("COMPTEUR_0>=1"))||(("CHOIX_1>=1")&&("COMPTEUR_1>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_0>=1")))||(("CHOIX_2>=1")&&("COMPTEUR_1>=1")))U((((((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_1>=1"))&&("ATTENTE_B>=1"))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_2>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_3>=1"))&&("ATTENTE_B>=1")))||(((("CAPACITE>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_4>=1"))&&("ATTENTE_B>=1")))))))
Formula 10 simplified : !("SUR_PONT_B>=1" U F((("CHOIX_1>=1" & "COMPTEUR_0>=1") | ("CHOIX_1>=1" & "COMPTEUR_1>=1") | ("CHOIX_2>=1" & "COMPTEUR_0>=1") | ("CHOIX_2>=1" & "COMPTEUR_1>=1")) U (("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_1>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_2>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_3>=1") | ("ATTENTE_B>=1" & "CAPACITE>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_B_4>=1"))))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.50298,83948,1,0,1200,141716,906,1123,2141,239126,2945
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(G(X(F("SUR_PONT_B>=1")))))))
Formula 11 simplified : !GXGXF"SUR_PONT_B>=1"
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.50448,83948,1,0,1200,141716,915,1123,2142,239127,2951
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G((("CAPACITE>=5")&&("VIDANGE_1>=1"))||(("CAPACITE>=5")&&("VIDANGE_2>=1")))))
Formula 12 simplified : !G(("CAPACITE>=5" & "VIDANGE_1>=1") | ("CAPACITE>=5" & "VIDANGE_2>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.50644,83948,1,0,1200,141716,919,1123,2142,239127,2957
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F((X(G((((((((((((((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_0>=1"))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_1>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_2>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_3>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_0>=1")&&("CONTROLEUR_1>=1"))&&("NB_ATTENTE_B_4>=1"))&&("COMPTEUR_2>=1")))))U(F(X(((((("ROUTE_A>=1")&&("NB_ATTENTE_A_0>=1"))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_1>=1")))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_2>=1")))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_3>=1")))||(("ROUTE_A>=1")&&("NB_ATTENTE_A_4>=1"))))))))
Formula 13 simplified : !F(XG(("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_1>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_2>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_3>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_1>=1" & "NB_ATTENTE_A_0>=1" & "NB_ATTENTE_B_4>=1")) U FX(("NB_ATTENTE_A_0>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_1>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_2>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_3>=1" & "ROUTE_A>=1") | ("NB_ATTENTE_A_4>=1" & "ROUTE_A>=1")))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.51068,83948,1,0,1200,141716,938,1123,2155,239127,2961
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(X(G(X(F((("CAPACITE>=5")&&("VIDANGE_1>=1"))||(("CAPACITE>=5")&&("VIDANGE_2>=1")))))))))
Formula 14 simplified : !XXGXF(("CAPACITE>=5" & "VIDANGE_1>=1") | ("CAPACITE>=5" & "VIDANGE_2>=1"))
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.51242,83948,1,0,1200,141716,944,1123,2155,239129,2967
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X(F(X(F((((((((((((((("NB_ATTENTE_A_1>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1"))||(((("NB_ATTENTE_A_1>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_1>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_2>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_2>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_2>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_3>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_3>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_3>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))||(((("NB_ATTENTE_A_4>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_0>=1")))||(((("NB_ATTENTE_A_4>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_1>=1")))||(((("NB_ATTENTE_A_4>=1")&&("CONTROLEUR_2>=1"))&&("NB_ATTENTE_B_0>=1"))&&("COMPTEUR_2>=1")))))))))
Formula 15 simplified : !FXFXF(("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_1>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_1>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_1>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_2>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_2>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_2>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_3>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_3>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_3>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_0>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_4>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_1>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_4>=1" & "NB_ATTENTE_B_0>=1") | ("COMPTEUR_2>=1" & "CONTROLEUR_2>=1" & "NB_ATTENTE_A_4>=1" & "NB_ATTENTE_B_0>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.64982,83996,1,0,1394,148050,950,1290,2155,249153,3397
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1464007734133
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 23, 2016 12:48:46 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 12:48:46 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 73 ms
May 23, 2016 12:48:46 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 places.
May 23, 2016 12:48:46 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 52 transitions.
May 23, 2016 12:48:46 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 62 ms
May 23, 2016 12:48:46 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 19 ms
May 23, 2016 12:48:46 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
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-PT-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/users/gast00/fkordon/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
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r001kn-ebro-146347648700258"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
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 ;