Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r019-csrt-155225080200322.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
Input is BridgeAndVehicles-COL-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r019-csrt-155225080200322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.7K Feb 9 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 9 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 5 04:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 118 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 356 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 22:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 2 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 2 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 29 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 37K Mar 10 17:31 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-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-LTLFireability-09
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

=== Now, execution of the tool begins

BK_START 1552435180283

23:59:46.569 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
23:59:46.573 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F(G(F("(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))"))))U(("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))")U(F("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))")))))
Formula 0 simplified : !(FGF"(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))" U ("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))" U F"((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))"))
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A, liberation_A, basculement, liberation_B, enregistrement_B, altern_cpt, timeout_A, timeout_B, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/8/11
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.557599,25424,1,0,42,46108,48,15,873,41731,32
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(("(((((((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))")U("(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))"))))))
Formula 1 simplified : !XXX("(((((((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))" U "(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))")
Computing Next relation with stutter on 4 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 34
// Phase 1: matrix 34 rows 28 cols
invariant :CONTROLEUR_0 + CONTROLEUR_1 + CHOIX_0 + CHOIX_1 + VIDANGE_0 + VIDANGE_1 = 1
invariant :SUR_PONT_B_0 + ATTENTE_B_0 + ROUTE_B_0 + SORTI_B_0 = 4
invariant :NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 = 1
invariant :CAPACITE_0 + SUR_PONT_A_0 + -1'ATTENTE_B_0 + -1'ROUTE_B_0 + -1'SORTI_B_0 = 1
invariant :SORTI_A_0 + ROUTE_A_0 + ATTENTE_A_0 + SUR_PONT_A_0 = 4
invariant :COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 = 1
invariant :NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 = 1
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
91 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.46762,43184,1,0,118,142537,66,124,987,113064,247
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(((CAPACITE_0>=5)&&(VIDANGE_0>=1))||((CAPACITE_0>=5)&&(VIDANGE_1>=1)))")U(G("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))"))))
Formula 2 simplified : !("(((CAPACITE_0>=5)&&(VIDANGE_0>=1))||((CAPACITE_0>=5)&&(VIDANGE_1>=1)))" U G"((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
62 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.09966,60544,1,0,286,236849,85,300,1015,225110,619
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))")U("(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))")))
Formula 3 simplified : !("(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))" U "(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
64 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.74021,77272,1,0,346,337609,93,411,1042,298050,796
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(G("((((((NB_ATTENTE_A_0>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_1>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_2>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_3>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>=1)))")))))
Formula 4 simplified : !XG"((((((NB_ATTENTE_A_0>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_1>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_2>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_3>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>=1)))"
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
53 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,3.26854,90468,1,0,493,412283,99,566,1061,368321,1145
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G(F("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))")))))
Formula 5 simplified : !GF"((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B_0>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B_0>=1)))"
Computing Next relation with stutter on 4 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
68 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,3.9515,98904,1,0,572,430854,99,662,1061,430168,1573
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X(G("(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))"))))U(F("(SUR_PONT_A_0>=1)"))))
Formula 6 simplified : !(XXG"(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))" U F"(SUR_PONT_A_0>=1)")
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,4.15603,105728,1,0,724,463894,108,757,1062,461005,1891
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))"))
Formula 7 simplified : !"(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))"
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,4.15729,105728,1,0,724,463894,111,757,1075,461005,1893
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(X("(((((((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))")))))
Formula 8 simplified : !GXX"(((((((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))"
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
23 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.38634,111524,1,0,792,499020,115,872,1078,488281,2085
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F("(SUR_PONT_B_0>=1)")))
Formula 9 simplified : !F"(SUR_PONT_B_0>=1)"
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
16 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.55379,116680,1,0,920,525725,124,953,1079,511354,2367
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(F("(((((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_1>=1))&&(CONTROLEUR_0>=1))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_2>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_3>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_4>=1))&&(CONTROLEUR_0>=1)))")))))
Formula 10 simplified : !GF"(((((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_1>=1))&&(CONTROLEUR_0>=1))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_2>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_3>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_4>=1))&&(CONTROLEUR_0>=1)))"
Computing Next relation with stutter on 4 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
24 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.78966,123280,1,0,1032,545638,133,1063,1094,536827,2652
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F((F("(((CHOIX_0>=1)&&(COMPTEUR_2>=1))||((CHOIX_1>=1)&&(COMPTEUR_2>=1)))"))U(F("(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))"))))))
Formula 11 simplified : !GF(F"(((CHOIX_0>=1)&&(COMPTEUR_2>=1))||((CHOIX_1>=1)&&(COMPTEUR_2>=1)))" U F"(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))")
Computing Next relation with stutter on 4 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
48 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.27479,131972,1,0,1195,586934,139,1172,1094,568327,2937
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 USE_NUPN
Checking formula 12 : !(("(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))"))
Formula 12 simplified : !"(((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_0>=1)&&(COMPTEUR_1>=1)))||((CHOIX_1>=1)&&(COMPTEUR_0>=1)))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))"
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.27584,131972,1,0,1195,586934,139,1172,1094,568327,2937
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(G(F("(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))")))))
Formula 13 simplified : !XGF"(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_1>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_2>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_3>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_A_4>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_B_0>=1)))"
Computing Next relation with stutter on 4 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
14 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.41706,134076,1,0,1289,605472,146,1266,1094,594086,3208
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(G(("(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))")U(G("(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))"))))))
Formula 14 simplified : !G("(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))" U G"(((((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_B_0>=1))&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1)))")
Computing Next relation with stutter on 4 deadlock states
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,5.42,134324,1,0,1289,605472,150,1266,1096,594086,3213
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 USE_NUPN
Checking formula 15 : !((((G("(((((((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))"))U(F("(((((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_1>=1))&&(CONTROLEUR_0>=1))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_2>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_3>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_4>=1))&&(CONTROLEUR_0>=1)))")))U(X(("((((((NB_ATTENTE_A_0>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_1>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_2>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_3>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>=1)))")U("(((((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_1>=1))&&(CONTROLEUR_0>=1))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_2>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_3>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_4>=1))&&(CONTROLEUR_0>=1)))")))))
Formula 15 simplified : !((G"(((((((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1))&&(CONTROLEUR_0>=1)))" U F"(((((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_1>=1))&&(CONTROLEUR_0>=1))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_2>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_3>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_4>=1))&&(CONTROLEUR_0>=1)))") U X("((((((NB_ATTENTE_A_0>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_1>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_2>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_3>=1)&&(ROUTE_A_0>=1)))||((NB_ATTENTE_A_4>=1)&&(ROUTE_A_0>=1)))" U "(((((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_1>=1))&&(CONTROLEUR_0>=1))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_2>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_3>=1))&&(CONTROLEUR_0>=1)))||((((CAPACITE_0>=1)&&(ATTENTE_A_0>=1))&&(NB_ATTENTE_A_4>=1))&&(CONTROLEUR_0>=1)))"))
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
15 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.593,137580,1,0,1403,618727,150,1354,1096,615444,3511
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552435198387

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ 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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 12, 2019 11:59:45 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 12, 2019 11:59:45 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 12, 2019 11:59:46 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 12, 2019 11:59:47 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1890 ms
Mar 12, 2019 11:59:47 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 15 places.
Mar 12, 2019 11:59:47 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 12, 2019 11:59:47 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
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,

Mar 12, 2019 11:59:47 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 transitions.
Mar 12, 2019 11:59:47 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 12, 2019 11:59:47 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 12, 2019 11:59:48 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 12, 2019 11:59:48 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 19.0 instantiations of transitions. Total transitions/syncs built is 58
Mar 12, 2019 11:59:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 142 ms
Mar 12, 2019 11:59:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
Mar 12, 2019 11:59:48 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to CAPACITE_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_A_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_A_1 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_A_2 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_A_3 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_A_4 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to SORTI_A_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to ROUTE_A_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to ATTENTE_A_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to SUR_PONT_A_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_B_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_B_1 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_B_2 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_B_3 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to NB_ATTENTE_B_4 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to SUR_PONT_B_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to ATTENTE_B_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to ROUTE_B_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to SORTI_B_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to CONTROLEUR_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to CONTROLEUR_1 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to CHOIX_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to CHOIX_1 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to COMPTEUR_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to COMPTEUR_1 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to COMPTEUR_2 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to VIDANGE_0 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to VIDANGE_1 in partition

Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.application.MccTranslator applyOrder
WARNING: Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: -1
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:439)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:145)
at fr.lip6.move.gal.application.MccTranslator.applyOrder(MccTranslator.java:129)
at fr.lip6.move.gal.application.MccTranslator.flattenSpec(MccTranslator.java:156)
at fr.lip6.move.gal.application.Application.start(Application.java:236)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:40)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:137)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:107)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:400)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:498)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:595)
at org.eclipse.equinox.launcher.Main.run(Main.java:1501)
at org.eclipse.equinox.launcher.Main.main(Main.java:1474)
Mar 12, 2019 11:59:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
Mar 12, 2019 11:59:49 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 12, 2019 11:59:49 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 90 ms
Mar 12, 2019 11:59:50 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 11 transitions. Expanding to a total of 79 deterministic transitions.
Mar 12, 2019 11:59:50 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 116 ms.
Mar 12, 2019 11:59:51 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 30 ms
Mar 12, 2019 11:59:51 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 28 variables to be positive in 832 ms
Mar 12, 2019 11:59:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
Mar 12, 2019 11:59:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/52 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 12, 2019 11:59:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 12, 2019 11:59:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 52 transitions.
Mar 12, 2019 11:59:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 12, 2019 11:59:57 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6994ms conformant to PINS in folder :/home/mcc/execution

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="LTLFireability"
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-3954"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-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 r019-csrt-155225080200322"
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 [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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 [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;