Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972914400618.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 SimpleLoadBal-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972914400618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 4.5K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:38 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 SimpleLoadBal-PT-15-00
FORMULA_NAME SimpleLoadBal-PT-15-01
FORMULA_NAME SimpleLoadBal-PT-15-02
FORMULA_NAME SimpleLoadBal-PT-15-03
FORMULA_NAME SimpleLoadBal-PT-15-04
FORMULA_NAME SimpleLoadBal-PT-15-05
FORMULA_NAME SimpleLoadBal-PT-15-06
FORMULA_NAME SimpleLoadBal-PT-15-07
FORMULA_NAME SimpleLoadBal-PT-15-08
FORMULA_NAME SimpleLoadBal-PT-15-09
FORMULA_NAME SimpleLoadBal-PT-15-10
FORMULA_NAME SimpleLoadBal-PT-15-11
FORMULA_NAME SimpleLoadBal-PT-15-12
FORMULA_NAME SimpleLoadBal-PT-15-13
FORMULA_NAME SimpleLoadBal-PT-15-14
FORMULA_NAME SimpleLoadBal-PT-15-15

=== Now, execution of the tool begins

BK_START 1589917141266

[2020-05-19 19:39:03] [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-19 19:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 19:39:03] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2020-05-19 19:39:03] [INFO ] Transformed 149 places.
[2020-05-19 19:39:03] [INFO ] Transformed 1280 transitions.
[2020-05-19 19:39:03] [INFO ] Parsed PT model containing 149 places and 1280 transitions in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 598 ms. (steps per millisecond=167 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1]
[2020-05-19 19:39:04] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2020-05-19 19:39:04] [INFO ] Computed 39 place invariants in 27 ms
[2020-05-19 19:39:04] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-05-19 19:39:04] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:04] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2020-05-19 19:39:04] [INFO ] State equation strengthened by 481 read => feed constraints.
[2020-05-19 19:39:04] [INFO ] [Real]Added 481 Read/Feed constraints in 165 ms returned sat
[2020-05-19 19:39:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-05-19 19:39:05] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 11 ms returned sat
[2020-05-19 19:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:05] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2020-05-19 19:39:05] [INFO ] [Nat]Added 481 Read/Feed constraints in 253 ms returned sat
[2020-05-19 19:39:06] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 751 ms.
[2020-05-19 19:39:25] [INFO ] Added : 395 causal constraints over 79 iterations in 19148 ms. Result :unknown
[2020-05-19 19:39:25] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned unsat
[2020-05-19 19:39:25] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-05-19 19:39:25] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:25] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-05-19 19:39:25] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-19 19:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:25] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2020-05-19 19:39:25] [INFO ] [Real]Added 481 Read/Feed constraints in 240 ms returned sat
[2020-05-19 19:39:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-05-19 19:39:25] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-19 19:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:26] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2020-05-19 19:39:26] [INFO ] [Nat]Added 481 Read/Feed constraints in 273 ms returned sat
[2020-05-19 19:39:26] [INFO ] Deduced a trap composed of 81 places in 185 ms
[2020-05-19 19:39:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 229 ms
[2020-05-19 19:39:26] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-05-19 19:39:26] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:26] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2020-05-19 19:39:26] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 9 ms returned unsat
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 5 ms returned unsat
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:27] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Real]Added 481 Read/Feed constraints in 112 ms returned sat
[2020-05-19 19:39:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-19 19:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:28] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2020-05-19 19:39:28] [INFO ] [Nat]Added 481 Read/Feed constraints in 211 ms returned sat
[2020-05-19 19:39:28] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 169 ms.
[2020-05-19 19:39:47] [INFO ] Added : 380 causal constraints over 76 iterations in 19236 ms. Result :unknown
[2020-05-19 19:39:47] [INFO ] [Real]Absence check using 35 positive place invariants in 121 ms returned sat
[2020-05-19 19:39:47] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 16 ms returned sat
[2020-05-19 19:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:48] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Real]Added 481 Read/Feed constraints in 99 ms returned sat
[2020-05-19 19:39:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:39:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:39:48] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-05-19 19:39:48] [INFO ] [Nat]Added 481 Read/Feed constraints in 126 ms returned sat
[2020-05-19 19:39:49] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 120 ms.
[2020-05-19 19:40:08] [INFO ] Added : 365 causal constraints over 73 iterations in 19598 ms. Result :unknown
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 35 positive place invariants in 89 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 13 ms returned sat
[2020-05-19 19:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:09] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2020-05-19 19:40:09] [INFO ] [Real]Added 481 Read/Feed constraints in 234 ms returned sat
[2020-05-19 19:40:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:40:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-05-19 19:40:10] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-19 19:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:10] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2020-05-19 19:40:11] [INFO ] [Nat]Added 481 Read/Feed constraints in 276 ms returned sat
[2020-05-19 19:40:11] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 292 ms.
[2020-05-19 19:40:30] [INFO ] Added : 335 causal constraints over 67 iterations in 18859 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-19 19:40:30] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-05-19 19:40:30] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-19 19:40:30] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-05-19 19:40:30] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:30] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-05-19 19:40:30] [INFO ] [Real]Added 481 Read/Feed constraints in 236 ms returned sat
[2020-05-19 19:40:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:40:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 128 ms returned sat
[2020-05-19 19:40:30] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 21 ms returned sat
[2020-05-19 19:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:32] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2020-05-19 19:40:32] [INFO ] [Nat]Added 481 Read/Feed constraints in 277 ms returned sat
[2020-05-19 19:40:33] [INFO ] Deduced a trap composed of 21 places in 1336 ms
[2020-05-19 19:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1425 ms
[2020-05-19 19:40:34] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 289 ms.
[2020-05-19 19:40:50] [INFO ] Added : 355 causal constraints over 71 iterations in 17076 ms. Result :unknown
[2020-05-19 19:40:50] [INFO ] [Real]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-05-19 19:40:50] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-19 19:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:51] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2020-05-19 19:40:52] [INFO ] [Real]Added 481 Read/Feed constraints in 185 ms returned sat
[2020-05-19 19:40:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:40:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 218 ms returned sat
[2020-05-19 19:40:52] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 37 ms returned sat
[2020-05-19 19:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:40:52] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2020-05-19 19:40:53] [INFO ] [Nat]Added 481 Read/Feed constraints in 203 ms returned sat
[2020-05-19 19:40:53] [INFO ] Deduced a trap composed of 19 places in 824 ms
[2020-05-19 19:40:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 889 ms
[2020-05-19 19:40:54] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 179 ms.
[2020-05-19 19:41:12] [INFO ] Added : 380 causal constraints over 76 iterations in 18186 ms. Result :unknown
[2020-05-19 19:41:12] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-05-19 19:41:12] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:41:13] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2020-05-19 19:41:13] [INFO ] [Real]Added 481 Read/Feed constraints in 208 ms returned sat
[2020-05-19 19:41:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:41:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-05-19 19:41:13] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-19 19:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:41:14] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2020-05-19 19:41:14] [INFO ] [Nat]Added 481 Read/Feed constraints in 269 ms returned sat
[2020-05-19 19:41:15] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 271 ms.
[2020-05-19 19:41:33] [INFO ] Added : 385 causal constraints over 77 iterations in 18706 ms. Result :unknown
[2020-05-19 19:41:33] [INFO ] [Real]Absence check using 35 positive place invariants in 150 ms returned sat
[2020-05-19 19:41:33] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 13 ms returned unsat
[2020-05-19 19:41:33] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2020-05-19 19:41:33] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 27 ms returned sat
[2020-05-19 19:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:41:34] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-05-19 19:41:34] [INFO ] [Real]Added 481 Read/Feed constraints in 148 ms returned sat
[2020-05-19 19:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:41:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2020-05-19 19:41:34] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:41:34] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2020-05-19 19:41:34] [INFO ] [Nat]Added 481 Read/Feed constraints in 163 ms returned sat
[2020-05-19 19:41:35] [INFO ] Deduced a trap composed of 19 places in 327 ms
[2020-05-19 19:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2020-05-19 19:41:35] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 240 ms.
[2020-05-19 19:41:54] [INFO ] Added : 370 causal constraints over 74 iterations in 19032 ms. Result :(error "Failed to check-sat")
[2020-05-19 19:41:54] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-05-19 19:41:54] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-19 19:41:54] [INFO ] [Real]Absence check using 35 positive place invariants in 200 ms returned sat
[2020-05-19 19:41:54] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 27 ms returned sat
[2020-05-19 19:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:41:55] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2020-05-19 19:41:56] [INFO ] [Real]Added 481 Read/Feed constraints in 166 ms returned sat
[2020-05-19 19:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:41:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2020-05-19 19:41:56] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:41:56] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2020-05-19 19:41:56] [INFO ] [Nat]Added 481 Read/Feed constraints in 224 ms returned sat
[2020-05-19 19:41:56] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 121 ms.
[2020-05-19 19:42:16] [INFO ] Added : 410 causal constraints over 82 iterations in 19295 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-19 19:42:16] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-05-19 19:42:16] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:42:16] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-05-19 19:42:17] [INFO ] [Real]Added 481 Read/Feed constraints in 211 ms returned sat
[2020-05-19 19:42:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:42:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-05-19 19:42:17] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:42:17] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2020-05-19 19:42:17] [INFO ] [Nat]Added 481 Read/Feed constraints in 144 ms returned sat
[2020-05-19 19:42:17] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 98 ms.
[2020-05-19 19:42:37] [INFO ] Added : 400 causal constraints over 80 iterations in 19318 ms. Result :(error "Failed to check-sat")
[2020-05-19 19:42:37] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-05-19 19:42:37] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:42:37] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-05-19 19:42:37] [INFO ] [Real]Added 481 Read/Feed constraints in 150 ms returned sat
[2020-05-19 19:42:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:42:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-05-19 19:42:37] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:42:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:42:38] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2020-05-19 19:42:38] [INFO ] [Nat]Added 481 Read/Feed constraints in 198 ms returned sat
[2020-05-19 19:42:39] [INFO ] Deduced a trap composed of 22 places in 1078 ms
[2020-05-19 19:42:41] [INFO ] Deduced a trap composed of 21 places in 2006 ms
[2020-05-19 19:42:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3174 ms
[2020-05-19 19:42:41] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 188 ms.
[2020-05-19 19:42:57] [INFO ] Added : 350 causal constraints over 70 iterations in 16106 ms. Result :(error "Failed to check-sat")
[2020-05-19 19:42:57] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-05-19 19:42:57] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-19 19:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:42:58] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2020-05-19 19:42:59] [INFO ] [Real]Added 481 Read/Feed constraints in 259 ms returned sat
[2020-05-19 19:42:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:42:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 127 ms returned sat
[2020-05-19 19:42:59] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 36 ms returned sat
[2020-05-19 19:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:43:00] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2020-05-19 19:43:00] [INFO ] [Nat]Added 481 Read/Feed constraints in 233 ms returned sat
[2020-05-19 19:43:02] [INFO ] Deduced a trap composed of 21 places in 2057 ms
[2020-05-19 19:43:02] [INFO ] Deduced a trap composed of 20 places in 163 ms
[2020-05-19 19:43:03] [INFO ] Deduced a trap composed of 19 places in 189 ms
[2020-05-19 19:43:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2546 ms
[2020-05-19 19:43:03] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 131 ms.
[2020-05-19 19:43:19] [INFO ] Added : 375 causal constraints over 75 iterations in 16020 ms. Result :unknown
[2020-05-19 19:43:19] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-05-19 19:43:19] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-19 19:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 19:43:19] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2020-05-19 19:43:19] [INFO ] [Real]Added 481 Read/Feed constraints in 143 ms returned sat
[2020-05-19 19:43:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 19:43:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2020-05-19 19:43:19] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-19 19:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 19:43:20] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2020-05-19 19:43:20] [INFO ] [Nat]Added 481 Read/Feed constraints in 215 ms returned sat
[2020-05-19 19:43:20] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 126 ms.
[2020-05-19 19:43:39] [INFO ] Added : 420 causal constraints over 84 iterations in 19289 ms. Result :(error "Failed to check-sat")
[2020-05-19 19:43:39] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-05-19 19:43:39] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned unsat
[2020-05-19 19:43:39] [INFO ] [Real]Absence check using 35 positive place invariants in 104 ms returned sat
[2020-05-19 19:43:39] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2020-05-19 19:43:40] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-19 19:43:40] [INFO ] Flatten gal took : 143 ms
FORMULA SimpleLoadBal-PT-15-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 19:43:40] [INFO ] Flatten gal took : 84 ms
[2020-05-19 19:43:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SimpleLoadBal-PT-15-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 19:43:40] [INFO ] Applying decomposition
[2020-05-19 19:43:40] [INFO ] Flatten gal took : 173 ms
[2020-05-19 19:43:40] [INFO ] Input system was already deterministic with 1280 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/graph7006493129982707320.txt, -o, /tmp/graph7006493129982707320.bin, -w, /tmp/graph7006493129982707320.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/graph7006493129982707320.bin, -l, -1, -v, -w, /tmp/graph7006493129982707320.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 19:43:40] [INFO ] Decomposing Gal with order
[2020-05-19 19:43:40] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1010 out of 1280 initially.
// Phase 1: matrix 1010 rows 149 cols
[2020-05-19 19:43:41] [INFO ] Computed 39 place invariants in 11 ms
inv : P_client_idle_5 + P_client_request_5 + P_client_ack_5 + P_server_request_5_1 + P_server_request_5_2 + P_lb_routing_1_5 = 1
inv : P_client_idle_6 + P_client_request_6 + P_client_ack_6 + P_server_request_6_1 + P_server_request_6_2 + P_lb_routing_1_6 = 1
inv : P_client_idle_7 + P_client_request_7 + P_client_ack_7 + P_server_request_7_1 + P_server_request_7_2 + P_lb_routing_1_7 = 1
inv : P_client_idle_4 + P_client_request_4 + P_client_ack_4 + P_server_request_4_1 + P_server_request_4_2 + P_lb_routing_1_4 = 1
inv : P_client_idle_13 + P_client_waiting_13 = 1
inv : P_client_idle_3 + P_client_request_3 + P_client_ack_3 + P_server_request_3_1 + P_server_request_3_2 + P_lb_routing_1_3 = 1
inv : P_client_idle_8 + P_client_request_8 + P_client_ack_8 + P_server_request_8_1 + P_server_request_8_2 + P_lb_routing_1_8 = 1
inv : -P_server_idle_2 - P_server_notification_ack_2 + P_server_request_1_2 + P_server_request_2_2 + P_server_request_3_2 + P_server_request_4_2 + P_server_request_5_2 + P_server_request_6_2 + P_server_request_7_2 + P_server_request_8_2 + P_server_request_9_2 + P_server_request_10_2 + P_server_request_11_2 + P_server_request_12_2 + P_server_request_13_2 + P_server_request_14_2 + P_server_request_15_2 + 14*P_lb_load_2_0 + 13*P_lb_load_2_1 + 12*P_lb_load_2_2 + 11*P_lb_load_2_3 + 10*P_lb_load_2_4 + 9*P_lb_load_2_5 + 8*P_lb_load_2_6 + 7*P_lb_load_2_7 + 6*P_lb_load_2_8 + 5*P_lb_load_2_9 + 4*P_lb_load_2_10 + 3*P_lb_load_2_11 + 2*P_lb_load_2_12 + P_lb_load_2_13 - P_lb_load_2_15 = 13
inv : P_client_idle_2 + P_client_request_2 + P_client_ack_2 + P_server_request_2_1 + P_server_request_2_2 + P_lb_routing_1_2 = 1
inv : P_client_idle_9 + P_client_request_9 + P_client_ack_9 + P_server_request_9_1 + P_server_request_9_2 + P_lb_routing_1_9 = 1
inv : P_client_idle_11 + P_client_request_11 + P_client_ack_11 + P_server_request_11_1 + P_server_request_11_2 + P_lb_routing_1_11 = 1
inv : P_client_idle_3 + P_client_waiting_3 = 1
inv : P_client_idle_10 + P_client_request_10 + P_client_ack_10 + P_server_request_10_1 + P_server_request_10_2 + P_lb_routing_1_10 = 1
inv : P_client_idle_1 + P_client_request_1 + P_client_ack_1 + P_server_request_1_1 + P_server_request_1_2 + P_lb_routing_1_1 = 1
inv : -P_client_idle_2 - P_client_idle_3 - P_client_idle_4 - P_client_idle_5 - P_client_idle_6 - P_client_idle_7 - P_client_idle_8 - P_client_idle_9 - P_client_idle_10 - P_client_idle_11 - P_client_idle_12 - P_client_idle_13 - P_client_idle_14 - P_client_idle_15 - P_client_request_2 - P_client_request_3 - P_client_request_4 - P_client_request_5 - P_client_request_6 - P_client_request_7 - P_client_request_8 - P_client_request_9 - P_client_request_10 - P_client_request_11 - P_client_request_12 - P_client_request_13 - P_client_request_14 - P_client_request_15 - P_client_ack_2 - P_client_ack_3 - P_client_ack_4 - P_client_ack_5 - P_client_ack_6 - P_client_ack_7 - P_client_ack_8 - P_client_ack_9 - P_client_ack_10 - P_client_ack_11 - P_client_ack_12 - P_client_ack_13 - P_client_ack_14 - P_client_ack_15 - P_server_idle_1 - P_server_notification_ack_1 + P_server_request_1_1 - P_server_request_2_2 - P_server_request_3_2 - P_server_request_4_2 - P_server_request_5_2 - P_server_request_6_2 - P_server_request_7_2 - P_server_request_8_2 - P_server_request_9_2 - P_server_request_10_2 - P_server_request_11_2 - P_server_request_12_2 - P_server_request_13_2 - P_server_request_14_2 - P_server_request_15_2 - P_lb_routing_1_2 - P_lb_routing_1_3 - P_lb_routing_1_4 - P_lb_routing_1_5 - P_lb_routing_1_6 - P_lb_routing_1_7 - P_lb_routing_1_8 - P_lb_routing_1_9 - P_lb_routing_1_10 - P_lb_routing_1_11 - P_lb_routing_1_12 - P_lb_routing_1_13 - P_lb_routing_1_14 - P_lb_routing_1_15 + 14*P_lb_load_1_0 + 13*P_lb_load_1_1 + 12*P_lb_load_1_2 + 11*P_lb_load_1_3 + 10*P_lb_load_1_4 + 9*P_lb_load_1_5 + 8*P_lb_load_1_6 + 7*P_lb_load_1_7 + 6*P_lb_load_1_8 + 5*P_lb_load_1_9 + 4*P_lb_load_1_10 + 3*P_lb_load_1_11 + 2*P_lb_load_1_12 + P_lb_load_1_13 - P_lb_load_1_15 = -1
inv : P_client_idle_2 + P_client_idle_3 + P_client_idle_4 + P_client_idle_5 + P_client_idle_6 + P_client_idle_7 + P_client_idle_8 + P_client_idle_9 + P_client_idle_10 + P_client_idle_11 + P_client_idle_12 + P_client_idle_13 + P_client_idle_14 + P_client_idle_15 + P_client_request_2 + P_client_request_3 + P_client_request_4 + P_client_request_5 + P_client_request_6 + P_client_request_7 + P_client_request_8 + P_client_request_9 + P_client_request_10 + P_client_request_11 + P_client_request_12 + P_client_request_13 + P_client_request_14 + P_client_request_15 + P_client_ack_2 + P_client_ack_3 + P_client_ack_4 + P_client_ack_5 + P_client_ack_6 + P_client_ack_7 + P_client_ack_8 + P_client_ack_9 + P_client_ack_10 + P_client_ack_11 + P_client_ack_12 + P_client_ack_13 + P_client_ack_14 + P_client_ack_15 + P_server_idle_1 + P_server_notification_ack_1 - P_server_request_1_1 + P_server_request_2_2 + P_server_request_3_2 + P_server_request_4_2 + P_server_request_5_2 + P_server_request_6_2 + P_server_request_7_2 + P_server_request_8_2 + P_server_request_9_2 + P_server_request_10_2 + P_server_request_11_2 + P_server_request_12_2 + P_server_request_13_2 + P_server_request_14_2 + P_server_request_15_2 + P_lb_routing_1_2 + P_lb_routing_1_3 + P_lb_routing_1_4 + P_lb_routing_1_5 + P_lb_routing_1_6 + P_lb_routing_1_7 + P_lb_routing_1_8 + P_lb_routing_1_9 + P_lb_routing_1_10 + P_lb_routing_1_11 + P_lb_routing_1_12 + P_lb_routing_1_13 + P_lb_routing_1_14 + P_lb_routing_1_15 - P_lb_load_1_0 + P_lb_load_1_2 + 2*P_lb_load_1_3 + 3*P_lb_load_1_4 + 4*P_lb_load_1_5 + 5*P_lb_load_1_6 + 6*P_lb_load_1_7 + 7*P_lb_load_1_8 + 8*P_lb_load_1_9 + 9*P_lb_load_1_10 + 10*P_lb_load_1_11 + 11*P_lb_load_1_12 + 12*P_lb_load_1_13 + 13*P_lb_load_1_14 + 14*P_lb_load_1_15 = 14
inv : P_client_idle_6 + P_client_waiting_6 = 1
inv : P_server_idle_1 + P_server_waiting_1 + P_server_processed_1 = 1
inv : P_client_idle_1 + P_client_waiting_1 = 1
inv : P_lb_idle_1 + P_lb_routing_1_1 + P_lb_routing_1_2 + P_lb_routing_1_3 + P_lb_routing_1_4 + P_lb_routing_1_5 + P_lb_routing_1_6 + P_lb_routing_1_7 + P_lb_routing_1_8 + P_lb_routing_1_9 + P_lb_routing_1_10 + P_lb_routing_1_11 + P_lb_routing_1_12 + P_lb_routing_1_13 + P_lb_routing_1_14 + P_lb_routing_1_15 + P_lb_balancing_1 = 1
inv : P_client_idle_15 + P_client_waiting_15 = 1
inv : P_client_idle_7 + P_client_waiting_7 = 1
inv : P_client_idle_12 + P_client_request_12 + P_client_ack_12 + P_server_request_12_1 + P_server_request_12_2 + P_lb_routing_1_12 = 1
inv : P_client_idle_10 + P_client_waiting_10 = 1
inv : P_client_idle_14 + P_client_request_14 + P_client_ack_14 + P_server_request_14_1 + P_server_request_14_2 + P_lb_routing_1_14 = 1
inv : P_server_idle_1 + P_server_processed_1 + P_server_notification_1 + P_server_notification_ack_1 = 1
inv : P_server_idle_2 + P_server_waiting_2 + P_server_processed_2 = 1
inv : P_client_idle_9 + P_client_waiting_9 = 1
inv : P_client_idle_4 + P_client_waiting_4 = 1
inv : P_server_idle_2 + P_server_processed_2 + P_server_notification_2 + P_server_notification_ack_2 = 1
inv : P_server_idle_2 + P_server_notification_ack_2 - P_server_request_1_2 - P_server_request_2_2 - P_server_request_3_2 - P_server_request_4_2 - P_server_request_5_2 - P_server_request_6_2 - P_server_request_7_2 - P_server_request_8_2 - P_server_request_9_2 - P_server_request_10_2 - P_server_request_11_2 - P_server_request_12_2 - P_server_request_13_2 - P_server_request_14_2 - P_server_request_15_2 - P_lb_load_2_0 + P_lb_load_2_2 + 2*P_lb_load_2_3 + 3*P_lb_load_2_4 + 4*P_lb_load_2_5 + 5*P_lb_load_2_6 + 6*P_lb_load_2_7 + 7*P_lb_load_2_8 + 8*P_lb_load_2_9 + 9*P_lb_load_2_10 + 10*P_lb_load_2_11 + 11*P_lb_load_2_12 + 12*P_lb_load_2_13 + 13*P_lb_load_2_14 + 14*P_lb_load_2_15 = 0
inv : P_client_idle_12 + P_client_waiting_12 = 1
inv : P_client_idle_11 + P_client_waiting_11 = 1
inv : P_client_idle_15 + P_client_request_15 + P_client_ack_15 + P_server_request_15_1 + P_server_request_15_2 + P_lb_routing_1_15 = 1
inv : P_client_idle_13 + P_client_request_13 + P_client_ack_13 + P_server_request_13_1 + P_server_request_13_2 + P_lb_routing_1_13 = 1
inv : P_client_idle_2 + P_client_waiting_2 = 1
inv : P_client_idle_5 + P_client_waiting_5 = 1
inv : P_client_idle_8 + P_client_waiting_8 = 1
inv : P_client_idle_14 + P_client_waiting_14 = 1
Total of 39 invariants.
[2020-05-19 19:43:41] [INFO ] Computed 39 place invariants in 15 ms
[2020-05-19 19:43:41] [INFO ] Removed a total of 3815 redundant transitions.
[2020-05-19 19:43:41] [INFO ] Flatten gal took : 289 ms
[2020-05-19 19:43:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 42 ms.
[2020-05-19 19:43:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
[2020-05-19 19:43:41] [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 10 LTL properties
Checking formula 0 : !(((X(!(("(((i9.u18.P_server_notification_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_2_4>=1))")U("((((i0.u24.P_server_request_2_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_3>=1))&&(i17.u35.P_lb_load_2_1>=1))"))))U((!(X("(((i14.u29.P_lb_routing_1_9>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_6>=1))")))&&("(((i14.u29.P_lb_routing_1_9<1)||(i17.u39.P_lb_load_1_5<1))||(i17.u39.P_lb_load_2_6<1))"))))
Formula 0 simplified : !(X!("(((i9.u18.P_server_notification_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_2_4>=1))" U "((((i0.u24.P_server_request_2_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_3>=1))&&(i17.u35.P_lb_load_2_1>=1))") U ("(((i14.u29.P_lb_routing_1_9<1)||(i17.u39.P_lb_load_1_5<1))||(i17.u39.P_lb_load_2_6<1))" & !X"(((i14.u29.P_lb_routing_1_9>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_6>=1))"))
built 137 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 42 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
[2020-05-19 19:43:42] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-19 19:43:42] [INFO ] Built C files in 2172ms 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]
Reverse transition relation is NOT exact ! Due to transitions T_server_process_1, T_server_process_2, T_server_process_3, T_server_process_4, T_server_process_5, T_server_process_6, T_server_process_7, T_server_process_8, T_server_process_9, T_server_process_10, T_server_process_11, T_server_process_12, T_server_process_13, T_server_process_14, T_server_process_15, T_server_process_16, T_server_process_17, T_server_process_18, T_server_process_19, T_server_process_20, T_server_process_21, T_server_process_22, T_server_process_23, T_server_process_24, T_server_process_25, T_server_process_26, T_server_process_27, T_server_process_28, T_server_process_29, T_server_process_30, T_lb_idle_receive_notification_2, T_lb_idle_receive_notification_5, T_lb_idle_receive_notification_8, T_lb_idle_receive_notification_9, T_lb_idle_receive_notification_18, T_lb_idle_receive_notification_21, T_lb_idle_receive_notification_24, T_lb_idle_receive_notification_26, T_lb_no_balance_154, T_lb_balance_to_2_2266, T_lb_balance_to_2_2267, T_lb_balance_to_2_2268, T_lb_balance_to_2_2269, T_lb_balance_to_2_2270, T_lb_balance_to_2_2271, T_lb_balance_to_2_2272, T_lb_balance_to_2_2273, T_lb_balance_to_2_2274, T_lb_balance_to_2_2275, T_lb_balance_to_2_2276, T_lb_balance_to_2_2277, T_lb_balance_to_2_2278, T_lb_balance_to_2_2279, T_lb_balance_to_2_2280, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :359/355/54/768
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
519 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.2583,84984,1,0,150459,1864,5504,161971,447,6529,337478
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-15-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("(((i1.u26.P_lb_routing_1_6>=1)&&(i17.u35.P_lb_load_1_3>=1))&&(i17.u39.P_lb_load_2_4>=1))"))))
Formula 1 simplified : !GF"(((i1.u26.P_lb_routing_1_6>=1)&&(i17.u35.P_lb_load_1_3>=1))&&(i17.u39.P_lb_load_2_4>=1))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
291 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.16556,135580,1,0,245748,1865,5953,275490,451,6543,609266
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((i4.u33.P_server_request_13_1<1)||(i17.u22.P_lb_balancing_1<1))||(u36.P_lb_load_1_8<1))||(i17.u39.P_lb_load_2_6<1))")U(G(("((((i16.u32.P_server_request_12_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_0>=1))")U("((((i11.u25.P_server_request_4_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_1_4>=1))&&(i17.u35.P_lb_load_2_2>=1))")))))
Formula 2 simplified : !("((((i4.u33.P_server_request_13_1<1)||(i17.u22.P_lb_balancing_1<1))||(u36.P_lb_load_1_8<1))||(i17.u39.P_lb_load_2_6<1))" U G("((((i16.u32.P_server_request_12_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_0>=1))" U "((((i11.u25.P_server_request_4_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_1_4>=1))&&(i17.u35.P_lb_load_2_2>=1))"))
Compilation finished in 14520 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 95 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAP5==true))U([](((LTLAP6==true))U((LTLAP7==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, -p, --pins-guards, --when, --ltl, ((LTLAP5==true))U([](((LTLAP6==true))U((LTLAP7==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, -p, --pins-guards, --when, --ltl, ((LTLAP5==true))U([](((LTLAP6==true))U((LTLAP7==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1031 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,18.4744,327016,1,0,604316,1866,6105,657330,454,6566,1409720
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X((F("((i9.u16.P_server_idle_2>=1)&&(i8.u21.P_server_request_15_2>=1))"))U("((((i0.u24.P_server_request_2_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_0>=1))")))&&((X("((((i0.u24.P_server_request_2_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_0>=1))"))||(F(G("((i4.u13.P_client_waiting_13>=1)&&(i4.u13.P_client_ack_13>=1))"))))))
Formula 3 simplified : !(X(F"((i9.u16.P_server_idle_2>=1)&&(i8.u21.P_server_request_15_2>=1))" U "((((i0.u24.P_server_request_2_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_0>=1))") & (X"((((i0.u24.P_server_request_2_1>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_0>=1))" | FG"((i4.u13.P_client_waiting_13>=1)&&(i4.u13.P_client_ack_13>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
888 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,27.3509,487724,1,0,880082,1866,6161,972345,454,6566,2102488
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(X(X(("(((((i15.u31.P_server_request_11_2<1)||(i17.u22.P_lb_balancing_1<1))||(u38.P_lb_load_1_13<1))||(u38.P_lb_load_2_15<1))&&((i14.u9.P_client_request_9<1)||(i17.u22.P_lb_idle_1<1)))")U(F(G("(((i16.u32.P_lb_routing_1_12>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_4>=1))")))))))))
Formula 4 simplified : !XFXX("(((((i15.u31.P_server_request_11_2<1)||(i17.u22.P_lb_balancing_1<1))||(u38.P_lb_load_1_13<1))||(u38.P_lb_load_2_15<1))&&((i14.u9.P_client_request_9<1)||(i17.u22.P_lb_idle_1<1)))" U FG"(((i16.u32.P_lb_routing_1_12>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_4>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5933 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.6861,1773072,1,0,3.55644e+06,1866,6195,3.73831e+06,454,6567,6924976
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("((((i5.u34.P_lb_routing_1_14<1)||(i17.u35.P_lb_load_1_2<1))||(i17.u35.P_lb_load_2_3<1))&&(((i15.u31.P_lb_routing_1_11<1)||(i17.u35.P_lb_load_1_0<1))||(i17.u35.P_lb_load_2_1<1)))")))
Formula 5 simplified : !G"((((i5.u34.P_lb_routing_1_14<1)||(i17.u35.P_lb_load_1_2<1))||(i17.u35.P_lb_load_2_3<1))&&(((i15.u31.P_lb_routing_1_11<1)||(i17.u35.P_lb_load_1_0<1))||(i17.u35.P_lb_load_2_1<1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1392 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,100.607,2080364,1,0,4.08534e+06,1911,6257,4.33683e+06,459,6766,8159812
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X("(((i3.u30.P_lb_routing_1_10>=1)&&(i17.u35.P_lb_load_1_1>=1))&&(i17.u35.P_lb_load_2_0>=1))")))U(((((X(!(X(!(G(X("(((i4.u33.P_lb_routing_1_13>=1)&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_3>=1))")))))))&&("(i12.u27.P_server_request_7_2>=1)"))&&("(i17.u22.P_lb_balancing_1>=1)"))&&("(u37.P_lb_load_1_12>=1)"))&&("(u38.P_lb_load_2_14>=1)"))))
Formula 6 simplified : !(XX"(((i3.u30.P_lb_routing_1_10>=1)&&(i17.u35.P_lb_load_1_1>=1))&&(i17.u35.P_lb_load_2_0>=1))" U ("(i12.u27.P_server_request_7_2>=1)" & "(i17.u22.P_lb_balancing_1>=1)" & "(u37.P_lb_load_1_12>=1)" & "(u38.P_lb_load_2_14>=1)" & X!X!GX"(((i4.u33.P_lb_routing_1_13>=1)&&(i17.u35.P_lb_load_1_2>=1))&&(i17.u35.P_lb_load_2_3>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
570 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,106.321,2182588,1,0,4.24116e+06,1911,6296,4.53674e+06,460,6766,8568974
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(G(F((!(("((((i10.u23.P_server_request_1_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_1_5>=1))&&(u36.P_lb_load_2_7>=1))")U(X("(((i9.u18.P_server_notification_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(u37.P_lb_load_2_11>=1))"))))||("((((i10.u23.P_server_request_1_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_1_5>=1))&&(u36.P_lb_load_2_7>=1))")))))))
Formula 7 simplified : !GFGF("((((i10.u23.P_server_request_1_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_1_5>=1))&&(u36.P_lb_load_2_7>=1))" | !("((((i10.u23.P_server_request_1_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(i17.u39.P_lb_load_1_5>=1))&&(u36.P_lb_load_2_7>=1))" U X"(((i9.u18.P_server_notification_2>=1)&&(i17.u22.P_lb_balancing_1>=1))&&(u37.P_lb_load_2_11>=1))"))
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,106.394,2183644,1,0,4.24272e+06,1911,6347,4.53816e+06,460,6766,8572428
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-15-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X("((i1.u2.P_client_waiting_6>=1)&&(i1.u2.P_client_ack_6>=1))")))
Formula 8 simplified : !X"((i1.u2.P_client_waiting_6>=1)&&(i1.u2.P_client_ack_6>=1))"
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,106.408,2183908,1,0,4.24277e+06,1911,6360,4.53824e+06,462,6766,8572936
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SimpleLoadBal-PT-15-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!((X("(((i4.u33.P_lb_routing_1_13>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_4>=1))"))U("(((i4.u33.P_lb_routing_1_13>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_4>=1))"))))
Formula 9 simplified : X"(((i4.u33.P_lb_routing_1_13>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_4>=1))" U "(((i4.u33.P_lb_routing_1_13>=1)&&(i17.u39.P_lb_load_1_5>=1))&&(i17.u39.P_lb_load_2_4>=1))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,106.409,2183908,1,0,4.24277e+06,1911,6369,4.53824e+06,462,6766,8572960
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SimpleLoadBal-PT-15-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589917546364

--------------------
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="SimpleLoadBal-PT-15"
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 SimpleLoadBal-PT-15, 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 r156-oct2-158972914400618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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