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-159033476200746.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 ShieldRVs-PT-001A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476200746
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.6K May 14 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.0K May 13 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:02 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 6.8K 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 ShieldRVs-PT-001A-00
FORMULA_NAME ShieldRVs-PT-001A-01
FORMULA_NAME ShieldRVs-PT-001A-02
FORMULA_NAME ShieldRVs-PT-001A-03
FORMULA_NAME ShieldRVs-PT-001A-04
FORMULA_NAME ShieldRVs-PT-001A-05
FORMULA_NAME ShieldRVs-PT-001A-06
FORMULA_NAME ShieldRVs-PT-001A-07
FORMULA_NAME ShieldRVs-PT-001A-08
FORMULA_NAME ShieldRVs-PT-001A-09
FORMULA_NAME ShieldRVs-PT-001A-10
FORMULA_NAME ShieldRVs-PT-001A-11
FORMULA_NAME ShieldRVs-PT-001A-12
FORMULA_NAME ShieldRVs-PT-001A-13
FORMULA_NAME ShieldRVs-PT-001A-14
FORMULA_NAME ShieldRVs-PT-001A-15

=== Now, execution of the tool begins

BK_START 1590618600106

[2020-05-27 22:30:01] [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-27 22:30:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 22:30:01] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-05-27 22:30:01] [INFO ] Transformed 17 places.
[2020-05-27 22:30:01] [INFO ] Transformed 22 transitions.
[2020-05-27 22:30:01] [INFO ] Found NUPN structural information;
[2020-05-27 22:30:01] [INFO ] Parsed PT model containing 17 places and 22 transitions in 74 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1836 resets, run finished after 155 ms. (steps per millisecond=645 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 17 cols
[2020-05-27 22:30:01] [INFO ] Computed 5 place invariants in 4 ms
[2020-05-27 22:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned unsat
[2020-05-27 22:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-27 22:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-05-27 22:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-05-27 22:30:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 22:30:02] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldRVs-PT-001A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 22:30:02] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 22:30:02] [INFO ] Applying decomposition
[2020-05-27 22:30:02] [INFO ] Flatten gal took : 3 ms
Built C files in :
/home/mcc/execution
[2020-05-27 22:30:02] [INFO ] Input system was already deterministic with 22 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 17 cols
[2020-05-27 22:30:02] [INFO ] Computed 5 place invariants in 1 ms
inv : p0 + p13 + p14 + p15 + p16 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p3 + p4 + p5 + p6 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p9 + p10 + p11 + p12 = 1
Total of 5 invariants.
[2020-05-27 22:30:02] [INFO ] Computed 5 place invariants in 1 ms
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/graph12317550657372173616.txt, -o, /tmp/graph12317550657372173616.bin, -w, /tmp/graph12317550657372173616.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/graph12317550657372173616.bin, -l, -1, -v, -w, /tmp/graph12317550657372173616.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 22:30:02] [INFO ] Proved 17 variables to be positive in 74 ms
[2020-05-27 22:30:02] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-27 22:30:02] [INFO ] Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:30:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:30:02] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-27 22:30:02] [INFO ] Decomposing Gal with order
[2020-05-27 22:30:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 22:30:02] [INFO ] Removed a total of 18 redundant transitions.
[2020-05-27 22:30:02] [INFO ] Flatten gal took : 30 ms
[2020-05-27 22:30:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2020-05-27 22:30:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-27 22:30:02] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 14 LTL properties
Checking formula 0 : !((F(X(F(X(X(G(F("((u1.p3==1)||((((u1.p5==1)&&(u2.p7==1))&&(u3.p12==1))&&(((u0.p2!=1)||(u1.p6!=1))||(u4.p15!=1))))")))))))))
Formula 0 simplified : !FXFXXGF"((u1.p3==1)||((((u1.p5==1)&&(u2.p7==1))&&(u3.p12==1))&&(((u0.p2!=1)||(u1.p6!=1))||(u4.p15!=1))))"
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, u1.t0, u1.t1, u1.t7, u3.t2, u3.t3, u4.t4, u4.t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/10/13
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.038212,17416,1,0,2119,151,234,2040,121,355,3839
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F(G((!(("(u3.p11==1)")U("(((u1.p5==1)&&(u2.p7==1))&&(u3.p12==1))")))||((!(G(F("((u0.p1==1)&&(u3.p9==1))"))))&&(!(G("(((u1.p6==1)&&(u2.p7==1))&&(u3.p11==1))"))))))))))
Formula 1 simplified : !XXFG(!("(u3.p11==1)" U "(((u1.p5==1)&&(u2.p7==1))&&(u3.p12==1))") | (!GF"((u0.p1==1)&&(u3.p9==1))" & !G"(((u1.p6==1)&&(u2.p7==1))&&(u3.p11==1))"))
Computing Next relation with stutter on 1 deadlock states
49 unique states visited
16 strongly connected components in search stack
73 transitions explored
29 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.084776,21524,1,0,8524,152,382,7839,130,359,18071
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((F("((u3.p12==1)&&(u4.p14==1))"))&&((G("((u2.p8==1)&&(u4.p13==1))"))||(X("(u1.p3==1)"))))))
Formula 2 simplified : !G(F"((u3.p12==1)&&(u4.p14==1))" & (G"((u2.p8==1)&&(u4.p13==1))" | X"(u1.p3==1)"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 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,0.088519,21784,1,0,8723,152,405,8071,130,359,18483
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G((F("(((u0.p2==1)&&(u1.p4==1))&&(u4.p15==1))"))&&(("(u0.p0==1)")U("(u1.p4!=1)"))))))
Formula 3 simplified : G(F"(((u0.p2==1)&&(u1.p4==1))&&(u4.p15==1))" & ("(u0.p0==1)" U "(u1.p4!=1)"))
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.101574,22044,1,0,9888,152,476,9060,134,359,21108
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001A-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((!(F(("(((u1.p5==1)&&(u2.p7==1))&&(u3.p11==1))")U(F("(((u0.p2==1)&&(u1.p4==1))&&(u4.p15==1))")))))&&(!(("((((u1.p6==1)&&(u2.p7==1))&&(u3.p12==1))||(((u0.p2==1)&&(u1.p4==1))&&(u4.p15==1)))")U("((u3.p12==1)&&(u4.p14==1))"))))&&(!(G("((u3.p10==1)&&(u4.p14==1))")))))
Formula 4 simplified : !(!F("(((u1.p5==1)&&(u2.p7==1))&&(u3.p11==1))" U F"(((u0.p2==1)&&(u1.p4==1))&&(u4.p15==1))") & !("((((u1.p6==1)&&(u2.p7==1))&&(u3.p12==1))||(((u0.p2==1)&&(u1.p4==1))&&(u4.p15==1)))" U "((u3.p12==1)&&(u4.p14==1))") & !G"((u3.p10==1)&&(u4.p14==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
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.115872,23084,1,0,11567,152,553,10538,134,360,23882
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("(u0.p0==1)")))
Formula 5 simplified : !G"(u0.p0==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.116682,23084,1,0,11567,152,569,10540,134,360,23929
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(!(G(X((G("(((u0.p2==1)&&(u1.p6==1))&&(u4.p16==1))"))U("(((u0.p2!=1)||(u1.p6!=1))||(u4.p16!=1))"))))))))
Formula 6 simplified : G!GX(G"(((u0.p2==1)&&(u1.p6==1))&&(u4.p16==1))" U "(((u0.p2!=1)||(u1.p6!=1))||(u4.p16!=1))")
Computing Next relation with stutter on 1 deadlock states
11 unique states visited
7 strongly connected components in search stack
14 transitions explored
10 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.122426,23084,1,0,11873,152,614,10909,134,360,24815
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(G("(((u1.p6==1)&&(u2.p7==1))&&(u3.p12==1))")))))
Formula 7 simplified : !GXG"(((u1.p6==1)&&(u2.p7==1))&&(u3.p12==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.123068,23084,1,0,11873,152,626,10909,134,360,24828
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((((F("((u0.p1==1)&&(u3.p9==1))"))&&("(u3.p12==1)"))&&("(u4.p14==1)"))U(G(("((u0.p1!=1)||(u3.p9!=1))")&&((X("((u0.p1==1)&&(u3.p9==1))"))||(!(F("((u3.p12==1)&&(u4.p14==1))"))))))))
Formula 8 simplified : !(("(u3.p12==1)" & "(u4.p14==1)" & F"((u0.p1==1)&&(u3.p9==1))") U G("((u0.p1!=1)||(u3.p9!=1))" & (X"((u0.p1==1)&&(u3.p9==1))" | !F"((u3.p12==1)&&(u4.p14==1))")))
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.142695,23564,1,0,11981,152,741,11033,138,360,25395
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((X(("(u1.p5==1)")U("(((u1.p6!=1)||(u2.p7!=1))||(u3.p12!=1))")))&&(X("(u1.p3!=1)")))))
Formula 9 simplified : !F(X("(u1.p5==1)" U "(((u1.p6!=1)||(u2.p7!=1))||(u3.p12!=1))") & X"(u1.p3!=1)")
Computing Next relation with stutter on 1 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,0.144698,23564,1,0,11981,152,766,11033,140,360,25418
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001A-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!((F("(((u1.p5!=1)||(u2.p7!=1))||(u3.p12!=1))"))U((((("(((u0.p2==1)&&(u1.p4==1))&&(u4.p16==1))")U(F("((u2.p8==1)&&(u4.p13==1))")))&&("(u1.p5==1)"))&&("(u2.p7==1)"))&&("(u3.p12==1)")))))
Formula 10 simplified : F"(((u1.p5!=1)||(u2.p7!=1))||(u3.p12!=1))" U ("(u1.p5==1)" & "(u2.p7==1)" & "(u3.p12==1)" & ("(((u0.p2==1)&&(u1.p4==1))&&(u4.p16==1))" U F"((u2.p8==1)&&(u4.p13==1))"))
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.166695,24088,1,0,13714,152,828,12640,142,361,29342
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((!(G(X(G("((u2.p8==1)&&(u4.p13==1))")))))||(!(G(F(X("(u3.p11==1)"))))))))
Formula 11 simplified : !G(!GXG"((u2.p8==1)&&(u4.p13==1))" | !GFX"(u3.p11==1)")
Computing Next relation with stutter on 1 deadlock states
25 unique states visited
0 strongly connected components in search stack
34 transitions explored
10 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.1695,24088,1,0,13827,152,866,12794,142,361,29959
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-001A-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(("(((u1.p5==1)&&(u2.p7==1))&&(u3.p12==1))")U("(((u0.p2==1)&&(u1.p6==1))&&(u4.p15==1))"))))
Formula 12 simplified : !X("(((u1.p5==1)&&(u2.p7==1))&&(u3.p12==1))" U "(((u0.p2==1)&&(u1.p6==1))&&(u4.p15==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.170459,24088,1,0,13827,152,882,12794,142,361,29971
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(F(X("((u3.p10==1)&&(u4.p16==1))")))))
Formula 13 simplified : FX"((u3.p10==1)&&(u4.p16==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
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.180164,24352,1,0,14932,152,894,13874,142,361,32014
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldRVs-PT-001A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 22:30:02] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 6) 1) (>= (select s0 7) 1)) (>= (select s0 11) 1)) (= (store (store (store (store (store (store s0 11 (- (select s0 11) 1)) 6 (- (select s0 6) 1)) 8 (+ (select s0 8) 1)) 9 (+ (select s0 9) 1)) 7 (- (select s0 7) 1)) 4 (+ (select s0 4) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (>= (select s0 6) 1) (>= (select s0 7) 1)) (>= (select s0 11) 1)) (= (store (store (store (store (store (store s0 11 (- (select s0 11) 1)) 6 (- (select s0 6) 1)) 8 (+ (select s0 8) 1)) 9 (+ (select s0 9) 1)) 7 (- (select s0 7) 1)) 4 (+ (select s0 4) 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:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java: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-27 22:30:02] [INFO ] Built C files in 398ms 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 1590618602898

--------------------
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="ShieldRVs-PT-001A"
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 ShieldRVs-PT-001A, 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-159033476200746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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