About the Execution of ITS-Tools for ShieldRVt-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.040 | 4650.00 | 9508.00 | 34.20 | FFTFTFFFTTTFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476400921.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ShieldRVt-PT-001A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476400921
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.4K May 14 02:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 02:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 3.7K May 12 20:42 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 ShieldRVt-PT-001A-00
FORMULA_NAME ShieldRVt-PT-001A-01
FORMULA_NAME ShieldRVt-PT-001A-02
FORMULA_NAME ShieldRVt-PT-001A-03
FORMULA_NAME ShieldRVt-PT-001A-04
FORMULA_NAME ShieldRVt-PT-001A-05
FORMULA_NAME ShieldRVt-PT-001A-06
FORMULA_NAME ShieldRVt-PT-001A-07
FORMULA_NAME ShieldRVt-PT-001A-08
FORMULA_NAME ShieldRVt-PT-001A-09
FORMULA_NAME ShieldRVt-PT-001A-10
FORMULA_NAME ShieldRVt-PT-001A-11
FORMULA_NAME ShieldRVt-PT-001A-12
FORMULA_NAME ShieldRVt-PT-001A-13
FORMULA_NAME ShieldRVt-PT-001A-14
FORMULA_NAME ShieldRVt-PT-001A-15
=== Now, execution of the tool begins
BK_START 1590630090566
[2020-05-28 01:41:33] [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-28 01:41:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:41:33] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2020-05-28 01:41:33] [INFO ] Transformed 11 places.
[2020-05-28 01:41:33] [INFO ] Transformed 11 transitions.
[2020-05-28 01:41:33] [INFO ] Found NUPN structural information;
[2020-05-28 01:41:33] [INFO ] Parsed PT model containing 11 places and 11 transitions in 54 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 158 ms. (steps per millisecond=632 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 10 rows 11 cols
[2020-05-28 01:41:33] [INFO ] Computed 5 place invariants in 2 ms
[2020-05-28 01:41:33] [INFO ] [Real]Absence check using 5 positive place invariants in 68 ms returned sat
[2020-05-28 01:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:33] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-05-28 01:41:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 38 ms returned unsat
[2020-05-28 01:41:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-28 01:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-28 01:41:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned unsat
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-28 01:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-05-28 01:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 41 ms returned unsat
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-28 01:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-28 01:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned unsat
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-28 01:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-05-28 01:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned unsat
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-28 01:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-28 01:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-28 01:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:41:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-28 01:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:41:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-28 01:41:34] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-28 01:41:34] [INFO ] Flatten gal took : 26 ms
FORMULA ShieldRVt-PT-001A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:41:34] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:41:34] [INFO ] Applying decomposition
[2020-05-28 01:41:34] [INFO ] Flatten gal took : 4 ms
[2020-05-28 01:41:34] [INFO ] Input system was already deterministic with 10 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/graph4582036772076036095.txt, -o, /tmp/graph4582036772076036095.bin, -w, /tmp/graph4582036772076036095.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4582036772076036095.bin, -l, -1, -v, -w, /tmp/graph4582036772076036095.weights, -q, 0, -e, 0.001], workingDir=null]
// Phase 1: matrix 10 rows 11 cols
[2020-05-28 01:41:34] [INFO ] Computed 5 place invariants in 2 ms
inv : p0 + p9 + p10 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p7 + p8 = 1
Total of 5 invariants.
[2020-05-28 01:41:34] [INFO ] Computed 5 place invariants in 3 ms
[2020-05-28 01:41:34] [INFO ] Decomposing Gal with order
[2020-05-28 01:41:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:41:34] [INFO ] Removed a total of 3 redundant transitions.
[2020-05-28 01:41:34] [INFO ] Proved 11 variables to be positive in 77 ms
[2020-05-28 01:41:34] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2020-05-28 01:41:34] [INFO ] Computation of disable matrix completed :0/10 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:41:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:41:34] [INFO ] Flatten gal took : 42 ms
[2020-05-28 01:41:34] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2020-05-28 01:41:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 01:41:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-28 01:41:34] [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], 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
Read 9 LTL properties
Checking formula 0 : !(((("((i0.u0.p0==0)||(u4.p9==1))")U(X("((u1.p3==0)||(i0.u0.p1==1))")))||(!(F("((u2.p6==0)||(u4.p9==1))")))))
Formula 0 simplified : !(("((i0.u0.p0==0)||(u4.p9==1))" U X"((u1.p3==0)||(i0.u0.p1==1))") | !F"((u2.p6==0)||(u4.p9==1))")
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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,0.025679,17360,1,0,144,38,155,150,65,41,162
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(!(F(G(!(G("(i0.u0.p0==1)")))))))))
Formula 1 simplified : !XX!FG!G"(i0.u0.p0==1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.028391,17724,1,0,260,39,183,271,66,41,760
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(F(((G(F("((u1.p4==0)||(u4.p9==1))")))U(X("((u1.p4==0)||(u4.p9==1))")))U(!(X("((u4.p9==0)||(u1.p4==1))"))))))))
Formula 2 simplified : !FXF((GF"((u1.p4==0)||(u4.p9==1))" U X"((u1.p4==0)||(u4.p9==1))") U !X"((u4.p9==0)||(u1.p4==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.029761,17724,1,0,324,39,214,371,67,41,1030
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((i0.u0.p2==0)||(i0.u0.p1==1))")))
Formula 3 simplified : !G"((i0.u0.p2==0)||(i0.u0.p1==1))"
3 unique states visited
3 strongly connected components in search stack
3 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,0.031896,17724,1,0,481,39,260,553,72,46,1510
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((X(G(("(i0.u0.p0==1)")U(F("((u1.p4==0)||(i0.u3.p7==1))")))))U(F("((u1.p4==0)||(i0.u3.p7==1))")))))
Formula 4 simplified : !X(XG("(i0.u0.p0==1)" U F"((u1.p4==0)||(i0.u3.p7==1))") U F"((u1.p4==0)||(i0.u3.p7==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,0.032813,17724,1,0,481,39,283,555,72,46,1548
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(F(X("(((i0.u0.p2==1)||(u4.p9==0))||(i0.u3.p8==1))"))))))
Formula 5 simplified : !XXFX"(((i0.u0.p2==1)||(u4.p9==0))||(i0.u3.p8==1))"
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.033501,17724,1,0,482,39,306,557,73,46,1574
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(X("((u4.p10==0)||(i0.u0.p1==1))")))))
Formula 6 simplified : !GXX"((u4.p10==0)||(i0.u0.p1==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,0.035311,17724,1,0,587,39,318,695,73,46,1909
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G((X(G("((u1.p3==0)||(u4.p10==1))")))||(F("(u1.p3==1)"))))))
Formula 7 simplified : !FG(XG"((u1.p3==0)||(u4.p10==1))" | F"(u1.p3==1)")
3 unique states visited
0 strongly connected components in search stack
5 transitions explored
3 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,0.0382,18316,1,0,619,39,337,749,73,46,2090
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(F(X((G("((i0.u0.p1!=0)&&(u1.p4!=1))"))||(F("((u2.p5==0)||(u1.p3==1))"))))))||(F(G("((i0.u0.p1==0)||(u1.p4==1))")))))
Formula 8 simplified : !(GFX(G"((i0.u0.p1!=0)&&(u1.p4!=1))" | F"((u2.p5==0)||(u1.p3==1))") | FG"((i0.u0.p1==0)||(u1.p4==1))")
3 unique states visited
0 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,0.040799,18452,1,0,630,39,408,769,74,46,2200
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-28 01:41:34] [INFO ] Built C files in 242ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1590630095216
--------------------
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="ShieldRVt-PT-001A"
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 ShieldRVt-PT-001A, 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 r210-tajo-159033476400921"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001A.tgz
mv ShieldRVt-PT-001A 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 ;