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.r189-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 itstoolsm
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 r189-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 1553600077689

11:34:40.617 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
11:34:40.620 [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
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
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)))"))
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
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t10, t11, t12, t13, t22, t23, t25, t26, t28, t29, t31, t32, t34, t35, t37, t38, t40, t41, t44, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :12/18/22/52
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
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,0.17101,20640,1,0,113,16347,118,44,1387,14844,102
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)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))")U("(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_1>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_4>=1)))"))))))
Formula 1 simplified : !XXX("(((((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))" U "(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_1>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_4>=1)))")
Computing Next relation with stutter on 4 deadlock states
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 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,0.31273,25036,1,0,189,30138,136,153,1509,30339,317
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 : !((("(((VIDANGE_0>=1)&&(CAPACITE_0>=5))||((VIDANGE_1>=1)&&(CAPACITE_0>=5)))")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 : !("(((VIDANGE_0>=1)&&(CAPACITE_0>=5))||((VIDANGE_1>=1)&&(CAPACITE_0>=5)))" 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
27 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.5909,32100,1,0,357,55877,155,329,1535,67933,689
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 : !((("(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))")U("(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_1>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_4>=1)))")))
Formula 3 simplified : !("(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))" U "(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_1>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_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
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,0.733836,37352,1,0,417,73472,163,440,1557,86601,866
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("((((((ROUTE_A_0>=1)&&(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)))")))))
Formula 4 simplified : !XG"((((((ROUTE_A_0>=1)&&(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)))"
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
29 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.01804,43420,1,0,564,94504,169,595,1571,115545,1215
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
10 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.11876,44992,1,0,643,96942,169,691,1571,133042,1643
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("(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))"))))U(F("(SUR_PONT_A_0>=1)"))))
Formula 6 simplified : !(XXG"(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=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
9 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.21344,47592,1,0,795,105358,178,786,1572,141475,1961
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 : !((true))
Formula 7 simplified : 0
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,1.21366,47592,1,0,795,105358,178,786,1572,141475,1961
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)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))")))))
Formula 8 simplified : !GXX"(((((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=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
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,1.28727,49956,1,0,863,112711,182,901,1575,149238,2153
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
3 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.32159,51012,1,0,991,117318,191,982,1576,154530,2435
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("(((((((NB_ATTENTE_A_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1))||((((NB_ATTENTE_A_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))")))))
Formula 10 simplified : !GF"(((((((NB_ATTENTE_A_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1))||((((NB_ATTENTE_A_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_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
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,1.46635,55236,1,0,1103,129440,200,1092,1591,166539,2720
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("(((COMPTEUR_2>=1)&&(CHOIX_0>=1))||((COMPTEUR_2>=1)&&(CHOIX_1>=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"(((COMPTEUR_2>=1)&&(CHOIX_0>=1))||((COMPTEUR_2>=1)&&(CHOIX_1>=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
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,1.63185,59784,1,0,1266,148529,209,1201,1600,185459,3005
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 : !((true))
Formula 12 simplified : 0
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,1.6321,59784,1,0,1266,148529,209,1201,1600,185459,3005
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_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_1>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_4>=1)))")))))
Formula 13 simplified : !XGF"(((((((((((((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_1>=1))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))&&(NB_ATTENTE_A_4>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_1>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_2>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_3>=1)))||((((CONTROLEUR_1>=1)&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))&&(NB_ATTENTE_A_4>=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
27 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.90365,64716,1,0,1360,167518,216,1295,1600,206992,3276
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(("(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))")U(G("(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))"))))))
Formula 14 simplified : !G("(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))" U G"(((((((NB_ATTENTE_B_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1))||((((NB_ATTENTE_B_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(ATTENTE_B_0>=1)))||((((NB_ATTENTE_B_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_1>=1))&&(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
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,1.90703,64964,1,0,1360,167518,220,1295,1600,206992,3281
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)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))"))U(F("(((((((NB_ATTENTE_A_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1))||((((NB_ATTENTE_A_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))")))U(X(("((((((ROUTE_A_0>=1)&&(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)))")U("(((((((NB_ATTENTE_A_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1))||((((NB_ATTENTE_A_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))")))))
Formula 15 simplified : !((G"(((((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_0>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))" U F"(((((((NB_ATTENTE_A_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1))||((((NB_ATTENTE_A_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))") U X("((((((ROUTE_A_0>=1)&&(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)))" U "(((((((NB_ATTENTE_A_1>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1))||((((NB_ATTENTE_A_2>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CAPACITE_0>=1))&&(CONTROLEUR_0>=1))&&(ATTENTE_A_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
12 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.03311,66108,1,0,1474,172520,220,1383,1600,213586,3579
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 1553600084668

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 26, 2019 11:34:40 AM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 26, 2019 11:34:40 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 11:34:40 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 878 ms
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 15 places.
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 26, 2019 11:34:41 AM 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 26, 2019 11:34:41 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 transitions.
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 26, 2019 11:34:41 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Mar 26, 2019 11:34:41 AM 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 26, 2019 11:34:41 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 40 ms
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
Mar 26, 2019 11:34:41 AM 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 26, 2019 11:34:41 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 3 ms.
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 28 places.
Mar 26, 2019 11:34:41 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 52 transitions.
Mar 26, 2019 11:34:41 AM 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 26, 2019 11:34:41 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 1 ms.
Mar 26, 2019 11:34:42 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 26, 2019 11:34:42 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 10 ms
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 28 variables to be positive in 157 ms
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 52 transitions.
Mar 26, 2019 11:34:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 11:34:44 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 26, 2019 11:34:44 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Mar 26, 2019 11:34:44 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 9) 1) (= (store (store (store s0 9 (- (select s0 9) 1)) 0 (+ (select s0 0) 1)) 6 (+ (select s0 6) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 9) 1) (= (store (store (store s0 9 (- (select s0 9) 1)) 0 (+ (select s0 0) 1)) 6 (+ (select s0 6) 1)) s1))")
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 26, 2019 11:34:44 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2526ms 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="itstoolsm"
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 itstoolsm"
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 r189-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 ;