Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r151-ebro-155286406200106.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
Input is ResAllocation-PT-R015C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-ebro-155286406200106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.9K Feb 12 14:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 14:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 8 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 61K Mar 10 17:31 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-R015C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553107140206

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(G(G("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")))))
Formula 0 simplified : !G"(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"
Reverse transition relation is NOT exact ! Due to transitions t_0_15, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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.135013,18588,1,0,79,11544,93,39,1837,9074,89
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((X("((p_0_2>=1)&&(r_0_3>=1))"))U(X("((p_0_1>=1)&&(r_0_2>=1))")))U(F(F(F("((p_0_2>=1)&&(r_0_3>=1))"))))))
Formula 1 simplified : !((X"((p_0_2>=1)&&(r_0_3>=1))" U X"((p_0_1>=1)&&(r_0_2>=1))") U F"((p_0_2>=1)&&(r_0_3>=1))")
Computing Next relation with stutter on 14 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.364122,24436,1,0,334,44796,102,315,1840,57533,696
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(G("(((r_1_12>=1)&&(p_1_13>=1))&&(r_0_12>=1))"))))
Formula 2 simplified : !G"(((r_1_12>=1)&&(p_1_13>=1))&&(r_0_12>=1))"
Computing Next relation with stutter on 14 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.366222,24700,1,0,334,44796,108,315,1846,57534,701
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((G(X(F("((p_0_2>=1)&&(r_0_3>=1))"))))U(G(F(X("((p_0_8>=1)&&(r_0_9>=1))"))))))
Formula 3 simplified : !(GXF"((p_0_2>=1)&&(r_0_3>=1))" U GFX"((p_0_8>=1)&&(r_0_9>=1))")
Computing Next relation with stutter on 14 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 60 cols
invariant :p_0_8 + r_0_8 + -1'r_1_8 = 0
invariant :p_1_7 + r_1_7 = 1
invariant :p_0_1 + r_0_1 + -1'r_1_1 = 0
invariant :p_1_3 + r_1_3 = 1
invariant :p_0_13 + r_0_13 + -1'r_1_13 = 0
invariant :p_1_6 + r_1_6 = 1
invariant :p_0_7 + r_0_7 + -1'r_1_7 = 0
invariant :p_1_0 + r_1_0 = 1
invariant :p_1_14 + r_1_14 = 1
invariant :p_1_13 + r_1_13 = 1
invariant :p_1_12 + r_1_12 = 1
invariant :p_1_11 + r_1_11 = 1
invariant :p_0_5 + r_0_5 + -1'r_1_5 = 0
invariant :p_1_2 + r_1_2 = 1
invariant :p_0_12 + r_0_12 + -1'r_1_12 = 0
invariant :p_0_4 + r_0_4 + -1'r_1_4 = 0
invariant :p_1_5 + r_1_5 = 1
invariant :p_1_10 + r_1_10 = 1
invariant :p_0_11 + r_0_11 + -1'r_1_11 = 0
invariant :p_1_9 + r_1_9 = 1
invariant :p_0_14 + r_0_14 + -1'r_1_14 = 0
invariant :p_0_2 + r_0_2 + -1'r_1_2 = 0
invariant :p_0_6 + r_0_6 + -1'r_1_6 = 0
invariant :p_0_10 + r_0_10 + -1'r_1_10 = 0
invariant :p_1_4 + r_1_4 = 1
invariant :p_0_9 + r_0_9 + -1'r_1_9 = 0
invariant :p_1_1 + r_1_1 = 1
invariant :p_1_8 + r_1_8 = 1
invariant :p_0_3 + r_0_3 + -1'r_1_3 = 0
invariant :p_0_0 + r_0_0 + -1'r_1_0 = 0
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
17 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.538538,29260,1,0,514,67186,117,468,1849,85776,1089
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(X((X("((p_0_7>=1)&&(r_0_8>=1))"))U(G("((r_1_14>=1)&&(r_0_14>=1))"))))))
Formula 4 simplified : !FX(X"((p_0_7>=1)&&(r_0_8>=1))" U G"((r_1_14>=1)&&(r_0_14>=1))")
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
49 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,1.03461,40564,1,0,1509,122961,130,1247,1852,201757,2769
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("(r_0_0>=1)"))
Formula 5 simplified : !"(r_0_0>=1)"
Computing Next relation with stutter on 14 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.03531,40564,1,0,1509,122961,133,1247,1852,201757,2771
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X("(r_0_0>=1)"))))
Formula 6 simplified : !XX"(r_0_0>=1)"
Computing Next relation with stutter on 14 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
35 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,1.38323,46952,1,0,1657,159285,133,1456,1852,246111,3100
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((X("((p_0_2>=1)&&(r_0_3>=1))"))U(G("((p_0_3>=1)&&(r_0_4>=1))")))U(G(X("(p_1_0>=1)")))))
Formula 7 simplified : !((X"((p_0_2>=1)&&(r_0_3>=1))" U G"((p_0_3>=1)&&(r_0_4>=1))") U GX"(p_1_0>=1)")
Computing Next relation with stutter on 14 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,1.40898,48544,1,0,1665,161530,147,1463,1860,249140,3123
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("(((r_1_11>=1)&&(p_1_12>=1))&&(r_0_11>=1))"))
Formula 8 simplified : !"(((r_1_11>=1)&&(p_1_12>=1))&&(r_0_11>=1))"
Computing Next relation with stutter on 14 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,1.41003,48808,1,0,1665,161530,150,1463,1865,249141,3125
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(G(("(((r_1_12>=1)&&(p_1_13>=1))&&(r_0_12>=1))")U(G("(((r_1_9>=1)&&(p_1_10>=1))&&(r_0_9>=1))"))))))
Formula 9 simplified : !FG("(((r_1_12>=1)&&(p_1_13>=1))&&(r_0_12>=1))" U G"(((r_1_9>=1)&&(p_1_10>=1))&&(r_0_9>=1))")
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 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,1.41979,48808,1,0,1671,161995,168,1468,1883,249912,3153
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(X(G(F(X("(((r_1_4>=1)&&(p_1_5>=1))&&(r_0_4>=1))")))))))
Formula 10 simplified : !GXGFX"(((r_1_4>=1)&&(p_1_5>=1))&&(r_0_4>=1))"
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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,1.57784,52504,1,0,1841,186385,177,1621,1887,279992,3539
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F("((p_0_6>=1)&&(r_0_7>=1))")))
Formula 11 simplified : !F"((p_0_6>=1)&&(r_0_7>=1))"
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
32 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,1.89556,58048,1,0,2091,216955,186,1912,1890,328470,4140
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(F((F("(((r_1_7>=1)&&(p_1_8>=1))&&(r_0_7>=1))"))U(X("(r_0_0>=1)"))))))
Formula 12 simplified : !F(F"(((r_1_7>=1)&&(p_1_8>=1))&&(r_0_7>=1))" U X"(r_0_0>=1)")
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
39 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,2.28972,67176,1,0,2600,266348,192,2331,1890,407665,5198
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G("(((r_1_11>=1)&&(p_1_12>=1))&&(r_0_11>=1))")))
Formula 13 simplified : !G"(((r_1_11>=1)&&(p_1_12>=1))&&(r_0_11>=1))"
Computing Next relation with stutter on 14 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,2.29226,67440,1,0,2600,266348,195,2331,1891,407665,5201
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((("(((r_1_6>=1)&&(p_1_7>=1))&&(r_0_6>=1))")U(F(("((p_0_6>=1)&&(r_0_7>=1))")U("((p_0_13>=1)&&(r_0_14>=1))")))))
Formula 14 simplified : !("(((r_1_6>=1)&&(p_1_7>=1))&&(r_0_6>=1))" U F("((p_0_6>=1)&&(r_0_7>=1))" U "((p_0_13>=1)&&(r_0_14>=1))"))
Computing Next relation with stutter on 14 deadlock states
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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
46 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,2.75732,71928,1,0,2834,289715,204,2614,1893,445265,5790
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G("((p_0_13>=1)&&(r_0_14>=1))")))
Formula 15 simplified : !G"((p_0_13>=1)&&(r_0_14>=1))"
Computing Next relation with stutter on 14 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,2.76019,72192,1,0,2834,289715,207,2614,1893,445265,5793
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1553107147728

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ 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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 20, 2019 6:39:03 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 20, 2019 6:39:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 20, 2019 6:39:03 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 82 ms
Mar 20, 2019 6:39:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 60 places.
Mar 20, 2019 6:39:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 32 transitions.
Mar 20, 2019 6:39:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 18 ms
Mar 20, 2019 6:39:03 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 61 ms
Mar 20, 2019 6:39:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Mar 20, 2019 6:39:03 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 32 transitions.
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 69 ms
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 60 variables to be positive in 218 ms
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 32 transitions.
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 32 transitions.
Mar 20, 2019 6:39:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 20, 2019 6:39:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 32 transitions.
Mar 20, 2019 6:39:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 732 ms. Total solver calls (SAT/UNSAT): 60(45/15)
Mar 20, 2019 6:39:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 32 transitions.
Mar 20, 2019 6:39:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 68 ms. Total solver calls (SAT/UNSAT): 46(0/46)
Mar 20, 2019 6:39:06 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2454ms conformant to PINS in folder :/home/mcc/execution

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-R015C002"
export BK_EXAMINATION="LTLFireability"
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-3954"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R015C002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-ebro-155286406200106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R015C002.tgz
mv ResAllocation-PT-R015C002 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;