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.r066-tajo-158922814600633.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 DiscoveryGPU-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600633
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.8K Mar 31 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 23:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 23:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-00
FORMULA_NAME DiscoveryGPU-PT-09a-01
FORMULA_NAME DiscoveryGPU-PT-09a-02
FORMULA_NAME DiscoveryGPU-PT-09a-03
FORMULA_NAME DiscoveryGPU-PT-09a-04
FORMULA_NAME DiscoveryGPU-PT-09a-05
FORMULA_NAME DiscoveryGPU-PT-09a-06
FORMULA_NAME DiscoveryGPU-PT-09a-07
FORMULA_NAME DiscoveryGPU-PT-09a-08
FORMULA_NAME DiscoveryGPU-PT-09a-09
FORMULA_NAME DiscoveryGPU-PT-09a-10
FORMULA_NAME DiscoveryGPU-PT-09a-11
FORMULA_NAME DiscoveryGPU-PT-09a-12
FORMULA_NAME DiscoveryGPU-PT-09a-13
FORMULA_NAME DiscoveryGPU-PT-09a-14
FORMULA_NAME DiscoveryGPU-PT-09a-15

=== Now, execution of the tool begins

BK_START 1590130033978

[2020-05-22 06:47:15] [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-22 06:47:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:47:15] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-05-22 06:47:15] [INFO ] Transformed 93 places.
[2020-05-22 06:47:15] [INFO ] Transformed 127 transitions.
[2020-05-22 06:47:15] [INFO ] Found NUPN structural information;
[2020-05-22 06:47:15] [INFO ] Parsed PT model containing 93 places and 127 transitions in 81 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 1037 resets, run finished after 147 ms. (steps per millisecond=680 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 06:47:15] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 93 cols
[2020-05-22 06:47:15] [INFO ] Computed 2 place invariants in 4 ms
[2020-05-22 06:47:15] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-05-22 06:47:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:47:16] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-05-22 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned unsat
[2020-05-22 06:47:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 06:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:47:16] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-22 06:47:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:47:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 06:47:16] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 06:47:16] [INFO ] Flatten gal took : 32 ms
FORMULA DiscoveryGPU-PT-09a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:47:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 06:47:16] [INFO ] Flatten gal took : 11 ms
[2020-05-22 06:47:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-09a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:47:16] [INFO ] Applying decomposition
[2020-05-22 06:47:16] [INFO ] Flatten gal took : 18 ms
[2020-05-22 06:47:16] [INFO ] Input system was already deterministic with 127 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/graph7243742159711986217.txt, -o, /tmp/graph7243742159711986217.bin, -w, /tmp/graph7243742159711986217.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/graph7243742159711986217.bin, -l, -1, -v, -w, /tmp/graph7243742159711986217.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 118 out of 127 initially.
// Phase 1: matrix 118 rows 93 cols
[2020-05-22 06:47:16] [INFO ] Computed 2 place invariants in 2 ms
inv : p0 + p92 = 1
inv : p0 + p91 = 1
Total of 2 invariants.
[2020-05-22 06:47:16] [INFO ] Computed 2 place invariants in 3 ms
[2020-05-22 06:47:16] [INFO ] Decomposing Gal with order
[2020-05-22 06:47:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:47:16] [INFO ] Removed a total of 74 redundant transitions.
[2020-05-22 06:47:16] [INFO ] Flatten gal took : 34 ms
[2020-05-22 06:47:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 10 ms.
[2020-05-22 06:47:16] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-22 06:47:16] [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 : !((("((i9.u28.p74==0)||(i6.u15.p41==1))")U(G("((i3.u9.p27!=0)&&(i5.u12.p34!=1))"))))
Formula 0 simplified : !("((i9.u28.p74==0)||(i6.u15.p41==1))" U G"((i3.u9.p27!=0)&&(i5.u12.p34!=1))")
[2020-05-22 06:47:16] [INFO ] Proved 93 variables to be positive in 150 ms
[2020-05-22 06:47:16] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2020-05-22 06:47:16] [INFO ] Computation of disable matrix completed :0/127 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:47:16] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:47:16] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2020-05-22 06:47:16] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.t117, i1.u1.t118, i2.u5.t120, i3.u9.t115, i4.u3.t119, i4.u7.t116, i4.u11.t121, i4.u31.t110, i5.u13.t122, i6.u15.t114, i6.u17.t113, i7.u19.t123, i7.u21.t124, i8.i0.u23.t112, i8.i1.u25.t111, i9.u27.t125, i9.u29.t126, i10.u33.t109, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/79/18/97
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
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.102812,20016,1,0,7857,208,1352,15255,163,800,13628
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F("((i9.u27.p72!=0)&&(i2.u6.p0!=1))")))))
Formula 1 simplified : !XXF"((i9.u27.p72!=0)&&(i2.u6.p0!=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.119507,21064,1,0,10268,209,1401,18689,163,822,18612
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!((X("((i10.u34.p89==0)||(i10.u32.p84==1))"))U(G("((i9.u28.p74==0)||(i10.u32.p84==1))")))))
Formula 2 simplified : X"((i10.u34.p89==0)||(i10.u32.p84==1))" U G"((i9.u28.p74==0)||(i10.u32.p84==1))"
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.126231,21856,1,0,10835,209,1449,19699,164,825,19877
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F((F(((X("((i7.u19.p53==0)||(i4.u31.p83==1))"))U(F("((i7.u19.p52==0)||(i9.u30.p80==1))")))U("(i7.u20.p54==1)")))U(G("(((i7.u19.p53==0)||(i4.u31.p83==1))&&((i5.u14.p39==0)||(i8.i0.u24.p65==1)))"))))))
Formula 3 simplified : !GF(F((X"((i7.u19.p53==0)||(i4.u31.p83==1))" U F"((i7.u19.p52==0)||(i9.u30.p80==1))") U "(i7.u20.p54==1)") U G"(((i7.u19.p53==0)||(i4.u31.p83==1))&&((i5.u14.p39==0)||(i8.i0.u24.p65==1)))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
23 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.346082,31340,1,0,32210,212,1497,65902,167,878,46291
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(X((G("((i3.u8.p24==0)||(i9.u28.p74==1))"))&&("((i3.u9.p26==0)||(i10.u32.p84==1))"))))))
Formula 4 simplified : !XXX("((i3.u9.p26==0)||(i10.u32.p84==1))" & G"((i3.u8.p24==0)||(i9.u28.p74==1))")
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.388753,33616,1,0,37319,214,1544,72392,167,913,54672
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(G("(i8.i1.u26.p70==1)")))))
Formula 5 simplified : !X!G"(i8.i1.u26.p70==1)"
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.390436,33616,1,0,37413,214,1569,72487,168,913,54975
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G((G(!(G("((i4.u3.p13!=1)||((i5.u12.p35!=0)&&(i3.u9.p26!=1)))"))))||(G("(i4.u3.p13==1)"))))))
Formula 6 simplified : !XG(G!G"((i4.u3.p13!=1)||((i5.u12.p35!=0)&&(i3.u9.p26!=1)))" | G"(i4.u3.p13==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
10 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.490832,38624,1,0,47863,222,1626,96031,168,985,67066
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(((X("((i2.u6.p20!=0)&&(i9.u28.p74!=1))"))||("(i5.u12.p35==0)"))||("(i6.u18.p48==1)")))))
Formula 7 simplified : !GX("(i5.u12.p35==0)" | "(i6.u18.p48==1)" | X"((i2.u6.p20!=0)&&(i9.u28.p74!=1))")
Computing Next relation with stutter on 1 deadlock states
13 unique states visited
7 strongly connected components in search stack
16 transitions explored
13 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.538957,40380,1,0,52168,222,1703,101347,169,987,75470
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:47:17] [INFO ] Computing symmetric co enabling matrix : 127 transitions.
[2020-05-22 06:47:17] [WARNING] Script execution failed on command (assert (and (>= (select s0 19) 1) (>= (select s0 91) 1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 19) 1) (>= (select s0 91) 1))")
[(assert (and (>= (select s0 19) 1) (>= (select s0 91) 1)))]
Skipping mayMatrices nes/nds SMT solver raised an exception.
java.lang.RuntimeException: SMT solver raised an exception.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:477)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-22 06:47:17] [INFO ] Built C files in 891ms 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 1590130037506

--------------------
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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r066-tajo-158922814600633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a 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 ;