About the Execution of ITS-Tools for ShieldRVt-PT-001B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.040 | 3389.00 | 7527.00 | 73.20 | FTFTTFTTFFTTTFTF | 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-159033476400929.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-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476400929
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 2.9K May 14 02:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 02:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 20:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.3K May 13 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 13K 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-001B-00
FORMULA_NAME ShieldRVt-PT-001B-01
FORMULA_NAME ShieldRVt-PT-001B-02
FORMULA_NAME ShieldRVt-PT-001B-03
FORMULA_NAME ShieldRVt-PT-001B-04
FORMULA_NAME ShieldRVt-PT-001B-05
FORMULA_NAME ShieldRVt-PT-001B-06
FORMULA_NAME ShieldRVt-PT-001B-07
FORMULA_NAME ShieldRVt-PT-001B-08
FORMULA_NAME ShieldRVt-PT-001B-09
FORMULA_NAME ShieldRVt-PT-001B-10
FORMULA_NAME ShieldRVt-PT-001B-11
FORMULA_NAME ShieldRVt-PT-001B-12
FORMULA_NAME ShieldRVt-PT-001B-13
FORMULA_NAME ShieldRVt-PT-001B-14
FORMULA_NAME ShieldRVt-PT-001B-15
=== Now, execution of the tool begins
BK_START 1590630205800
[2020-05-28 01:43:27] [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:43:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:43:27] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-05-28 01:43:27] [INFO ] Transformed 53 places.
[2020-05-28 01:43:27] [INFO ] Transformed 53 transitions.
[2020-05-28 01:43:27] [INFO ] Found NUPN structural information;
[2020-05-28 01:43:27] [INFO ] Parsed PT model containing 53 places and 53 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 118 resets, run finished after 99 ms. (steps per millisecond=1010 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 53 rows 53 cols
[2020-05-28 01:43:27] [INFO ] Computed 5 place invariants in 4 ms
[2020-05-28 01:43:28] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-28 01:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:43:28] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-28 01:43:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:43:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned unsat
[2020-05-28 01:43:28] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-28 01:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:43:28] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-28 01:43:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:43:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-28 01:43:28] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-28 01:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:43:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-28 01:43:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:43:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-28 01:43:28] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-28 01:43:28] [INFO ] Flatten gal took : 27 ms
FORMULA ShieldRVt-PT-001B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:43:28] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:43:28] [INFO ] Applying decomposition
[2020-05-28 01:43:28] [INFO ] Flatten gal took : 11 ms
[2020-05-28 01:43:28] [INFO ] Input system was already deterministic with 53 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/graph2378762617219163126.txt, -o, /tmp/graph2378762617219163126.bin, -w, /tmp/graph2378762617219163126.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/graph2378762617219163126.bin, -l, -1, -v, -w, /tmp/graph2378762617219163126.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:43:28] [INFO ] Decomposing Gal with order
[2020-05-28 01:43:28] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 53 rows 53 cols
[2020-05-28 01:43:28] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-28 01:43:28] [INFO ] Computed 5 place invariants in 2 ms
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p4 + p5 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 = 1
inv : p0 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p4 + p5 + p6 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 = 1
inv : p0 + p4 + p5 + p6 + p7 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 = 1
Total of 5 invariants.
[2020-05-28 01:43:28] [INFO ] Computed 5 place invariants in 5 ms
[2020-05-28 01:43:28] [INFO ] Flatten gal took : 39 ms
[2020-05-28 01:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-28 01:43:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-28 01:43:28] [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 8 LTL properties
Checking formula 0 : !((G(!(X(!(F(!((G((F("((i1.u5.p15==0)||(i2.u11.p41==1))"))U(X("((i1.u5.p15==0)||(i2.u11.p41==1))"))))U(F("(i2.u7.p18==1)"))))))))))
Formula 0 simplified : !G!X!F!(G(F"((i1.u5.p15==0)||(i2.u11.p41==1))" U X"((i1.u5.p15==0)||(i2.u11.p41==1))") U F"(i2.u7.p18==1)")
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-28 01:43:28] [INFO ] Proved 53 variables to be positive in 120 ms
[2020-05-28 01:43:28] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2020-05-28 01:43:28] [INFO ] Computation of disable matrix completed :0/53 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:43:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:43:28] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2020-05-28 01:43:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t16, t37, i0.u0.t46, i1.t44, i1.u5.t38, i1.u5.t45, i1.u6.t42, i3.t28, i3.u9.t32, i3.u9.t34, i4.t23, i4.u12.t17, i4.u12.t24, i4.u14.t21, i5.t11, i5.t4, i5.u16.t9, i5.u19.t5, i5.u19.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/34/19/53
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
13 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.155621,23800,1,0,11745,266,861,20381,170,684,25934
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("((i4.u14.p33==0)||(i5.u17.p47==1))")U(F(!(X(!(G("((i2.u2.p6==0)||(i3.u9.p27==1))")))))))))
Formula 1 simplified : !G("((i4.u14.p33==0)||(i5.u17.p47==1))" U F!X!G"((i2.u2.p6==0)||(i3.u9.p27==1))")
Computing Next relation with stutter on 1 deadlock states
33 unique states visited
0 strongly connected components in search stack
34 transitions explored
18 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.164169,24312,1,0,11853,266,889,20678,172,684,26779
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((F("((i3.u9.p21==0)||(i1.u3.p12==1))"))U((G(X(("((i4.u13.p32==0)||(i5.u17.p47==1))")U("(i0.u0.p2!=1)"))))&&("(i0.u0.p2==1)")))))
Formula 2 simplified : !G(F"((i3.u9.p21==0)||(i1.u3.p12==1))" U ("(i0.u0.p2==1)" & GX("((i4.u13.p32==0)||(i5.u17.p47==1))" U "(i0.u0.p2!=1)")))
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
2 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.185205,24924,1,0,13674,268,929,22977,175,693,30764
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(((("(i5.u16.p51!=1)")U(F("(i5.u16.p51==1)")))||("(i0.u0.p2==0)"))||("(i0.u0.p2==1)")))))
Formula 3 simplified : !XG("(i0.u0.p2==0)" | "(i0.u0.p2==1)" | ("(i5.u16.p51!=1)" U F"(i5.u16.p51==1)"))
Computing Next relation with stutter on 1 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 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.187686,25448,1,0,13728,268,947,23025,179,693,31098
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(G(X("((i4.u12.p37==0)||(i2.u7.p19==1))"))))))
Formula 4 simplified : !GXGX"((i4.u12.p37==0)||(i2.u7.p19==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
2 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.206001,25976,1,0,15766,273,970,25656,179,713,35377
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X("((i2.u11.p41==0)||(i1.u3.p12==1))")))
Formula 5 simplified : !X"((i2.u11.p41==0)||(i1.u3.p12==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,0.206671,26240,1,0,15766,273,975,25656,179,713,35387
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(!(X(G(X("(i3.u8.p23==1)")))))))))
Formula 6 simplified : !FXF!XGX"(i3.u8.p23==1)"
Computing Next relation with stutter on 1 deadlock states
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.207593,26240,1,0,15766,273,995,25656,180,713,35404
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((((G(X(("((i2.u2.p6==0)||(i3.u8.p23==1))")U((F("((i3.u8.p24==0)||(i4.u12.p37==1))"))U("((i4.u13.p32==0)||(i3.u8.p23==1))")))))||(!(X("((i5.u19.p50==0)||(i1.u6.p17==1))"))))||("(i3.u8.p24==0)"))||("(i4.u12.p37==1)"))))
Formula 7 simplified : !G("(i3.u8.p24==0)" | "(i4.u12.p37==1)" | GX("((i2.u2.p6==0)||(i3.u8.p23==1))" U (F"((i3.u8.p24==0)||(i4.u12.p37==1))" U "((i4.u13.p32==0)||(i3.u8.p23==1))")) | !X"((i5.u19.p50==0)||(i1.u6.p17==1))")
Computing Next relation with stutter on 1 deadlock states
100 unique states visited
0 strongly connected components in search stack
125 transitions explored
56 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,0.257629,28076,1,0,19960,289,1076,31479,181,833,45482
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001B-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-28 01:43:29] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-28 01:43:29] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-28 01:43:29] [WARNING] Script execution failed on command (assert (and (>= (select s0 5) 1) (= (store (store (store s0 5 (- (select s0 5) 1)) 6 (+ (select s0 6) 1)) 42 (+ (select s0 42) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 5) 1) (= (store (store (store s0 5 (- (select s0 5) 1)) 6 (+ (select s0 6) 1)) 42 (+ (select s0 42) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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:43:29] [INFO ] Built C files in 501ms 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 1590630209189
--------------------
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-001B"
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-001B, 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-159033476400929"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001B.tgz
mv ShieldRVt-PT-001B 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 ;