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-159033389100666.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-R003C015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389100666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.4K May 14 00:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:34 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.8K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 3.7K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 13 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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 107K 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-R003C015-00
FORMULA_NAME ResAllocation-PT-R003C015-01
FORMULA_NAME ResAllocation-PT-R003C015-02
FORMULA_NAME ResAllocation-PT-R003C015-03
FORMULA_NAME ResAllocation-PT-R003C015-04
FORMULA_NAME ResAllocation-PT-R003C015-05
FORMULA_NAME ResAllocation-PT-R003C015-06
FORMULA_NAME ResAllocation-PT-R003C015-07
FORMULA_NAME ResAllocation-PT-R003C015-08
FORMULA_NAME ResAllocation-PT-R003C015-09
FORMULA_NAME ResAllocation-PT-R003C015-10
FORMULA_NAME ResAllocation-PT-R003C015-11
FORMULA_NAME ResAllocation-PT-R003C015-12
FORMULA_NAME ResAllocation-PT-R003C015-13
FORMULA_NAME ResAllocation-PT-R003C015-14
FORMULA_NAME ResAllocation-PT-R003C015-15

=== Now, execution of the tool begins

BK_START 1590538994964

[2020-05-27 00:23:17] [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, -timeout, 3600]
[2020-05-27 00:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:23:17] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-05-27 00:23:17] [INFO ] Transformed 90 places.
[2020-05-27 00:23:17] [INFO ] Transformed 60 transitions.
[2020-05-27 00:23:17] [INFO ] Parsed PT model containing 90 places and 60 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1718 steps, including 53 resets, run visited all 41 properties in 39 ms. (steps per millisecond=44 )
[2020-05-27 00:23:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 00:23:17] [INFO ] Flatten gal took : 45 ms
FORMULA ResAllocation-PT-R003C015-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C015-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:23:17] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:23:17] [INFO ] Applying decomposition
[2020-05-27 00:23:17] [INFO ] Flatten gal took : 23 ms
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/graph13054403119511766940.txt, -o, /tmp/graph13054403119511766940.bin, -w, /tmp/graph13054403119511766940.weights], workingDir=null]
[2020-05-27 00:23:17] [INFO ] Input system was already deterministic with 60 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13054403119511766940.bin, -l, -1, -v, -w, /tmp/graph13054403119511766940.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:23:17] [INFO ] Decomposing Gal with order
[2020-05-27 00:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:23:17] [INFO ] Flatten gal took : 50 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 60 rows 90 cols
[2020-05-27 00:23:17] [INFO ] Computed 45 place invariants in 10 ms
inv : p_8_1 + r_8_1 + p_9_1 = 1
inv : p_5_1 + r_5_1 + p_6_1 = 1
inv : p_11_1 + r_11_1 + p_12_1 = 1
inv : p_2_2 + r_2_2 + p_3_2 = 1
inv : p_14_0 + r_14_0 = 1
inv : p_8_0 + r_8_0 + p_9_0 = 1
inv : p_8_2 + r_8_2 + p_9_2 = 1
inv : p_3_0 + r_3_0 + p_4_0 = 1
inv : p_11_0 + r_11_0 + p_12_0 = 1
inv : p_6_0 + r_6_0 + p_7_0 = 1
inv : p_5_2 + r_5_2 + p_6_2 = 1
inv : p_10_2 + r_10_2 + p_11_2 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_4_2 + r_4_2 + p_5_2 = 1
inv : p_9_0 + r_9_0 + p_10_0 = 1
inv : p_13_1 + r_13_1 + p_14_1 = 1
inv : p_10_1 + r_10_1 + p_11_1 = 1
inv : p_13_2 + r_13_2 + p_14_2 = 1
inv : p_4_1 + r_4_1 + p_5_1 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_5_0 + r_5_0 + p_6_0 = 1
inv : p_9_2 + r_9_2 + p_10_2 = 1
inv : p_9_1 + r_9_1 + p_10_1 = 1
inv : p_4_0 + r_4_0 + p_5_0 = 1
inv : p_12_2 + r_12_2 + p_13_2 = 1
inv : p_1_0 + r_1_0 + p_2_0 = 1
inv : p_10_0 + r_10_0 + p_11_0 = 1
inv : p_1_1 + r_1_1 + p_2_1 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_13_0 + r_13_0 + p_14_0 = 1
inv : p_3_2 + r_3_2 + p_4_2 = 1
inv : p_3_1 + r_3_1 + p_4_1 = 1
inv : p_14_1 + r_14_1 = 1
inv : p_12_0 + r_12_0 + p_13_0 = 1
inv : p_6_1 + r_6_1 + p_7_1 = 1
inv : p_1_2 + r_1_2 + p_2_2 = 1
inv : p_7_2 + r_7_2 + p_8_2 = 1
inv : p_14_2 + r_14_2 = 1
inv : p_12_1 + r_12_1 + p_13_1 = 1
inv : p_7_1 + r_7_1 + p_8_1 = 1
inv : p_6_2 + r_6_2 + p_7_2 = 1
inv : p_11_2 + r_11_2 + p_12_2 = 1
inv : p_2_1 + r_2_1 + p_3_1 = 1
inv : p_2_0 + r_2_0 + p_3_0 = 1
inv : p_7_0 + r_7_0 + p_8_0 = 1
Total of 45 invariants.
[2020-05-27 00:23:17] [INFO ] Computed 45 place invariants in 17 ms
[2020-05-27 00:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 00:23:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 00:23:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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/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.202005100927/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 14 LTL properties
Checking formula 0 : !(((("(i5.i0.u26.p_11_0>=1)")U("(i5.i2.u32.p_13_0>=1)"))U(X((G("(i5.i2.u32.p_13_0>=1)"))U((!(X("((i0.i0.u2.r_0_2>=1)&&(i0.i0.u5.r_1_2>=1))")))||("(((i1.u11.r_3_2>=1)&&(i1.u10.p_4_1>=1))&&(i3.u13.r_4_2>=1))"))))))
Formula 0 simplified : !(("(i5.i0.u26.p_11_0>=1)" U "(i5.i2.u32.p_13_0>=1)") U X(G"(i5.i2.u32.p_13_0>=1)" U ("(((i1.u11.r_3_2>=1)&&(i1.u10.p_4_1>=1))&&(i3.u13.r_4_2>=1))" | !X"((i0.i0.u2.r_0_2>=1)&&(i0.i0.u5.r_1_2>=1))")))
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-27 00:23:18] [INFO ] Proved 90 variables to be positive in 225 ms
[2020-05-27 00:23:18] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2020-05-27 00:23:18] [INFO ] Computation of disable matrix completed :0/60 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:23:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:23:18] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2020-05-27 00:23:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t_2_3, t_4_3, t_7_0, t_8_3, t_11_0, i0.i0.u2.t_0_3, i0.i1.t_1_0, i2.t_5_0, i2.i0.t_3_0, i3.t_6_3, i4.i0.t_9_0, i4.i1.t_10_3, i5.t_13_0, i5.i1.t_12_3, i5.i1.u35.t_14_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/45/15/60
Computing Next relation with stutter on 65 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
20 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.243408,25368,1,0,14568,767,1436,35112,277,2109,25156
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("(((i4.i0.u22.r_8_1>=1)&&(i4.i0.u24.r_9_1>=1))&&(i4.i1.u23.p_9_2>=1))"))U(F(G((G("(i0.i0.u2.p_0_2>=1)"))U(F(G("(i0.i1.u3.p_1_0<1)"))))))))
Formula 1 simplified : !(G"(((i4.i0.u22.r_8_1>=1)&&(i4.i0.u24.r_9_1>=1))&&(i4.i1.u23.p_9_2>=1))" U FG(G"(i0.i0.u2.p_0_2>=1)" U FG"(i0.i1.u3.p_1_0<1)"))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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.348654,29800,1,0,29171,771,1471,44317,277,2117,38749
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(((G("(((i5.i0.u30.r_12_0>=1)&&(i5.i2.u32.r_13_0>=1))&&(i5.i1.u33.p_13_1>=1))"))||(G("(i0.i1.u0.r_0_0>=1)")))U(!(G((!(X("(((i0.i0.u4.r_1_1>=1)&&(i0.i1.u3.p_2_0>=1))&&(i1.u7.r_2_1>=1))")))||(F("(i0.i1.u0.r_0_0>=1)"))))))))
Formula 2 simplified : !G((G"(((i5.i0.u30.r_12_0>=1)&&(i5.i2.u32.r_13_0>=1))&&(i5.i1.u33.p_13_1>=1))" | G"(i0.i1.u0.r_0_0>=1)") U !G(!X"(((i0.i0.u4.r_1_1>=1)&&(i0.i1.u3.p_2_0>=1))&&(i1.u7.r_2_1>=1))" | F"(i0.i1.u0.r_0_0>=1)"))
Computing Next relation with stutter on 65 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 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.394633,31636,1,0,35291,771,1531,48648,278,2120,44777
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(("((i2.i1.u14.r_5_0>=1)&&(i2.i1.u15.r_6_0>=1))")U("(((i0.i0.u1.r_0_1>=1)&&(i0.i0.u4.r_1_1>=1))&&(i0.i0.u5.p_1_2>=1))"))))
Formula 3 simplified : !G("((i2.i1.u14.r_5_0>=1)&&(i2.i1.u15.r_6_0>=1))" U "(((i0.i0.u1.r_0_1>=1)&&(i0.i0.u4.r_1_1>=1))&&(i0.i0.u5.p_1_2>=1))")
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.531523,36916,1,0,49698,772,1593,62370,278,2151,61370
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((!(G("((((i2.i0.u6.r_2_0>=1)&&(i2.i0.u9.r_3_0>=1))&&(i1.u10.p_3_1>=1))||((i5.i1.u31.r_12_2>=1)&&(i5.i1.u35.r_13_2>=1)))")))&&(("(i5.i1.u29.p_12_2>=1)")U(X("(i1.u8.p_2_2>=1)"))))&&(F(G("(i5.i1.u29.p_12_2>=1)")))))
Formula 4 simplified : !(!G"((((i2.i0.u6.r_2_0>=1)&&(i2.i0.u9.r_3_0>=1))&&(i1.u10.p_3_1>=1))||((i5.i1.u31.r_12_2>=1)&&(i5.i1.u35.r_13_2>=1)))" & ("(i5.i1.u29.p_12_2>=1)" U X"(i1.u8.p_2_2>=1)") & FG"(i5.i1.u29.p_12_2>=1)")
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
66 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.18981,54076,1,0,72596,924,1641,210014,278,2652,81943
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((((G("((i5.i1.u31.r_12_2>=1)&&(i5.i1.u35.r_13_2>=1))"))&&("(i5.i1.u31.r_12_2>=1)"))&&("(i5.i1.u35.r_13_2>=1)"))U(("(((i2.i0.u12.r_4_0>=1)&&(i2.i1.u14.r_5_0>=1))&&(i3.u13.p_5_1>=1))")&&((X(X("(((i2.i0.u12.r_4_0>=1)&&(i2.i1.u14.r_5_0>=1))&&(i3.u13.p_5_1>=1))")))||("(((i5.i1.u29.r_11_2>=1)&&(i5.i0.u27.p_12_1>=1))&&(i5.i1.u31.r_12_2>=1))")))))
Formula 5 simplified : !(("(i5.i1.u31.r_12_2>=1)" & "(i5.i1.u35.r_13_2>=1)" & G"((i5.i1.u31.r_12_2>=1)&&(i5.i1.u35.r_13_2>=1))") U ("(((i2.i0.u12.r_4_0>=1)&&(i2.i1.u14.r_5_0>=1))&&(i3.u13.p_5_1>=1))" & ("(((i5.i1.u29.r_11_2>=1)&&(i5.i0.u27.p_12_1>=1))&&(i5.i1.u31.r_12_2>=1))" | XX"(((i2.i0.u12.r_4_0>=1)&&(i2.i1.u14.r_5_0>=1))&&(i3.u13.p_5_1>=1))")))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 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.41218,61496,1,0,89686,927,1733,245348,283,2678,97682
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(X(F(X("(((i2.i0.u12.r_4_0>=1)&&(i2.i1.u14.r_5_0>=1))&&(i3.u13.p_5_1>=1))")))))))
Formula 6 simplified : !GFXFX"(((i2.i0.u12.r_4_0>=1)&&(i2.i1.u14.r_5_0>=1))&&(i3.u13.p_5_1>=1))"
Computing Next relation with stutter on 65 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,1.4191,61760,1,0,90180,927,1747,245972,283,2679,98178
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(X("(((i3.u16.r_6_1>=1)&&(i3.u18.r_7_1>=1))&&(i3.u19.p_7_2>=1))")))||(X("(i4.i0.u21.p_9_0>=1)"))))
Formula 7 simplified : !(GX"(((i3.u16.r_6_1>=1)&&(i3.u18.r_7_1>=1))&&(i3.u19.p_7_2>=1))" | X"(i4.i0.u21.p_9_0>=1)")
Computing Next relation with stutter on 65 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,1.43049,62024,1,0,91145,931,1785,247320,283,2716,100437
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((F(X(F("((i4.i0.u20.r_7_0>=1)&&(i4.i0.u21.r_8_0>=1))"))))&&(X("(i3.u19.p_8_2>=1)")))&&(!(G("(((i5.i1.u29.r_11_2>=1)&&(i5.i0.u27.p_12_1>=1))&&(i5.i1.u31.r_12_2>=1))")))))
Formula 8 simplified : !(FXF"((i4.i0.u20.r_7_0>=1)&&(i4.i0.u21.r_8_0>=1))" & X"(i3.u19.p_8_2>=1)" & !G"(((i5.i1.u29.r_11_2>=1)&&(i5.i0.u27.p_12_1>=1))&&(i5.i1.u31.r_12_2>=1))")
Computing Next relation with stutter on 65 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,1.44098,62552,1,0,92081,939,1823,248554,284,2729,102740
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((F(((((F("(((i5.i0.u30.r_12_0>=1)&&(i5.i2.u32.r_13_0>=1))&&(i5.i1.u33.p_13_1>=1))"))&&(F("(((i0.i0.u5.r_1_2>=1)&&(i1.u7.p_2_1>=1))&&(i1.u8.r_2_2>=1))")))&&("(i0.i1.u0.r_0_0>=1)"))&&("(i0.i1.u3.r_1_0>=1)"))&&("(i0.i0.u4.p_1_1>=1)")))&&((X("(((i0.i0.u1.r_0_1>=1)&&(i0.i0.u4.r_1_1>=1))&&(i0.i0.u5.p_1_2>=1))"))||("(((i0.i1.u0.r_0_0>=1)&&(i0.i1.u3.r_1_0>=1))&&(i0.i0.u4.p_1_1>=1))")))U("(((i0.i1.u0.r_0_0>=1)&&(i0.i1.u3.r_1_0>=1))&&(i0.i0.u4.p_1_1>=1))")))
Formula 9 simplified : !((F("(i0.i0.u4.p_1_1>=1)" & "(i0.i1.u0.r_0_0>=1)" & "(i0.i1.u3.r_1_0>=1)" & F"(((i5.i0.u30.r_12_0>=1)&&(i5.i2.u32.r_13_0>=1))&&(i5.i1.u33.p_13_1>=1))" & F"(((i0.i0.u5.r_1_2>=1)&&(i1.u7.p_2_1>=1))&&(i1.u8.r_2_2>=1))") & ("(((i0.i1.u0.r_0_0>=1)&&(i0.i1.u3.r_1_0>=1))&&(i0.i0.u4.p_1_1>=1))" | X"(((i0.i0.u1.r_0_1>=1)&&(i0.i0.u4.r_1_1>=1))&&(i0.i0.u5.p_1_2>=1))")) U "(((i0.i1.u0.r_0_0>=1)&&(i0.i1.u3.r_1_0>=1))&&(i0.i0.u4.p_1_1>=1))")
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.48511,63572,1,0,95418,939,1893,250851,284,2730,108187
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(!(F(X("((((i3.u13.r_5_1>=1)&&(i2.i1.u14.p_6_0>=1))&&(i3.u16.r_6_1>=1))||((i5.i2.u32.r_13_0>=1)&&(i5.i2.u34.r_14_0>=1)))")))))))
Formula 10 simplified : !FG!FX"((((i3.u13.r_5_1>=1)&&(i2.i1.u14.p_6_0>=1))&&(i3.u16.r_6_1>=1))||((i5.i2.u32.r_13_0>=1)&&(i5.i2.u34.r_14_0>=1)))"
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 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,1.49753,64100,1,0,96118,939,1921,253429,284,2732,109619
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(!(G(!(F((G((X("((i0.i0.u1.p_0_1>=1)&&(i0.i0.u2.r_0_2>=1))"))||("(i1.u8.p_2_2>=1)")))&&("(((i4.i1.u25.r_9_2<1)||(i4.i0.u24.p_10_1<1))||(i4.i1.u28.r_10_2<1))"))))))))
Formula 11 simplified : !G!G!F("(((i4.i1.u25.r_9_2<1)||(i4.i0.u24.p_10_1<1))||(i4.i1.u28.r_10_2<1))" & G("(i1.u8.p_2_2>=1)" | X"((i0.i0.u1.p_0_1>=1)&&(i0.i0.u2.r_0_2>=1))"))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
6 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.55747,66476,1,0,101365,953,1979,266940,285,2776,116596
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((!(G("((i2.i0.u9.r_3_0>=1)&&(i2.i0.u12.r_4_0>=1))")))||((G("(i0.i0.u2.p_0_2>=1)"))&&(("(i0.i0.u2.p_0_2>=1)")U("((i5.i0.u26.r_11_0>=1)&&(i5.i0.u30.r_12_0>=1))")))))
Formula 12 simplified : !(!G"((i2.i0.u9.r_3_0>=1)&&(i2.i0.u12.r_4_0>=1))" | (G"(i0.i0.u2.p_0_2>=1)" & ("(i0.i0.u2.p_0_2>=1)" U "((i5.i0.u26.r_11_0>=1)&&(i5.i0.u30.r_12_0>=1))")))
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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,1.57377,67268,1,0,103241,953,2040,268026,285,2776,118932
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F("((i4.i0.u20.r_7_0>=1)&&(i4.i0.u21.r_8_0>=1))"))))
Formula 13 simplified : !XF"((i4.i0.u20.r_7_0>=1)&&(i4.i0.u21.r_8_0>=1))"
Computing Next relation with stutter on 65 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.57501,67532,1,0,103241,953,2044,268036,285,2776,118962
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C015-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:23:20] [INFO ] Built C files in 2262ms 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 1590539000358

--------------------
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 -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 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 -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-R003C015"
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-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R003C015, 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 r193-csrt-159033389100666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;