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.r096-oct2-158940145200497.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 Kanban-PT-00020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145200497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 7 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 02:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 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 Kanban-PT-00020-00
FORMULA_NAME Kanban-PT-00020-01
FORMULA_NAME Kanban-PT-00020-02
FORMULA_NAME Kanban-PT-00020-03
FORMULA_NAME Kanban-PT-00020-04
FORMULA_NAME Kanban-PT-00020-05
FORMULA_NAME Kanban-PT-00020-06
FORMULA_NAME Kanban-PT-00020-07
FORMULA_NAME Kanban-PT-00020-08
FORMULA_NAME Kanban-PT-00020-09
FORMULA_NAME Kanban-PT-00020-10
FORMULA_NAME Kanban-PT-00020-11
FORMULA_NAME Kanban-PT-00020-12
FORMULA_NAME Kanban-PT-00020-13
FORMULA_NAME Kanban-PT-00020-14
FORMULA_NAME Kanban-PT-00020-15

=== Now, execution of the tool begins

BK_START 1589581740696

[2020-05-15 22:29:02] [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-15 22:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 22:29:02] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2020-05-15 22:29:02] [INFO ] Transformed 16 places.
[2020-05-15 22:29:02] [INFO ] Transformed 16 transitions.
[2020-05-15 22:29:02] [INFO ] Parsed PT model containing 16 places and 16 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100007 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=1282 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 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, 0, 1, 1, 1]
// Phase 1: matrix 16 rows 16 cols
[2020-05-15 22:29:02] [INFO ] Computed 5 place invariants in 3 ms
[2020-05-15 22:29:03] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned unsat
[2020-05-15 22:29:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-15 22:29:03] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned unsat
[2020-05-15 22:29:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-15 22:29:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
[2020-05-15 22:29:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-15 22:29:03] [INFO ] Flatten gal took : 27 ms
FORMULA Kanban-PT-00020-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 22:29:03] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 22:29:03] [INFO ] Applying decomposition
[2020-05-15 22:29:03] [INFO ] Flatten gal took : 3 ms
[2020-05-15 22:29:03] [INFO ] Input system was already deterministic with 16 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/graph4357169285955889604.txt, -o, /tmp/graph4357169285955889604.bin, -w, /tmp/graph4357169285955889604.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/graph4357169285955889604.bin, -l, -1, -v, -w, /tmp/graph4357169285955889604.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 16 rows 16 cols
[2020-05-15 22:29:03] [INFO ] Computed 5 place invariants in 1 ms
inv : Pm1 + P1 + Pout1 + Pback1 = 20
inv : P4 + Pm4 + Pback4 + Pout4 = 20
inv : P3 + Pm2 + Pout2 + Pback2 = 20
inv : Pm3 + Pback3 + Pout3 - Pm2 - Pout2 - Pback2 = 0
inv : Pm2 + P2 + Pout2 + Pback2 = 20
Total of 5 invariants.
[2020-05-15 22:29:03] [INFO ] Computed 5 place invariants in 2 ms
[2020-05-15 22:29:03] [INFO ] Decomposing Gal with order
[2020-05-15 22:29:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 22:29:03] [INFO ] Removed a total of 4 redundant transitions.
[2020-05-15 22:29:03] [INFO ] Flatten gal took : 35 ms
[2020-05-15 22:29:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2020-05-15 22:29:03] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-15 22:29:03] [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]

[2020-05-15 22:29:03] [INFO ] Proved 16 variables to be positive in 117 ms
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
[2020-05-15 22:29:03] [INFO ] Computing symmetric may disable matrix : 16 transitions.
Read 14 LTL properties
[2020-05-15 22:29:03] [INFO ] Computation of disable matrix completed :0/16 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:29:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:29:03] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2020-05-15 22:29:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((F((F(((F("(gi0.gu1.Pm1<3)"))&&("(gi0.gu2.Pout3<=gi2.gu5.Pback2)"))&&("(gi0.gu1.Pm1>=3)")))||(X(G(("(gi0.gu2.Pm3<=gi0.gu1.Pm1)")U("(gi0.gu1.Pback3>=1)")))))))
Formula 0 simplified : !F(F("(gi0.gu1.Pm1>=3)" & "(gi0.gu2.Pout3<=gi2.gu5.Pback2)" & F"(gi0.gu1.Pm1<3)") | XG("(gi0.gu2.Pm3<=gi0.gu1.Pm1)" U "(gi0.gu1.Pback3>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 22:29:07] [INFO ] Computing symmetric co enabling matrix : 16 transitions.
[2020-05-15 22:29:07] [INFO ] Computation of co-enabling matrix(0/16) took 13 ms. Total solver calls (SAT/UNSAT): 6(6/0)
[2020-05-15 22:29:07] [INFO ] Computation of Finished co-enabling matrix. took 448 ms. Total solver calls (SAT/UNSAT): 45(45/0)
[2020-05-15 22:29:07] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2020-05-15 22:29:08] [INFO ] Computation of Completed DNA matrix. took 628 ms. Total solver calls (SAT/UNSAT): 27(0/27)
[2020-05-15 22:29:08] [INFO ] Built C files in 4833ms 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 403 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 70 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(( <>(( ( <>((LTLAP0==true)) ) && ( (LTLAP1==true) ) ) && ( (LTLAP2==true) ))) || ( X([](((LTLAP3==true))U((LTLAP4==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, <>(( <>(( ( <>((LTLAP0==true)) ) && ( (LTLAP1==true) ) ) && ( (LTLAP2==true) ))) || ( X([](((LTLAP3==true))U((LTLAP4==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, <>(( <>(( ( <>((LTLAP0==true)) ) && ( (LTLAP1==true) ) ) && ( (LTLAP2==true) ))) || ( X([](((LTLAP3==true))U((LTLAP4==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)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8610 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,86.1203,1553616,1,0,747,7.31756e+06,57,343,765,1.07229e+07,1761
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Kanban-PT-00020-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((!(F(X("(gi3.gu0.P3<3)"))))&&(G("(gi0.gu2.P4<=gi0.gu2.Pout3)")))&&(("(gi0.gu2.P4<=gi0.gu2.Pm3)")U("(gu3.Pout4<=gi3.gu6.Pout2)")))))
Formula 1 simplified : !X(!FX"(gi3.gu0.P3<3)" & G"(gi0.gu2.P4<=gi0.gu2.Pout3)" & ("(gi0.gu2.P4<=gi0.gu2.Pm3)" U "(gu3.Pout4<=gi3.gu6.Pout2)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
81 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,86.93,1577512,1,0,748,7.45923e+06,83,343,805,1.0899e+07,1780
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Kanban-PT-00020-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(X("(((gi3.gu6.Pout2>=3)&&(gi3.gu6.Pout2>=0))&&(gi3.gu6.Pm4<=gi3.gu0.P3))")))))
Formula 2 simplified : !XGX"(((gi3.gu6.Pout2>=3)&&(gi3.gu6.Pout2>=0))&&(gi3.gu6.Pm4<=gi3.gu0.P3))"
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,86.9325,1577776,1,0,749,7.45934e+06,89,343,817,1.08991e+07,1790
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Kanban-PT-00020-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((G("((gi2.gu4.P1<=gi2.gu4.P2)||(gi0.gu1.Pm1<=gi0.gu1.Pback3))"))&&(("(gi0.gu1.Pm1<=gi0.gu1.Pback3)")U(X("(gi0.gu1.Pm1<=gi0.gu1.Pback3)"))))))
Formula 3 simplified : !F(G"((gi2.gu4.P1<=gi2.gu4.P2)||(gi0.gu1.Pm1<=gi0.gu1.Pback3))" & ("(gi0.gu1.Pm1<=gi0.gu1.Pback3)" U X"(gi0.gu1.Pm1<=gi0.gu1.Pback3)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10717 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,194.094,2217660,1,0,1050,1.03681e+07,23,500,623,1.62743e+07,787
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Kanban-PT-00020-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(((!(G("((gi3.gu6.Pout2>=0)&&(gi0.gu1.Pback3<=gi0.gu2.Pout3))")))||(G("(gi3.gu6.Pm4>=3)")))||("(gi3.gu6.Pm4>=3)")))))
Formula 4 simplified : !XX("(gi3.gu6.Pm4>=3)" | !G"((gi3.gu6.Pout2>=0)&&(gi0.gu1.Pback3<=gi0.gu2.Pout3))" | G"(gi3.gu6.Pm4>=3)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
452 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,198.624,2217660,1,0,1050,1.03681e+07,38,500,690,1.62743e+07,2191
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Kanban-PT-00020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(F("(gi2.gu4.P1>=1)")))U(X("((((gi0.gu1.Pback3<2)||(gi0.gu1.Pback3>gu3.Pout4))||(gi2.gu5.Pback2>=2))||(gi2.gu4.P1<1))"))))
Formula 5 simplified : !(XF"(gi2.gu4.P1>=1)" U X"((((gi0.gu1.Pback3<2)||(gi0.gu1.Pback3>gu3.Pout4))||(gi2.gu5.Pback2>=2))||(gi2.gu4.P1<1))")
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,198.625,2217660,1,0,1050,1.03681e+07,48,500,706,1.62743e+07,2196
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Kanban-PT-00020-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((X(("(gi3.gu0.Pback1>=1)")U(X("(gi0.gu1.Pm1>=1)"))))&&(F("(((gi0.gu1.Pm1>=1)&&(gi0.gu2.P4<=gi3.gu6.Pm4))&&(gi3.gu0.Pback1>=1))")))))
Formula 6 simplified : !G(X("(gi3.gu0.Pback1>=1)" U X"(gi0.gu1.Pm1>=1)") & F"(((gi0.gu1.Pm1>=1)&&(gi0.gu2.P4<=gi3.gu6.Pm4))&&(gi3.gu0.Pback1>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
129 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,199.91,2217924,1,0,1050,1.03681e+07,64,500,772,1.62743e+07,2223
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Kanban-PT-00020-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((!(F("(gi2.gu5.Pback2<=gi2.gu4.P2)")))||(!(X(!(X(X("(gu3.Pback4<=gu3.Pout4)")))))))||(!(G("(gi3.gu0.P3>=3)")))))
Formula 7 simplified : !(!F"(gi2.gu5.Pback2<=gi2.gu4.P2)" | !X!XX"(gu3.Pback4<=gu3.Pout4)" | !G"(gi3.gu0.P3>=3)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
224 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,202.155,2217924,1,0,1358,1.03681e+07,86,692,787,1.62743e+07,3563
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Kanban-PT-00020-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(G(X(X(G(F((F(!(F("(gi2.gu5.Pm2<=gi0.gu1.Pback3)"))))&&(X("(gi0.gu1.Pback3<=gi3.gu0.Pback1)")))))))))))
Formula 8 simplified : !GXGXXGF(F!F"(gi2.gu5.Pm2<=gi0.gu1.Pback3)" & X"(gi0.gu1.Pback3<=gi3.gu0.Pback1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
70 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,202.857,2217924,1,0,1417,1.03681e+07,99,732,830,1.62743e+07,3711
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Kanban-PT-00020-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(X(!(G("(gi3.gu6.Pout2<=gi3.gu6.Pm4)")))))&&(("(gi3.gu6.Pout2<=gi3.gu6.Pm4)")U("(gi3.gu0.Pback1>=2)"))))
Formula 9 simplified : !(!X!G"(gi3.gu6.Pout2<=gi3.gu6.Pm4)" & ("(gi3.gu6.Pout2<=gi3.gu6.Pm4)" U "(gi3.gu0.Pback1>=2)"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
10443 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,307.288,2442276,1,0,1715,1.29305e+07,28,882,598,1.97399e+07,762
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Kanban-PT-00020-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((((X((G("(gi0.gu1.Pm1<=gi2.gu5.Pm2)"))U(F("(gi2.gu5.Pback2<=gi2.gu5.Pm2)"))))||(F("(gi2.gu5.Pback2<=gi2.gu5.Pm2)")))||(G("(gi3.gu6.Pout2>=3)")))||("(gi3.gu0.P3<=gi3.gu0.Pback1)"))))
Formula 10 simplified : !G("(gi3.gu0.P3<=gi3.gu0.Pback1)" | F"(gi2.gu5.Pback2<=gi2.gu5.Pm2)" | X(G"(gi0.gu1.Pm1<=gi2.gu5.Pm2)" U F"(gi2.gu5.Pback2<=gi2.gu5.Pm2)") | G"(gi3.gu6.Pout2>=3)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
394 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,311.231,2442276,1,0,1715,1.29305e+07,59,882,734,1.97399e+07,1145
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Kanban-PT-00020-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((G("(gi2.gu5.Pm2<=gu3.Pout4)"))||("(gi3.gu0.Pback1>=3)"))))
Formula 11 simplified : !G("(gi3.gu0.Pback1>=3)" | G"(gi2.gu5.Pm2<=gu3.Pout4)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
7438 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,385.607,2448676,1,0,1715,1.36593e+07,76,882,782,1.97399e+07,2564
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Kanban-PT-00020-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F(X("(gu3.Pout4>=2)")))U(X("(gi2.gu5.Pback2>=1)"))))
Formula 12 simplified : !(FX"(gu3.Pout4>=2)" U X"(gi2.gu5.Pback2>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
457 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,390.179,2491764,1,0,1715,1.4401e+07,89,882,787,1.98132e+07,4068
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Kanban-PT-00020-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F(G(!(("(gi0.gu2.Pout3>=1)")U(F("(gi2.gu5.Pm2<=gi2.gu5.Pout1)"))))))))
Formula 13 simplified : !GFG!("(gi0.gu2.Pout3>=1)" U F"(gi2.gu5.Pm2<=gi2.gu5.Pout1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4762 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,437.793,2678772,1,0,2135,1.5317e+07,17,963,574,2.15645e+07,1687
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Kanban-PT-00020-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589582190100

--------------------
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="Kanban-PT-00020"
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 Kanban-PT-00020, 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 r096-oct2-158940145200497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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