Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389100649.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R003C005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389100649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.3K May 14 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 07:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 35K May 12 20:53 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 ResAllocation-PT-R003C005-00
FORMULA_NAME ResAllocation-PT-R003C005-01
FORMULA_NAME ResAllocation-PT-R003C005-02
FORMULA_NAME ResAllocation-PT-R003C005-03
FORMULA_NAME ResAllocation-PT-R003C005-04
FORMULA_NAME ResAllocation-PT-R003C005-05
FORMULA_NAME ResAllocation-PT-R003C005-06
FORMULA_NAME ResAllocation-PT-R003C005-07
FORMULA_NAME ResAllocation-PT-R003C005-08
FORMULA_NAME ResAllocation-PT-R003C005-09
FORMULA_NAME ResAllocation-PT-R003C005-10
FORMULA_NAME ResAllocation-PT-R003C005-11
FORMULA_NAME ResAllocation-PT-R003C005-12
FORMULA_NAME ResAllocation-PT-R003C005-13
FORMULA_NAME ResAllocation-PT-R003C005-14
FORMULA_NAME ResAllocation-PT-R003C005-15

=== Now, execution of the tool begins

BK_START 1590538903787

[2020-05-27 00:21:46] [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-27 00:21:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:21:46] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-05-27 00:21:46] [INFO ] Transformed 30 places.
[2020-05-27 00:21:46] [INFO ] Transformed 20 transitions.
[2020-05-27 00:21:46] [INFO ] Parsed PT model containing 30 places and 20 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 7582 resets, run finished after 219 ms. (steps per millisecond=456 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 20 rows 30 cols
[2020-05-27 00:21:47] [INFO ] Computed 15 place invariants in 4 ms
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned unsat
[2020-05-27 00:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
[2020-05-27 00:21:47] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-27 00:21:47] [INFO ] Flatten gal took : 54 ms
FORMULA ResAllocation-PT-R003C005-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:21:47] [INFO ] Flatten gal took : 7 ms
[2020-05-27 00:21:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R003C005-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-27 00:21:47] [INFO ] Applying decomposition
[2020-05-27 00:21:47] [INFO ] Flatten gal took : 5 ms
Built C files in :
/home/mcc/execution
[2020-05-27 00:21:47] [INFO ] Input system was already deterministic with 20 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/graph16058612382348201425.txt, -o, /tmp/graph16058612382348201425.bin, -w, /tmp/graph16058612382348201425.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/graph16058612382348201425.bin, -l, -1, -v, -w, /tmp/graph16058612382348201425.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:21:47] [INFO ] Decomposing Gal with order
[2020-05-27 00:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 30 cols
[2020-05-27 00:21:47] [INFO ] Computed 15 place invariants in 1 ms
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_1_0 + r_1_0 + p_2_0 = 1
inv : p_1_2 + r_1_2 + p_2_2 = 1
inv : p_4_0 + r_4_0 = 1
inv : p_1_1 + r_1_1 + p_2_1 = 1
inv : p_4_2 + r_4_2 = 1
inv : p_2_2 + r_2_2 + p_3_2 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_3_2 + r_3_2 + p_4_2 = 1
inv : p_3_0 + r_3_0 + p_4_0 = 1
inv : p_2_1 + r_2_1 + p_3_1 = 1
inv : p_4_1 + r_4_1 = 1
inv : p_2_0 + r_2_0 + p_3_0 = 1
inv : p_3_1 + r_3_1 + p_4_1 = 1
Total of 15 invariants.
[2020-05-27 00:21:47] [INFO ] Computed 15 place invariants in 2 ms
[2020-05-27 00:21:47] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-27 00:21:48] [INFO ] Flatten gal took : 130 ms
[2020-05-27 00:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 00:21:48] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-27 00:21:48] [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 9 LTL properties
Checking formula 0 : !((F(X(G(!(F("(gu4.p_3_1<=gu4.r_2_0)")))))))
Formula 0 simplified : !FXG!F"(gu4.p_3_1<=gu4.r_2_0)"
Reverse transition relation is NOT exact ! Due to transitions gi0.gu1.t_0_3, gi4.gu10.t_4_3, gi4.t_2_3, t_1_0, t_3_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/5/20
Computing Next relation with stutter on 4 deadlock states
[2020-05-27 00:21:48] [INFO ] Proved 30 variables to be positive in 326 ms
[2020-05-27 00:21:48] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2020-05-27 00:21:48] [INFO ] Computation of disable matrix completed :0/20 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:21:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:21:48] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2020-05-27 00:21:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.089852,18936,1,0,140,13425,70,105,908,18438,223
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(((F(X(X(G(X("(gi1.gu6.p_0_0<=gi1.gu2.p_1_0)"))))))&&(F("(gi4.gu8.p_2_2>=1)")))&&(F("(gi1.gu6.p_0_0<=gi1.gu2.p_1_0)"))))))
Formula 1 simplified : !GX(FXXGX"(gi1.gu6.p_0_0<=gi1.gu2.p_1_0)" & F"(gi4.gu8.p_2_2>=1)" & F"(gi1.gu6.p_0_0<=gi1.gu2.p_1_0)")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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.102198,21016,1,0,143,14399,86,111,941,20080,248
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("(gu3.r_1_1>=1)"))&&(X(G("(gu4.p_1_2<=gu4.r_2_0)")))))
Formula 2 simplified : !(F"(gu3.r_1_1>=1)" & XG"(gu4.p_1_2<=gu4.r_2_0)")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.118913,21792,1,0,165,16924,98,148,946,24756,353
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G("(gi1.gu2.p_3_0>=1)"))))
Formula 3 simplified : !FG"(gi1.gu2.p_3_0>=1)"
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.148258,22320,1,0,227,21714,111,221,947,32660,528
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X(!(X(!(F("(gu3.p_1_1<=gu3.r_1_1)"))))))))
Formula 4 simplified : X!X!F"(gu3.p_1_1<=gu3.r_1_1)"
Computing Next relation with stutter on 4 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.160596,22840,1,0,258,24158,117,244,952,36628,589
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G("(gu4.r_2_0<=gu4.r_1_0)"))U((X(F("(gi4.gu8.p_4_0<=gi4.gu8.p_2_2)")))||(X("(gu4.r_2_0<=gu4.r_1_0)")))))
Formula 5 simplified : !(G"(gu4.r_2_0<=gu4.r_1_0)" U (XF"(gi4.gu8.p_4_0<=gi4.gu8.p_2_2)" | X"(gu4.r_2_0<=gu4.r_1_0)"))
Computing Next relation with stutter on 4 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.161618,23356,1,0,258,24158,124,244,960,36628,591
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C005-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X(G("(gi1.gu6.r_3_1<=gi1.gu6.p_0_0)"))))U(G(X(X(!(X("(gi1.gu6.r_3_1>gi1.gu6.p_0_0)"))))))))
Formula 6 simplified : !(XXG"(gi1.gu6.r_3_1<=gi1.gu6.p_0_0)" U GXX!X"(gi1.gu6.r_3_1>gi1.gu6.p_0_0)")
Computing Next relation with stutter on 4 deadlock states
7 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 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.191397,24140,1,0,268,27227,136,253,972,41281,626
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((X(F("(gu9.p_4_1<=gu9.r_4_1)")))||("((gi4.gu7.r_2_2<1)&&(gu9.p_4_1>gu9.r_4_1))")))))
Formula 7 simplified : !FX("((gi4.gu7.r_2_2<1)&&(gu9.p_4_1>gu9.r_4_1))" | XF"(gu9.p_4_1<=gu9.r_4_1)")
Computing Next relation with stutter on 4 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.198986,24404,1,0,301,28825,150,276,988,43877,693
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X((F(G("(gi1.gu2.p_3_0>gi1.gu2.r_3_0)")))||(F(G((G("(gi1.gu2.p_3_0<=gi1.gu2.p_1_0)"))||("(gi1.gu2.p_3_0<=gi1.gu2.p_1_0)"))))))))
Formula 8 simplified : X(FG"(gi1.gu2.p_3_0>gi1.gu2.r_3_0)" | FG("(gi1.gu2.p_3_0<=gi1.gu2.p_1_0)" | G"(gi1.gu2.p_3_0<=gi1.gu2.p_1_0)"))
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 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.201728,24404,1,0,303,29096,162,278,999,44228,706
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-12 FALSE 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-27 00:21:48] [INFO ] Built C files in 640ms 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 1590538908758

--------------------
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="ResAllocation-PT-R003C005"
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 ResAllocation-PT-R003C005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-csrt-159033389100649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C005.tgz
mv ResAllocation-PT-R003C005 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;