About the Execution of ITS-Tools for ClientsAndServers-PT-N0002P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.050 | 1675334.00 | 1692268.00 | 5657.10 | FFFFFFTFTFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r036-smll-158901930600114.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N0002P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930600114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 26 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 26 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N0002P0-00
FORMULA_NAME ClientsAndServers-PT-N0002P0-01
FORMULA_NAME ClientsAndServers-PT-N0002P0-02
FORMULA_NAME ClientsAndServers-PT-N0002P0-03
FORMULA_NAME ClientsAndServers-PT-N0002P0-04
FORMULA_NAME ClientsAndServers-PT-N0002P0-05
FORMULA_NAME ClientsAndServers-PT-N0002P0-06
FORMULA_NAME ClientsAndServers-PT-N0002P0-07
FORMULA_NAME ClientsAndServers-PT-N0002P0-08
FORMULA_NAME ClientsAndServers-PT-N0002P0-09
FORMULA_NAME ClientsAndServers-PT-N0002P0-10
FORMULA_NAME ClientsAndServers-PT-N0002P0-11
FORMULA_NAME ClientsAndServers-PT-N0002P0-12
FORMULA_NAME ClientsAndServers-PT-N0002P0-13
FORMULA_NAME ClientsAndServers-PT-N0002P0-14
FORMULA_NAME ClientsAndServers-PT-N0002P0-15
=== Now, execution of the tool begins
BK_START 1589696955952
[2020-05-17 06:29:19] [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-17 06:29:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 06:29:19] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-17 06:29:19] [INFO ] Transformed 25 places.
[2020-05-17 06:29:19] [INFO ] Transformed 18 transitions.
[2020-05-17 06:29:19] [INFO ] Parsed PT model containing 25 places and 18 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 362 resets, run finished after 182 ms. (steps per millisecond=549 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:29:19] [INFO ] Computed 8 place invariants in 5 ms
[2020-05-17 06:29:19] [INFO ] [Real]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-17 06:29:19] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned unsat
[2020-05-17 06:29:19] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-17 06:29:19] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-17 06:29:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-17 06:29:19] [INFO ] Flatten gal took : 48 ms
FORMULA ClientsAndServers-PT-N0002P0-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 06:29:19] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 06:29:19] [INFO ] Applying decomposition
[2020-05-17 06:29:19] [INFO ] Flatten gal took : 9 ms
[2020-05-17 06:29:20] [INFO ] Input system was already deterministic with 18 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/graph8895420910657075482.txt, -o, /tmp/graph8895420910657075482.bin, -w, /tmp/graph8895420910657075482.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/graph8895420910657075482.bin, -l, -1, -v, -w, /tmp/graph8895420910657075482.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:29:20] [INFO ] Decomposing Gal with order
[2020-05-17 06:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 06:29:20] [INFO ] Computed 8 place invariants in 9 ms
inv : CG + CR + StR + SwG + SpG - CwG = 0
inv : SR + SG + MpG + MwU - SwG = 0
inv : StF + Si + StR + SwG + SpG + SwA + SpA = 4
inv : SA + SF + MpA + MtF - SwA = 0
inv : CA + CF + StF + SwA + SpA + Cb + CwG + Ci = 16
inv : MpA + MtF + MpG + MwU + Mi = 6
inv : CwA + Cb + CwG + Ci = 16
inv : Uf + SF + CF + StF + CG + MtF + SG + MpG + SpG + Cb = 8
Total of 8 invariants.
[2020-05-17 06:29:20] [INFO ] Computed 8 place invariants in 10 ms
[2020-05-17 06:29:20] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-17 06:29:20] [INFO ] Flatten gal took : 45 ms
[2020-05-17 06:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-17 06:29:20] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-17 06:29:20] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 14 LTL properties
Checking formula 0 : !((G(!(X(X(F(G(((F(!(F("(i2.u7.Cb>=1)"))))||("(i1.u5.SpG>=1)"))||("(i2.u7.Cb>=1)")))))))))
Formula 0 simplified : !G!XXFG("(i1.u5.SpG>=1)" | "(i2.u7.Cb>=1)" | F!F"(i2.u7.Cb>=1)")
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-17 06:29:20] [INFO ] Proved 25 variables to be positive in 198 ms
[2020-05-17 06:29:20] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-17 06:29:20] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:29:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:29:20] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-17 06:29:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:29:21] [INFO ] Computing symmetric co enabling matrix : 18 transitions.
[2020-05-17 06:29:22] [INFO ] Computation of Finished co-enabling matrix. took 595 ms. Total solver calls (SAT/UNSAT): 99(99/0)
[2020-05-17 06:29:22] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2020-05-17 06:29:22] [INFO ] Computation of Completed DNA matrix. took 219 ms. Total solver calls (SAT/UNSAT): 33(0/33)
[2020-05-17 06:29:22] [INFO ] Built C files in 2382ms 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 559 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 51 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](!( X(X(<>([](( ( <>(!( <>((LTLAP0==true))) )) || ( (LTLAP1==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, --when, --ltl, [](!( X(X(<>([](( ( <>(!( <>((LTLAP0==true))) )) || ( (LTLAP1==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, --when, --ltl, [](!( X(X(<>([](( ( <>(!( <>((LTLAP0==true))) )) || ( (LTLAP1==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)
Reverse transition relation is NOT exact ! Due to transitions ssA, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
6943 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.4463,591640,1,0,608981,42761,384,3.9884e+06,183,322661,349570
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(X("(i0.u2.MtF<1)")))))
Formula 1 simplified : !FGX"(i0.u2.MtF<1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
290 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,72.3452,615920,1,0,681856,42761,404,4.02528e+06,183,322678,377135
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G("(((i3.u6.CA>=1)&&(i2.u8.CwA>=1))&&((i2.u7.CF<1)||(i1.u5.Si<1)))"))))
Formula 2 simplified : !XG"(((i3.u6.CA>=1)&&(i2.u8.CwA>=1))&&((i2.u7.CF<1)||(i1.u5.Si<1)))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,72.4036,616708,1,0,681974,42761,441,4.0254e+06,184,322678,377441
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X((!(F(("(i1.u5.SpG>=1)")U("((i0.u2.MpA<1)&&(i1.u5.SpG>=1))"))))&&("((i1.u5.CG<1)||(i2.u7.CwG<1))")))||(X(F("(i3.u1.StF>=1)")))))
Formula 3 simplified : !(X("((i1.u5.CG<1)||(i2.u7.CwG<1))" & !F("(i1.u5.SpG>=1)" U "((i0.u2.MpA<1)&&(i1.u5.SpG>=1))")) | XF"(i3.u1.StF>=1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1051 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,82.9165,726576,1,0,855249,43089,506,4.64331e+06,184,326406,466733
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((!(F("(i1.u0.StR>=1)")))U("(i1.u0.StR>=1)"))U(!(X("(i3.u1.StF>=1)")))))
Formula 4 simplified : !((!F"(i1.u0.StR>=1)" U "(i1.u0.StR>=1)") U !X"(i3.u1.StF>=1)")
Computing Next relation with stutter on 1 deadlock states
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,82.9185,727108,1,0,855249,43089,511,4.64331e+06,184,326406,466746
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(("(i2.u8.Ci>=1)")U("((i3.u1.SF>=1)&&(i0.u2.Mi>=1))")))U(F(G((G("((i3.u1.SF>=1)&&(i0.u2.Mi>=1))"))&&("(i3.u1.SF>=1)"))))))
Formula 5 simplified : !(F("(i2.u8.Ci>=1)" U "((i3.u1.SF>=1)&&(i0.u2.Mi>=1))") U FG("(i3.u1.SF>=1)" & G"((i3.u1.SF>=1)&&(i0.u2.Mi>=1))"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
258 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,85.5035,777848,1,0,860869,43242,547,5.30426e+06,188,327504,478712
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(((F("(i0.u3.MpG>=1)"))||("((i3.u6.SA>=1)&&(i3.u1.SwA>=1))"))||("(i2.u7.Cb>=1)")))||(!(F(("(i0.u3.MpG>=1)")U("((i0.u3.MpG>=1)||(i2.u7.Cb>=1))"))))))
Formula 6 simplified : !(F("((i3.u6.SA>=1)&&(i3.u1.SwA>=1))" | "(i2.u7.Cb>=1)" | F"(i0.u3.MpG>=1)") | !F("(i0.u3.MpG>=1)" U "((i0.u3.MpG>=1)||(i2.u7.Cb>=1))"))
Computing Next relation with stutter on 1 deadlock states
30 unique states visited
0 strongly connected components in search stack
29 transitions explored
30 items max in DFS search stack
7 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,85.5649,779948,1,0,865947,43256,600,5.30818e+06,188,327530,487781
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(X(F((!(X(F("(i0.u3.MpG>=1)"))))&&("(i3.u6.SpA>=1)")))))))
Formula 7 simplified : !XGXF("(i3.u6.SpA>=1)" & !XF"(i0.u3.MpG>=1)")
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2020-05-17 06:49:20] [INFO ] Flatten gal took : 4 ms
[2020-05-17 06:49:20] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-17 06:49:20] [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, --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 7 LTL properties
Checking formula 0 : !((X(G(X(F((!(X(F("(MpG>=1)"))))&&("(SpA>=1)")))))))
Formula 0 simplified : !XGXF("(SpA>=1)" & !XF"(MpG>=1)")
Reverse transition relation is NOT exact ! Due to transitions ssA, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
155 unique states visited
155 strongly connected components in search stack
156 transitions explored
155 items max in DFS search stack
35415 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,354.152,2554548,1,0,4986,1.51019e+07,19,6086,499,1.84265e+07,8504
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((!(X((G("((SF<1)||(Mi<1))"))U("((SR>=1)&&(Mi>=1))")))))
Formula 1 simplified : X(G"((SF<1)||(Mi<1))" U "((SR>=1)&&(Mi>=1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
218 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,356.344,2603548,1,0,4986,1.53954e+07,40,6086,582,1.87104e+07,9505
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(X(G(F(X(("((SG>=1)&&(SwG>=1))")&&(((F("((SG>=1)&&(SwG>=1))"))||(G("(MpA>=1)")))||("((CF>=1)&&(Si>=1))"))))))))))
Formula 2 simplified : !XGXGFX("((SG>=1)&&(SwG>=1))" & ("((CF>=1)&&(Si>=1))" | F"((SG>=1)&&(SwG>=1))" | G"(MpA>=1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3299 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,389.332,2685996,1,0,4986,1.57478e+07,17,6086,492,1.90884e+07,372
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((X((X("(StF>=1)"))U(X("((((Uf<1)||(MwU<1))||(SR<1))||(Mi<1))"))))||(("(StF>=1)")U("(Cb>=1)"))))
Formula 3 simplified : !(X(X"(StF>=1)" U X"((((Uf<1)||(MwU<1))||(SR<1))||(Mi<1))") | ("(StF>=1)" U "(Cb>=1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
15 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,389.489,2686560,1,0,4986,1.57478e+07,36,6086,591,1.90884e+07,390
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(X(F(X(("((CA>=1)&&(CwA>=1))")||((X("(MpA>=1)"))&&("(MpA>=1)"))))))))
Formula 4 simplified : !FXFX("((CA>=1)&&(CwA>=1))" | ("(MpA>=1)" & X"(MpA>=1)"))
Computing Next relation with stutter on 1 deadlock states
12645 unique states visited
103 strongly connected components in search stack
16493 transitions explored
137 items max in DFS search stack
1823 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,407.719,2686560,1,0,60136,1.57478e+07,48,48815,600,1.90884e+07,157466
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(!(G(F("(MpA>=1)"))))))
Formula 5 simplified : !F!GF"(MpA>=1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
830 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,416.023,2686560,1,0,61376,1.57478e+07,59,49826,600,1.90884e+07,159598
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(G((F((G("((CA>=1)&&(CwA>=1))"))&&(F("((CF>=1)&&(Si>=1))"))))U("(Cb>=1)")))))
Formula 6 simplified : !FG(F(G"((CA>=1)&&(CwA>=1))" & F"((CF>=1)&&(Si>=1))") U "(Cb>=1)")
Computing Next relation with stutter on 1 deadlock states
131 unique states visited
131 strongly connected components in search stack
132 transitions explored
131 items max in DFS search stack
3324 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,449.272,2687204,1,0,65632,1.57478e+07,94,53831,652,1.90884e+07,167678
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1589698631286
--------------------
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="ClientsAndServers-PT-N0002P0"
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 ClientsAndServers-PT-N0002P0, 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 r036-smll-158901930600114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0002P0.tgz
mv ClientsAndServers-PT-N0002P0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;