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.r200-ebro-155286406100043.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 itstoolsm
Input is ResAllocation-PT-R003C010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r200-ebro-155286406100043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 4.3K Feb 12 14:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 14:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 16:24 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.4K Feb 5 01:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K Feb 5 01:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 12:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 12:59 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 68K 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-R003C010-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553667981987

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((false))
Formula 0 simplified : 1
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 60 cols
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t11, t12, t19, t20, t27, t28, t35, t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/10/40
Computing Next relation with stutter on 16 deadlock states
invariant :p_6_2 + r_6_2 + -1'r_7_2 + r_8_2 + -1'r_9_2 = 0
invariant :p_3_2 + r_3_2 + -1'r_4_2 + r_5_2 + -1'r_6_2 + r_7_2 + -1'r_8_2 + r_9_2 = 1
invariant :p_4_2 + r_4_2 + -1'r_5_2 + r_6_2 + -1'r_7_2 + r_8_2 + -1'r_9_2 = 0
invariant :p_5_2 + r_5_2 + -1'r_6_2 + r_7_2 + -1'r_8_2 + r_9_2 = 1
invariant :p_1_1 + r_1_1 + -1'r_2_1 + r_3_1 + -1'r_4_1 + r_5_1 + -1'r_6_1 + r_7_1 + -1'r_8_1 + r_9_1 = 1
invariant :p_7_2 + r_7_2 + -1'r_8_2 + r_9_2 = 1
invariant :p_9_2 + r_9_2 = 1
invariant :p_0_0 + r_0_0 + -1'r_1_0 + r_2_0 + -1'r_3_0 + r_4_0 + -1'r_5_0 + r_6_0 + -1'r_7_0 + r_8_0 + -1'r_9_0 = 0
invariant :p_9_1 + r_9_1 = 1
invariant :p_9_0 + r_9_0 = 1
invariant :p_6_1 + r_6_1 + -1'r_7_1 + r_8_1 + -1'r_9_1 = 0
invariant :p_8_0 + r_8_0 + -1'r_9_0 = 0
invariant :p_8_2 + r_8_2 + -1'r_9_2 = 0
invariant :p_2_0 + r_2_0 + -1'r_3_0 + r_4_0 + -1'r_5_0 + r_6_0 + -1'r_7_0 + r_8_0 + -1'r_9_0 = 0
invariant :p_2_2 + r_2_2 + -1'r_3_2 + r_4_2 + -1'r_5_2 + r_6_2 + -1'r_7_2 + r_8_2 + -1'r_9_2 = 0
invariant :p_8_1 + r_8_1 + -1'r_9_1 = 0
invariant :p_1_2 + r_1_2 + -1'r_2_2 + r_3_2 + -1'r_4_2 + r_5_2 + -1'r_6_2 + r_7_2 + -1'r_8_2 + r_9_2 = 1
invariant :p_3_1 + r_3_1 + -1'r_4_1 + r_5_1 + -1'r_6_1 + r_7_1 + -1'r_8_1 + r_9_1 = 1
invariant :p_1_0 + r_1_0 + -1'r_2_0 + r_3_0 + -1'r_4_0 + r_5_0 + -1'r_6_0 + r_7_0 + -1'r_8_0 + r_9_0 = 1
invariant :p_3_0 + r_3_0 + -1'r_4_0 + r_5_0 + -1'r_6_0 + r_7_0 + -1'r_8_0 + r_9_0 = 1
invariant :p_5_0 + r_5_0 + -1'r_6_0 + r_7_0 + -1'r_8_0 + r_9_0 = 1
invariant :p_0_1 + r_0_1 + -1'r_1_1 + r_2_1 + -1'r_3_1 + r_4_1 + -1'r_5_1 + r_6_1 + -1'r_7_1 + r_8_1 + -1'r_9_1 = 0
invariant :p_5_1 + r_5_1 + -1'r_6_1 + r_7_1 + -1'r_8_1 + r_9_1 = 1
invariant :p_2_1 + r_2_1 + -1'r_3_1 + r_4_1 + -1'r_5_1 + r_6_1 + -1'r_7_1 + r_8_1 + -1'r_9_1 = 0
invariant :p_6_0 + r_6_0 + -1'r_7_0 + r_8_0 + -1'r_9_0 = 0
invariant :p_0_2 + r_0_2 + -1'r_1_2 + r_2_2 + -1'r_3_2 + r_4_2 + -1'r_5_2 + r_6_2 + -1'r_7_2 + r_8_2 + -1'r_9_2 = 0
invariant :p_7_0 + r_7_0 + -1'r_8_0 + r_9_0 = 1
invariant :p_4_0 + r_4_0 + -1'r_5_0 + r_6_0 + -1'r_7_0 + r_8_0 + -1'r_9_0 = 0
invariant :p_4_1 + r_4_1 + -1'r_5_1 + r_6_1 + -1'r_7_1 + r_8_1 + -1'r_9_1 = 0
invariant :p_7_1 + r_7_1 + -1'r_8_1 + r_9_1 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.203833,20752,1,0,102,31293,103,46,1937,18798,97
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((F("(((r_7_0>=1)&&(p_7_1>=1))&&(r_6_0>=1))"))U("(p_1_0>=1)"))U(G(G(F("((r_1_2>=1)&&(r_0_2>=1))"))))))
Formula 1 simplified : !((F"(((r_7_0>=1)&&(p_7_1>=1))&&(r_6_0>=1))" U "(p_1_0>=1)") U GF"((r_1_2>=1)&&(r_0_2>=1))")
Computing Next relation with stutter on 16 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.21794,22564,1,0,104,32976,112,48,1940,20563,108
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(X(F(G("(((r_3_0>=1)&&(p_3_1>=1))&&(r_2_0>=1))")))))))
Formula 2 simplified : !FGXFG"(((r_3_0>=1)&&(p_3_1>=1))&&(r_2_0>=1))"
Computing Next relation with stutter on 16 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.230752,22768,1,0,106,34484,125,51,1946,22877,124
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("((r_9_2>=1)&&(r_8_2>=1))")))
Formula 3 simplified : !G"((r_9_2>=1)&&(r_8_2>=1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.379245,26728,1,0,167,54178,131,109,1949,51731,275
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(G(F(("(((p_8_1>=1)&&(r_8_2>=1))&&(r_7_2>=1))")U("((p_0_1>=1)&&(r_0_2>=1))"))))))
Formula 4 simplified : !FGF("(((p_8_1>=1)&&(r_8_2>=1))&&(r_7_2>=1))" U "((p_0_1>=1)&&(r_0_2>=1))")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.399088,26972,1,0,168,55353,140,110,1951,53082,284
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(("((p_0_0>=1)&&(r_0_1>=1))")U(F(F("((r_7_2>=1)&&(r_6_2>=1))"))))))
Formula 5 simplified : !G("((p_0_0>=1)&&(r_0_1>=1))" U F"((r_7_2>=1)&&(r_6_2>=1))")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.402289,27196,1,0,170,55664,149,112,1954,53505,295
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F("(((p_2_1>=1)&&(r_2_2>=1))&&(r_1_2>=1))"))))
Formula 6 simplified : !F"(((p_2_1>=1)&&(r_2_2>=1))&&(r_1_2>=1))"
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.527487,30940,1,0,231,77146,158,183,1958,86453,452
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(X(F(X("(((r_5_1>=1)&&(p_5_2>=1))&&(r_4_1>=1))"))))))
Formula 7 simplified : !FXFX"(((r_5_1>=1)&&(p_5_2>=1))&&(r_4_1>=1))"
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,0.682835,34636,1,0,292,94273,167,253,1963,114652,605
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(X("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"))))
Formula 8 simplified : !GX"(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"
Computing Next relation with stutter on 16 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.686124,34900,1,0,292,94286,173,253,1969,114673,612
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F("(p_5_0>=1)")))
Formula 9 simplified : !F"(p_5_0>=1)"
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.784113,36748,1,0,323,101953,182,285,1970,125479,766
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((false))
Formula 10 simplified : 1
Computing Next relation with stutter on 16 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,0.784473,36748,1,0,323,101953,182,285,1970,125479,766
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((G(("(((r_3_1>=1)&&(p_3_2>=1))&&(r_2_1>=1))")U("(r_0_0>=1)")))U(("(((r_7_1>=1)&&(p_7_2>=1))&&(r_6_1>=1))")U(F("(((r_7_1>=1)&&(p_7_2>=1))&&(r_6_1>=1))")))))
Formula 11 simplified : !(G("(((r_3_1>=1)&&(p_3_2>=1))&&(r_2_1>=1))" U "(r_0_0>=1)") U ("(((r_7_1>=1)&&(p_7_2>=1))&&(r_6_1>=1))" U F"(((r_7_1>=1)&&(p_7_2>=1))&&(r_6_1>=1))"))
Computing Next relation with stutter on 16 deadlock states
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.863575,38332,1,0,386,108633,191,356,1975,136129,923
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G((("(p_1_0>=1)")U("(((r_9_1>=1)&&(p_9_2>=1))&&(r_8_1>=1))"))U(F(X("((r_9_2>=1)&&(r_8_2>=1))"))))))
Formula 12 simplified : !G(("(p_1_0>=1)" U "(((r_9_1>=1)&&(p_9_2>=1))&&(r_8_1>=1))") U FX"((r_9_2>=1)&&(r_8_2>=1))")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.866265,38512,1,0,388,108695,197,359,1975,136306,936
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G(F(G("((r_3_2>=1)&&(r_2_2>=1))"))))))
Formula 13 simplified : !FGFG"((r_3_2>=1)&&(r_2_2>=1))"
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24 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.09618,45344,1,0,475,147666,210,447,1977,193263,1150
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(G(G(F(X("((r_4_0>=1)&&(r_3_0>=1))")))))))
Formula 14 simplified : !XGFX"((r_4_0>=1)&&(r_3_0>=1))"
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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,1.10665,45600,1,0,477,148792,219,450,1979,195028,1165
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(F(G("(p_8_2>=1)")))))
Formula 15 simplified : !FG"(p_8_2>=1)"
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.2377,47712,1,0,643,157083,232,580,1980,214285,1478
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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 1553667987843

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 27, 2019 6:26:24 AM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 92 ms
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 60 places.
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
Mar 27, 2019 6:26:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 64 ms
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 29 ms
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 40 transitions.
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 60 places.
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 40 transitions.
Mar 27, 2019 6:26:25 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 40 transitions.
Mar 27, 2019 6:26:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 27, 2019 6:26:25 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 28 ms
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 60 variables to be positive in 659 ms
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 40 transitions.
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/40 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 40 transitions.
Mar 27, 2019 6:26:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 6:26:27 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 27, 2019 6:26:27 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error
Mar 27, 2019 6:26:27 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (not (and (and (>= (select s0 50) 1) (>= (select s0 53) 1)) (>= (select s0 47) 1)))) with error
Mar 27, 2019 6:26:27 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s1 50) 1) (>= (select s1 53) 1)) (>= (select s1 47) 1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s1 50) 1) (>= (select s1 53) 1)) (>= (select s1 47) 1))")
Mar 27, 2019 6:26:27 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (>= (select s0 45) 1) (>= (select s0 46) 1)) (>= (select s0 39) 1)) (= (store (store (store (store (store (store s0 44 (+ (select s0 44) 1)) 47 (+ (select s0 47) 1)) 46 (- (select s0 46) 1)) 39 (- (select s0 39) 1)) 41 (+ (select s0 41) 1)) 45 (- (select s0 45) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (and (>= (select s0 45) 1) (>= (select s0 46) 1)) (>= (select s0 39) 1)) (= (store (store (store (store (store (store s0 44 (+ (select s0 44) 1)) 47 (+ (select s0 47) 1)) 46 (- (select s0 46) 1)) 39 (- (select s0 39) 1)) 41 (+ (select s0 41) 1)) 45 (- (select s0 45) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 27, 2019 6:26:27 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1594ms 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-R003C010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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 itstoolsm"
echo " Input is ResAllocation-PT-R003C010, 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 r200-ebro-155286406100043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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