Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698900289.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698900289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.4K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 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-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-15

=== Now, execution of the tool begins

BK_START 1589228775430

[2020-05-11 20:26:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 20:26:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 20:26:19] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-05-11 20:26:19] [INFO ] Transformed 28 places.
[2020-05-11 20:26:19] [INFO ] Transformed 52 transitions.
[2020-05-11 20:26:19] [INFO ] Parsed PT model containing 28 places and 52 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2299 resets, run finished after 320 ms. (steps per millisecond=312 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
[2020-05-11 20:26:19] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 20:26:19] [INFO ] Computed 7 place invariants in 16 ms
[2020-05-11 20:26:19] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-05-11 20:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:19] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-05-11 20:26:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:26:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-05-11 20:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:19] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-05-11 20:26:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-11 20:26:19] [INFO ] [Nat]Added 6 Read/Feed constraints in 40 ms returned sat
[2020-05-11 20:26:20] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-05-11 20:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2020-05-11 20:26:20] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 8 ms.
[2020-05-11 20:26:20] [INFO ] Added : 27 causal constraints over 6 iterations in 173 ms. Result :sat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2020-05-11 20:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-11 20:26:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:26:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 20:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:20] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-11 20:26:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2020-05-11 20:26:20] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-05-11 20:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-05-11 20:26:20] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 10 ms.
[2020-05-11 20:26:20] [INFO ] Added : 27 causal constraints over 6 iterations in 195 ms. Result :sat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned sat
[2020-05-11 20:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:20] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-11 20:26:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:26:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:26:20] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-11 20:26:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2020-05-11 20:26:21] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2020-05-11 20:26:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-05-11 20:26:21] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 3 ms.
[2020-05-11 20:26:21] [INFO ] Added : 29 causal constraints over 6 iterations in 146 ms. Result :sat
[2020-05-11 20:26:21] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2020-05-11 20:26:21] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-11 20:26:21] [INFO ] Flatten gal took : 61 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 20:26:21] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 20:26:21] [INFO ] Applying decomposition
[2020-05-11 20:26:21] [INFO ] Flatten gal took : 7 ms
[2020-05-11 20:26:21] [INFO ] Input system was already deterministic with 52 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph18217223165850754439.txt, -o, /tmp/graph18217223165850754439.bin, -w, /tmp/graph18217223165850754439.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18217223165850754439.bin, -l, -1, -v, -w, /tmp/graph18217223165850754439.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 20:26:22] [INFO ] Decomposing Gal with order
[2020-05-11 20:26:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 20:26:22] [INFO ] Removed a total of 116 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 34 out of 52 initially.
// Phase 1: matrix 34 rows 28 cols
[2020-05-11 20:26:22] [INFO ] Computed 7 place invariants in 4 ms
inv : SUR_PONT_A + CAPACITE + SUR_PONT_B = 5
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 = 1
inv : ATTENTE_B + SUR_PONT_B + SORTI_B + ROUTE_B = 4
inv : ROUTE_A + ATTENTE_A + SUR_PONT_A + SORTI_A = 4
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 = 1
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 = 1
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
Total of 7 invariants.
[2020-05-11 20:26:22] [INFO ] Computed 7 place invariants in 4 ms
[2020-05-11 20:26:22] [INFO ] Flatten gal took : 164 ms
[2020-05-11 20:26:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 29 ms.
[2020-05-11 20:26:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-11 20:26:22] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((X(G((F(!(F("((gu2.VIDANGE_1+gu2.VIDANGE_2)<=gu2.ROUTE_B)"))))U(G(F("(gi3.gu5.ROUTE_A<=gi3.gu5.SORTI_A)")))))))
Formula 0 simplified : !XG(F!F"((gu2.VIDANGE_1+gu2.VIDANGE_2)<=gu2.ROUTE_B)" U GF"(gi3.gu5.ROUTE_A<=gi3.gu5.SORTI_A)")
[2020-05-11 20:26:22] [INFO ] Proved 28 variables to be positive in 262 ms
[2020-05-11 20:26:22] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-11 20:26:22] [INFO ] Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:26:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:26:22] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-11 20:26:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_3, liberation_A, basculement_1, liberation_B, enregistrement_B_2, altern_cpt_2_1, timeout_A_1_1_0_1, timeout_A_2_1_0_1, timeout_A_1_1_0_4, timeout_A_2_1_0_4, timeout_B_1_2_3_0, timeout_B_2_2_3_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/8/12/24
Computing Next relation with stutter on 4 deadlock states
100 unique states visited
0 strongly connected components in search stack
100 transitions explored
58 items max in DFS search stack
118 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.19676,38968,1,0,209,87182,74,226,1099,97576,809
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(X(!(("((gu2.CHOIX_1+gu2.CHOIX_2)<=(gu2.VIDANGE_1+gu2.VIDANGE_2))")U(F("((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>=1)"))))))))
Formula 1 simplified : !FXX!("((gu2.CHOIX_1+gu2.CHOIX_2)<=(gu2.VIDANGE_1+gu2.VIDANGE_2))" U F"((gu1.CONTROLEUR_1+gu1.CONTROLEUR_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
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48475,51464,1,0,673,138029,87,578,1104,180364,1753
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(!(G("(gi3.gu5.SORTI_A>=1)"))))))
Formula 2 simplified : !XF!G"(gi3.gu5.SORTI_A>=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
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.48546,51464,1,0,673,138029,96,578,1106,180364,1757
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((("(gu2.ROUTE_B>=1)")U((X(G("(gu2.ROUTE_B>=1)")))&&("(gu2.SUR_PONT_B>=1)")))&&(X(G(!(F("(gu2.SORTI_B>=1)"))))))))
Formula 3 simplified : !X(("(gu2.ROUTE_B>=1)" U ("(gu2.SUR_PONT_B>=1)" & XG"(gu2.ROUTE_B>=1)")) & XG!F"(gu2.SORTI_B>=1)")
Computing Next relation with stutter on 4 deadlock states
33 unique states visited
33 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.57691,55736,1,0,1060,150582,147,891,1139,203486,2696
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(X("(gu1.CONTROLEUR_2<=gu2.VIDANGE_2)")))U(G(!(X(((G("(gu2.VIDANGE_1>=1)"))U(F("(gi3.gu0.NB_ATTENTE_B_4<=gi3.gu0.ATTENTE_A)")))||("(gu2.ROUTE_B>gu2.CHOIX_2)")))))))
Formula 4 simplified : !(XX"(gu1.CONTROLEUR_2<=gu2.VIDANGE_2)" U G!X("(gu2.ROUTE_B>gu2.CHOIX_2)" | (G"(gu2.VIDANGE_1>=1)" U F"(gi3.gu0.NB_ATTENTE_B_4<=gi3.gu0.ATTENTE_A)")))
Computing Next relation with stutter on 4 deadlock states
62 unique states visited
62 strongly connected components in search stack
63 transitions explored
62 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,1.58202,56684,1,0,1061,150621,163,892,1153,203532,2713
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X((X("(gu2.SUR_PONT_B<=gu2.ROUTE_B)"))||("((gi3.gu0.ATTENTE_A>=2)&&(gi2.gu4.COMPTEUR_1<=gi2.gu4.ATTENTE_B))")))))
Formula 5 simplified : !GX("((gi3.gu0.ATTENTE_A>=2)&&(gi2.gu4.COMPTEUR_1<=gi2.gu4.ATTENTE_B))" | X"(gu2.SUR_PONT_B<=gu2.ROUTE_B)")
Computing Next relation with stutter on 4 deadlock states
55 unique states visited
55 strongly connected components in search stack
55 transitions explored
55 items max in DFS search stack
47 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.05815,71140,1,0,1908,203156,180,1520,1172,298420,4517
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X(!(F(X("((gi3.gu5.SORTI_A<=gi3.gu0.ATTENTE_A)||(gu1.CONTROLEUR_2<=gu1.CAPACITE))"))))))||(G("(gu1.CAPACITE<=gi3.gu0.ATTENTE_A)"))))
Formula 6 simplified : !(XX!FX"((gi3.gu5.SORTI_A<=gi3.gu0.ATTENTE_A)||(gu1.CONTROLEUR_2<=gu1.CAPACITE))" | G"(gu1.CAPACITE<=gi3.gu0.ATTENTE_A)")
Computing Next relation with stutter on 4 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.06053,71404,1,0,1908,203193,190,1520,1187,298460,4531
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G(X(F("(gi3.gu5.COMPTEUR_2<=gi3.gu5.ROUTE_A)"))))))
Formula 7 simplified : GXF"(gi3.gu5.COMPTEUR_2<=gi3.gu5.ROUTE_A)"
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
33 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.38321,82228,1,0,2330,248717,203,1949,1192,379526,5548
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((!(G((X("(gi3.gu5.ROUTE_A>=2)"))&&("(gi3.gu5.ROUTE_A>=2)"))))U("(gi3.gu0.ATTENTE_A<=gu2.CHOIX_1)"))))
Formula 8 simplified : !X(!G("(gi3.gu5.ROUTE_A>=2)" & X"(gi3.gu5.ROUTE_A>=2)") U "(gi3.gu0.ATTENTE_A<=gu2.CHOIX_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
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.38401,82492,1,0,2330,248717,213,1949,1202,379526,5553
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V04P05N02-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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:757)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-11 20:26:25] [INFO ] Built C files in 3367ms conformant to PINS in folder :/home/mcc/execution
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 1589228785678

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897698900289"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;