fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897698900305
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15728.850 353491.00 681964.00 3036.50 FTFFFTTFFFFTFTFT normal

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-158897698900305.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-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698900305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K Mar 26 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 26 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Mar 25 20:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 25 20:49 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 5.3K 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 18K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 25 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Mar 25 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Mar 25 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 598K 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-V20P10N10-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-15

=== Now, execution of the tool begins

BK_START 1589229071380

[2020-05-11 20:31:13] [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:31:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 20:31:13] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-05-11 20:31:13] [INFO ] Transformed 68 places.
[2020-05-11 20:31:13] [INFO ] Transformed 548 transitions.
[2020-05-11 20:31:13] [INFO ] Parsed PT model containing 68 places and 548 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 563 resets, run finished after 309 ms. (steps per millisecond=323 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1]
[2020-05-11 20:31:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 20:31:14] [INFO ] Computed 7 place invariants in 9 ms
[2020-05-11 20:31:14] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2020-05-11 20:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:31:14] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-05-11 20:31:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:31:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-05-11 20:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:31:14] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-05-11 20:31:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-11 20:31:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 40 ms returned sat
[2020-05-11 20:31:15] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 107 ms.
[2020-05-11 20:31:16] [INFO ] Added : 106 causal constraints over 22 iterations in 1384 ms. Result :sat
[2020-05-11 20:31:16] [INFO ] Deduced a trap composed of 6 places in 385 ms
[2020-05-11 20:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2020-05-11 20:31:16] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2020-05-11 20:31:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-11 20:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 20:31:16] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-11 20:31:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-11 20:31:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-11 20:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-11 20:31:17] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-11 20:31:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-05-11 20:31:17] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2020-05-11 20:31:18] [INFO ] Deduced a trap composed of 16 places in 921 ms
[2020-05-11 20:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1091 ms
[2020-05-11 20:31:18] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 47 ms.
[2020-05-11 20:31:19] [INFO ] Added : 123 causal constraints over 25 iterations in 1754 ms. Result :sat
[2020-05-11 20:31:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-11 20:31:20] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-11 20:31:20] [INFO ] Flatten gal took : 143 ms
FORMULA BridgeAndVehicles-PT-V20P10N10-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-11 20:31:20] [INFO ] Flatten gal took : 76 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-11 20:31:20] [INFO ] Applying decomposition
[2020-05-11 20:31:20] [INFO ] Flatten gal took : 37 ms
[2020-05-11 20:31:20] [INFO ] Input system was already deterministic with 548 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/graph3941569491609510923.txt, -o, /tmp/graph3941569491609510923.bin, -w, /tmp/graph3941569491609510923.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/graph3941569491609510923.bin, -l, -1, -v, -w, /tmp/graph3941569491609510923.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-11 20:31:21] [INFO ] Decomposing Gal with order
[2020-05-11 20:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-11 20:31:21] [INFO ] Removed a total of 1075 redundant transitions.
[2020-05-11 20:31:21] [INFO ] Flatten gal took : 310 ms
[2020-05-11 20:31:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 672 labels/synchronizations in 86 ms.
[2020-05-11 20:31:21] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-11 20:31:21] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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 11 LTL properties
Checking formula 0 : !((!(X(G(!(X("(gu3.CAPACITE>=1)")))))))
Formula 0 simplified : XG!X"(gu3.CAPACITE>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 68 cols
[2020-05-11 20:31:22] [INFO ] Computed 7 place invariants in 3 ms
inv : NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 = 1
inv : NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 = 1
inv : SUR_PONT_A + CAPACITE + SUR_PONT_B = 10
inv : ROUTE_A + ATTENTE_A + SUR_PONT_A + SORTI_A = 20
inv : CONTROLEUR_1 + CONTROLEUR_2 + CHOIX_1 + CHOIX_2 + VIDANGE_1 + VIDANGE_2 = 1
inv : COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 = 1
inv : ATTENTE_B + SUR_PONT_B + SORTI_B + ROUTE_B = 20
Total of 7 invariants.
[2020-05-11 20:31:22] [INFO ] Computed 7 place invariants in 3 ms
[2020-05-11 20:31:22] [INFO ] Proved 68 variables to be positive in 537 ms
[2020-05-11 20:31:22] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2020-05-11 20:31:22] [INFO ] Computation of disable matrix completed :0/548 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:31:22] [INFO ] Computation of Complete disable matrix. took 132 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:31:22] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2020-05-11 20:31:22] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-11 20:31:37] [INFO ] Computing symmetric co enabling matrix : 548 transitions.
[2020-05-11 20:31:38] [INFO ] Computation of co-enabling matrix(0/548) took 303 ms. Total solver calls (SAT/UNSAT): 481(221/260)
Reverse transition relation is NOT exact ! Due to transitions gu3.liberation_B, enregistrement_A_0, liberation_A, basculement_1, basculement_2, enregistrement_B_0, altern_cpt_10_1, altern_cpt_10_2, timeout_A_0_1_1_9, timeout_B_11_1_2_0, timeout_B_11_10_2_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :2/8/11/21
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1813 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,18.1797,405112,1,0,63,990424,66,25,4520,1.11367e+06,56
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(G(F(X(F(!((F(X(F("(gi0.gu0.ROUTE_B>=2)"))))U("(gi0.gu5.SUR_PONT_A<=gu2.ATTENTE_B)"))))))))))
Formula 1 simplified : !GFGFXF!(FXF"(gi0.gu0.ROUTE_B>=2)" U "(gi0.gu5.SUR_PONT_A<=gu2.ATTENTE_B)")
Computing Next relation with stutter on 20 deadlock states
[2020-05-11 20:31:41] [INFO ] Computation of co-enabling matrix(11/548) took 3517 ms. Total solver calls (SAT/UNSAT): 5706(364/5342)
[2020-05-11 20:31:44] [INFO ] Computation of co-enabling matrix(15/548) took 6888 ms. Total solver calls (SAT/UNSAT): 7576(416/7160)
[2020-05-11 20:31:47] [INFO ] Computation of co-enabling matrix(19/548) took 9910 ms. Total solver calls (SAT/UNSAT): 9430(468/8962)
[2020-05-11 20:31:50] [INFO ] Computation of co-enabling matrix(24/548) took 12968 ms. Total solver calls (SAT/UNSAT): 11506(528/10978)
[2020-05-11 20:31:54] [INFO ] Computation of co-enabling matrix(31/548) took 16483 ms. Total solver calls (SAT/UNSAT): 15139(542/14597)
[2020-05-11 20:31:58] [INFO ] Computation of co-enabling matrix(34/548) took 20818 ms. Total solver calls (SAT/UNSAT): 16681(548/16133)
[2020-05-11 20:32:04] [INFO ] Computation of co-enabling matrix(35/548) took 26835 ms. Total solver calls (SAT/UNSAT): 17193(550/16643)
[2020-05-11 20:32:07] [INFO ] Computation of co-enabling matrix(39/548) took 29948 ms. Total solver calls (SAT/UNSAT): 19231(558/18673)
[2020-05-11 20:32:11] [INFO ] Computation of co-enabling matrix(50/548) took 33284 ms. Total solver calls (SAT/UNSAT): 23997(878/23119)
[2020-05-11 20:32:14] [INFO ] Computation of co-enabling matrix(61/548) took 36515 ms. Total solver calls (SAT/UNSAT): 28936(999/27937)
[2020-05-11 20:32:17] [INFO ] Computation of co-enabling matrix(74/548) took 39668 ms. Total solver calls (SAT/UNSAT): 34995(1043/33952)
[2020-05-11 20:32:24] [INFO ] Computation of co-enabling matrix(79/548) took 46938 ms. Total solver calls (SAT/UNSAT): 37345(1043/36302)
[2020-05-11 20:32:27] [INFO ] Computation of co-enabling matrix(93/548) took 50131 ms. Total solver calls (SAT/UNSAT): 43792(1043/42749)
[2020-05-11 20:32:32] [INFO ] Computation of co-enabling matrix(98/548) took 54306 ms. Total solver calls (SAT/UNSAT): 46047(1043/45004)
[2020-05-11 20:32:36] [INFO ] Computation of co-enabling matrix(106/548) took 59115 ms. Total solver calls (SAT/UNSAT): 49603(1043/48560)
[2020-05-11 20:32:40] [INFO ] Computation of co-enabling matrix(118/548) took 63169 ms. Total solver calls (SAT/UNSAT): 54817(1043/53774)
[2020-05-11 20:32:43] [INFO ] Computation of co-enabling matrix(127/548) took 66174 ms. Total solver calls (SAT/UNSAT): 58633(1043/57590)
[2020-05-11 20:32:48] [INFO ] Computation of co-enabling matrix(129/548) took 70819 ms. Total solver calls (SAT/UNSAT): 59470(1043/58427)
[2020-05-11 20:32:51] [INFO ] Computation of co-enabling matrix(145/548) took 73980 ms. Total solver calls (SAT/UNSAT): 66022(1043/64979)
[2020-05-11 20:32:54] [INFO ] Computation of co-enabling matrix(162/548) took 77022 ms. Total solver calls (SAT/UNSAT): 72703(1043/71660)
[2020-05-11 20:32:59] [INFO ] Computation of co-enabling matrix(180/548) took 81954 ms. Total solver calls (SAT/UNSAT): 79462(1043/78419)
283 unique states visited
283 strongly connected components in search stack
284 transitions explored
283 items max in DFS search stack
8018 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,98.3643,1670076,1,0,395,5.99323e+06,76,639,4542,8.21268e+06,1754
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(F("(gi0.gu5.SUR_PONT_A>=2)")))))
Formula 2 simplified : !FXF"(gi0.gu5.SUR_PONT_A>=2)"
Computing Next relation with stutter on 20 deadlock states
[2020-05-11 20:33:02] [INFO ] Computation of co-enabling matrix(196/548) took 85029 ms. Total solver calls (SAT/UNSAT): 85198(1043/84155)
[2020-05-11 20:33:05] [INFO ] Computation of co-enabling matrix(218/548) took 88110 ms. Total solver calls (SAT/UNSAT): 92667(1043/91624)
[2020-05-11 20:33:10] [INFO ] Computation of co-enabling matrix(238/548) took 92536 ms. Total solver calls (SAT/UNSAT): 99037(1043/97994)
[2020-05-11 20:33:13] [INFO ] Computation of co-enabling matrix(247/548) took 96230 ms. Total solver calls (SAT/UNSAT): 101773(1043/100730)
[2020-05-11 20:33:17] [INFO ] Computation of co-enabling matrix(259/548) took 99844 ms. Total solver calls (SAT/UNSAT): 105295(1043/104252)
[2020-05-11 20:33:23] [INFO ] Computation of co-enabling matrix(264/548) took 106207 ms. Total solver calls (SAT/UNSAT): 106720(1043/105677)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2518 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,123.544,2173296,1,0,1495,8.62152e+06,85,1532,4544,1.05999e+07,3998
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G("((gu2.CONTROLEUR_1+gu3.CONTROLEUR_2)>=1)"))))
Formula 3 simplified : !FG"((gu2.CONTROLEUR_1+gu3.CONTROLEUR_2)>=1)"
Computing Next relation with stutter on 20 deadlock states
[2020-05-11 20:33:27] [INFO ] Computation of co-enabling matrix(265/548) took 110019 ms. Total solver calls (SAT/UNSAT): 107002(1043/105959)
[2020-05-11 20:33:31] [INFO ] Computation of co-enabling matrix(266/548) took 113407 ms. Total solver calls (SAT/UNSAT): 107283(1043/106240)
[2020-05-11 20:33:34] [INFO ] Computation of co-enabling matrix(277/548) took 116435 ms. Total solver calls (SAT/UNSAT): 110308(1043/109265)
[2020-05-11 20:33:37] [INFO ] Computation of co-enabling matrix(299/548) took 119548 ms. Total solver calls (SAT/UNSAT): 115995(1043/114952)
[2020-05-11 20:33:43] [INFO ] Computation of co-enabling matrix(315/548) took 125737 ms. Total solver calls (SAT/UNSAT): 119827(1043/118784)
[2020-05-11 20:33:47] [INFO ] Computation of co-enabling matrix(317/548) took 129889 ms. Total solver calls (SAT/UNSAT): 120288(1043/119245)
[2020-05-11 20:33:50] [INFO ] Computation of co-enabling matrix(321/548) took 133202 ms. Total solver calls (SAT/UNSAT): 121198(1043/120155)
[2020-05-11 20:33:54] [INFO ] Computation of co-enabling matrix(338/548) took 137091 ms. Total solver calls (SAT/UNSAT): 124887(1043/123844)
[2020-05-11 20:33:58] [INFO ] Computation of co-enabling matrix(341/548) took 140537 ms. Total solver calls (SAT/UNSAT): 125508(1043/124465)
[2020-05-11 20:34:04] [INFO ] Computation of co-enabling matrix(345/548) took 146576 ms. Total solver calls (SAT/UNSAT): 126322(1043/125279)
[2020-05-11 20:34:07] [INFO ] Computation of co-enabling matrix(353/548) took 149674 ms. Total solver calls (SAT/UNSAT): 127902(1043/126859)
[2020-05-11 20:34:10] [INFO ] Computation of co-enabling matrix(370/548) took 152811 ms. Total solver calls (SAT/UNSAT): 131047(1043/130004)
[2020-05-11 20:34:13] [INFO ] Computation of co-enabling matrix(385/548) took 155818 ms. Total solver calls (SAT/UNSAT): 133582(1043/132539)
[2020-05-11 20:34:18] [INFO ] Computation of co-enabling matrix(389/548) took 160999 ms. Total solver calls (SAT/UNSAT): 134220(1043/133177)
[2020-05-11 20:34:22] [INFO ] Computation of co-enabling matrix(404/548) took 164431 ms. Total solver calls (SAT/UNSAT): 136470(1043/135427)
[2020-05-11 20:34:25] [INFO ] Computation of co-enabling matrix(422/548) took 167843 ms. Total solver calls (SAT/UNSAT): 138873(1043/137830)
[2020-05-11 20:34:28] [INFO ] Computation of co-enabling matrix(451/548) took 171051 ms. Total solver calls (SAT/UNSAT): 142063(1043/141020)
[2020-05-11 20:34:32] [INFO ] Computation of co-enabling matrix(480/548) took 174482 ms. Total solver calls (SAT/UNSAT): 144412(1043/143369)
[2020-05-11 20:34:35] [INFO ] Computation of co-enabling matrix(486/548) took 177813 ms. Total solver calls (SAT/UNSAT): 144793(1043/143750)
[2020-05-11 20:34:38] [INFO ] Computation of co-enabling matrix(489/548) took 180947 ms. Total solver calls (SAT/UNSAT): 144970(1043/143927)
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
7444 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,197.982,2225872,1,0,2329,1.07088e+07,20,1619,1799,1.07671e+07,4172
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(X(F(X(F(!(G(X("(gi0.gu0.ROUTE_B<=gu2.ATTENTE_B)")))))))))))
Formula 4 simplified : !G!XFXF!GX"(gi0.gu0.ROUTE_B<=gu2.ATTENTE_B)"
[2020-05-11 20:34:42] [INFO ] Computation of co-enabling matrix(498/548) took 184453 ms. Total solver calls (SAT/UNSAT): 145447(1043/144404)
Computing Next relation with stutter on 20 deadlock states
[2020-05-11 20:34:45] [INFO ] Computation of co-enabling matrix(525/548) took 187895 ms. Total solver calls (SAT/UNSAT): 146392(1043/145349)
[2020-05-11 20:34:47] [INFO ] Computation of Finished co-enabling matrix. took 189845 ms. Total solver calls (SAT/UNSAT): 146623(1043/145580)
[2020-05-11 20:34:47] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2020-05-11 20:34:49] [INFO ] Computation of Completed DNA matrix. took 1815 ms. Total solver calls (SAT/UNSAT): 81(0/81)
[2020-05-11 20:34:49] [INFO ] Built C files in 208678ms 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]
Compilation finished in 5716 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 60 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(<>(X(<>(!( [](X((LTLAP5==true)))) ))))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(<>(X(<>(!( [](X((LTLAP5==true)))) ))))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(<>(X(<>(!( [](X((LTLAP5==true)))) ))))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
4677 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,244.752,2434276,1,0,2337,1.18856e+07,18,1743,1814,1.20847e+07,567
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((!(X((G("(gu3.SUR_PONT_B>=1)"))U("(gi0.gu0.ROUTE_B>=1)"))))&&((F(X("(gu3.SUR_PONT_B>=1)")))U(X("(gu3.SORTI_B>=1)"))))))
Formula 5 simplified : !X(!X(G"(gu3.SUR_PONT_B>=1)" U "(gi0.gu0.ROUTE_B>=1)") & (FX"(gu3.SUR_PONT_B>=1)" U X"(gu3.SORTI_B>=1)"))
Computing Next relation with stutter on 20 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1539 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,260.138,2434572,1,0,2337,1.18856e+07,27,1743,2125,1.20847e+07,865
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G((!(X(X("(gi3.gu4.VIDANGE_1>=1)"))))U(F(G(X(G((G("(gi3.gu4.VIDANGE_1>=1)"))&&("(gi0.gu0.ROUTE_B<=gi0.gu0.CHOIX_2)"))))))))))
Formula 6 simplified : !XG(!XX"(gi3.gu4.VIDANGE_1>=1)" U FGXG("(gi0.gu0.ROUTE_B<=gi0.gu0.CHOIX_2)" & G"(gi3.gu4.VIDANGE_1>=1)"))
Computing Next relation with stutter on 20 deadlock states
283 unique states visited
282 strongly connected components in search stack
284 transitions explored
283 items max in DFS search stack
1015 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,270.289,2434704,1,0,2337,1.18856e+07,35,1743,2132,1.20847e+07,1712
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(G(X("(gu2.ATTENTE_B<=gu2.CONTROLEUR_1)"))))U(X(G(!(G(X("(gi0.gu0.ROUTE_A<=gi0.gu0.ROUTE_B)"))))))))
Formula 7 simplified : !(FGX"(gu2.ATTENTE_B<=gu2.CONTROLEUR_1)" U XG!GX"(gi0.gu0.ROUTE_A<=gi0.gu0.ROUTE_B)")
Computing Next relation with stutter on 20 deadlock states
284 unique states visited
284 strongly connected components in search stack
285 transitions explored
284 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,270.392,2434836,1,0,2337,1.18856e+07,44,1743,2136,1.20847e+07,1726
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X((((F("(gu3.SORTI_B<=gu3.CONTROLEUR_2)"))U("(gi0.gu5.SUR_PONT_A<=gi0.gu5.CHOIX_1)"))||(G("(gi0.gu5.SUR_PONT_A<=gi0.gu5.CHOIX_1)")))&&(G(X("(gi0.gu0.CHOIX_2<=gi0.gu5.SUR_PONT_A)")))))))
Formula 8 simplified : X(((F"(gu3.SORTI_B<=gu3.CONTROLEUR_2)" U "(gi0.gu5.SUR_PONT_A<=gi0.gu5.CHOIX_1)") | G"(gi0.gu5.SUR_PONT_A<=gi0.gu5.CHOIX_1)") & GX"(gi0.gu0.CHOIX_2<=gi0.gu5.SUR_PONT_A)")
Computing Next relation with stutter on 20 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
192 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,272.316,2434836,1,0,2337,1.18856e+07,64,1743,2170,1.20847e+07,2430
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X("(gu3.CONTROLEUR_2<=gu3.CAPACITE)"))))
Formula 9 simplified : !GX"(gu3.CONTROLEUR_2<=gu3.CAPACITE)"
Computing Next relation with stutter on 20 deadlock states
282 unique states visited
0 strongly connected components in search stack
282 transitions explored
282 items max in DFS search stack
3724 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,309.567,2459620,1,0,2337,1.18856e+07,70,1743,2193,1.51218e+07,4692
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(F(!(F(X("(gi0.gu5.SUR_PONT_A<=gi0.gu0.ROUTE_A)"))))))))
Formula 10 simplified : !XXF!FX"(gi0.gu5.SUR_PONT_A<=gi0.gu0.ROUTE_A)"
Computing Next relation with stutter on 20 deadlock states
283 unique states visited
282 strongly connected components in search stack
284 transitions explored
283 items max in DFS search stack
2824 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,337.813,2676348,1,0,2337,1.18856e+07,18,2070,1718,1.62733e+07,910
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BridgeAndVehicles-PT-V20P10N10-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589229424871

--------------------
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-V20P10N10"
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-V20P10N10, 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-158897698900305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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