fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902545700114
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for CloudReconfiguration-PT-315

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.450 742656.00 851135.00 422.90 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 30 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 26 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 08:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-315-00
FORMULA_NAME CloudReconfiguration-PT-315-01
FORMULA_NAME CloudReconfiguration-PT-315-02
FORMULA_NAME CloudReconfiguration-PT-315-03
FORMULA_NAME CloudReconfiguration-PT-315-04
FORMULA_NAME CloudReconfiguration-PT-315-05
FORMULA_NAME CloudReconfiguration-PT-315-06
FORMULA_NAME CloudReconfiguration-PT-315-07
FORMULA_NAME CloudReconfiguration-PT-315-08
FORMULA_NAME CloudReconfiguration-PT-315-09
FORMULA_NAME CloudReconfiguration-PT-315-10
FORMULA_NAME CloudReconfiguration-PT-315-11
FORMULA_NAME CloudReconfiguration-PT-315-12
FORMULA_NAME CloudReconfiguration-PT-315-13
FORMULA_NAME CloudReconfiguration-PT-315-14
FORMULA_NAME CloudReconfiguration-PT-315-15

=== Now, execution of the tool begins

BK_START 1589508022836

[2020-05-15 02:00:26] [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-15 02:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 02:00:27] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2020-05-15 02:00:27] [INFO ] Transformed 2585 places.
[2020-05-15 02:00:27] [INFO ] Transformed 3095 transitions.
[2020-05-15 02:00:27] [INFO ] Found NUPN structural information;
[2020-05-15 02:00:27] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 499 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 133 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 808 resets, run finished after 779 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
// Phase 1: matrix 3095 rows 2585 cols
[2020-05-15 02:00:28] [INFO ] Computed 4 place invariants in 138 ms
[2020-05-15 02:00:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 144 ms returned sat
[2020-05-15 02:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:00:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:00:48] [INFO ] [Real]Absence check using state equation in 18945 ms returned (error "Failed to check-sat")
[2020-05-15 02:00:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 141 ms returned sat
[2020-05-15 02:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:01:08] [INFO ] [Real]Absence check using state equation in 17474 ms returned (error "Solver has unexpectedly terminated")
[2020-05-15 02:01:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-15 02:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:01:28] [INFO ] [Real]Absence check using state equation in 19407 ms returned sat
[2020-05-15 02:01:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-05-15 02:01:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-15 02:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:01:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:01:48] [INFO ] [Real]Absence check using state equation in 19468 ms returned unknown
[2020-05-15 02:01:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-05-15 02:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:02:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:02:08] [INFO ] [Real]Absence check using state equation in 19448 ms returned (error "Failed to check-sat")
[2020-05-15 02:02:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-05-15 02:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:02:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:02:28] [INFO ] [Real]Absence check using state equation in 19377 ms returned unknown
[2020-05-15 02:02:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-05-15 02:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:02:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:02:48] [INFO ] [Real]Absence check using state equation in 18355 ms returned (error "Failed to check-sat")
[2020-05-15 02:02:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-15 02:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:03:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:03:08] [INFO ] [Real]Absence check using state equation in 19405 ms returned (error "Failed to check-sat")
[2020-05-15 02:03:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 136 ms returned sat
[2020-05-15 02:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:03:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:03:28] [INFO ] [Real]Absence check using state equation in 19368 ms returned (error "Failed to check-sat")
[2020-05-15 02:03:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 156 ms returned sat
[2020-05-15 02:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:03:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:03:48] [INFO ] [Real]Absence check using state equation in 18405 ms returned (error "Failed to check-sat")
[2020-05-15 02:03:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-15 02:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:04:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:04:08] [INFO ] [Real]Absence check using state equation in 19351 ms returned unknown
[2020-05-15 02:04:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-05-15 02:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:04:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:04:28] [INFO ] [Real]Absence check using state equation in 19375 ms returned (error "Failed to check-sat")
[2020-05-15 02:04:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 135 ms returned sat
[2020-05-15 02:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:04:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:04:49] [INFO ] [Real]Absence check using state equation in 17711 ms returned (error "Failed to check-sat")
[2020-05-15 02:04:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 146 ms returned sat
[2020-05-15 02:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:05:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:05:09] [INFO ] [Real]Absence check using state equation in 19380 ms returned unknown
[2020-05-15 02:05:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 151 ms returned sat
[2020-05-15 02:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:05:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:05:29] [INFO ] [Real]Absence check using state equation in 19362 ms returned (error "Failed to check-sat")
[2020-05-15 02:05:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-05-15 02:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:05:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:05:49] [INFO ] [Real]Absence check using state equation in 19375 ms returned unknown
[2020-05-15 02:05:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 123 ms returned sat
[2020-05-15 02:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:06:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:06:09] [INFO ] [Real]Absence check using state equation in 18648 ms returned (error "Failed to check-sat")
[2020-05-15 02:06:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-15 02:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:06:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:06:29] [INFO ] [Real]Absence check using state equation in 19386 ms returned (error "Failed to check-sat")
[2020-05-15 02:06:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 126 ms returned sat
[2020-05-15 02:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:06:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:06:49] [INFO ] [Real]Absence check using state equation in 18672 ms returned (error "Failed to check-sat")
[2020-05-15 02:06:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-05-15 02:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:07:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:07:09] [INFO ] [Real]Absence check using state equation in 19390 ms returned unknown
[2020-05-15 02:07:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-05-15 02:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:07:14] [INFO ] [Real]Absence check using state equation in 4846 ms returned unsat
[2020-05-15 02:07:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 126 ms returned sat
[2020-05-15 02:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:07:34] [INFO ] [Real]Absence check using state equation in 19158 ms returned sat
[2020-05-15 02:07:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 21
[2020-05-15 02:07:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-05-15 02:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:07:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:07:54] [INFO ] [Real]Absence check using state equation in 19521 ms returned unknown
[2020-05-15 02:07:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-05-15 02:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:08:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:08:14] [INFO ] [Real]Absence check using state equation in 19422 ms returned unknown
[2020-05-15 02:08:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-05-15 02:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:08:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:08:34] [INFO ] [Real]Absence check using state equation in 19397 ms returned unknown
[2020-05-15 02:08:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 124 ms returned sat
[2020-05-15 02:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 02:08:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-15 02:08:54] [INFO ] [Real]Absence check using state equation in 19391 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 02:08:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-15 02:08:55] [INFO ] Flatten gal took : 442 ms
FORMULA CloudReconfiguration-PT-315-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 02:08:56] [INFO ] Flatten gal took : 246 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 02:08:56] [INFO ] Applying decomposition
[2020-05-15 02:08:56] [INFO ] Flatten gal took : 226 ms
[2020-05-15 02:08:56] [INFO ] Input system was already deterministic with 3095 transitions.
[2020-05-15 02:08:56] [INFO ] Too many transitions (3095) to apply POR reductions. Disabling POR matrices.
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/graph11860364931894854180.txt, -o, /tmp/graph11860364931894854180.bin, -w, /tmp/graph11860364931894854180.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/graph11860364931894854180.bin, -l, -1, -v, -w, /tmp/graph11860364931894854180.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 02:08:57] [INFO ] Built C files in 1019ms 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]
[2020-05-15 02:08:57] [INFO ] Decomposing Gal with order
[2020-05-15 02:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 02:08:58] [INFO ] Removed a total of 580 redundant transitions.
[2020-05-15 02:08:59] [INFO ] Flatten gal took : 784 ms
[2020-05-15 02:08:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 131 ms.
[2020-05-15 02:08:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 149 ms
[2020-05-15 02:08:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 12 LTL properties
Checking formula 0 : !(((X(X(G("((i43.u1017.p2538==1)&&(i19.u350.p894==1))"))))||(!(F("(i19.u350.p894==1)")))))
Formula 0 simplified : !(XXG"((i43.u1017.p2538==1)&&(i19.u350.p894==1))" | !F"(i19.u350.p894==1)")
built 102 ordering constraints for composite.
built 38 ordering constraints for composite.
built 23 ordering constraints for composite.
built 22 ordering constraints for composite.
built 37 ordering constraints for composite.
built 21 ordering constraints for composite.
built 28 ordering constraints for composite.
built 18 ordering constraints for composite.
built 36 ordering constraints for composite.
built 26 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 82 ordering constraints for composite.
built 32 ordering constraints for composite.
built 62 ordering constraints for composite.
built 13 ordering constraints for composite.
built 51 ordering constraints for composite.
built 29 ordering constraints for composite.
built 17 ordering constraints for composite.
built 51 ordering constraints for composite.
built 25 ordering constraints for composite.
built 32 ordering constraints for composite.
built 50 ordering constraints for composite.
built 11 ordering constraints for composite.
built 109 ordering constraints for composite.
built 16 ordering constraints for composite.
built 28 ordering constraints for composite.
built 31 ordering constraints for composite.
built 49 ordering constraints for composite.
built 22 ordering constraints for composite.
built 61 ordering constraints for composite.
built 62 ordering constraints for composite.
built 46 ordering constraints for composite.
built 18 ordering constraints for composite.
built 33 ordering constraints for composite.
built 108 ordering constraints for composite.
built 12 ordering constraints for composite.
built 16 ordering constraints for composite.
built 29 ordering constraints for composite.
built 50 ordering constraints for composite.
built 21 ordering constraints for composite.
built 66 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 109 ordering constraints for composite.
built 12 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t5, t36, t59, t323, t329, t481, t557, t625, t777, t1041, t1047, t1199, t1266, t1471, t1494, t1758, t1764, t1916, t1992, t2060, t2238, t2395, t2458, t2615, t2678, t2835, t2868, i9.t2866, i9.t2860, i9.t2854, i9.t2848, i9.t2846, i9.t2841, i9.t2807, i9.t2647, i9.t2642, i9.t2637, i9.t2628, i9.t2626, i9.t2621, i9.t2587, i9.t2427, i9.t2422, i9.t2417, i9.t2408, i9.t2406, i9.t2401, i9.t2367, i9.t2207, i9.t2202, i9.t2197, i9.u6.t2181, i14.t2176, i14.t2168, i14.t1467, i14.u253.t2152, i16.t1896, i16.t1737, i16.t1733, i16.t1732, i16.u268.t2106, i16.u285.t2052, i16.u289.t2044, i16.u289.t2121, i16.u500.t1464, i16.u500.t2131, i16.u399.t1735, i18.t2041, i18.t2024, i18.t1957, i18.t1922, i18.t1915, i18.u315.t2039, i18.u324.t1946, i19.t1889, i19.t1887, i19.t1870, i19.t1838, i19.t1829, i19.t1799, i19.t1757, i20.u381.t1788, i21.t1573, i21.t1569, i23.t1519, i23.t1515, i24.t1726, i24.t1724, i24.t1722, i24.t1720, i24.t1718, i24.t1705, i24.t1703, i24.t1689, i24.t1675, i24.t1673, i24.t1671, i24.t1667, i24.t1663, i24.t1651, i24.t1649, i24.t1626, i24.t1624, i24.t1610, i24.t1606, i24.t1604, i24.t1589, i24.t1587, i24.t1533, i24.u488.t1493, i24.u488.t1497, i24.u488.t1504, i24.u488.t1524, i24.u488.t1531, i24.u488.t1548, i24.u488.t1551, i24.u488.t1558, i24.u488.t1578, i24.u488.t1585, i24.u488.t1600, i24.u488.t1622, i24.u488.t1680, i24.u488.t1687, i24.u488.t1694, i24.u488.t1701, i24.u488.t1711, i25.t1459, i25.t1451, i25.t1435, i25.t750, i26.t1179, i26.t1020, i26.t1016, i26.t1015, i26.t754, i26.u763.t747, i26.u763.t1414, i26.u660.t1018, i29.t1324, i29.t1307, i29.t1240, i29.t1205, i29.t1198, i29.u586.t1229, i29.u578.t1322, i30.u640.t1071, i31.t1172, i31.t1170, i31.t1153, i31.t1121, i31.t1082, i31.t1040, i31.u626.t1112, i32.t1009, i32.t1007, i32.t1005, i32.t1003, i32.t1001, i32.t988, i32.t986, i32.t972, i32.t958, i32.t956, i32.t954, i32.t950, i32.t946, i32.t934, i32.t932, i32.t909, i32.t907, i32.t893, i32.t889, i32.t885, i32.t872, i32.t870, i32.t816, i32.u751.t776, i32.u751.t780, i32.u751.t787, i32.u751.t807, i32.u751.t814, i32.u751.t831, i32.u751.t834, i32.u751.t841, i32.u751.t861, i32.u751.t868, i32.u751.t883, i32.u751.t905, i32.u751.t963, i32.u751.t970, i32.u751.t977, i32.u751.t984, i32.u751.t994, i33.t856, i33.t852, i35.t802, i35.t798, i36.t741, i36.t717, i36.t32, i36.u5.t4, i36.u769.t733, i37.t461, i37.t302, i37.t298, i37.t297, i37.u793.t671, i37.u813.t617, i37.u764.t29, i37.u764.t696, i37.u817.t609, i37.u817.t686, i37.u927.t300, i40.t606, i40.t604, i40.t589, i40.t522, i40.t487, i40.u860.t480, i40.u854.t511, i41.t454, i41.t452, i41.t435, i41.t403, i41.t394, i41.t364, i41.t322, i42.u908.t353, i43.t291, i43.t289, i43.t287, i43.t285, i43.t283, i43.t270, i43.t268, i43.t254, i43.t240, i43.t238, i43.t236, i43.t232, i43.t228, i43.t216, i43.t214, i43.t191, i43.t189, i43.t175, i43.t171, i43.t167, i43.t154, i43.t152, i43.t98, i43.u1017.t58, i43.u1017.t62, i43.u1017.t69, i43.u1017.t89, i43.u1017.t96, i43.u1017.t113, i43.u1017.t116, i43.u1017.t123, i43.u1017.t143, i43.u1017.t150, i43.u1017.t165, i43.u1017.t187, i43.u1017.t245, i43.u1017.t252, i43.u1017.t259, i43.u1017.t266, i43.u1017.t276, i44.t138, i44.t134, i46.i0.i1.t80, i46.i0.i1.i0.t84, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :88/2723/272/3083
Computing Next relation with stutter on 497576 deadlock states
Compilation finished in 70269 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 117 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X(X([]((LTLAP0==true))))) || ( !( <>((LTLAP1==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([]((LTLAP0==true))))) || ( !( <>((LTLAP1==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([]((LTLAP0==true))))) || ( !( <>((LTLAP1==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)
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 items max in DFS search stack
7205 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,72.7927,1099200,1,0,1.4516e+06,12823,27331,4.72996e+06,819,72103,10297657
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("((i38.u798.p2004==1)&&((i36.u88.p572!=1)||(i36.u88.p598!=1)))")U(F((X("(i19.u350.p864==1)"))U("((i38.u798.p2004==1)||(i27.u546.p1353==1))"))))))
Formula 1 simplified : !G("((i38.u798.p2004==1)&&((i36.u88.p572!=1)||(i36.u88.p598!=1)))" U F(X"(i19.u350.p864==1)" U "((i38.u798.p2004==1)||(i27.u546.p1353==1))"))
Computing Next relation with stutter on 497576 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 items max in DFS search stack
1351 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,86.3099,1297928,1,0,1.80326e+06,12940,27401,5.92828e+06,821,73174,10860612
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(!(F(G("(i28.u573.p1426==1)")))))U(((G("(i16.u260.p630==1)"))&&("(i14.u257.p626==1)"))&&("(i32.u664.p1893==1)"))))
Formula 2 simplified : !(G!FG"(i28.u573.p1426==1)" U ("(i14.u257.p626==1)" & "(i32.u664.p1893==1)" & G"(i16.u260.p630==1)"))
Computing Next relation with stutter on 497576 deadlock states
43 unique states visited
43 strongly connected components in search stack
43 transitions explored
43 items max in DFS search stack
1616 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,102.485,1547736,1,0,2.30834e+06,13793,27524,6.89215e+06,823,79536,11822847
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F(X(G("(i32.u667.p1663==1)"))))||("(i19.u348.p859==1)"))))
Formula 3 simplified : !G("(i19.u348.p859==1)" | FXG"(i32.u667.p1663==1)")
Computing Next relation with stutter on 497576 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 items max in DFS search stack
115 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,103.645,1565940,1,0,2.3401e+06,13820,27576,6.96368e+06,823,79694,11910534
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(((!(F(G("(i26.u605.p1506==1)"))))||("(i7.u131.p322==1)"))U(G(X(("(i29.u585.p1456==1)")U(G(X("(i26.u605.p1506==1)")))))))))
Formula 4 simplified : !X(("(i7.u131.p322==1)" | !FG"(i26.u605.p1506==1)") U GX("(i29.u585.p1456==1)" U GX"(i26.u605.p1506==1)"))
Computing Next relation with stutter on 497576 deadlock states
101 unique states visited
101 strongly connected components in search stack
104 transitions explored
101 items max in DFS search stack
6145 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,165.125,2200548,1,0,3.62639e+06,18088,12680,1.06608e+07,442,96790,363854
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F((!(G("(i36.u775.p2567==1)")))&&("(i41.u923.p2300==1)")))&&(G((!(X(F("(i41.u923.p2300==1)"))))||("(i26.u604.p1508!=1)")))))
Formula 5 simplified : !(F("(i41.u923.p2300==1)" & !G"(i36.u775.p2567==1)") & G("(i26.u604.p1508!=1)" | !XF"(i41.u923.p2300==1)"))
Computing Next relation with stutter on 497576 deadlock states
38 unique states visited
38 strongly connected components in search stack
40 transitions explored
38 items max in DFS search stack
949 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,174.636,2200548,1,0,3.62639e+06,18088,15609,1.06608e+07,476,96790,1621464
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(X(((X("(i34.u726.p1810==1)"))U("(i40.u856.p2139==1)"))&&("(i40.u856.p2139==1)"))))||(G("(i40.u866.p2166==1)"))))
Formula 6 simplified : !(GX("(i40.u856.p2139==1)" & (X"(i34.u726.p1810==1)" U "(i40.u856.p2139==1)")) | G"(i40.u866.p2166==1)")
Computing Next relation with stutter on 497576 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
501 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,179.655,2200548,1,0,3.62639e+06,18088,15635,1.06608e+07,478,96790,2011616
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(i18.u331.p813==1)")U(F("(i18.u319.p784==1)")))||(F(X((F(G("(i18.u319.p784==1)")))&&("(i18.u331.p813==1)"))))))
Formula 7 simplified : !(("(i18.u331.p813==1)" U F"(i18.u319.p784==1)") | FX("(i18.u331.p813==1)" & FG"(i18.u319.p784==1)"))
Computing Next relation with stutter on 497576 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
303 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,182.694,2200548,1,0,3.62639e+06,18088,15720,1.06608e+07,478,96790,2365575
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((F("(i9.u84.p203==1)"))U(F(G(X("(i41.u884.p2211==1)")))))))
Formula 8 simplified : !F(F"(i9.u84.p203==1)" U FGX"(i41.u884.p2211==1)")
Computing Next relation with stutter on 497576 deadlock states
44 unique states visited
43 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
122 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,183.923,2200548,1,0,3.62639e+06,18088,15732,1.06608e+07,478,96790,2441848
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F((X(G(X(F(X((X("(i11.u187.p448==1)"))||("(i19.u350.p864==1)")))))))||(X("(i31.u628.p1566==1)"))))))
Formula 9 simplified : !GF(XGXFX("(i19.u350.p864==1)" | X"(i11.u187.p448==1)") | X"(i31.u628.p1566==1)")
Computing Next relation with stutter on 497576 deadlock states
48 unique states visited
48 strongly connected components in search stack
49 transitions explored
48 items max in DFS search stack
767 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,191.603,2200548,1,0,3.62639e+06,18088,15887,1.06608e+07,478,96790,3026306
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G("(i9.u158.p378!=1)"))U(X("((i39.u833.p2082==1)||(i38.u795.p1986==1))"))))
Formula 10 simplified : !(G"(i9.u158.p378!=1)" U X"((i39.u833.p2082==1)||(i38.u795.p1986==1))")
Computing Next relation with stutter on 497576 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
1825 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,209.85,2200548,1,0,3.62639e+06,18088,16023,1.06608e+07,478,96790,4596703
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(("(i11.u183.p438==1)")U("((i29.u558.p1388==1)&&(i36.u780.p1948==1))"))))
Formula 11 simplified : !X("(i11.u183.p438==1)" U "((i29.u558.p1388==1)&&(i36.u780.p1948==1))")
Computing Next relation with stutter on 497576 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,209.855,2200548,1,0,3.62639e+06,18088,16041,1.06608e+07,478,96790,4596814
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589508765492

--------------------
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="CloudReconfiguration-PT-315"
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 CloudReconfiguration-PT-315, 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 r051-ebro-158902545700114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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