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

About the Execution of ITS-Tools for RefineWMG-PT-007008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.570 1754652.00 1815216.00 514.50 FFFFFFFFTFFTFTFF 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-158972913500041.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-007008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913500041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.1K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 11:59 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 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 22:56 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 18K 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-007008-00
FORMULA_NAME RefineWMG-PT-007008-01
FORMULA_NAME RefineWMG-PT-007008-02
FORMULA_NAME RefineWMG-PT-007008-03
FORMULA_NAME RefineWMG-PT-007008-04
FORMULA_NAME RefineWMG-PT-007008-05
FORMULA_NAME RefineWMG-PT-007008-06
FORMULA_NAME RefineWMG-PT-007008-07
FORMULA_NAME RefineWMG-PT-007008-08
FORMULA_NAME RefineWMG-PT-007008-09
FORMULA_NAME RefineWMG-PT-007008-10
FORMULA_NAME RefineWMG-PT-007008-11
FORMULA_NAME RefineWMG-PT-007008-12
FORMULA_NAME RefineWMG-PT-007008-13
FORMULA_NAME RefineWMG-PT-007008-14
FORMULA_NAME RefineWMG-PT-007008-15

=== Now, execution of the tool begins

BK_START 1589872932584

[2020-05-19 07:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 07:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 07:22:14] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2020-05-19 07:22:14] [INFO ] Transformed 39 places.
[2020-05-19 07:22:14] [INFO ] Transformed 31 transitions.
[2020-05-19 07:22:14] [INFO ] Parsed PT model containing 39 places and 31 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100003 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=1123 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 31 rows 39 cols
[2020-05-19 07:22:15] [INFO ] Computed 16 place invariants in 2 ms
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2020-05-19 07:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-19 07:22:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:22:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2020-05-19 07:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:22:15] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-19 07:22:15] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 3 ms.
[2020-05-19 07:22:15] [INFO ] Added : 22 causal constraints over 5 iterations in 47 ms. Result :sat
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2020-05-19 07:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-05-19 07:22:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:22:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-05-19 07:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:22:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-05-19 07:22:15] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 7 ms.
[2020-05-19 07:22:15] [INFO ] Added : 15 causal constraints over 3 iterations in 34 ms. Result :sat
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned unsat
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned unsat
[2020-05-19 07:22:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-19 07:22:15] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 07:22:15] [INFO ] Flatten gal took : 23 ms
FORMULA RefineWMG-PT-007008-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 07:22:15] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
[2020-05-19 07:22:15] [INFO ] Applying decomposition
[2020-05-19 07:22:15] [INFO ] Flatten gal took : 4 ms
Built C files in :
/home/mcc/execution
[2020-05-19 07:22:15] [INFO ] Input system was already deterministic with 31 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/graph16803383640957943637.txt, -o, /tmp/graph16803383640957943637.bin, -w, /tmp/graph16803383640957943637.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/graph16803383640957943637.bin, -l, -1, -v, -w, /tmp/graph16803383640957943637.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 07:22:15] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 31 rows 39 cols
[2020-05-19 07:22:15] [INFO ] Computed 16 place invariants in 1 ms
inv : p27 + p28 = 8
inv : p32 + p33 = 8
inv : p17 + p18 = 8
inv : p22 + p23 = 8
inv : p2 + p3 = 8
inv : p34 + p35 = 8
inv : p29 + p30 = 8
inv : p24 + p25 = 8
inv : p14 + p15 = 8
inv : p19 + p20 = 8
inv : p9 + p10 = 8
inv : p + pprime + p1 + p6 + p11 + p16 + p21 + p26 + p31 = 7
inv : psecond + pterce = 5
inv : p4 + p5 = 8
inv : p7 + p8 = 8
inv : p12 + p13 = 8
Total of 16 invariants.
[2020-05-19 07:22:15] [INFO ] Computed 16 place invariants in 2 ms
[2020-05-19 07:22:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 07:22:15] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-19 07:22:15] [INFO ] Flatten gal took : 26 ms
[2020-05-19 07:22:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-19 07:22:15] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-19 07:22:15] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 13 LTL properties
Checking formula 0 : !(((G(X("(gi2.gu3.p25>=3)")))||(F(X(G("(gi2.gu4.p13<=gi2.gu3.p25)"))))))
Formula 0 simplified : !(GX"(gi2.gu3.p25>=3)" | FXG"(gi2.gu4.p13<=gi2.gu3.p25)")
[2020-05-19 07:22:15] [INFO ] Proved 39 variables to be positive in 82 ms
[2020-05-19 07:22:15] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2020-05-19 07:22:15] [INFO ] Computation of disable matrix completed :0/31 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:22:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:22:15] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2020-05-19 07:22:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:22:16] [INFO ] Computing symmetric co enabling matrix : 31 transitions.
[2020-05-19 07:22:17] [INFO ] Computation of Finished co-enabling matrix. took 431 ms. Total solver calls (SAT/UNSAT): 65(65/0)
[2020-05-19 07:22:17] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2020-05-19 07:22:17] [INFO ] Computation of Completed DNA matrix. took 114 ms. Total solver calls (SAT/UNSAT): 31(0/31)
[2020-05-19 07:22:17] [INFO ] Built C files in 1750ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 571 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 166 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](X((LTLAP0==true)))) || ( <>(X([]((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](X((LTLAP0==true)))) || ( <>(X([]((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](X((LTLAP0==true)))) || ( <>(X([]((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5223 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,52.2409,1104936,1,0,297,3.65447e+06,31,186,1178,1.08389e+07,689
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(G(!(F("(gi1.gu0.p11<=gi1.gu2.p28)")))))))
Formula 1 simplified : !FXG!F"(gi1.gu0.p11<=gi1.gu2.p28)"
Detected timeout of ITS tools.
[2020-05-19 07:42:15] [INFO ] Flatten gal took : 2 ms
[2020-05-19 07:42:15] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-19 07:42:15] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 12 LTL properties
Checking formula 0 : !((F(X(G(!(F("(p11<=p28)")))))))
Formula 0 simplified : !FXG!F"(p11<=p28)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24174 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,241.747,2446488,1,0,2305,1.03442e+07,17,766,833,2.30637e+07,1884
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F(G(F("(p11<=pprime)"))))||(!(X(G(!(X(G("(p19>=1)")))))))))
Formula 1 simplified : !(FGF"(p11<=pprime)" | !XG!XG"(p19>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
41 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,242.16,2446920,1,0,2305,1.03442e+07,42,766,1000,2.30637e+07,1963
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(F((!(G("(p20<2)")))U((X(F("(p20>=2)")))&&("(p18<=p15)")))))))
Formula 2 simplified : !XGF(!G"(p20<2)" U ("(p18<=p15)" & XF"(p20>=2)"))
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
273 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,244.885,2447240,1,0,2305,1.03442e+07,53,766,1020,2.30637e+07,2362
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((!(("(p21<=p16)")U("(p19>=3)")))||(!(X(G("((p14>p17)||(p21>p16))"))))))
Formula 3 simplified : !(!("(p21<=p16)" U "(p19>=3)") | !XG"((p14>p17)||(p21>p16))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7955 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,324.442,2690612,1,0,2338,1.11812e+07,17,984,855,2.51036e+07,2030
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((!(G("(p12>p13)")))&&(!(F((X("(p23>=2)"))&&("(p34>=3)"))))))
Formula 4 simplified : !(!G"(p12>p13)" & !F("(p34>=3)" & X"(p23>=2)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,324.557,2690904,1,0,2338,1.11812e+07,52,984,1027,2.51036e+07,2062
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F((((F("(p7<=p28)"))||("(p7<=p28)"))U("(p6>=1)"))&&(G((X("(p5>=3)"))U("(p6>=1)"))))))
Formula 5 simplified : !F((("(p7<=p28)" | F"(p7<=p28)") U "(p6>=1)") & G(X"(p5>=3)" U "(p6>=1)"))
7 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
100 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,325.559,2691696,1,0,2338,1.11812e+07,79,984,1055,2.51036e+07,2681
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(!(X("(p20<=p12)")))))
Formula 6 simplified : !G!X"(p20<=p12)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5400 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,379.561,2691696,1,0,2854,1.11812e+07,85,1420,1073,2.51036e+07,7202
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((!(X("(p25<=p8)")))U(G("(p25<=p8)")))&&((X("(p32<=p22)"))||(G("(p32<=p22)")))))
Formula 7 simplified : !((!X"(p25<=p8)" U G"(p25<=p8)") & (X"(p32<=p22)" | G"(p32<=p22)"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
14903 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,528.604,2952136,1,0,3171,1.35051e+07,26,1582,885,2.58815e+07,3684
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(X(X((!(G("(p18>=1)")))||(F("(p26>=1)")))))))
Formula 8 simplified : !FXX(!G"(p18>=1)" | F"(p26>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
93 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,529.574,2952136,1,0,3171,1.35051e+07,40,1582,995,2.58815e+07,4046
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G((F("(p32<=p10)"))&&(!(X(G((("(pterce>=3)")U("(p32<=p10)"))||("(pterce>=3)"))))))))
Formula 9 simplified : !G(F"(p32<=p10)" & !XG("(pterce>=3)" | ("(pterce>=3)" U "(p32<=p10)")))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
52 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,530.127,2952136,1,0,3171,1.35051e+07,55,1582,1017,2.58815e+07,4062
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X((("(p15>=2)")U((("(p5>p33)")U("(p15>=2)"))&&("(p5>p33)")))&&("(p2<3)"))))
Formula 10 simplified : !X("(p2<3)" & ("(p15>=2)" U ("(p5>p33)" & ("(p5>p33)" U "(p15>=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,530.131,2952136,1,0,3171,1.35051e+07,80,1582,1043,2.58815e+07,4070
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(((("(p4>=2)")U("(p4<2)"))&&(G("(p4<2)")))&&("(pterce<=p15)"))))
Formula 11 simplified : !X("(pterce<=p15)" & ("(p4>=2)" U "(p4<2)") & G"(p4<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,530.132,2952136,1,0,3171,1.35051e+07,91,1582,1052,2.58815e+07,4074
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RefineWMG-PT-007008-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1589874687236

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-007008"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-007008, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-oct2-158972913500041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007008.tgz
mv RefineWMG-PT-007008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;