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-158972913500058.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-010011, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913500058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:00 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.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 24K 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-010011-00
FORMULA_NAME RefineWMG-PT-010011-01
FORMULA_NAME RefineWMG-PT-010011-02
FORMULA_NAME RefineWMG-PT-010011-03
FORMULA_NAME RefineWMG-PT-010011-04
FORMULA_NAME RefineWMG-PT-010011-05
FORMULA_NAME RefineWMG-PT-010011-06
FORMULA_NAME RefineWMG-PT-010011-07
FORMULA_NAME RefineWMG-PT-010011-08
FORMULA_NAME RefineWMG-PT-010011-09
FORMULA_NAME RefineWMG-PT-010011-10
FORMULA_NAME RefineWMG-PT-010011-11
FORMULA_NAME RefineWMG-PT-010011-12
FORMULA_NAME RefineWMG-PT-010011-13
FORMULA_NAME RefineWMG-PT-010011-14
FORMULA_NAME RefineWMG-PT-010011-15

=== Now, execution of the tool begins

BK_START 1589872974725

[2020-05-19 07:22:56] [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:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 07:22:56] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-05-19 07:22:56] [INFO ] Transformed 54 places.
[2020-05-19 07:22:56] [INFO ] Transformed 43 transitions.
[2020-05-19 07:22:56] [INFO ] Parsed PT model containing 54 places and 43 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100006 steps, including 0 resets, run finished after 111 ms. (steps per millisecond=900 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 43 rows 54 cols
[2020-05-19 07:22:56] [INFO ] Computed 22 place invariants in 3 ms
[2020-05-19 07:22:56] [INFO ] [Real]Absence check using 22 positive place invariants in 63 ms returned sat
[2020-05-19 07:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:22:57] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-05-19 07:22:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:22:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2020-05-19 07:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:22:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-19 07:22:57] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 10 ms.
[2020-05-19 07:22:57] [INFO ] Added : 21 causal constraints over 5 iterations in 36 ms. Result :sat
[2020-05-19 07:22:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 07:22:57] [INFO ] Flatten gal took : 40 ms
FORMULA RefineWMG-PT-010011-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 07:22:57] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 07:22:57] [INFO ] Applying decomposition
[2020-05-19 07:22:57] [INFO ] Flatten gal took : 6 ms
[2020-05-19 07:22:57] [INFO ] Input system was already deterministic with 43 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/graph4148064226739264465.txt, -o, /tmp/graph4148064226739264465.bin, -w, /tmp/graph4148064226739264465.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/graph4148064226739264465.bin, -l, -1, -v, -w, /tmp/graph4148064226739264465.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 43 rows 54 cols
[2020-05-19 07:22:57] [INFO ] Computed 22 place invariants in 2 ms
inv : p27 + p28 = 11
inv : p32 + p33 = 11
inv : p17 + p18 = 11
inv : p22 + p23 = 11
inv : p42 + p43 = 11
inv : p2 + p3 = 11
inv : p34 + p35 = 11
inv : p37 + p38 = 11
inv : p29 + p30 = 11
inv : p49 + p50 = 11
inv : p24 + p25 = 11
inv : p14 + p15 = 11
inv : p19 + p20 = 11
inv : p9 + p10 = 11
inv : p + pprime + p1 + p6 + p11 + p16 + p21 + p26 + p31 + p36 + p41 + p46 = 7
inv : p39 + p40 = 11
inv : p44 + p45 = 11
inv : p47 + p48 = 11
inv : psecond + pterce = 5
inv : p4 + p5 = 11
inv : p7 + p8 = 11
inv : p12 + p13 = 11
Total of 22 invariants.
[2020-05-19 07:22:57] [INFO ] Computed 22 place invariants in 7 ms
[2020-05-19 07:22:57] [INFO ] Decomposing Gal with order
[2020-05-19 07:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 07:22:57] [INFO ] Flatten gal took : 39 ms
[2020-05-19 07:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-19 07:22:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-19 07:22:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F((F(G(X("(i10.u24.p47>=1)"))))&&(!(("(i1.u3.p5>=1)")U("(i2.u4.p7>=1)"))))))
Formula 0 simplified : !F(FGX"(i10.u24.p47>=1)" & !("(i1.u3.p5>=1)" U "(i2.u4.p7>=1)"))
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 4 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
[2020-05-19 07:22:57] [INFO ] Proved 54 variables to be positive in 263 ms
[2020-05-19 07:22:57] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2020-05-19 07:22:57] [INFO ] Computation of disable matrix completed :0/43 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:22:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:22:57] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2020-05-19 07:22:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 07:22:59] [INFO ] Computing symmetric co enabling matrix : 43 transitions.
[2020-05-19 07:23:00] [INFO ] Computation of Finished co-enabling matrix. took 610 ms. Total solver calls (SAT/UNSAT): 107(107/0)
[2020-05-19 07:23:00] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2020-05-19 07:23:00] [INFO ] Computation of Completed DNA matrix. took 180 ms. Total solver calls (SAT/UNSAT): 43(0/43)
[2020-05-19 07:23:00] [INFO ] Built C files in 2813ms 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 596 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(( <>([](X((LTLAP0==true)))) ) && ( !( ((LTLAP1==true))U((LTLAP2==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)))) ) && ( !( ((LTLAP1==true))U((LTLAP2==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)))) ) && ( !( ((LTLAP1==true))U((LTLAP2==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.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6248 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,62.5039,348988,1,0,309839,19717,389,1.53839e+06,170,213308,267028
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(F(G(F((X(G("(((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i7.u16.p36>=1))")))||(F((!(G("(i7.u18.p35>=1)")))&&("(i7.u18.p35<1)"))))))))))
Formula 1 simplified : !F!FGF(XG"(((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i7.u16.p36>=1))" | F("(i7.u18.p35<1)" & !G"(i7.u18.p35>=1)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
177 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,64.278,363460,1,0,320692,20456,437,1.57356e+06,175,218904,288136
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(G("((((i6.u14.p28>=1)&&(i6.u15.p29>=1))&&(i7.u16.p31>=1))||(((i0.u0.p>=1)&&(i10.u24.p48>=1))&&(i10.u25.p49>=1)))")))||((X("(i1.u2.p2>=1)"))U("(((i6.u14.p28>=1)&&(i6.u15.p29>=1))&&(i7.u16.p31>=1))"))))
Formula 2 simplified : !(FG"((((i6.u14.p28>=1)&&(i6.u15.p29>=1))&&(i7.u16.p31>=1))||(((i0.u0.p>=1)&&(i10.u24.p48>=1))&&(i10.u25.p49>=1)))" | (X"(i1.u2.p2>=1)" U "(((i6.u14.p28>=1)&&(i6.u15.p29>=1))&&(i7.u16.p31>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,64.3973,367652,1,0,329692,20484,514,1.58614e+06,175,219094,300160
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(X((X(F(X("(i0.u1.pterce>=3)"))))&&(!(F(X("(((i0.u0.p>=1)&&(i10.u24.p48>=1))&&(i10.u25.p49>=1))")))))))))
Formula 3 simplified : !XXX(XFX"(i0.u1.pterce>=3)" & !FX"(((i0.u0.p>=1)&&(i10.u24.p48>=1))&&(i10.u25.p49>=1))")
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 items max in DFS search stack
462 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,69.0112,392696,1,0,349584,20690,555,1.64291e+06,176,220996,327505
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X(X((("(i3.u8.p15>=1)")U(G("(i1.u3.p4>=1)")))&&(G("((i1.u3.p4<1)||(i3.u8.p15<1))")))))))
Formula 4 simplified : XX(("(i3.u8.p15>=1)" U G"(i1.u3.p4>=1)") & G"((i1.u3.p4<1)||(i3.u8.p15<1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,69.1004,395588,1,0,355709,20691,609,1.65043e+06,176,221024,337192
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X(F(!(X("((i9.u22.p44>=1)&&(i7.u17.p32>=1))"))))))))
Formula 5 simplified : !XGXF!X"((i9.u22.p44>=1)&&(i7.u17.p32>=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,69.104,395844,1,0,355944,20691,634,1.65115e+06,176,221024,337629
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(G(!((X(F("(i10.u25.p50>=1)")))U((X(("(i2.u5.p9>=1)")U("(i10.u25.p50>=1)")))||("(i10.u25.p49>=1)"))))))))
Formula 6 simplified : !XXG!(XF"(i10.u25.p50>=1)" U ("(i10.u25.p49>=1)" | X("(i2.u5.p9>=1)" U "(i10.u25.p50>=1)")))
5 unique states visited
5 strongly connected components in search stack
5 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,69.1062,396080,1,0,355961,20691,637,1.6512e+06,176,221029,337734
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((X(F("(i10.u25.p50<1)")))U("(i10.u25.p50<1)"))&&(X("(i4.u10.p20>=1)"))))
Formula 7 simplified : !((XF"(i10.u25.p50<1)" U "(i10.u25.p50<1)") & X"(i4.u10.p20>=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,69.1074,396080,1,0,355997,20691,643,1.65123e+06,176,221029,337804
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(!(X("(i8.u20.p39>=1)")))))
Formula 8 simplified : !F!X"(i8.u20.p39>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
644 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,75.5523,480848,1,0,448292,21025,663,2.0605e+06,176,232831,386729
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(X(G(("(i5.u12.p24>=1)")U(F(G(((((X("(((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i7.u16.p36>=1))"))&&(X("(i6.u14.p27>=1)")))&&("(i7.u17.p33>=1)"))&&("(i7.u18.p34>=1)"))&&("(i7.u16.p36>=1)"))))))))))
Formula 9 simplified : XXG("(i5.u12.p24>=1)" U FG("(i7.u16.p36>=1)" & "(i7.u17.p33>=1)" & "(i7.u18.p34>=1)" & X"(((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i7.u16.p36>=1))" & X"(i6.u14.p27>=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,75.5585,481064,1,0,448728,21025,725,2.06108e+06,180,232836,387503
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((F(!(X(F(X(G((F("(((i5.u11.p23>=1)&&(i5.u12.p24>=1))&&(i5.u13.p26>=1))"))||(X("(i2.u5.p10>=1)")))))))))&&(G("(i5.u12.p24>=1)")))))
Formula 10 simplified : !X(F!XFXG(F"(((i5.u11.p23>=1)&&(i5.u12.p24>=1))&&(i5.u13.p26>=1))" | X"(i2.u5.p10>=1)") & G"(i5.u12.p24>=1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
8785 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,163.419,1319460,1,0,1.07267e+06,29771,749,7.25059e+06,180,330843,715597
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F((F("(i1.u3.p5>=1)"))&&("(i0.u0.p1<5)")))||(G(F(X(G("(i4.u9.p17>=1)")))))))
Formula 11 simplified : !(F("(i0.u0.p1<5)" & F"(i1.u3.p5>=1)") | GFXG"(i4.u9.p17>=1)")
Detected timeout of ITS tools.
[2020-05-19 07:42:57] [INFO ] Flatten gal took : 3 ms
[2020-05-19 07:42:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
[2020-05-19 07:42:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 13 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, --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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((F((F("(p5>=1)"))&&("(p1<5)")))||(G(F(X(G("(p17>=1)")))))))
Formula 0 simplified : !(F("(p1<5)" & F"(p5>=1)") | GFXG"(p17>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1617 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,16.1745,496588,1,0,1404,2.55001e+06,41,573,1683,4.02476e+06,2758
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(X((G("((p44>=1)||(((p38>=1)&&(p39>=1))&&(p41>=1)))"))||(G(!(X(F("(((p18<1)||(p19<1))||(p21<1))")))))))))
Formula 1 simplified : !XX(G"((p44>=1)||(((p38>=1)&&(p39>=1))&&(p41>=1)))" | G!XF"(((p18<1)||(p19<1))||(p21<1))")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
20955 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,225.729,2444292,1,0,2119,1.11827e+07,27,932,1332,2.10823e+07,1974
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RefineWMG-PT-010011-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1589874414313

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

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