Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476400930.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476400930
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 2.9K May 14 02:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 02:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 20:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 13K May 12 20:42 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 ShieldRVt-PT-001B-00
FORMULA_NAME ShieldRVt-PT-001B-01
FORMULA_NAME ShieldRVt-PT-001B-02
FORMULA_NAME ShieldRVt-PT-001B-03
FORMULA_NAME ShieldRVt-PT-001B-04
FORMULA_NAME ShieldRVt-PT-001B-05
FORMULA_NAME ShieldRVt-PT-001B-06
FORMULA_NAME ShieldRVt-PT-001B-07
FORMULA_NAME ShieldRVt-PT-001B-08
FORMULA_NAME ShieldRVt-PT-001B-09
FORMULA_NAME ShieldRVt-PT-001B-10
FORMULA_NAME ShieldRVt-PT-001B-11
FORMULA_NAME ShieldRVt-PT-001B-12
FORMULA_NAME ShieldRVt-PT-001B-13
FORMULA_NAME ShieldRVt-PT-001B-14
FORMULA_NAME ShieldRVt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1590630215664

[2020-05-28 01:43:37] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-28 01:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:43:37] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-05-28 01:43:37] [INFO ] Transformed 53 places.
[2020-05-28 01:43:37] [INFO ] Transformed 53 transitions.
[2020-05-28 01:43:37] [INFO ] Found NUPN structural information;
[2020-05-28 01:43:37] [INFO ] Parsed PT model containing 53 places and 53 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 109 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 53 rows 53 cols
[2020-05-28 01:43:37] [INFO ] Computed 5 place invariants in 3 ms
[2020-05-28 01:43:37] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-28 01:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:43:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-28 01:43:37] [INFO ] Computed and/alt/rep : 52/77/52 causal constraints in 8 ms.
[2020-05-28 01:43:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:43:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 141 ms returned sat
[2020-05-28 01:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:43:38] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-05-28 01:43:38] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2020-05-28 01:43:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2020-05-28 01:43:38] [INFO ] Computed and/alt/rep : 52/77/52 causal constraints in 8 ms.
[2020-05-28 01:43:38] [INFO ] Added : 50 causal constraints over 11 iterations in 71 ms. Result :sat
[2020-05-28 01:43:38] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-28 01:43:38] [INFO ] Flatten gal took : 36 ms
FORMULA ShieldRVt-PT-001B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:43:38] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:43:38] [INFO ] Applying decomposition
[2020-05-28 01:43:38] [INFO ] Flatten gal took : 6 ms
[2020-05-28 01:43:38] [INFO ] Input system was already deterministic with 53 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/graph12169371647302666179.txt, -o, /tmp/graph12169371647302666179.bin, -w, /tmp/graph12169371647302666179.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/graph12169371647302666179.bin, -l, -1, -v, -w, /tmp/graph12169371647302666179.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 53 rows 53 cols
[2020-05-28 01:43:38] [INFO ] Computed 5 place invariants in 1 ms
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p4 + p5 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p4 + p5 + p6 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 = 1
inv : p0 + p4 + p5 + p6 + p7 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 = 1
Total of 5 invariants.
[2020-05-28 01:43:38] [INFO ] Computed 5 place invariants in 2 ms
[2020-05-28 01:43:38] [INFO ] Decomposing Gal with order
[2020-05-28 01:43:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:43:38] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-28 01:43:38] [INFO ] Proved 53 variables to be positive in 63 ms
[2020-05-28 01:43:38] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2020-05-28 01:43:38] [INFO ] Computation of disable matrix completed :0/53 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:43:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:43:38] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2020-05-28 01:43:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:43:38] [INFO ] Flatten gal took : 34 ms
[2020-05-28 01:43:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 01:43:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-28 01:43:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/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.202005100927/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 13 LTL properties
Checking formula 0 : !((F(G(((X("((i2.u3.p8==1)&&(i3.u10.p21==1))"))||("(i2.u3.p8!=1)"))||("(i5.u19.p50==1)")))))
Formula 0 simplified : !FG("(i2.u3.p8!=1)" | "(i5.u19.p50==1)" | X"((i2.u3.p8==1)&&(i3.u10.p21==1))")
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t37, i0.u0.t46, i1.t44, i1.u4.t38, i1.u4.t45, i1.u6.t42, i3.t28, i3.u10.t32, i3.u10.t34, i4.t23, i4.t16, i4.u13.t17, i4.u13.t24, i4.u14.t21, i5.t11, i5.t4, i5.u19.t5, i5.u19.t12, i5.u20.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/34/19/53
Computing Next relation with stutter on 1 deadlock states
19 unique states visited
18 strongly connected components in search stack
21 transitions explored
19 items max in DFS search stack
7 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.084156,19196,1,0,5408,283,883,9941,170,736,15067
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(G(F(X(F(G("(i5.u17.p44==1)")))))))))
Formula 1 simplified : !XFGFXFG"(i5.u17.p44==1)"
Computing Next relation with stutter on 1 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.086362,19800,1,0,5431,283,903,10028,170,736,15284
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((!(F((G("(i4.u14.p33==1)"))||("(i5.u19.p49==1)"))))&&(G(F("(i3.u10.p22==1)"))))))
Formula 2 simplified : !F(!F("(i5.u19.p49==1)" | G"(i4.u14.p33==1)") & GF"(i3.u10.p22==1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.094503,20760,1,0,6006,287,948,10740,172,745,16652
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(G(F(!(X("(i4.u11.p32==1)"))))))))
Formula 3 simplified : !FXGF!X"(i4.u11.p32==1)"
Computing Next relation with stutter on 1 deadlock states
33 unique states visited
0 strongly connected components in search stack
34 transitions explored
18 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.112569,21276,1,0,7983,315,969,12761,172,856,20108
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(G(X("(i4.u13.p38==1)"))))U("((i4.u14.p33==1)||(i3.u8.p20==1))")))
Formula 4 simplified : !(XGX"(i4.u13.p38==1)" U "((i4.u14.p33==1)||(i3.u8.p20==1))")
Computing Next relation with stutter on 1 deadlock states
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.125081,21788,1,0,8767,315,985,14036,172,856,22297
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!((F("((i3.u10.p25==1)||(i2.u3.p18==1))"))U(F("(i2.u3.p18==1)"))))&&(!(G(X("(((i1.u6.p17==1)&&(i3.u9.p23==1))&&(i4.u14.p39==1))"))))))
Formula 5 simplified : !(!(F"((i3.u10.p25==1)||(i2.u3.p18==1))" U F"(i2.u3.p18==1)") & !GX"(((i1.u6.p17==1)&&(i3.u9.p23==1))&&(i4.u14.p39==1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.134088,22368,1,0,9726,315,1029,15194,172,856,24409
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F((("(i2.u3.p19==1)")U(X("((i3.u10.p27==1)&&(i5.u18.p46==1))")))||((F("(i2.u3.p19==1)"))U(G(("(i4.u11.p32==1)")U("(i4.u14.p33!=1)"))))))))
Formula 6 simplified : !GF(("(i2.u3.p19==1)" U X"((i3.u10.p27==1)&&(i5.u18.p46==1))") | (F"(i2.u3.p19==1)" U G("(i4.u11.p32==1)" U "(i4.u14.p33!=1)")))
Computing Next relation with stutter on 1 deadlock states
38 unique states visited
38 strongly connected components in search stack
39 transitions explored
38 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,0.215808,26972,1,0,18372,321,1078,25764,173,902,42675
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((X((!(G("(i2.u3.p19==1)")))&&(X("(i0.u0.p2==1)"))))&&((F("(i1.u7.p12==1)"))||("(i0.u1.p0==1)")))))
Formula 7 simplified : !F(X(!G"(i2.u3.p19==1)" & X"(i0.u0.p2==1)") & ("(i0.u1.p0==1)" | F"(i1.u7.p12==1)"))
Computing Next relation with stutter on 1 deadlock states
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 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,0.253019,28344,1,0,21100,322,1152,29276,173,907,48750
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F((X("(i1.u7.p12==1)"))&&("((i1.u6.p11==1)||(i1.u7.p12==1))")))))
Formula 8 simplified : F("((i1.u6.p11==1)||(i1.u7.p12==1))" & X"(i1.u7.p12==1)")
Computing Next relation with stutter on 1 deadlock states
36 unique states visited
20 strongly connected components in search stack
55 transitions explored
36 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.337066,31508,1,0,27560,356,1197,39117,173,1321,62961
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((!(X(F(("(i3.u8.p28==1)")U("((i3.u10.p27==1)&&(i5.u18.p46==1))")))))||(!(G((X("(i0.u1.p0==1)"))||("(i5.u16.p52==1)")))))))
Formula 9 simplified : !X(!XF("(i3.u8.p28==1)" U "((i3.u10.p27==1)&&(i5.u18.p46==1))") | !G("(i5.u16.p52==1)" | X"(i0.u1.p0==1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.339846,32012,1,0,27560,356,1252,39117,173,1321,63010
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((G(F("(i5.u19.p49==1)")))||("(i2.u3.p18==1)"))))
Formula 10 simplified : !F("(i2.u3.p18==1)" | GF"(i5.u19.p49==1)")
Computing Next relation with stutter on 1 deadlock states
31 unique states visited
0 strongly connected components in search stack
32 transitions explored
17 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,0.37483,33332,1,0,31350,356,1270,42335,173,1325,70109
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((((!(G(X(("(i1.u5.p14==1)")U(G("((i3.u10.p27==1)&&(i5.u18.p46==1))"))))))||("(i3.u10.p27!=1)"))||("(i5.u18.p46!=1)"))U(F(G("(i4.u15.p41==1)")))))
Formula 11 simplified : !(("(i3.u10.p27!=1)" | "(i5.u18.p46!=1)" | !GX("(i1.u5.p14==1)" U G"((i3.u10.p27==1)&&(i5.u18.p46==1))")) U FG"(i4.u15.p41==1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.488842,37540,1,0,41478,358,1290,53270,173,1332,83526
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(((F("(i4.u11.p36==1)"))||("(i2.u2.p6==1)"))&&((("(i4.u13.p37==1)")U("(i3.u10.p22==1)"))||("(i4.u11.p36==1)")))))
Formula 12 simplified : !X(("(i2.u2.p6==1)" | F"(i4.u11.p36==1)") & ("(i4.u11.p36==1)" | ("(i4.u13.p37==1)" U "(i3.u10.p22==1)")))
Computing Next relation with stutter on 1 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,0.49095,37804,1,0,41480,358,1326,53274,173,1332,83578
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-28 01:43:39] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-28 01:43:39] [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")
[2020-05-28 01:43:39] [WARNING] Script execution failed on command (assert (and (>= (select s0 8) 1) (= (store (store s0 19 (+ (select s0 19) 1)) 8 (- (select s0 8) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 8) 1) (= (store (store s0 19 (+ (select s0 19) 1)) 8 (- (select s0 8) 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: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-28 01:43:39] [INFO ] Built C files in 768ms 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 1590630219381

--------------------
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/ -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 LTLFireability -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="ShieldRVt-PT-001B"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-001B, 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 r210-tajo-159033476400930"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001B.tgz
mv ShieldRVt-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;