About the Execution of M4M.struct for BridgeAndVehicles-PT-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
773.380 | 19517.00 | 44500.00 | 440.20 | TFTFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 57K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-ebro-152732380800074
=====================================================================
--------------------
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-PT-V04P05N02-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1527806289720
BK_STOP 1527806309237
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V04P05N02 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 152, 'Memory': 111.03, 'Tool': 'lola'}, {'Time': 246, 'Memory': 111.35, 'Tool': 'lola'}, {'Time': 5512, 'Memory': 348.18, 'Tool': 'itstools'}, {'Time': 5618, 'Memory': 368.63, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 36.26315789473684x far from the best tool lola.
LTLFireability itstools BridgeAndVehicles-PT-V04P05N02...
May 31, 2018 10:38:22 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLFireability]
May 31, 2018 10:38:22 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 31, 2018 10:38:22 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 102 ms
May 31, 2018 10:38:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 places.
May 31, 2018 10:38:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 52 transitions.
May 31, 2018 10:38:22 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 22 ms
May 31, 2018 10:38:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 92 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
May 31, 2018 10:38:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLFireability.pnml.gal : 4 ms
May 31, 2018 10:38:23 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLFireability.ltl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLFireability.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]
its-ltl command run as :
/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLFireability.pnml.gal -t CGAL -LTL /mcc-data/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((X("(((((CHOIX_1>=1)&&(COMPTEUR_0>=1))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))||((CHOIX_2>=1)&&(COMPTEUR_0>=1)))||((CHOIX_2>=1)&&(COMPTEUR_1>=1)))"))U(("(((((((NB_ATTENTE_A_1>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1))||((((NB_ATTENTE_A_2>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1)))||((((NB_ATTENTE_A_3>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1)))||((((NB_ATTENTE_A_4>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1)))")U("(SUR_PONT_B>=1)")))))
Formula 0 simplified : !F(X"(((((CHOIX_1>=1)&&(COMPTEUR_0>=1))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))||((CHOIX_2>=1)&&(COMPTEUR_0>=1)))||((CHOIX_2>=1)&&(COMPTEUR_1>=1)))" U ("(((((((NB_ATTENTE_A_1>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1))||((((NB_ATTENTE_A_2>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1)))||((((NB_ATTENTE_A_3>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1)))||((((NB_ATTENTE_A_4>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1)))" U "(SUR_PONT_B>=1)"))
May 31, 2018 10:38:23 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 52 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 34
// Phase 1: matrix 34 rows 28 cols
May 31, 2018 10:38:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 43 ms
invariant :CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
invariant :ATTENTE_B + SUR_PONT_B + SORTI_B + ROUTE_B = 4
invariant :SUR_PONT_A + CAPACITE + -1'ATTENTE_B + -1'SORTI_B + -1'ROUTE_B = 1
invariant :COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 = 1
invariant :ROUTE_A + ATTENTE_A + SUR_PONT_A + SORTI_A = 4
invariant :NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 = 1
invariant :NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 = 1
May 31, 2018 10:38:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 28 variables to be positive in 229 ms
May 31, 2018 10:38:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
May 31, 2018 10:38:24 PM 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)
May 31, 2018 10:38:24 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)
May 31, 2018 10:38:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 52 transitions.
May 31, 2018 10:38:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_0, liberation_A, basculement_1, basculement_2, liberation_B, enregistrement_B_0, altern_cpt_2_1, altern_cpt_2_2, timeout_A_1_1_0_1, timeout_A_2_1_0_1, timeout_A_1_1_0_2, timeout_A_2_1_0_2, timeout_A_1_1_0_3, timeout_A_2_1_0_3, timeout_A_1_1_0_4, timeout_A_2_1_0_4, timeout_B_1_2_1_0, timeout_B_2_2_1_0, timeout_B_1_2_2_0, timeout_B_2_2_2_0, timeout_B_2_2_3_0, timeout_B_2_2_4_0, 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
119 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.21603,37244,1,0,250,63611,118,131,1366,80228,389
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((("(((((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))")U(F(G(X("(SUR_PONT_B>=1)"))))))
Formula 1 simplified : !("(((((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))" U FGX"(SUR_PONT_B>=1)")
Computing Next relation with stutter on 4 deadlock states
59 unique states visited
58 strongly connected components in search stack
60 transitions explored
59 items max in DFS search stack
60 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.82291,46604,1,0,417,86617,122,410,1397,151719,1068
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F("(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))"))))
Formula 2 simplified : !XF"(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))"
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
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.9478,50036,1,0,514,89228,131,491,1418,156840,1339
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(G(F(X(F("(((((CHOIX_1>=1)&&(COMPTEUR_0>=1))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))||((CHOIX_2>=1)&&(COMPTEUR_0>=1)))||((CHOIX_2>=1)&&(COMPTEUR_1>=1)))")))))))
Formula 3 simplified : !XGFXF"(((((CHOIX_1>=1)&&(COMPTEUR_0>=1))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))||((CHOIX_2>=1)&&(COMPTEUR_0>=1)))||((CHOIX_2>=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
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.95192,50284,1,0,514,89258,140,491,1429,156882,1347
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))"))
Formula 4 simplified : !"(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))"
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.95568,50516,1,0,514,89258,142,491,1429,156887,1352
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G(G(X(F("(SUR_PONT_A>=1)")))))))
Formula 5 simplified : !XGXF"(SUR_PONT_A>=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
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.95691,50516,1,0,514,89258,151,491,1430,156888,1358
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G("(SUR_PONT_B>=1)")))
Formula 6 simplified : !G"(SUR_PONT_B>=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.95771,50516,1,0,514,89258,154,491,1430,156888,1361
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(X(F(G(F("(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))")))))))
Formula 7 simplified : !FXFGF"(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))"
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
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,2.18205,55788,1,0,616,95629,154,593,1430,166312,1632
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((G(X("((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1))")))U("((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))")))
Formula 8 simplified : !(GX"((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1))" U "((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1))")
Computing Next relation with stutter on 4 deadlock states
May 31, 2018 10:38:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 52 transitions.
56 unique states visited
56 strongly connected components in search stack
56 transitions explored
56 items max in DFS search stack
94 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.11843,63372,1,0,910,123623,164,903,1438,232464,2433
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((F("((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))"))U(("((ROUTE_A>=1)&&(NB_ATTENTE_A_2>=1))")U(G("((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))")))))
Formula 9 simplified : !(F"((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))" U ("((ROUTE_A>=1)&&(NB_ATTENTE_A_2>=1))" U G"((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))"))
Computing Next relation with stutter on 4 deadlock states
58 unique states visited
58 strongly connected components in search stack
58 transitions explored
58 items max in DFS search stack
18 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.29878,67400,1,0,981,131306,179,974,1456,240545,2902
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1))"))
Formula 10 simplified : !"((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=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
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.30008,67400,1,0,981,131306,180,974,1456,240545,2904
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(F(F(X(G("((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1))")))))))
Formula 11 simplified : !XFXG"((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_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
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,3.47671,70568,1,0,1062,136392,193,1065,1461,253457,3492
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))"))
Formula 12 simplified : !"((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=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,3.47833,70568,1,0,1062,136392,196,1065,1463,253458,3494
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(G(F("((CAPACITE>=5)&&(VIDANGE_1>=1))")))))
Formula 13 simplified : !XGF"((CAPACITE>=5)&&(VIDANGE_1>=1))"
Computing Next relation with stutter on 4 deadlock states
May 31, 2018 10:38:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(27/52) took 965 ms. Total solver calls (SAT/UNSAT): 863(115/748)
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
21 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.67866,74256,1,0,1169,144314,205,1171,1466,265287,3771
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(G(X(("((ROUTE_A>=1)&&(NB_ATTENTE_A_3>=1))")U("((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))"))))))
Formula 14 simplified : !XGX("((ROUTE_A>=1)&&(NB_ATTENTE_A_3>=1))" U "((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1))")
Computing Next relation with stutter on 4 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 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,3.68213,74476,1,0,1169,144314,215,1171,1473,265291,3775
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G((G(G("((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))")))U(G(F("((CHOIX_2>=1)&&(COMPTEUR_2>=1))"))))))
Formula 15 simplified : !G(G"((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1))" U GF"((CHOIX_2>=1)&&(COMPTEUR_2>=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,3.77718,75824,1,0,1273,148689,224,1276,1474,271010,4054
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
May 31, 2018 10:38:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1455 ms. Total solver calls (SAT/UNSAT): 1139(115/1024)
May 31, 2018 10:38:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 52 transitions.
Running compilation step : CommandLine [args=[gcc, -c, -I/usr/bin/include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/mcc-data]
java.io.IOException: Cannot run program "gcc" (in directory "/mcc-data"): error=2, No such file or directory
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1048)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:46)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.application.LTSminRunner.compilePINS(LTSminRunner.java:235)
at fr.lip6.move.gal.application.LTSminRunner.access$6(LTSminRunner.java:220)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:75)
at java.lang.Thread.run(Thread.java:748)
Caused by: java.io.IOException: error=2, No such file or directory
at java.lang.UNIXProcess.forkAndExec(Native Method)
at java.lang.UNIXProcess.
at java.lang.ProcessImpl.start(ProcessImpl.java:134)
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
... 6 more
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="mcc4mcc-structural"
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
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-ebro-152732380800074"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;