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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.7K May 14 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K 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.4K May 13 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 6.2K 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-002A-00
FORMULA_NAME ShieldRVt-PT-002A-01
FORMULA_NAME ShieldRVt-PT-002A-02
FORMULA_NAME ShieldRVt-PT-002A-03
FORMULA_NAME ShieldRVt-PT-002A-04
FORMULA_NAME ShieldRVt-PT-002A-05
FORMULA_NAME ShieldRVt-PT-002A-06
FORMULA_NAME ShieldRVt-PT-002A-07
FORMULA_NAME ShieldRVt-PT-002A-08
FORMULA_NAME ShieldRVt-PT-002A-09
FORMULA_NAME ShieldRVt-PT-002A-10
FORMULA_NAME ShieldRVt-PT-002A-11
FORMULA_NAME ShieldRVt-PT-002A-12
FORMULA_NAME ShieldRVt-PT-002A-13
FORMULA_NAME ShieldRVt-PT-002A-14
FORMULA_NAME ShieldRVt-PT-002A-15

=== Now, execution of the tool begins

BK_START 1590630253958

[2020-05-28 01:44:15] [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:44:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:44:15] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-05-28 01:44:15] [INFO ] Transformed 19 places.
[2020-05-28 01:44:15] [INFO ] Transformed 19 transitions.
[2020-05-28 01:44:15] [INFO ] Found NUPN structural information;
[2020-05-28 01:44:15] [INFO ] Parsed PT model containing 19 places and 19 transitions in 65 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=800 ) properties seen :[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]
// Phase 1: matrix 18 rows 19 cols
[2020-05-28 01:44:15] [INFO ] Computed 9 place invariants in 3 ms
[2020-05-28 01:44:15] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-28 01:44:16] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-28 01:44:16] [INFO ] Flatten gal took : 27 ms
FORMULA ShieldRVt-PT-002A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:44:16] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:44:16] [INFO ] Applying decomposition
[2020-05-28 01:44:16] [INFO ] Flatten gal took : 13 ms
[2020-05-28 01:44:16] [INFO ] Input system was already deterministic with 18 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 19 cols
[2020-05-28 01:44:16] [INFO ] Computed 9 place invariants in 0 ms
inv : p0 + p9 + p10 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p7 + p8 = 1
Total of 9 invariants.
[2020-05-28 01:44:16] [INFO ] Computed 9 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/graph8445726698258604477.txt, -o, /tmp/graph8445726698258604477.bin, -w, /tmp/graph8445726698258604477.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/graph8445726698258604477.bin, -l, -1, -v, -w, /tmp/graph8445726698258604477.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:44:16] [INFO ] Proved 19 variables to be positive in 55 ms
[2020-05-28 01:44:16] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-28 01:44:16] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:44:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:44:16] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-28 01:44:16] [INFO ] Decomposing Gal with order
[2020-05-28 01:44:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:44:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:44:16] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-28 01:44:16] [INFO ] Flatten gal took : 29 ms
[2020-05-28 01:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 01:44:16] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-28 01:44:16] [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 14 LTL properties
Checking formula 0 : !((F(X(G(X((G("(((i0.u3.p8==1)&&(i2.u4.p10==1))&&(u7.p15==1))"))||(X("(i2.u2.p5==1)"))))))))
Formula 0 simplified : !FXGX(G"(((i0.u3.p8==1)&&(i2.u4.p10==1))&&(u7.p15==1))" | X"(i2.u2.p5==1)")
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.031382,18420,1,0,638,42,360,613,65,50,1548
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(F(((("(((i0.u0.p2==1)&&(u1.p4==1))&&(i2.u4.p10==1))")U("(u1.p3==1)"))||("(u1.p3==1)"))U(G("(u1.p3==1)")))))U(X("((((i0.u3.p8==1)&&(i2.u4.p10==1))&&(u7.p15==1))||((u6.p14==1)&&(u8.p17==1)))"))))
Formula 1 simplified : !(GF(("(u1.p3==1)" | ("(((i0.u0.p2==1)&&(u1.p4==1))&&(i2.u4.p10==1))" U "(u1.p3==1)")) U G"(u1.p3==1)") U X"((((i0.u3.p8==1)&&(i2.u4.p10==1))&&(u7.p15==1))||((u6.p14==1)&&(u8.p17==1)))")
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.040033,18728,1,0,2415,42,392,2171,65,50,4077
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(((G(F("(u7.p15==1)")))||(F(G("(u8.p17==1)"))))||("(u7.p15!=1)")))))
Formula 2 simplified : !XX("(u7.p15!=1)" | GF"(u7.p15==1)" | FG"(u8.p17==1)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.043567,19428,1,0,2753,42,436,2465,67,50,4844
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(((((!(("(u5.p11==1)")U(("(i0.u0.p0==1)")U(G("(u5.p11==1)")))))&&(F("(u5.p11==1)")))&&("(u1.p3==1)"))&&("(u5.p12==1)"))&&("(u8.p18==1)")))))
Formula 3 simplified : !GX("(u1.p3==1)" & "(u5.p12==1)" & "(u8.p18==1)" & !("(u5.p11==1)" U ("(i0.u0.p0==1)" U G"(u5.p11==1)")) & F"(u5.p11==1)")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.048043,19800,1,0,2804,42,486,2529,72,50,5057
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(i2.u4.p9==1)")U(X("((((i0.u0.p2==1)&&(u1.p4==1))&&(i2.u4.p10==1))&&(i0.u0.p0!=1))"))))
Formula 4 simplified : !("(i2.u4.p9==1)" U X"((((i0.u0.p2==1)&&(u1.p4==1))&&(i2.u4.p10==1))&&(i0.u0.p0!=1))")
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.048699,19800,1,0,2805,42,510,2529,75,50,5094
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(("((u7.p16==1)&&(u8.p18==1))")U(F(G((F(X(X(X("(((i0.u3.p8==1)&&(i2.u4.p10==1))&&(u7.p15==1))")))))&&(F(G("(((u1.p4==1)&&(i2.u2.p5==1))&&(i0.u3.p8==1))")))))))))
Formula 5 simplified : !F("((u7.p16==1)&&(u8.p18==1))" U FG(FXXX"(((i0.u3.p8==1)&&(i2.u4.p10==1))&&(u7.p15==1))" & FG"(((u1.p4==1)&&(i2.u2.p5==1))&&(i0.u3.p8==1))"))
4 unique states visited
4 strongly connected components in search stack
5 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.050745,19800,1,0,2898,42,552,2626,75,50,5312
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((G(!(F("((i2.u2.p6==1)&&(i2.u4.p9==1))"))))&&("(u5.p11!=1)"))))
Formula 6 simplified : !G("(u5.p11!=1)" & G!F"((i2.u2.p6==1)&&(i2.u4.p9==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.052325,19800,1,0,3008,42,584,2736,75,50,5729
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("(((i0.u0.p2==1)&&(u1.p4==1))&&(i2.u4.p10==1))")))
Formula 7 simplified : !F"(((i0.u0.p2==1)&&(u1.p4==1))&&(i2.u4.p10==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.056082,19800,1,0,3475,42,598,3212,75,50,6752
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(!(X((F("((u7.p16==1)&&(u8.p18==1))"))U(X(X(X(("(((u1.p4==1)&&(i2.u2.p5==1))&&(i0.u3.p8==1))")U("((u7.p16==1)&&(u8.p18==1))"))))))))))
Formula 8 simplified : !X!X(F"((u7.p16==1)&&(u8.p18==1))" U XXX("(((u1.p4==1)&&(i2.u2.p5==1))&&(i0.u3.p8==1))" U "((u7.p16==1)&&(u8.p18==1))"))
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.059443,20032,1,0,3849,42,612,3601,75,50,7587
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((X(G(X(F(X(G((G("((u6.p14==1)&&(u8.p17==1))"))U(X("((u6.p14==1)&&(u8.p17==1))")))))))))||(F("((u6.p14==1)&&(u8.p17==1))")))))
Formula 9 simplified : !F(XGXFXG(G"((u6.p14==1)&&(u8.p17==1))" U X"((u6.p14==1)&&(u8.p17==1))") | F"((u6.p14==1)&&(u8.p17==1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.060719,20296,1,0,3851,42,627,3608,75,50,7629
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002A-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X(X(("(i0.u3.p7==1)")U("((u7.p16!=1)||(u8.p18!=1))"))))||(G("(((u1.p4==1)&&(i2.u2.p5==1))&&(i0.u3.p8==1))"))))
Formula 10 simplified : !(XX("(i0.u3.p7==1)" U "((u7.p16!=1)||(u8.p18!=1))") | G"(((u1.p4==1)&&(i2.u2.p5==1))&&(i0.u3.p8==1))")
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.061646,20296,1,0,3851,42,639,3608,75,50,7650
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002A-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(((((X("(i2.u4.p9==1)"))&&(G(F("(i2.u4.p9==1)"))))&&("(u1.p3==1)"))&&("(u5.p12==1)"))&&("(u8.p18==1)"))))
Formula 11 simplified : !F("(u1.p3==1)" & "(u5.p12==1)" & "(u8.p18==1)" & X"(i2.u4.p9==1)" & GF"(i2.u4.p9==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.065454,20296,1,0,4432,42,684,4126,75,50,8952
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(!(X(G((F(G(X(G(F("(u1.p3!=1)"))))))U("((i0.u0.p1==1)&&(i0.u3.p7==1))")))))))
Formula 12 simplified : !X!XG(FGXGF"(u1.p3!=1)" U "((i0.u0.p1==1)&&(i0.u3.p7==1))")
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.082894,21088,1,0,7363,42,726,6872,75,50,13182
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((F("(i2.u4.p9==1)"))U("(i2.u4.p9==1)"))U(!(X("(i2.u2.p5==1)")))))
Formula 13 simplified : !((F"(i2.u4.p9==1)" U "(i2.u4.p9==1)") U !X"(i2.u2.p5==1)")
3 unique states visited
0 strongly connected components in search stack
2 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.084004,21352,1,0,7363,42,739,6872,75,50,13204
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002A-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-28 01:44:16] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 8) 1) (>= (select s0 10) 1)) (>= (select s0 15) 1)) (= (store (store (store (store (store (store s0 16 (+ (select s0 16) 1)) 9 (+ (select s0 9) 1)) 15 (- (select s0 15) 1)) 7 (+ (select s0 7) 1)) 10 (- (select s0 10) 1)) 8 (- (select s0 8) 1)) s1))) with error
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-28 01:44:16] [INFO ] Built C files in 316ms 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 1590630256663

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

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