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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 3.8K May 14 00:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 17:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 17:35 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.4K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:34 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 360K 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-R003C050-00
FORMULA_NAME ResAllocation-PT-R003C050-01
FORMULA_NAME ResAllocation-PT-R003C050-02
FORMULA_NAME ResAllocation-PT-R003C050-03
FORMULA_NAME ResAllocation-PT-R003C050-04
FORMULA_NAME ResAllocation-PT-R003C050-05
FORMULA_NAME ResAllocation-PT-R003C050-06
FORMULA_NAME ResAllocation-PT-R003C050-07
FORMULA_NAME ResAllocation-PT-R003C050-08
FORMULA_NAME ResAllocation-PT-R003C050-09
FORMULA_NAME ResAllocation-PT-R003C050-10
FORMULA_NAME ResAllocation-PT-R003C050-11
FORMULA_NAME ResAllocation-PT-R003C050-12
FORMULA_NAME ResAllocation-PT-R003C050-13
FORMULA_NAME ResAllocation-PT-R003C050-14
FORMULA_NAME ResAllocation-PT-R003C050-15

=== Now, execution of the tool begins

BK_START 1590539148832

[2020-05-27 00:25:50] [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:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:25:50] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-05-27 00:25:50] [INFO ] Transformed 300 places.
[2020-05-27 00:25:50] [INFO ] Transformed 200 transitions.
[2020-05-27 00:25:50] [INFO ] Parsed PT model containing 300 places and 200 transitions in 171 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 14720 steps, including 138 resets, run visited all 53 properties in 144 ms. (steps per millisecond=102 )
[2020-05-27 00:25:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 00:25:51] [INFO ] Flatten gal took : 74 ms
FORMULA ResAllocation-PT-R003C050-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:25:51] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:25:51] [INFO ] Applying decomposition
[2020-05-27 00:25:51] [INFO ] Flatten gal took : 32 ms
[2020-05-27 00:25:51] [INFO ] Input system was already deterministic with 200 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/graph4167818651745210517.txt, -o, /tmp/graph4167818651745210517.bin, -w, /tmp/graph4167818651745210517.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/graph4167818651745210517.bin, -l, -1, -v, -w, /tmp/graph4167818651745210517.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:25:51] [INFO ] Decomposing Gal with order
[2020-05-27 00:25:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:25:51] [INFO ] Flatten gal took : 69 ms
[2020-05-27 00:25:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-27 00:25:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
[2020-05-27 00:25:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/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 15 LTL properties
Checking formula 0 : !(((G(X(X("(((i6.u75.r_32_0>=1)&&(i6.u75.r_33_0>=1))&&(i6.u75.p_33_1>=1))"))))||((F(G((F("(((i7.i0.i0.u86.r_38_1>=1)&&(i7.i0.i1.u90.r_39_1>=1))&&(i7.i0.i1.u89.p_39_2>=1))"))U("(((i7.i0.i0.u86.r_38_1<1)||(i7.i0.i1.u90.r_39_1<1))||(i7.i0.i1.u89.p_39_2<1))"))))U(G("(((i7.i0.i0.u86.r_38_1>=1)&&(i7.i0.i1.u90.r_39_1>=1))&&(i7.i0.i1.u89.p_39_2>=1))")))))
Formula 0 simplified : !(GXX"(((i6.u75.r_32_0>=1)&&(i6.u75.r_33_0>=1))&&(i6.u75.p_33_1>=1))" | (FG(F"(((i7.i0.i0.u86.r_38_1>=1)&&(i7.i0.i1.u90.r_39_1>=1))&&(i7.i0.i1.u89.p_39_2>=1))" U "(((i7.i0.i0.u86.r_38_1<1)||(i7.i0.i1.u90.r_39_1<1))||(i7.i0.i1.u89.p_39_2<1))") U G"(((i7.i0.i0.u86.r_38_1>=1)&&(i7.i0.i1.u90.r_39_1>=1))&&(i7.i0.i1.u89.p_39_2>=1))"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 200 rows 300 cols
[2020-05-27 00:25:52] [INFO ] Computed 150 place invariants in 14 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_46_0 + r_46_0 + p_47_0 = 1
inv : p_11_1 + r_11_1 + p_12_1 = 1
inv : p_17_1 + r_17_1 + p_18_1 = 1
inv : p_20_1 + r_20_1 + p_21_1 = 1
inv : p_40_0 + r_40_0 + p_41_0 = 1
inv : p_23_1 + r_23_1 + p_24_1 = 1
inv : p_43_0 + r_43_0 + p_44_0 = 1
inv : p_28_0 + r_28_0 + p_29_0 = 1
inv : p_25_0 + r_25_0 + p_26_0 = 1
inv : p_38_1 + r_38_1 + p_39_1 = 1
inv : p_44_1 + r_44_1 + p_45_1 = 1
inv : p_19_0 + r_19_0 + p_20_0 = 1
inv : p_14_1 + r_14_1 + p_15_1 = 1
inv : p_34_0 + r_34_0 + p_35_0 = 1
inv : p_9_2 + r_9_2 + p_10_2 = 1
inv : p_29_1 + r_29_1 + p_30_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_10_0 + r_10_0 + p_11_0 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_32_2 + r_32_2 + p_33_2 = 1
inv : p_27_2 + r_27_2 + p_28_2 = 1
inv : p_30_2 + r_30_2 + p_31_2 = 1
inv : p_35_2 + r_35_2 + p_36_2 = 1
inv : p_47_2 + r_47_2 + p_48_2 = 1
inv : p_15_2 + r_15_2 + p_16_2 = 1
inv : p_20_2 + r_20_2 + p_21_2 = 1
inv : p_26_1 + r_26_1 + p_27_1 = 1
inv : p_45_2 + r_45_2 + p_46_2 = 1
inv : p_17_2 + r_17_2 + p_18_2 = 1
inv : p_37_0 + r_37_0 + p_38_0 = 1
inv : p_22_0 + r_22_0 + p_23_0 = 1
inv : p_2_0 + r_2_0 + p_3_0 = 1
inv : p_46_1 + r_46_1 + p_47_1 = 1
inv : p_41_1 + r_41_1 + p_42_1 = 1
inv : p_7_0 + r_7_0 + p_8_0 = 1
inv : p_20_0 + r_20_0 + p_21_0 = 1
inv : p_17_0 + r_17_0 + p_18_0 = 1
built 8 ordering constraints for composite.
inv : p_26_0 + r_26_0 + p_27_0 = 1
inv : p_37_1 + r_37_1 + p_38_1 = 1
inv : p_43_1 + r_43_1 + p_44_1 = 1
inv : p_28_1 + r_28_1 + p_29_1 = 1
inv : p_8_2 + r_8_2 + p_9_2 = 1
inv : p_35_0 + r_35_0 + p_36_0 = 1
inv : p_11_0 + r_11_0 + p_12_0 = 1
inv : p_13_1 + r_13_1 + p_14_1 = 1
inv : p_49_2 + r_49_2 = 1
inv : p_29_2 + r_29_2 + p_30_2 = 1
inv : p_33_2 + r_33_2 + p_34_2 = 1
inv : p_39_2 + r_39_2 + p_40_2 = 1
inv : p_23_2 + r_23_2 + p_24_2 = 1
inv : p_48_2 + r_48_2 + p_49_2 = 1
inv : p_24_2 + r_24_2 + p_25_2 = 1
inv : p_5_0 + r_5_0 + p_6_0 = 1
inv : p_38_2 + r_38_2 + p_39_2 = 1
inv : p_14_2 + r_14_2 + p_15_2 = 1
inv : p_36_0 + r_36_0 + p_37_0 = 1
inv : p_44_2 + r_44_2 + p_45_2 = 1
inv : p_1_0 + r_1_0 + p_2_0 = 1
inv : p_18_2 + r_18_2 + p_19_2 = 1
inv : p_27_1 + r_27_1 + p_28_1 = 1
inv : p_16_0 + r_16_0 + p_17_0 = 1
inv : p_21_0 + r_21_0 + p_22_0 = 1
inv : p_3_2 + r_3_2 + p_4_2 = 1
inv : p_47_1 + r_47_1 + p_48_1 = 1
inv : p_32_1 + r_32_1 + p_33_1 = 1
inv : p_41_0 + r_41_0 + p_42_0 = 1
inv : p_22_1 + r_22_1 + p_23_1 = 1
inv : p_42_1 + r_42_1 + p_43_1 = 1
inv : p_31_0 + r_31_0 + p_32_0 = 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_2_1 + r_2_1 + p_3_1 = 1
inv : p_28_2 + r_28_2 + p_29_2 = 1
inv : p_34_2 + r_34_2 + p_35_2 = 1
inv : p_40_2 + r_40_2 + p_41_2 = 1
inv : p_22_2 + r_22_2 + p_23_2 = 1
inv : p_3_0 + r_3_0 + p_4_0 = 1
inv : p_6_0 + r_6_0 + p_7_0 = 1
inv : p_37_2 + r_37_2 + p_38_2 = 1
inv : p_25_2 + r_25_2 + p_26_2 = 1
inv : p_10_2 + r_10_2 + p_11_2 = 1
inv : p_48_1 + r_48_1 + p_49_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_2 + r_13_2 + p_14_2 = 1
inv : p_15_0 + r_15_0 + p_16_0 = 1
inv : p_24_0 + r_24_0 + p_25_0 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_43_2 + r_43_2 + p_44_2 = 1
inv : p_19_2 + r_19_2 + p_20_2 = 1
inv : p_39_1 + r_39_1 + p_40_1 = 1
inv : p_24_1 + r_24_1 + p_25_1 = 1
inv : p_21_1 + r_21_1 + p_22_1 = 1
inv : p_30_0 + r_30_0 + p_31_0 = 1
inv : p_42_0 + r_42_0 + p_43_0 = 1
inv : p_33_1 + r_33_1 + p_34_1 = 1
inv : p_1_1 + r_1_1 + p_2_1 = 1
inv : p_45_0 + r_45_0 + p_46_0 = 1
inv : p_18_1 + r_18_1 + p_19_1 = 1
inv : p_3_1 + r_3_1 + p_4_1 = 1
inv : p_16_1 + r_16_1 + p_17_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_7_2 + r_7_2 + p_8_2 = 1
inv : p_47_0 + r_47_0 + p_48_0 = 1
inv : p_32_0 + r_32_0 + p_33_0 = 1
inv : p_36_1 + r_36_1 + p_37_1 = 1
inv : p_27_0 + r_27_0 + p_28_0 = 1
inv : p_31_1 + r_31_1 + p_32_1 = 1
inv : p_49_1 + r_49_1 = 1
inv : p_40_1 + r_40_1 + p_41_1 = 1
inv : p_14_0 + r_14_0 + p_15_0 = 1
inv : p_2_2 + r_2_2 + p_3_2 = 1
inv : p_8_0 + r_8_0 + p_9_0 = 1
inv : p_38_0 + r_38_0 + p_39_0 = 1
inv : p_5_2 + r_5_2 + p_6_2 = 1
inv : p_25_1 + r_25_1 + p_26_1 = 1
inv : p_42_2 + r_42_2 + p_43_2 = 1
inv : p_23_0 + r_23_0 + p_24_0 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_44_0 + r_44_0 + p_45_0 = 1
inv : p_10_1 + r_10_1 + p_11_1 = 1
inv : p_4_1 + r_4_1 + p_5_1 = 1
inv : p_29_0 + r_29_0 + p_30_0 = 1
inv : p_34_1 + r_34_1 + p_35_1 = 1
inv : p_9_1 + r_9_1 + p_10_1 = 1
inv : p_19_1 + r_19_1 + p_20_1 = 1
inv : p_39_0 + r_39_0 + p_40_0 = 1
inv : p_49_0 + r_49_0 = 1
inv : p_33_0 + r_33_0 + p_34_0 = 1
inv : p_48_0 + r_48_0 + p_49_0 = 1
inv : p_13_0 + r_13_0 + p_14_0 = 1
inv : p_15_1 + r_15_1 + p_16_1 = 1
inv : p_18_0 + r_18_0 + p_19_0 = 1
inv : p_30_1 + r_30_1 + p_31_1 = 1
inv : p_45_1 + r_45_1 + p_46_1 = 1
inv : p_35_1 + r_35_1 + p_36_1 = 1
inv : p_36_2 + r_36_2 + p_37_2 = 1
inv : p_1_2 + r_1_2 + p_2_2 = 1
inv : p_16_2 + r_16_2 + p_17_2 = 1
inv : p_46_2 + r_46_2 + p_47_2 = 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_41_2 + r_41_2 + p_42_2 = 1
inv : p_21_2 + r_21_2 + p_22_2 = 1
inv : p_26_2 + r_26_2 + p_27_2 = 1
inv : p_31_2 + r_31_2 + p_32_2 = 1
Total of 150 invariants.
built 26 ordering constraints for composite.
built 26 ordering constraints for composite.
built 35 ordering constraints for composite.
built 30 ordering constraints for composite.
built 23 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 15 ordering constraints for composite.
[2020-05-27 00:25:52] [INFO ] Computed 150 place invariants in 24 ms
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 31 ordering constraints for composite.
built 15 ordering constraints for composite.
built 19 ordering constraints for composite.
built 14 ordering constraints for composite.
built 18 ordering constraints for composite.
built 17 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 20 ordering constraints for composite.
[2020-05-27 00:25:52] [INFO ] Proved 300 variables to be positive in 587 ms
[2020-05-27 00:25:52] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2020-05-27 00:25:52] [INFO ] Computation of disable matrix completed :0/200 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:25:52] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:25:52] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2020-05-27 00:25:52] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:25:55] [INFO ] Computing symmetric co enabling matrix : 200 transitions.
[2020-05-27 00:25:55] [INFO ] Computation of co-enabling matrix(15/200) took 438 ms. Total solver calls (SAT/UNSAT): 52(12/40)
Reverse transition relation is NOT exact ! Due to transitions t_5_0, t_6_3, t_15_0, t_20_3, t_38_3, t_45_0, i0.t_3_0, i0.t_2_3, i0.t_1_0, i0.u2.t_0_3, i0.u10.t_4_3, i1.t_9_0, i1.t_8_3, i1.t_7_0, i2.t_16_3, i2.t_14_3, i2.t_13_0, i2.t_12_3, i2.t_10_3, i2.u26.t_11_0, i3.t_21_0, i3.t_19_0, i3.t_18_3, i3.u41.t_17_0, i4.t_24_3, i4.t_23_0, i4.u54.t_22_3, i4.u59.t_25_0, i5.i0.i0.t_27_0, i5.i0.i1.t_26_3, i5.i0.i1.u66.t_28_3, i5.i1.i0.t_30_3, i5.i1.i1.t_31_0, i5.i1.i1.u67.t_29_0, i6.t_36_3, i6.t_35_0, i6.t_34_3, i6.t_32_3, i6.u75.t_33_0, i7.t_41_0, i7.i0.i0.t_37_0, i7.i0.i0.u86.t_39_0, i7.i0.i1.t_42_3, i7.i0.i1.u90.t_40_3, i7.i1.i0.t_43_0, i7.i1.i1.t_44_3, i8.t_49_0, i8.t_48_3, i8.t_46_3, i8.u107.t_47_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/150/50/200
Computing Next relation with stutter on 1.22154e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
564 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,5.71165,198576,1,0,344970,1737,4391,1.21482e+06,590,8178,333905
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G("(i7.i0.i0.u84.p_37_0>=1)")))||((X((((!(X("(i7.i1.i1.u103.p_44_2>=1)")))||("(i4.u54.r_21_2<1)"))||("(i4.u54.p_22_1<1)"))||("(i4.u54.r_22_2<1)")))&&(F("(((i4.u54.r_21_2>=1)&&(i4.u54.p_22_1>=1))&&(i4.u54.r_22_2>=1))")))))
Formula 1 simplified : !(XG"(i7.i0.i0.u84.p_37_0>=1)" | (X("(i4.u54.p_22_1<1)" | "(i4.u54.r_21_2<1)" | "(i4.u54.r_22_2<1)" | !X"(i7.i1.i1.u103.p_44_2>=1)") & F"(((i4.u54.r_21_2>=1)&&(i4.u54.p_22_1>=1))&&(i4.u54.r_22_2>=1))"))
Computing Next relation with stutter on 1.22154e+06 deadlock states
[2020-05-27 00:25:58] [INFO ] Computation of co-enabling matrix(159/200) took 3439 ms. Total solver calls (SAT/UNSAT): 520(120/400)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
202 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,7.73573,243500,1,0,422388,1878,4462,1.52944e+06,598,8735,425670
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X((F("((((i6.u78.p_35_0>=1)&&(i2.u26.r_11_1>=1))&&(i2.u29.p_12_0>=1))&&(i2.u30.r_12_1>=1))"))&&(("(((i2.u26.r_11_1>=1)&&(i2.u29.p_12_0>=1))&&(i2.u30.r_12_1>=1))")U("(((i8.u107.r_47_1>=1)&&(i8.u110.p_48_0>=1))&&(i8.u111.r_48_1>=1))")))))))
Formula 2 simplified : !FGX(F"((((i6.u78.p_35_0>=1)&&(i2.u26.r_11_1>=1))&&(i2.u29.p_12_0>=1))&&(i2.u30.r_12_1>=1))" & ("(((i2.u26.r_11_1>=1)&&(i2.u29.p_12_0>=1))&&(i2.u30.r_12_1>=1))" U "(((i8.u107.r_47_1>=1)&&(i8.u110.p_48_0>=1))&&(i8.u111.r_48_1>=1))"))
Computing Next relation with stutter on 1.22154e+06 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 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,7.87055,247724,1,0,430372,1878,4520,1.56031e+06,598,8735,441098
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F("(((i0.u14.r_5_2>=1)&&(i1.u16.p_6_1>=1))&&(i1.u17.r_6_2>=1))"))U("((i3.u47.p_19_0<1)&&(((i6.u88.r_37_2<1)||(i7.i0.i0.u86.p_38_1<1))||(i7.i0.i1.u89.r_38_2<1)))"))))
Formula 3 simplified : !G(F"(((i0.u14.r_5_2>=1)&&(i1.u16.p_6_1>=1))&&(i1.u17.r_6_2>=1))" U "((i3.u47.p_19_0<1)&&(((i6.u88.r_37_2<1)||(i7.i0.i0.u86.p_38_1<1))||(i7.i0.i1.u89.r_38_2<1)))")
Computing Next relation with stutter on 1.22154e+06 deadlock states
[2020-05-27 00:26:00] [INFO ] Computation of Finished co-enabling matrix. took 4931 ms. Total solver calls (SAT/UNSAT): 640(147/493)
[2020-05-27 00:26:00] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2020-05-27 00:26:00] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:26:00] [INFO ] Built C files in 8597ms 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]
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,8.071,253268,1,0,443705,1881,4587,1.59134e+06,599,8849,453181
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(X(G(X(((G(X("(((i0.u10.r_4_1>=1)&&(i0.u13.r_5_1>=1))&&(i0.u14.p_5_2>=1))")))||(F("(i0.u8.p_2_2>=1)")))||("(((i8.u107.r_47_1>=1)&&(i8.u110.p_48_0>=1))&&(i8.u111.r_48_1>=1))"))))))))
Formula 4 simplified : !FGXGX("(((i8.u107.r_47_1>=1)&&(i8.u110.p_48_0>=1))&&(i8.u111.r_48_1>=1))" | GX"(((i0.u10.r_4_1>=1)&&(i0.u13.r_5_1>=1))&&(i0.u14.p_5_2>=1))" | F"(i0.u8.p_2_2>=1)")
Computing Next relation with stutter on 1.22154e+06 deadlock states
8 unique states visited
4 strongly connected components in search stack
12 transitions explored
8 items max in DFS search stack
227 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,10.3481,323176,1,0,502388,1885,4669,2.34047e+06,599,8904,517117
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X((X("(((i1.u22.r_9_1>=1)&&(i1.u24.p_10_0>=1))&&(i2.u26.r_10_1>=1))"))U(G((((F(G("((i8.u108.p_46_2<1)&&(i7.i1.i1.u103.p_44_2>=1))")))&&("(i1.u19.r_7_2>=1)"))&&("(i1.u18.p_8_1>=1)"))&&("(i1.u23.r_8_2>=1)"))))))))
Formula 5 simplified : !FGX(X"(((i1.u22.r_9_1>=1)&&(i1.u24.p_10_0>=1))&&(i2.u26.r_10_1>=1))" U G("(i1.u18.p_8_1>=1)" & "(i1.u19.r_7_2>=1)" & "(i1.u23.r_8_2>=1)" & FG"((i8.u108.p_46_2<1)&&(i7.i1.i1.u103.p_44_2>=1))"))
Computing Next relation with stutter on 1.22154e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,10.4201,325552,1,0,509693,1885,4728,2.34812e+06,599,8904,525089
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(G(X((F(!(G("(((i6.u80.r_34_2>=1)&&(i6.u83.r_35_2>=1))||(((i2.u32.r_13_2>=1)&&(i2.u35.p_14_1>=1))&&(i2.u36.r_14_2>=1)))"))))U(F(G("(i3.u46.p_18_2>=1)")))))))))
Formula 6 simplified : !XFGX(F!G"(((i6.u80.r_34_2>=1)&&(i6.u83.r_35_2>=1))||(((i2.u32.r_13_2>=1)&&(i2.u35.p_14_1>=1))&&(i2.u36.r_14_2>=1)))" U FG"(i3.u46.p_18_2>=1)")
Computing Next relation with stutter on 1.22154e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
12 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,10.5398,330040,1,0,522349,1885,4761,2.36916e+06,599,8904,536603
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(X("(((i3.u48.r_19_1<1)||(i3.u50.p_20_0<1))||(i3.u51.r_20_1<1))")))&&(X("((((((i0.u6.r_2_0>=1)&&(i0.u9.r_3_0>=1))&&(i0.u7.p_3_1>=1))&&(i3.u48.r_19_1>=1))&&(i3.u50.p_20_0>=1))&&(i3.u51.r_20_1>=1))"))))
Formula 7 simplified : !(FX"(((i3.u48.r_19_1<1)||(i3.u50.p_20_0<1))||(i3.u51.r_20_1<1))" & X"((((((i0.u6.r_2_0>=1)&&(i0.u9.r_3_0>=1))&&(i0.u7.p_3_1>=1))&&(i3.u48.r_19_1>=1))&&(i3.u50.p_20_0>=1))&&(i3.u51.r_20_1>=1))")
Computing Next relation with stutter on 1.22154e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.5766,330832,1,0,524129,1885,4815,2.37272e+06,599,8907,539959
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((((X("((i1.u23.r_8_2>=1)&&(i2.u25.r_9_2>=1))"))&&("(i8.u109.r_47_2>=1)"))&&("(i8.u111.p_48_1>=1)"))&&("(i8.u112.r_48_2>=1)"))||(((((X(G("(i1.u21.p_9_0>=1)")))&&("(i2.u28.r_11_2>=1)"))&&("(i2.u30.p_12_1>=1)"))&&("(i2.u31.r_12_2>=1)"))&&("(i2.u37.p_15_0>=1)")))))
Formula 8 simplified : !X(("(i8.u109.r_47_2>=1)" & "(i8.u111.p_48_1>=1)" & "(i8.u112.r_48_2>=1)" & X"((i1.u23.r_8_2>=1)&&(i2.u25.r_9_2>=1))") | ("(i2.u28.r_11_2>=1)" & "(i2.u30.p_12_1>=1)" & "(i2.u31.r_12_2>=1)" & "(i2.u37.p_15_0>=1)" & XG"(i1.u21.p_9_0>=1)"))
Computing Next relation with stutter on 1.22154e+06 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,10.5861,331360,1,0,524164,1885,4930,2.37276e+06,599,8907,540449
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(((i8.u107.r_46_0>=1)&&(i8.u107.r_47_0>=1))&&(i8.u107.p_47_1>=1))")U(X("(((i0.u7.r_2_1>=1)&&(i0.u10.r_3_1>=1))&&(i0.u8.p_3_2>=1))"))))
Formula 9 simplified : !("(((i8.u107.r_46_0>=1)&&(i8.u107.r_47_0>=1))&&(i8.u107.p_47_1>=1))" U X"(((i0.u7.r_2_1>=1)&&(i0.u10.r_3_1>=1))&&(i0.u8.p_3_2>=1))")
Computing Next relation with stutter on 1.22154e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,10.5895,331360,1,0,524322,1885,4963,2.37287e+06,599,8907,540770
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("(((i0.u0.r_0_0>=1)&&(i0.u3.r_1_0>=1))&&(i0.u4.p_1_1>=1))")))
Formula 10 simplified : !F"(((i0.u0.r_0_0>=1)&&(i0.u3.r_1_0>=1))&&(i0.u4.p_1_1>=1))"
Computing Next relation with stutter on 1.22154e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,10.7934,338752,1,0,547384,1892,4992,2.38948e+06,599,8941,562092
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G(X(G((G(X(("((i7.i1.i0.u98.r_43_0>=1)&&(i7.i1.i0.u101.r_44_0>=1))")U("(i5.i1.i1.u72.p_31_0>=1)"))))||("(i5.i1.i1.u72.p_31_0<1)")))))))
Formula 11 simplified : GXG("(i5.i1.i1.u72.p_31_0<1)" | GX("((i7.i1.i0.u98.r_43_0>=1)&&(i7.i1.i0.u101.r_44_0>=1))" U "(i5.i1.i1.u72.p_31_0>=1)"))
Computing Next relation with stutter on 1.22154e+06 deadlock states
Compilation finished in 3003 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( [](X([](( [](X(((LTLAP37==true))U((LTLAP38==true))))) || ( (LTLAP39==true)) )))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( [](X([](( [](X(((LTLAP37==true))U((LTLAP38==true))))) || ( (LTLAP39==true)) )))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( [](X([](( [](X(((LTLAP37==true))U((LTLAP38==true))))) || ( (LTLAP39==true)) )))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2729 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,38.0904,615928,1,0,1.09958e+06,1935,5051,3.73515e+06,599,9414,714421
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G((!(X(X("(i2.u42.p_16_2>=1)"))))||((!(G("(((i5.i1.i1.u67.r_28_0>=1)&&(i5.i1.i1.u67.r_29_0>=1))&&(i5.i1.i1.u67.p_29_1>=1))")))&&((((!(G("(((i4.u59.r_24_0>=1)&&(i4.u59.r_25_0>=1))&&(i4.u59.p_25_1>=1))")))||("(i2.u39.r_15_1<1)"))||("(i3.u38.p_16_0<1)"))||("(i3.u41.r_16_1<1)"))))))
Formula 12 simplified : !G(!XX"(i2.u42.p_16_2>=1)" | (!G"(((i5.i1.i1.u67.r_28_0>=1)&&(i5.i1.i1.u67.r_29_0>=1))&&(i5.i1.i1.u67.p_29_1>=1))" & ("(i2.u39.r_15_1<1)" | "(i3.u38.p_16_0<1)" | "(i3.u41.r_16_1<1)" | !G"(((i4.u59.r_24_0>=1)&&(i4.u59.r_25_0>=1))&&(i4.u59.p_25_1>=1))")))
Computing Next relation with stutter on 1.22154e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,38.2004,619096,1,0,1.10784e+06,1935,5141,3.74477e+06,602,9414,725350
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G(X("((i5.i1.i0.u71.r_30_2>=1)&&(i6.u74.r_31_2>=1))")))U(!(X("(((i0.u1.r_0_1>=1)&&(i0.u4.r_1_1>=1))&&(i0.u5.p_1_2>=1))")))))
Formula 13 simplified : !(GX"((i5.i1.i0.u71.r_30_2>=1)&&(i6.u74.r_31_2>=1))" U !X"(((i0.u1.r_0_1>=1)&&(i0.u4.r_1_1>=1))&&(i0.u5.p_1_2>=1))")
Computing Next relation with stutter on 1.22154e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2240 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,60.5929,819208,1,0,1.42859e+06,1952,5208,5.18241e+06,602,9591,868461
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((F("((i2.u33.r_13_0>=1)&&(i2.u37.r_14_0>=1))"))U(F(X("(((i2.u26.r_11_1>=1)&&(i2.u29.p_12_0>=1))&&(i2.u30.r_12_1>=1))"))))))
Formula 14 simplified : !F(F"((i2.u33.r_13_0>=1)&&(i2.u37.r_14_0>=1))" U FX"(((i2.u26.r_11_1>=1)&&(i2.u29.p_12_0>=1))&&(i2.u30.r_12_1>=1))")
Computing Next relation with stutter on 1.22154e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
480 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,65.4006,958072,1,0,1.57552e+06,1953,5223,6.61141e+06,602,9600,1075934
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C050-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590539226962

--------------------
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-R003C050"
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-R003C050, 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-159033389100682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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