About the Execution of ITS-Tools for RefineWMG-PT-002002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15735.710 | 5772.00 | 13851.00 | 111.40 | FFFFFFFTFTFFFFFF | 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.r156-oct2-158972913500002.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 RefineWMG-PT-002002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913500002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 2.8K Apr 12 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 11 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 22:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.8K Mar 24 05:38 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 RefineWMG-PT-002002-00
FORMULA_NAME RefineWMG-PT-002002-01
FORMULA_NAME RefineWMG-PT-002002-02
FORMULA_NAME RefineWMG-PT-002002-03
FORMULA_NAME RefineWMG-PT-002002-04
FORMULA_NAME RefineWMG-PT-002002-05
FORMULA_NAME RefineWMG-PT-002002-06
FORMULA_NAME RefineWMG-PT-002002-07
FORMULA_NAME RefineWMG-PT-002002-08
FORMULA_NAME RefineWMG-PT-002002-09
FORMULA_NAME RefineWMG-PT-002002-10
FORMULA_NAME RefineWMG-PT-002002-11
FORMULA_NAME RefineWMG-PT-002002-12
FORMULA_NAME RefineWMG-PT-002002-13
FORMULA_NAME RefineWMG-PT-002002-14
FORMULA_NAME RefineWMG-PT-002002-15
=== Now, execution of the tool begins
BK_START 1589872899775
[2020-05-19 07:21:42] [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-19 07:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 07:21:42] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-05-19 07:21:42] [INFO ] Transformed 14 places.
[2020-05-19 07:21:42] [INFO ] Transformed 11 transitions.
[2020-05-19 07:21:42] [INFO ] Parsed PT model containing 14 places and 11 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 134 steps, including 0 resets, run visited all 23 properties in 3 ms. (steps per millisecond=44 )
[2020-05-19 07:21:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-19 07:21:42] [INFO ] Flatten gal took : 42 ms
FORMULA RefineWMG-PT-002002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 07:21:42] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 07:21:42] [INFO ] Applying decomposition
[2020-05-19 07:21:42] [INFO ] Flatten gal took : 35 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/graph4868263388187769275.txt, -o, /tmp/graph4868263388187769275.bin, -w, /tmp/graph4868263388187769275.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/graph4868263388187769275.bin, -l, -1, -v, -w, /tmp/graph4868263388187769275.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 07:21:42] [INFO ] Decomposing Gal with order
[2020-05-19 07:21:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 07:21:42] [INFO ] Input system was already deterministic with 11 transitions.
[2020-05-19 07:21:43] [INFO ] Flatten gal took : 78 ms
[2020-05-19 07:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-19 07:21:43] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-19 07:21:43] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 11 rows 14 cols
[2020-05-19 07:21:43] [INFO ] Computed 6 place invariants in 3 ms
inv : p9 + p10 = 2
inv : p + pprime + p1 + p6 = 7
inv : p2 + p3 = 2
inv : psecond + pterce = 5
inv : p4 + p5 = 2
inv : p7 + p8 = 2
Total of 6 invariants.
[2020-05-19 07:21:43] [INFO ] Computed 6 place invariants in 4 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]
[2020-05-19 07:21:43] [INFO ] Proved 14 variables to be positive in 42 ms
[2020-05-19 07:21:43] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2020-05-19 07:21:43] [INFO ] Computation of disable matrix completed :0/11 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:21:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:21:43] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2020-05-19 07:21:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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 15 LTL properties
Checking formula 0 : !((G(X(((((G((G(X("(u0.pterce>=3)")))U(F(X("(u5.p9>=1)")))))&&("(u2.p3>=1)"))&&("(u3.p4>=1)"))&&("(u1.p6>=1)"))&&("(u5.p9>=1)")))))
Formula 0 simplified : !GX("(u1.p6>=1)" & "(u2.p3>=1)" & "(u3.p4>=1)" & "(u5.p9>=1)" & G(GX"(u0.pterce>=3)" U FX"(u5.p9>=1)"))
built 3 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.373881,24712,1,0,8677,4778,200,27954,175,37609,10015
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F((F("(u4.p7>=1)"))||((F("(((u1.p<1)||(u4.p8<1))||(u5.p9<1))"))U("(u4.p7>=1)"))))U(G("(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1))"))))
Formula 1 simplified : !(F(F"(u4.p7>=1)" | (F"(((u1.p<1)||(u4.p8<1))||(u5.p9<1))" U "(u4.p7>=1)")) U G"(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1))")
2 unique states visited
2 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.377954,25184,1,0,8810,4896,238,28086,175,37991,10263
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((X("(u3.p4>=1)"))U("(u1.p1>=5)"))&&(G(X(X("(((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1))"))))))
Formula 2 simplified : !((X"(u3.p4>=1)" U "(u1.p1>=5)") & GXX"(((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.393185,25704,1,0,10084,5134,262,30665,176,40382,12446
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((F(X(G(!((F(X("(u5.p10>=1)")))U(G(F("(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1))"))))))))U("(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1))"))))
Formula 3 simplified : !X(FXG!(FX"(u5.p10>=1)" U GF"(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1))") U "(((u1.p>=1)&&(u4.p8>=1))&&(u5.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.395292,25964,1,0,10225,5137,269,30872,176,40388,12784
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G("(u5.p10<1)"))&&(F((X("(u3.p5>=1)"))||(F(((G(F(X("((u1.pprime>=2)&&(u0.psecond>=2))"))))&&("(u1.pprime>=2)"))&&("(u0.psecond>=2)")))))))
Formula 4 simplified : !(G"(u5.p10<1)" & F(X"(u3.p5>=1)" | F("(u0.psecond>=2)" & "(u1.pprime>=2)" & GFX"((u1.pprime>=2)&&(u0.psecond>=2))")))
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.398617,25964,1,0,10281,5140,307,31001,178,40436,12963
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((X(X("(u4.p7>=1)")))&&("(u4.p7>=1)")))))
Formula 5 simplified : !FX("(u4.p7>=1)" & XX"(u4.p7>=1)")
147 unique states visited
28 strongly connected components in search stack
147 transitions explored
147 items max in DFS search stack
5 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.447557,28040,1,0,16357,5539,319,37491,178,43572,22880
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(X(F("(u2.p2>=1)"))))||("(u0.pterce>=3)"))))
Formula 6 simplified : !X("(u0.pterce>=3)" | XXF"(u2.p2>=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.451446,28304,1,0,16593,5549,346,38058,179,43976,23446
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((F("(u4.p7>=1)"))&&((G(!(G("(u4.p7>=1)"))))||("(u4.p7<1)")))))
Formula 7 simplified : !G(F"(u4.p7>=1)" & ("(u4.p7<1)" | G!G"(u4.p7>=1)"))
3 unique states visited
3 strongly connected components in search stack
4 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.452886,28568,1,0,16608,5549,362,38068,181,43976,23499
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F((X("(u1.p1>=5)"))&&("(u1.p1>=5)")))||(!(X("(u1.p1>=5)")))))
Formula 8 simplified : !(F("(u1.p1>=5)" & X"(u1.p1>=5)") | !X"(u1.p1>=5)")
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.453206,28568,1,0,16608,5549,363,38068,181,43976,23511
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA RefineWMG-PT-002002-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((F((G("(u5.p10>=1)"))&&("(u4.p7>=1)")))&&("(u3.p4>=1)"))))
Formula 9 simplified : !X("(u3.p4>=1)" & F("(u4.p7>=1)" & G"(u5.p10>=1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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.607596,32528,1,0,21378,7937,408,60001,181,71562,28085
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((("(u1.p1>=5)")U(!(X(("(u3.p4<1)")U("(u5.p10>=1)")))))||("(u1.p1>=5)"))))
Formula 10 simplified : !G("(u1.p1>=5)" | ("(u1.p1>=5)" U !X("(u3.p4<1)" U "(u5.p10>=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.60967,32792,1,0,21423,7937,446,60058,181,71562,28313
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G((!(G("(u0.pterce>=3)")))&&(!(X("(u0.pterce>=3)")))))||(X(F("((u3.p5<1)||(((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1)))")))))
Formula 11 simplified : !(G(!G"(u0.pterce>=3)" & !X"(u0.pterce>=3)") | XF"((u3.p5<1)||(((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=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.615633,33056,1,0,22069,7944,492,60955,181,71731,29816
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(G((G("(u4.p7>=1)"))||("((u1.pprime>=2)&&(u0.psecond>=2))"))))))
Formula 12 simplified : !GXG("((u1.pprime>=2)&&(u0.psecond>=2))" | G"(u4.p7>=1)")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,0.728478,36752,1,0,27544,8933,520,77803,181,86161,37075
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(F(!((G(!(G("(((((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1))&&(u5.p9>=1))||(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1)))"))))U("(u2.p2<1)")))))))
Formula 13 simplified : !FGF!(G!G"(((((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1))&&(u5.p9>=1))||(((u1.p>=1)&&(u4.p8>=1))&&(u5.p9>=1)))" U "(u2.p2<1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
21 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.929932,43088,1,0,38097,14158,562,99496,181,119068,44138
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(F(X(((G("(((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1))"))&&(F(X("(u3.p4>=1)"))))&&(F(!(F(G("(u3.p4>=1)"))))))))))
Formula 14 simplified : !GFX(G"(((u2.p3>=1)&&(u3.p4>=1))&&(u1.p6>=1))" & FX"(u3.p4>=1)" & F!FG"(u3.p4>=1)")
3 unique states visited
3 strongly connected components in search stack
4 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.934238,43616,1,0,38216,14261,580,99659,181,119456,44315
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RefineWMG-PT-002002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-19 07:21:44] [INFO ] Computing symmetric co enabling matrix : 11 transitions.
[2020-05-19 07:21:45] [INFO ] Computation of Finished co-enabling matrix. took 324 ms. Total solver calls (SAT/UNSAT): 15(15/0)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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-19 07:21:45] [INFO ] Built C files in 2180ms 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 1589872905547
--------------------
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="RefineWMG-PT-002002"
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 RefineWMG-PT-002002, 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 r156-oct2-158972913500002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-002002.tgz
mv RefineWMG-PT-002002 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 '
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 ;