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 itstoolsl
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 r225-ebro-152732379600074
=====================================================================

--------------------
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 1527611168920

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph3922924405575841680.txt, -o, /tmp/graph3922924405575841680.bin, -w, /tmp/graph3922924405575841680.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph3922924405575841680.bin, -l, -1, -v, -w, /tmp/graph3922924405575841680.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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((X("(((((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_0>=1))||((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_1>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_0>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_1>=1)))"))U(("(((((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1)))")U("(u1.SUR_PONT_B>=1)")))))
Formula 0 simplified : !F(X"(((((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_0>=1))||((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_1>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_0>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_1>=1)))" U ("(((((((u0.NB_ATTENTE_A_1>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1))||((((u0.NB_ATTENTE_A_2>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_3>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1)))||((((u0.NB_ATTENTE_A_4>=1)&&(u0.ATTENTE_A>=1))&&(u1.CAPACITE>=1))&&(u4.CONTROLEUR_1>=1)))" U "(u1.SUR_PONT_B>=1)"))
built 9 ordering constraints for composite.
built 38 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_0, basculement_1, basculement_2, 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, u1.liberation_A, u1.liberation_B, 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
17 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.206022,21392,1,0,7794,3772,680,13715,369,18130,12191
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(((((((((((((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_0>=1))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_2>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_0>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_2>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_0>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_2>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_0>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_2>=1)))")U(F(G(X("(u1.SUR_PONT_B>=1)"))))))
Formula 1 simplified : !("(((((((((((((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_0>=1))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_2>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_0>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_2>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_0>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_2>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_0>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_1>=1)))||((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_2>=1)))" U FGX"(u1.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
35 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.556616,30376,1,0,26242,4096,718,34256,372,23348,44476
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 USE_NUPN
Checking formula 2 : !((X(F("(((((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(u2.ATTENTE_B>=1))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(u2.ATTENTE_B>=1)))"))))
Formula 2 simplified : !XF"(((((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(u2.ATTENTE_B>=1))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(u2.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
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.578776,31168,1,0,27941,4098,778,35461,385,23424,48016
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(F(X(F("(((((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_0>=1))||((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_1>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_0>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_1>=1)))")))))))
Formula 3 simplified : !XGFXF"(((((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_0>=1))||((u1.CHOIX_1>=1)&&(i3.u5.COMPTEUR_1>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_0>=1)))||((i3.u3.CHOIX_2>=1)&&(i3.u5.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
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,0.583744,31384,1,0,28012,4098,822,35564,385,23424,48293
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 USE_NUPN
Checking formula 4 : !(("(((((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(u2.ATTENTE_B>=1))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(u2.ATTENTE_B>=1)))"))
Formula 4 simplified : !"(((((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(u2.ATTENTE_B>=1))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(u2.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,0.585968,31384,1,0,28012,4098,824,35564,385,23424,48301
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 USE_NUPN
Checking formula 5 : !((X(G(G(X(F("(u1.SUR_PONT_A>=1)")))))))
Formula 5 simplified : !XGXF"(u1.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,0.587272,31648,1,0,28012,4098,839,35564,386,23424,48314
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 USE_NUPN
Checking formula 6 : !((G("(u1.SUR_PONT_B>=1)")))
Formula 6 simplified : !G"(u1.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,0.588052,31648,1,0,28012,4098,847,35564,386,23424,48324
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 USE_NUPN
Checking formula 7 : !((F(X(F(G(F("(((((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(u2.ATTENTE_B>=1))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(u2.ATTENTE_B>=1)))")))))))
Formula 7 simplified : !FXFGF"(((((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(u2.ATTENTE_B>=1))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(u2.ATTENTE_B>=1)))||((((u1.CAPACITE>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(u2.ATTENTE_B>=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 :u1:SUR_PONT_B + u1:SORTI_B + u2:ATTENTE_B + u2:ROUTE_B = 4
invariant :u2:NB_ATTENTE_B_1 + u2:NB_ATTENTE_B_2 + u2:NB_ATTENTE_B_3 + u2:NB_ATTENTE_B_4 + i3:u3:NB_ATTENTE_B_0 = 1
invariant :u0:NB_ATTENTE_A_1 + u0:NB_ATTENTE_A_2 + u0:NB_ATTENTE_A_3 + u0:NB_ATTENTE_A_4 + u4:NB_ATTENTE_A_0 = 1
invariant :u1:CHOIX_1 + u4:CONTROLEUR_1 + u4:VIDANGE_2 + i3:u3:CONTROLEUR_2 + i3:u3:CHOIX_2 + i3:u3:VIDANGE_1 = 1
invariant :u1:SUR_PONT_A + u1:CAPACITE + -1'u1:SORTI_B + -1'u2:ATTENTE_B + -1'u2:ROUTE_B = 1
invariant :u0:ROUTE_A + u0:ATTENTE_A + u1:SORTI_A + -1'u1:CAPACITE + u1:SORTI_B + u2:ATTENTE_B + u2:ROUTE_B = 3
invariant :i3:u5:COMPTEUR_0 + i3:u5:COMPTEUR_1 + i3:u5:COMPTEUR_2 = 1
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
4 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.620764,32128,1,0,29364,4098,847,36662,386,23425,52269
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 USE_NUPN
Checking formula 8 : !(((G(X("((u2.NB_ATTENTE_B_2>=1)&&(u2.ROUTE_B>=1))")))U("((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_2>=1))")))
Formula 8 simplified : !(GX"((u2.NB_ATTENTE_B_2>=1)&&(u2.ROUTE_B>=1))" U "((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_1>=1))&&(i3.u5.COMPTEUR_2>=1))")
Computing Next relation with stutter on 4 deadlock states
56 unique states visited
56 strongly connected components in search stack
56 transitions explored
56 items max in DFS search stack
22 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.850885,38592,1,0,42315,4136,889,48683,391,24322,76418
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 USE_NUPN
Checking formula 9 : !(((F("((((u0.NB_ATTENTE_A_2>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(i3.u3.NB_ATTENTE_B_0>=1))&&(i3.u5.COMPTEUR_0>=1))"))U(("((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1))")U(G("((((u0.NB_ATTENTE_A_4>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(i3.u3.NB_ATTENTE_B_0>=1))&&(i3.u5.COMPTEUR_1>=1))")))))
Formula 9 simplified : !(F"((((u0.NB_ATTENTE_A_2>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(i3.u3.NB_ATTENTE_B_0>=1))&&(i3.u5.COMPTEUR_0>=1))" U ("((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_2>=1))" U G"((((u0.NB_ATTENTE_A_4>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(i3.u3.NB_ATTENTE_B_0>=1))&&(i3.u5.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
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,0.942874,41692,1,0,47081,4141,945,51623,395,24415,86207
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 USE_NUPN
Checking formula 10 : !(("((u2.NB_ATTENTE_B_2>=1)&&(u2.ROUTE_B>=1))"))
Formula 10 simplified : !"((u2.NB_ATTENTE_B_2>=1)&&(u2.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
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,0.94384,41956,1,0,47081,4141,946,51623,395,24415,86209
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 USE_NUPN
Checking formula 11 : !((X(F(F(X(G("((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.COMPTEUR_0>=1))")))))))
Formula 11 simplified : !XFXG"((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_4>=1))&&(i3.u5.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
22 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.15675,45120,1,0,55941,4176,976,57697,395,25238,98936
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 USE_NUPN
Checking formula 12 : !(("((((u0.NB_ATTENTE_A_3>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(i3.u3.NB_ATTENTE_B_0>=1))&&(i3.u5.COMPTEUR_1>=1))"))
Formula 12 simplified : !"((((u0.NB_ATTENTE_A_3>=1)&&(i3.u3.CONTROLEUR_2>=1))&&(i3.u3.NB_ATTENTE_B_0>=1))&&(i3.u5.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
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.17546,45384,1,0,55941,4176,984,57697,395,25238,98940
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 USE_NUPN
Checking formula 13 : !((X(G(F("((u1.CAPACITE>=5)&&(i3.u3.VIDANGE_1>=1))")))))
Formula 13 simplified : !XGF"((u1.CAPACITE>=5)&&(i3.u3.VIDANGE_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
11 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.29136,46960,1,0,58818,4191,1000,60158,395,25406,105817
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 USE_NUPN
Checking formula 14 : !((X(G(X(("((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1))")U("((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.COMPTEUR_2>=1))"))))))
Formula 14 simplified : !XGX("((u0.ROUTE_A>=1)&&(u0.NB_ATTENTE_A_3>=1))" U "((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_2>=1))&&(i3.u5.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,1.29382,47192,1,0,58818,4191,1018,60158,398,25407,105840
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 USE_NUPN
Checking formula 15 : !((G((G(G("((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_2>=1))")))U(G(F("((i3.u3.CHOIX_2>=1)&&(i3.u5.COMPTEUR_2>=1))"))))))
Formula 15 simplified : !G(G"((((u4.NB_ATTENTE_A_0>=1)&&(u4.CONTROLEUR_1>=1))&&(u2.NB_ATTENTE_B_3>=1))&&(i3.u5.COMPTEUR_2>=1))" U GF"((i3.u3.CHOIX_2>=1)&&(i3.u5.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
4 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.32955,48000,1,0,60378,4191,1040,61470,398,25407,109446
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 USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527611175437

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 29, 2018 4:26:12 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/, -louvain, -smt]
May 29, 2018 4:26:12 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 4:26:12 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 80 ms
May 29, 2018 4:26:12 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 places.
May 29, 2018 4:26:12 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 52 transitions.
May 29, 2018 4:26:12 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 21 ms
May 29, 2018 4:26:12 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 29, 2018 4:26:12 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 72 ms
May 29, 2018 4:26:12 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
Begin: Tue May 29 16:26:12 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Tue May 29 16:26:12 2018
network size: 28 nodes, 246 links, 104 weight
quality increased from -0.0517751 to 0.313635
end computation: Tue May 29 16:26:12 2018
level 1:
start computation: Tue May 29 16:26:12 2018
network size: 6 nodes, 34 links, 104 weight
quality increased from 0.313635 to 0.337427
end computation: Tue May 29 16:26:12 2018
level 2:
start computation: Tue May 29 16:26:12 2018
network size: 5 nodes, 23 links, 104 weight
quality increased from 0.337427 to 0.337427
end computation: Tue May 29 16:26:12 2018
End: Tue May 29 16:26:12 2018
Total duration: 0 sec
0.337427
May 29, 2018 4:26:12 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 29, 2018 4:26:12 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 32 ms
May 29, 2018 4:26:12 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 29, 2018 4:26:13 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 77 redundant transitions.
May 29, 2018 4:26:13 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
May 29, 2018 4:26:13 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
May 29, 2018 4:26:13 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 52 transitions.
May 29, 2018 4:26:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 27 ms
May 29, 2018 4:26:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 28 variables to be positive in 532 ms
May 29, 2018 4:26:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
May 29, 2018 4:26:14 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)
May 29, 2018 4:26:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 4:26:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 52 transitions.
May 29, 2018 4:26:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 4:26:15 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
May 29, 2018 4:26:15 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error
May 29, 2018 4:26:15 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (not (or (or (or (or (or (or (or (or (or (or (or (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 12) 1)) (>= (select s0 25) 1)) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 12) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 12) 1)) (>= (select s0 27) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 13) 1)) (>= (select s0 25) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 13) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 13) 1)) (>= (select s0 27) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 14) 1)) (>= (select s0 25) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 14) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 14) 1)) (>= (select s0 27) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 15) 1)) (>= (select s0 25) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 15) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 15) 1)) (>= (select s0 27) 1))))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (not (or (or (or (or (or (or (or (or (or (or (or (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 12) 1)) (>= (select s0 25) 1)) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 12) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 12) 1)) (>= (select s0 27) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 13) 1)) (>= (select s0 25) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 13) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 13) 1)) (>= (select s0 27) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 14) 1)) (>= (select s0 25) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 14) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 14) 1)) (>= (select s0 27) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 15) 1)) (>= (select s0 25) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 15) 1)) (>= (select s0 26) 1))) (and (and (and (>= (select s0 18) 1) (>= (select s0 19) 1)) (>= (select s0 15) 1)) (>= (select s0 27) 1))))")
May 29, 2018 4:26:15 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 0) 1) (>= (select s0 18) 1)) (= (store (store (store (store s0 5 (+ (select s0 5) 1)) 1 (+ (select s0 1) 1)) 0 (- (select s0 0) 1)) 18 (- (select s0 18) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 0) 1) (>= (select s0 18) 1)) (= (store (store (store (store s0 5 (+ (select s0 5) 1)) 1 (+ (select s0 1) 1)) 0 (- (select s0 0) 1)) 18 (- (select s0 18) 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:502)
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)
May 29, 2018 4:26:15 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1351ms 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-PT-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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 itstoolsl"
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 r225-ebro-152732379600074"
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 '' 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 ;