Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 4.2K Feb 9 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 9 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 5 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 5 04:37 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 117 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 355 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 22:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 2 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 2 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jan 29 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Jan 29 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 57K 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-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 1552454862418

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F(G(F("(((((CHOIX_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_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))")U(F("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))")))))
Formula 0 simplified : !(FGF"(((((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_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))" U F"((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))"))
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_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
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
50 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.520806,33500,1,0,113,53234,118,44,1363,62063,102
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 : !((X(X(X(("(((((((((((((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_1>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_2>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_3>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_0>=1)&&(CONTROLEUR_1>=1))&&(NB_ATTENTE_B_4>=1))&&(COMPTEUR_2>=1)))")U("(((((((((((((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))"))))))
Formula 1 simplified : !XXX("(((((((((((((((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 "(((((((((((((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))")
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
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,0.729163,38868,1,0,189,64077,136,153,1478,82403,317
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 : !((("(((CAPACITE>=5)&&(VIDANGE_1>=1))||((CAPACITE>=5)&&(VIDANGE_2>=1)))")U(G("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))"))))
Formula 2 simplified : !("(((CAPACITE>=5)&&(VIDANGE_1>=1))||((CAPACITE>=5)&&(VIDANGE_2>=1)))" U G"((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))")
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
36 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.08792,49568,1,0,357,90866,155,329,1493,138605,689
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))")U("(((((((((((((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))")))
Formula 3 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)))" U "(((((((((((((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1)))||((((NB_ATTENTE_A_4>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1)))")
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
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.3032,55616,1,0,417,105059,163,440,1521,157401,866
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 : !((X(G(G("((((((ROUTE_A>=1)&&(NB_ATTENTE_A_0>=1))||((ROUTE_A>=1)&&(NB_ATTENTE_A_1>=1)))||((ROUTE_A>=1)&&(NB_ATTENTE_A_2>=1)))||((ROUTE_A>=1)&&(NB_ATTENTE_A_3>=1)))||((ROUTE_A>=1)&&(NB_ATTENTE_A_4>=1)))")))))
Formula 4 simplified : !XG"((((((ROUTE_A>=1)&&(NB_ATTENTE_A_0>=1))||((ROUTE_A>=1)&&(NB_ATTENTE_A_1>=1)))||((ROUTE_A>=1)&&(NB_ATTENTE_A_2>=1)))||((ROUTE_A>=1)&&(NB_ATTENTE_A_3>=1)))||((ROUTE_A>=1)&&(NB_ATTENTE_A_4>=1)))"
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
34 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.65054,62044,1,0,564,123240,169,595,1529,185864,1215
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 : !((G(G(F("((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))")))))
Formula 5 simplified : !GF"((((((NB_ATTENTE_B_0>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_2>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||((NB_ATTENTE_B_4>=1)&&(ROUTE_B>=1)))"
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.7679,64144,1,0,643,125530,169,691,1529,205720,1643
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 : !(((X(X(G("(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))"))))U(F("(SUR_PONT_A>=1)"))))
Formula 6 simplified : !(XXG"(((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_1>=1))&&(ATTENTE_B>=1))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_2>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1)))||((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_4>=1))&&(ATTENTE_B>=1)))" U F"(SUR_PONT_A>=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.79742,64896,1,0,795,127976,178,786,1530,208866,1961
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((CHOIX_1>=1)&&(COMPTEUR_0>=1))||((CHOIX_1>=1)&&(COMPTEUR_1>=1)))||((CHOIX_2>=1)&&(COMPTEUR_0>=1)))||((CHOIX_2>=1)&&(COMPTEUR_1>=1)))"))
Formula 7 simplified : !"(((((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
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.79839,65160,1,0,795,127976,181,786,1539,208866,1963
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G("((CAPACITE>=5)&&(VIDANGE_2>=1))"))))
Formula 8 simplified : !XG"((CAPACITE>=5)&&(VIDANGE_2>=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
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.80129,65160,1,0,795,128031,187,786,1539,208931,1971
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 : !((("((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))")U(F(G(X("((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=1))"))))))
Formula 9 simplified : !("((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_2>=1))" U FGX"((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_1>=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
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,1.92686,65896,1,0,862,130953,192,908,1539,235501,2289
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_A_4>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_1>=1))"))
Formula 10 simplified : !"((((NB_ATTENTE_A_4>=1)&&(ATTENTE_A>=1))&&(CAPACITE>=1))&&(CONTROLEUR_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,1.92759,66160,1,0,862,130953,195,908,1543,235502,2291
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 : !((F(F("((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))"))))
Formula 11 simplified : !F"((((NB_ATTENTE_A_2>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))"
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.99841,68536,1,0,928,133075,204,997,1543,241581,2629
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 : !(("((ROUTE_A>=1)&&(NB_ATTENTE_A_2>=1))"))
Formula 12 simplified : !"((ROUTE_A>=1)&&(NB_ATTENTE_A_2>=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.99904,68800,1,0,928,133075,207,997,1543,241581,2631
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((X(F("((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))")))U(G(X("((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_B>=1))"))))))
Formula 13 simplified : !X(XF"((((NB_ATTENTE_A_1>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))" U GX"((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_3>=1))&&(ATTENTE_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
5 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.05281,70476,1,0,965,135419,212,1051,1543,246190,2910
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("((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=1))")))
Formula 14 simplified : !X"((NB_ATTENTE_B_1>=1)&&(ROUTE_B>=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
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.05455,70740,1,0,970,135468,215,1058,1543,246232,2929
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 : !((F("((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))")))
Formula 15 simplified : !F"((((NB_ATTENTE_A_3>=1)&&(CONTROLEUR_2>=1))&&(NB_ATTENTE_B_0>=1))&&(COMPTEUR_0>=1))"
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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,2.07891,71532,1,0,970,135468,224,1058,1543,246539,3141
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
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 1552454867271

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 13, 2019 5:27:44 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/, -smt]
Mar 13, 2019 5:27:44 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 13, 2019 5:27:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 46 ms
Mar 13, 2019 5:27:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 places.
Mar 13, 2019 5:27:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 52 transitions.
Mar 13, 2019 5:27:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Mar 13, 2019 5:27:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 75 ms
Mar 13, 2019 5:27:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 13, 2019 5:27:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 13, 2019 5:27:44 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 52 transitions.
Mar 13, 2019 5:27:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 9 ms
Mar 13, 2019 5:27:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 28 variables to be positive in 71 ms
Mar 13, 2019 5:27:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
Mar 13, 2019 5:27:45 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 13, 2019 5:27:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 13, 2019 5:27:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 52 transitions.
Mar 13, 2019 5:27:45 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 13, 2019 5:27:47 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 13, 2019 5:27:47 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: Stream closed")
Mar 13, 2019 5:27:47 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 0) 1) (>= (select s0 1) 1)) (= (store (store (store (store s0 1 (- (select s0 1) 1)) 2 (+ (select s0 2) 1)) 0 (- (select s0 0) 1)) 6 (+ (select s0 6) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 0) 1) (>= (select s0 1) 1)) (= (store (store (store (store s0 1 (- (select s0 1) 1)) 2 (+ (select s0 2) 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 13, 2019 5:27:47 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2230ms 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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-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 r019-csrt-155225080500502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-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 ;