About the Execution of ITS-Tools for HouseConstruction-PT-00002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15715.190 | 5828.00 | 11886.00 | 387.40 | FTTFFTTTFTTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r096-oct2-158940144600137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HouseConstruction-PT-00002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940144600137
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 2.8K Apr 4 20:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 4 20:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 4 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 21:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 3 21:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 3 14:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 3 14:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00002-00
FORMULA_NAME HouseConstruction-PT-00002-01
FORMULA_NAME HouseConstruction-PT-00002-02
FORMULA_NAME HouseConstruction-PT-00002-03
FORMULA_NAME HouseConstruction-PT-00002-04
FORMULA_NAME HouseConstruction-PT-00002-05
FORMULA_NAME HouseConstruction-PT-00002-06
FORMULA_NAME HouseConstruction-PT-00002-07
FORMULA_NAME HouseConstruction-PT-00002-08
FORMULA_NAME HouseConstruction-PT-00002-09
FORMULA_NAME HouseConstruction-PT-00002-10
FORMULA_NAME HouseConstruction-PT-00002-11
FORMULA_NAME HouseConstruction-PT-00002-12
FORMULA_NAME HouseConstruction-PT-00002-13
FORMULA_NAME HouseConstruction-PT-00002-14
FORMULA_NAME HouseConstruction-PT-00002-15
=== Now, execution of the tool begins
BK_START 1589551466578
[2020-05-15 14:04:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 14:04:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 14:04:29] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-05-15 14:04:29] [INFO ] Transformed 26 places.
[2020-05-15 14:04:29] [INFO ] Transformed 18 transitions.
[2020-05-15 14:04:29] [INFO ] Parsed PT model containing 26 places and 18 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 1850 resets, run finished after 183 ms. (steps per millisecond=546 ) properties seen :[1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 26 cols
[2020-05-15 14:04:30] [INFO ] Computed 8 place invariants in 2 ms
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-15 14:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-15 14:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-05-15 14:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-05-15 14:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 31 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-05-15 14:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2020-05-15 14:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2020-05-15 14:04:30] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-15 14:04:30] [INFO ] Flatten gal took : 21 ms
FORMULA HouseConstruction-PT-00002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 14:04:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 14:04:30] [INFO ] Flatten gal took : 4 ms
[2020-05-15 14:04:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HouseConstruction-PT-00002-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 14:04:30] [INFO ] Applying decomposition
[2020-05-15 14:04:30] [INFO ] Flatten gal took : 14 ms
[2020-05-15 14:04:30] [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/graph10324322371639932247.txt, -o, /tmp/graph10324322371639932247.bin, -w, /tmp/graph10324322371639932247.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/graph10324322371639932247.bin, -l, -1, -v, -w, /tmp/graph10324322371639932247.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 26 cols
[2020-05-15 14:04:30] [INFO ] Computed 8 place invariants in 1 ms
inv : p4 - p5 - p13 - p17 - p14 - p18 - p26 - p21 + p25 + p16 = 0
inv : p9 + p10 - p13 = 0
inv : p6 - p5 + p12 - p13 = 0
inv : p19 - p18 + p22 - p21 + p23 = 0
inv : p6 - p5 + p7 + p15 + p11 - p13 - p17 - p14 - p18 - p26 - p21 + p25 + p16 = 0
inv : p6 - p5 + p8 + p10 - p13 = 0
inv : p20 - p18 + p22 - p21 + p23 = 0
inv : p27 - p26 - p23 = 0
Total of 8 invariants.
[2020-05-15 14:04:30] [INFO ] Computed 8 place invariants in 2 ms
[2020-05-15 14:04:30] [INFO ] Decomposing Gal with order
[2020-05-15 14:04:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 14:04:31] [INFO ] Flatten gal took : 64 ms
[2020-05-15 14:04:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-15 14:04:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 8 ms
[2020-05-15 14:04:31] [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 8 LTL properties
Checking formula 0 : !(((!(G("(gu0.p2>=1)")))U(F(G(!(F("((gu0.p2>=1)&&(gu1.p23>=0))")))))))
Formula 0 simplified : !(!G"(gu0.p2>=1)" U FG!F"((gu0.p2>=1)&&(gu1.p23>=0))")
[2020-05-15 14:04:31] [INFO ] Proved 26 variables to be positive in 284 ms
[2020-05-15 14:04:31] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-15 14:04:31] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 14:04:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 14:04:31] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-15 14:04:31] [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 t18, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
14 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.191319,21828,1,0,280,26431,64,251,665,31932,684
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(F(G(F("(gu7.p21<=gu7.p13)")))))))
Formula 1 simplified : !GXFGF"(gu7.p21<=gu7.p13)"
Computing Next relation with stutter on 1 deadlock states
62 unique states visited
0 strongly connected components in search stack
72 transitions explored
37 items max in DFS search stack
8 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.264941,24452,1,0,484,37944,77,402,704,51200,1490
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G(((F(X("(gu1.p3<=gu1.p5)")))||(G("(gu1.p3<=gu1.p5)")))&&("(gu1.p3<=gu1.p5)")))&&("(gi3.gu4.p14<=gi3.gu4.p7)"))))
Formula 2 simplified : !G("(gi3.gu4.p14<=gi3.gu4.p7)" & G("(gu1.p3<=gu1.p5)" & (FX"(gu1.p3<=gu1.p5)" | G"(gu1.p3<=gu1.p5)")))
Computing Next relation with stutter on 1 deadlock states
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.269011,25312,1,0,492,38160,92,410,716,51763,1521
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((G((G("(gu1.p5>=1)"))&&("(gu6.p18<=gu6.p26)")))||(X("(gu1.p5>=1)")))))
Formula 3 simplified : !F(G("(gu6.p18<=gu6.p26)" & G"(gu1.p5>=1)") | X"(gu1.p5>=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.271296,25312,1,0,505,38353,101,421,717,52315,1559
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(F("(gu2.p8<=gu2.p11)")))))
Formula 4 simplified : !XF"(gu2.p8<=gu2.p11)"
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.271641,25516,1,0,505,38353,110,421,721,52317,1563
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00002-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F((F("(gu2.p15>=2)"))&&("(gu2.p15>=2)")))&&(G("(gi3.gu3.p10>=1)")))))
Formula 5 simplified : !X(F("(gu2.p15>=2)" & F"(gu2.p15>=2)") & G"(gi3.gu3.p10>=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
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.286673,25668,1,0,505,38392,121,421,728,52437,1572
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(!(X("(gu1.p3<=gu1.p23)")))))
Formula 6 simplified : !G!X"(gu1.p3<=gu1.p23)"
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
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.287247,25668,1,0,505,38392,127,421,731,52438,1577
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(!(F(X(F("(gu2.p12<=gu2.p8)"))))))U(G("(gu1.p23>=1)"))))
Formula 7 simplified : !(F!FXF"(gu2.p12<=gu2.p8)" U G"(gu1.p23>=1)")
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
35 transitions explored
35 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.301164,25996,1,0,651,39404,133,579,732,56090,2108
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HouseConstruction-PT-00002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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-15 14:04:31] [INFO ] Built C files in 669ms 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 1589551472406
--------------------
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="HouseConstruction-PT-00002"
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 HouseConstruction-PT-00002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-oct2-158940144600137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00002.tgz
mv HouseConstruction-PT-00002 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 ;