About the Execution of ITS-Tools for TriangularGrid-PT-2011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.430 | 723312.00 | 746980.00 | 1772.30 | FFFTFTFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033388900545.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 TriangularGrid-PT-2011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033388900545
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 5 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 33K Apr 27 14:36 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 TriangularGrid-PT-2011-00
FORMULA_NAME TriangularGrid-PT-2011-01
FORMULA_NAME TriangularGrid-PT-2011-02
FORMULA_NAME TriangularGrid-PT-2011-03
FORMULA_NAME TriangularGrid-PT-2011-04
FORMULA_NAME TriangularGrid-PT-2011-05
FORMULA_NAME TriangularGrid-PT-2011-06
FORMULA_NAME TriangularGrid-PT-2011-07
FORMULA_NAME TriangularGrid-PT-2011-08
FORMULA_NAME TriangularGrid-PT-2011-09
FORMULA_NAME TriangularGrid-PT-2011-10
FORMULA_NAME TriangularGrid-PT-2011-11
FORMULA_NAME TriangularGrid-PT-2011-12
FORMULA_NAME TriangularGrid-PT-2011-13
FORMULA_NAME TriangularGrid-PT-2011-14
FORMULA_NAME TriangularGrid-PT-2011-15
=== Now, execution of the tool begins
BK_START 1590534585949
[2020-05-26 23:09:51] [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-26 23:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 23:09:51] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-05-26 23:09:51] [INFO ] Transformed 52 places.
[2020-05-26 23:09:51] [INFO ] Transformed 42 transitions.
[2020-05-26 23:09:51] [INFO ] Parsed PT model containing 52 places and 42 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 155 resets, run finished after 297 ms. (steps per millisecond=336 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 42 rows 52 cols
[2020-05-26 23:09:51] [INFO ] Computed 23 place invariants in 5 ms
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned unsat
[2020-05-26 23:09:51] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2020-05-26 23:09:52] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 50 ms
FORMULA TriangularGrid-PT-2011-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 23:09:52] [INFO ] Applying decomposition
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 16 ms
[2020-05-26 23:09:52] [INFO ] Input system was already deterministic with 42 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 52 cols
[2020-05-26 23:09:52] [INFO ] Computed 23 place invariants in 3 ms
inv : pbl_1_1 + pbl_2_1 + pbl_2_2 + pbl_2_3 + pil1_1_1 + pil1_2_1 + pil1_2_3 + pil2_1_1 + pil2_2_1 + pil2_2_3 + pil3_1_1 + pil3_2_1 + pil3_2_3 + pol1_1_1 + pol1_2_1 + pol1_2_3 + pol2_1_1 + pol2_2_1 + pol2_2_3 + pol3_1_1 + pol3_2_1 + pol3_2_3 = 22
inv : po1_2_1 + pol1_2_1 = 1
inv : po2_1_1 + pol2_1_1 = 1
inv : pb1_2_3 + pb2_2_3 + pb3_2_3 + pbl_2_3 = 4
inv : po3_1_1 + pol3_1_1 = 1
inv : pb1_1_1 + pb2_1_1 + pb3_1_1 + pbl_1_1 = 4
inv : pi2_2_1 + pil2_2_1 = 1
inv : pi1_2_1 + pil1_2_1 = 1
inv : po2_2_1 + pol2_2_1 = 1
inv : pb1_2_1 + pb2_2_1 + pb3_2_1 - pbl_1_1 - pbl_2_2 - pbl_2_3 - pil1_1_1 - pil1_2_1 - pil1_2_3 - pil2_1_1 - pil2_2_1 - pil2_2_3 - pil3_1_1 - pil3_2_1 - pil3_2_3 - pol1_1_1 - pol1_2_1 - pol1_2_3 - pol2_1_1 - pol2_2_1 - pol2_2_3 - pol3_1_1 - pol3_2_1 - pol3_2_3 = -18
inv : pi3_1_1 + pil3_1_1 = 1
inv : po1_2_3 + pol1_2_3 = 1
inv : po3_2_1 + pol3_2_1 = 1
inv : pi2_1_1 + pil2_1_1 = 1
inv : pi2_2_3 + pil2_2_3 = 1
inv : pi3_2_3 + pil3_2_3 = 1
inv : pb1_2_2 + pb2_2_2 + pb3_2_2 + pbl_2_2 = 4
inv : pi1_1_1 + pil1_1_1 = 1
inv : po2_2_3 + pol2_2_3 = 1
inv : pi3_2_1 + pil3_2_1 = 1
inv : po1_1_1 + pol1_1_1 = 1
inv : po3_2_3 + pol3_2_3 = 1
inv : pi1_2_3 + pil1_2_3 = 1
Total of 23 invariants.
[2020-05-26 23:09:52] [INFO ] Computed 23 place invariants in 4 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/graph10640603447053558472.txt, -o, /tmp/graph10640603447053558472.bin, -w, /tmp/graph10640603447053558472.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/graph10640603447053558472.bin, -l, -1, -v, -w, /tmp/graph10640603447053558472.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 23:09:52] [INFO ] Decomposing Gal with order
[2020-05-26 23:09:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 23:09:52] [INFO ] Removed a total of 34 redundant transitions.
[2020-05-26 23:09:52] [INFO ] Flatten gal took : 70 ms
[2020-05-26 23:09:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2020-05-26 23:09:52] [INFO ] Proved 52 variables to be positive in 202 ms
[2020-05-26 23:09:52] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2020-05-26 23:09:52] [INFO ] Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:52] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2020-05-26 23:09:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:52] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-26 23:09:52] [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 10 LTL properties
Checking formula 0 : !((F(("(gu3.pb3_2_2<=gu3.po1_1_1)")||(G("(gu3.pb3_2_2<=gu3.po1_1_1)")))))
Formula 0 simplified : !F("(gu3.pb3_2_2<=gu3.po1_1_1)" | G"(gu3.pb3_2_2<=gu3.po1_1_1)")
Reverse transition relation is NOT exact ! Due to transitions to1_2_3, to2_2_1, to3_1_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/3/41
Computing Next relation with stutter on 99 deadlock states
[2020-05-26 23:09:53] [INFO ] Computing symmetric co enabling matrix : 42 transitions.
[2020-05-26 23:09:55] [INFO ] Computation of co-enabling matrix(17/42) took 1962 ms. Total solver calls (SAT/UNSAT): 585(561/24)
[2020-05-26 23:09:57] [INFO ] Computation of Finished co-enabling matrix. took 3753 ms. Total solver calls (SAT/UNSAT): 861(831/30)
[2020-05-26 23:09:57] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2020-05-26 23:09:58] [INFO ] Computation of Completed DNA matrix. took 720 ms. Total solver calls (SAT/UNSAT): 84(0/84)
[2020-05-26 23:09:58] [INFO ] Built C files in 5962ms 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 1132 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( (LTLAP0==true)) || ( []((LTLAP0==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, -p, --pins-guards, --when, --ltl, <>(( (LTLAP0==true)) || ( []((LTLAP0==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, -p, --pins-guards, --when, --ltl, <>(( (LTLAP0==true)) || ( []((LTLAP0==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4906 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,49.0923,854548,1,0,235,3.73194e+06,108,185,1584,7.02082e+06,435
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(G((G(("(gu9.pil1_2_1<=gu9.pol1_1_1)")U(F(G(F("(gu1.pb1_2_1<=gu1.pil1_2_3)"))))))U(!(X(X("(gu9.pil1_2_1<=gu9.pol1_1_1)")))))))))
Formula 1 simplified : !GFG(G("(gu9.pil1_2_1<=gu9.pol1_1_1)" U FGF"(gu1.pb1_2_1<=gu1.pil1_2_3)") U !XX"(gu9.pil1_2_1<=gu9.pol1_1_1)")
Computing Next relation with stutter on 99 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,49.5369,868604,1,0,242,3.78259e+06,122,195,1643,7.09745e+06,466
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(F("(gu9.pil1_2_1<=gu9.pb1_2_3)")))U(X("(gi6.gu12.pil3_2_1<=gi6.gu12.pi2_2_1)"))))
Formula 2 simplified : !(!F"(gu9.pil1_2_1<=gu9.pb1_2_3)" U X"(gi6.gu12.pil3_2_1<=gi6.gu12.pi2_2_1)")
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
23 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,49.768,874148,1,0,244,3.80665e+06,131,196,1649,7.13348e+06,479
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(F((G("(gu9.pi3_2_1<=gu9.pol1_1_1)"))U(F(G("(gi8.gu17.pol3_1_1<=gi8.gu17.pol1_2_1)"))))))))
Formula 3 simplified : GF(G"(gu9.pi3_2_1<=gu9.pol1_1_1)" U FG"(gi8.gu17.pol3_1_1<=gi8.gu17.pol1_2_1)")
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
4 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,49.8037,874940,1,0,247,3.81269e+06,140,198,1653,7.14167e+06,490
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(((X(X("(gi2.gu8.pb2_2_3<=gi2.gu8.pil1_1_1)")))&&(F("(gi2.gu8.pb2_2_3<=gi2.gu8.pil1_1_1)")))&&("(gu13.po1_2_3<=gu13.po3_2_1)"))))
Formula 4 simplified : !G("(gu13.po1_2_3<=gu13.po3_2_1)" & XX"(gi2.gu8.pb2_2_3<=gi2.gu8.pil1_1_1)" & F"(gi2.gu8.pb2_2_3<=gi2.gu8.pil1_1_1)")
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26487 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,314.684,2580276,1,0,302,1.05042e+07,22,246,867,2.22797e+07,152
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G("(gu7.pi1_2_3<=gu7.pb3_1_1)"))))
Formula 5 simplified : G"(gu7.pi1_2_3<=gu7.pb3_1_1)"
Computing Next relation with stutter on 99 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5022 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,364.903,2580276,1,0,302,1.05042e+07,32,246,1028,2.22797e+07,516
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(X(F("(gi8.gu6.pbl_2_2>=2)"))))))
Formula 6 simplified : XXF"(gi8.gu6.pbl_2_2>=2)"
Computing Next relation with stutter on 99 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
839 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,373.29,2580276,1,0,442,1.05042e+07,38,384,1030,2.22797e+07,860
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((F("((gi2.gu8.pil1_1_1<1)||(gi9.gu2.pb2_1_1>gi9.gu2.pil3_2_3))"))||((X(X((X("(gi9.gu2.pb2_1_1<=gi9.gu2.pil3_2_3)"))&&("(gi2.gu8.pil1_1_1>=1)"))))&&("(gu3.po1_1_1>=1)")))))
Formula 7 simplified : !X(F"((gi2.gu8.pil1_1_1<1)||(gi9.gu2.pb2_1_1>gi9.gu2.pil3_2_3))" | ("(gu3.po1_1_1>=1)" & XX("(gi2.gu8.pil1_1_1>=1)" & X"(gi9.gu2.pb2_1_1<=gi9.gu2.pil3_2_3)")))
Computing Next relation with stutter on 99 deadlock states
7 unique states visited
4 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
13926 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,512.547,2902552,1,0,493,1.16146e+07,27,426,822,2.46627e+07,222
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("(gi5.gi0.gu14.pi3_1_1<=gi5.gi0.gu14.po2_2_3)")))
Formula 8 simplified : !G"(gi5.gi0.gu14.pi3_1_1<=gi5.gi0.gu14.po2_2_3)"
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17993 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,692.491,3202128,1,0,493,1.3395e+07,22,426,862,2.7009e+07,233
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F(("(gu3.po1_2_1<=gu3.pb3_2_2)")U(G(X(F(X("((gi8.gu17.pol3_1_1>=1)&&(gi6.gu5.pbl_2_1>=0))")))))))))
Formula 9 simplified : F("(gu3.po1_2_1<=gu3.pb3_2_2)" U GXFX"((gi8.gu17.pol3_1_1>=1)&&(gi6.gu5.pbl_2_1>=0))")
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
39 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,692.886,3202128,1,0,493,1.3395e+07,28,426,1023,2.7009e+07,253
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1590535309261
--------------------
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="TriangularGrid-PT-2011"
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 TriangularGrid-PT-2011, 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 r193-csrt-159033388900545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-2011.tgz
mv TriangularGrid-PT-2011 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 '
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 ;