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.r211-tajo-159033478401082.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 itslola
Input is ShieldRVt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 3.5K May 14 03:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 03:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 273K May 12 20:42 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 ShieldRVt-PT-100A-00
FORMULA_NAME ShieldRVt-PT-100A-01
FORMULA_NAME ShieldRVt-PT-100A-02
FORMULA_NAME ShieldRVt-PT-100A-03
FORMULA_NAME ShieldRVt-PT-100A-04
FORMULA_NAME ShieldRVt-PT-100A-05
FORMULA_NAME ShieldRVt-PT-100A-06
FORMULA_NAME ShieldRVt-PT-100A-07
FORMULA_NAME ShieldRVt-PT-100A-08
FORMULA_NAME ShieldRVt-PT-100A-09
FORMULA_NAME ShieldRVt-PT-100A-10
FORMULA_NAME ShieldRVt-PT-100A-11
FORMULA_NAME ShieldRVt-PT-100A-12
FORMULA_NAME ShieldRVt-PT-100A-13
FORMULA_NAME ShieldRVt-PT-100A-14
FORMULA_NAME ShieldRVt-PT-100A-15

=== Now, execution of the tool begins

BK_START 1591340794051

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:06:36] [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, -timeout, 3600, -rebuildPNML]
[2020-06-05 07:06:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:06:37] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2020-06-05 07:06:37] [INFO ] Transformed 803 places.
[2020-06-05 07:06:37] [INFO ] Transformed 803 transitions.
[2020-06-05 07:06:37] [INFO ] Found NUPN structural information;
[2020-06-05 07:06:37] [INFO ] Parsed PT model containing 803 places and 803 transitions in 130 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1026 ms. (steps per millisecond=97 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0]
// Phase 1: matrix 802 rows 803 cols
[2020-06-05 07:06:38] [INFO ] Computed 401 place invariants in 19 ms
[2020-06-05 07:06:38] [INFO ] [Real]Absence check using 401 positive place invariants in 189 ms returned sat
[2020-06-05 07:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:40] [INFO ] [Real]Absence check using state equation in 1541 ms returned sat
[2020-06-05 07:06:40] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 59 ms.
[2020-06-05 07:06:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:06:40] [INFO ] [Nat]Absence check using 401 positive place invariants in 169 ms returned sat
[2020-06-05 07:06:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:06:42] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2020-06-05 07:06:42] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 69 ms.
[2020-06-05 07:06:59] [INFO ] Added : 798 causal constraints over 160 iterations in 17283 ms. Result :sat
[2020-06-05 07:06:59] [INFO ] [Real]Absence check using 401 positive place invariants in 236 ms returned sat
[2020-06-05 07:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:01] [INFO ] [Real]Absence check using state equation in 1402 ms returned sat
[2020-06-05 07:07:01] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 58 ms.
[2020-06-05 07:07:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:07:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 230 ms returned sat
[2020-06-05 07:07:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:03] [INFO ] [Nat]Absence check using state equation in 1398 ms returned sat
[2020-06-05 07:07:03] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 63 ms.
[2020-06-05 07:07:21] [INFO ] Added : 781 causal constraints over 157 iterations in 18209 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:07:21] [INFO ] [Real]Absence check using 401 positive place invariants in 228 ms returned sat
[2020-06-05 07:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:24] [INFO ] [Real]Absence check using state equation in 2553 ms returned sat
[2020-06-05 07:07:24] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:07:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:07:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 2391 ms returned sat
[2020-06-05 07:07:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:33] [INFO ] [Nat]Absence check using state equation in 6088 ms returned sat
[2020-06-05 07:07:33] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:07:44] [INFO ] Added : 635 causal constraints over 127 iterations in 11331 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:07:45] [INFO ] [Real]Absence check using 401 positive place invariants in 184 ms returned sat
[2020-06-05 07:07:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:46] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2020-06-05 07:07:46] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 63 ms.
[2020-06-05 07:07:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:07:47] [INFO ] [Nat]Absence check using 401 positive place invariants in 247 ms returned sat
[2020-06-05 07:07:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:07:48] [INFO ] [Nat]Absence check using state equation in 1412 ms returned sat
[2020-06-05 07:07:48] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 77 ms.
[2020-06-05 07:08:06] [INFO ] Added : 795 causal constraints over 159 iterations in 18179 ms. Result :unknown
[2020-06-05 07:08:07] [INFO ] [Real]Absence check using 401 positive place invariants in 269 ms returned sat
[2020-06-05 07:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:08] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2020-06-05 07:08:08] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 63 ms.
[2020-06-05 07:08:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:11] [INFO ] [Nat]Absence check using 401 positive place invariants in 2514 ms returned sat
[2020-06-05 07:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:17] [INFO ] [Nat]Absence check using state equation in 5949 ms returned sat
[2020-06-05 07:08:17] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:08:28] [INFO ] Added : 615 causal constraints over 123 iterations in 11380 ms. Result :(error "Failed to check-sat")
[2020-06-05 07:08:29] [INFO ] [Real]Absence check using 401 positive place invariants in 435 ms returned sat
[2020-06-05 07:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:30] [INFO ] [Real]Absence check using state equation in 1613 ms returned sat
[2020-06-05 07:08:31] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:08:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:33] [INFO ] [Nat]Absence check using state equation in 1560 ms returned sat
[2020-06-05 07:08:33] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:08:51] [INFO ] Added : 791 causal constraints over 159 iterations in 18038 ms. Result :unknown
[2020-06-05 07:08:51] [INFO ] [Real]Absence check using 401 positive place invariants in 228 ms returned sat
[2020-06-05 07:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:52] [INFO ] [Real]Absence check using state equation in 1389 ms returned sat
[2020-06-05 07:08:53] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:08:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:53] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:55] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2020-06-05 07:08:55] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 27 ms.
[2020-06-05 07:09:13] [INFO ] Added : 790 causal constraints over 158 iterations in 18062 ms. Result :unknown
[2020-06-05 07:09:13] [INFO ] [Real]Absence check using 401 positive place invariants in 160 ms returned sat
[2020-06-05 07:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:14] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2020-06-05 07:09:14] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 67 ms.
[2020-06-05 07:09:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:15] [INFO ] [Nat]Absence check using 401 positive place invariants in 221 ms returned sat
[2020-06-05 07:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:18] [INFO ] [Nat]Absence check using state equation in 3022 ms returned sat
[2020-06-05 07:09:18] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:09:34] [INFO ] Added : 785 causal constraints over 157 iterations in 16596 ms. Result :unknown
[2020-06-05 07:09:35] [INFO ] [Real]Absence check using 401 positive place invariants in 201 ms returned sat
[2020-06-05 07:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:36] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2020-06-05 07:09:36] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:09:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 221 ms returned sat
[2020-06-05 07:09:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:38] [INFO ] [Nat]Absence check using state equation in 1350 ms returned sat
[2020-06-05 07:09:38] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:09:56] [INFO ] Added : 794 causal constraints over 159 iterations in 17579 ms. Result :sat
[2020-06-05 07:09:56] [INFO ] [Real]Absence check using 401 positive place invariants in 227 ms returned sat
[2020-06-05 07:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:57] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2020-06-05 07:09:58] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:09:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 234 ms returned sat
[2020-06-05 07:09:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:00] [INFO ] [Nat]Absence check using state equation in 1532 ms returned sat
[2020-06-05 07:10:00] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:10:18] [INFO ] Added : 792 causal constraints over 159 iterations in 18011 ms. Result :unknown
[2020-06-05 07:10:20] [INFO ] [Real]Absence check using 401 positive place invariants in 2218 ms returned sat
[2020-06-05 07:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:25] [INFO ] [Real]Absence check using state equation in 4620 ms returned sat
[2020-06-05 07:10:25] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:10:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 945 ms returned sat
[2020-06-05 07:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:28] [INFO ] [Nat]Absence check using state equation in 2044 ms returned sat
[2020-06-05 07:10:28] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 67 ms.
[2020-06-05 07:10:45] [INFO ] Added : 770 causal constraints over 154 iterations in 16874 ms. Result :unknown
[2020-06-05 07:10:45] [INFO ] [Real]Absence check using 401 positive place invariants in 182 ms returned sat
[2020-06-05 07:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:47] [INFO ] [Real]Absence check using state equation in 1407 ms returned sat
[2020-06-05 07:10:47] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 69 ms.
[2020-06-05 07:10:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:47] [INFO ] [Nat]Absence check using 401 positive place invariants in 217 ms returned sat
[2020-06-05 07:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:49] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2020-06-05 07:10:49] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 39 ms.
[2020-06-05 07:11:04] [INFO ] Added : 796 causal constraints over 160 iterations in 14979 ms. Result :sat
[2020-06-05 07:11:04] [INFO ] [Real]Absence check using 401 positive place invariants in 236 ms returned sat
[2020-06-05 07:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:05] [INFO ] [Real]Absence check using state equation in 1458 ms returned sat
[2020-06-05 07:11:05] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 51 ms.
[2020-06-05 07:11:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:11:06] [INFO ] [Nat]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:07] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2020-06-05 07:11:07] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 50 ms.
[2020-06-05 07:11:26] [INFO ] Added : 792 causal constraints over 159 iterations in 18370 ms. Result :unknown
[2020-06-05 07:11:26] [INFO ] [Real]Absence check using 401 positive place invariants in 158 ms returned sat
[2020-06-05 07:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:27] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2020-06-05 07:11:27] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 52 ms.
[2020-06-05 07:11:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:11:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 173 ms returned sat
[2020-06-05 07:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:29] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2020-06-05 07:11:29] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:11:47] [INFO ] Added : 795 causal constraints over 160 iterations in 17489 ms. Result :sat
[2020-06-05 07:11:47] [INFO ] [Real]Absence check using 401 positive place invariants in 165 ms returned sat
[2020-06-05 07:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:48] [INFO ] [Real]Absence check using state equation in 1592 ms returned sat
[2020-06-05 07:11:49] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:11:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:11:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 220 ms returned sat
[2020-06-05 07:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:51] [INFO ] [Nat]Absence check using state equation in 1556 ms returned sat
[2020-06-05 07:11:51] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 52 ms.
[2020-06-05 07:12:08] [INFO ] Added : 792 causal constraints over 160 iterations in 17428 ms. Result :sat
[2020-06-05 07:12:08] [INFO ] [Real]Absence check using 401 positive place invariants in 210 ms returned sat
[2020-06-05 07:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:10] [INFO ] [Real]Absence check using state equation in 1370 ms returned sat
[2020-06-05 07:12:10] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:12:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:12:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:12] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2020-06-05 07:12:12] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 68 ms.
[2020-06-05 07:12:30] [INFO ] Added : 788 causal constraints over 158 iterations in 18193 ms. Result :unknown
[2020-06-05 07:12:30] [INFO ] [Real]Absence check using 401 positive place invariants in 190 ms returned sat
[2020-06-05 07:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:32] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2020-06-05 07:12:32] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 71 ms.
[2020-06-05 07:12:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:12:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:34] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2020-06-05 07:12:34] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:12:52] [INFO ] Added : 790 causal constraints over 158 iterations in 18255 ms. Result :unknown
[2020-06-05 07:12:53] [INFO ] [Real]Absence check using 401 positive place invariants in 224 ms returned sat
[2020-06-05 07:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:54] [INFO ] [Real]Absence check using state equation in 1579 ms returned sat
[2020-06-05 07:12:54] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:12:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:12:55] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:56] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2020-06-05 07:12:56] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:13:14] [INFO ] Added : 791 causal constraints over 159 iterations in 18296 ms. Result :unknown
[2020-06-05 07:13:15] [INFO ] [Real]Absence check using 401 positive place invariants in 176 ms returned sat
[2020-06-05 07:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:16] [INFO ] [Real]Absence check using state equation in 1498 ms returned sat
[2020-06-05 07:13:16] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:13:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:13:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 257 ms returned sat
[2020-06-05 07:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:18] [INFO ] [Nat]Absence check using state equation in 1610 ms returned sat
[2020-06-05 07:13:18] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 73 ms.
[2020-06-05 07:13:36] [INFO ] Added : 793 causal constraints over 159 iterations in 17952 ms. Result :unknown
[2020-06-05 07:13:37] [INFO ] [Real]Absence check using 401 positive place invariants in 208 ms returned sat
[2020-06-05 07:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:38] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2020-06-05 07:13:38] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 51 ms.
[2020-06-05 07:13:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:13:39] [INFO ] [Nat]Absence check using 401 positive place invariants in 234 ms returned sat
[2020-06-05 07:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:40] [INFO ] [Nat]Absence check using state equation in 1795 ms returned sat
[2020-06-05 07:13:40] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 52 ms.
[2020-06-05 07:13:58] [INFO ] Added : 791 causal constraints over 159 iterations in 17422 ms. Result :sat
[2020-06-05 07:13:58] [INFO ] [Real]Absence check using 401 positive place invariants in 214 ms returned sat
[2020-06-05 07:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:00] [INFO ] [Real]Absence check using state equation in 1612 ms returned sat
[2020-06-05 07:14:00] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:14:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:14:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:02] [INFO ] [Nat]Absence check using state equation in 1741 ms returned sat
[2020-06-05 07:14:02] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 51 ms.
[2020-06-05 07:14:19] [INFO ] Added : 791 causal constraints over 159 iterations in 17192 ms. Result :sat
[2020-06-05 07:14:20] [INFO ] [Real]Absence check using 401 positive place invariants in 220 ms returned sat
[2020-06-05 07:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:21] [INFO ] [Real]Absence check using state equation in 1438 ms returned sat
[2020-06-05 07:14:21] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 88 ms.
[2020-06-05 07:14:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:14:22] [INFO ] [Nat]Absence check using 401 positive place invariants in 218 ms returned sat
[2020-06-05 07:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:23] [INFO ] [Nat]Absence check using state equation in 1457 ms returned sat
[2020-06-05 07:14:23] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 46 ms.
[2020-06-05 07:14:41] [INFO ] Added : 791 causal constraints over 159 iterations in 17697 ms. Result :sat
[2020-06-05 07:14:41] [INFO ] [Real]Absence check using 401 positive place invariants in 238 ms returned sat
[2020-06-05 07:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:43] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2020-06-05 07:14:43] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:14:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:14:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:45] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2020-06-05 07:14:45] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 129 ms.
[2020-06-05 07:15:03] [INFO ] Added : 788 causal constraints over 158 iterations in 18293 ms. Result :unknown
[2020-06-05 07:15:03] [INFO ] [Real]Absence check using 401 positive place invariants in 173 ms returned sat
[2020-06-05 07:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:05] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2020-06-05 07:15:05] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 64 ms.
[2020-06-05 07:15:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:15:05] [INFO ] [Nat]Absence check using 401 positive place invariants in 206 ms returned sat
[2020-06-05 07:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:07] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2020-06-05 07:15:07] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 67 ms.
[2020-06-05 07:15:25] [INFO ] Added : 785 causal constraints over 157 iterations in 18305 ms. Result :unknown
[2020-06-05 07:15:25] [INFO ] [Real]Absence check using 401 positive place invariants in 173 ms returned sat
[2020-06-05 07:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:27] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2020-06-05 07:15:27] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:15:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:15:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 191 ms returned sat
[2020-06-05 07:15:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:29] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2020-06-05 07:15:29] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:15:47] [INFO ] Added : 788 causal constraints over 158 iterations in 18330 ms. Result :unknown
[2020-06-05 07:15:47] [INFO ] [Real]Absence check using 401 positive place invariants in 226 ms returned sat
[2020-06-05 07:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:49] [INFO ] [Real]Absence check using state equation in 1423 ms returned sat
[2020-06-05 07:15:49] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:15:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:15:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 231 ms returned sat
[2020-06-05 07:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:51] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2020-06-05 07:15:51] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 44 ms.
[2020-06-05 07:16:07] [INFO ] Added : 793 causal constraints over 159 iterations in 16448 ms. Result :sat
[2020-06-05 07:16:07] [INFO ] [Real]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:09] [INFO ] [Real]Absence check using state equation in 1555 ms returned sat
[2020-06-05 07:16:09] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 49 ms.
[2020-06-05 07:16:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:16:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 224 ms returned sat
[2020-06-05 07:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:11] [INFO ] [Nat]Absence check using state equation in 1428 ms returned sat
[2020-06-05 07:16:11] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:16:26] [INFO ] Added : 793 causal constraints over 159 iterations in 14866 ms. Result :sat
[2020-06-05 07:16:26] [INFO ] [Real]Absence check using 401 positive place invariants in 166 ms returned sat
[2020-06-05 07:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:27] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2020-06-05 07:16:28] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 53 ms.
[2020-06-05 07:16:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:16:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 216 ms returned sat
[2020-06-05 07:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:29] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2020-06-05 07:16:30] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:16:47] [INFO ] Added : 789 causal constraints over 158 iterations in 17275 ms. Result :sat
[2020-06-05 07:16:47] [INFO ] [Real]Absence check using 401 positive place invariants in 236 ms returned sat
[2020-06-05 07:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:49] [INFO ] [Real]Absence check using state equation in 1779 ms returned sat
[2020-06-05 07:16:49] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 53 ms.
[2020-06-05 07:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:16:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 214 ms returned sat
[2020-06-05 07:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:51] [INFO ] [Nat]Absence check using state equation in 1167 ms returned sat
[2020-06-05 07:16:51] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 96 ms.
[2020-06-05 07:17:09] [INFO ] Added : 794 causal constraints over 159 iterations in 18487 ms. Result :unknown
[2020-06-05 07:17:10] [INFO ] [Real]Absence check using 401 positive place invariants in 225 ms returned sat
[2020-06-05 07:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:11] [INFO ] [Real]Absence check using state equation in 1660 ms returned sat
[2020-06-05 07:17:11] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 86 ms.
[2020-06-05 07:17:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:17:12] [INFO ] [Nat]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:13] [INFO ] [Nat]Absence check using state equation in 1360 ms returned sat
[2020-06-05 07:17:13] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 46 ms.
[2020-06-05 07:17:32] [INFO ] Added : 784 causal constraints over 157 iterations in 18266 ms. Result :unknown
[2020-06-05 07:17:32] [INFO ] [Real]Absence check using 401 positive place invariants in 157 ms returned sat
[2020-06-05 07:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:33] [INFO ] [Real]Absence check using state equation in 1402 ms returned sat
[2020-06-05 07:17:33] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 42 ms.
[2020-06-05 07:17:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:17:34] [INFO ] [Nat]Absence check using 401 positive place invariants in 211 ms returned sat
[2020-06-05 07:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:35] [INFO ] [Nat]Absence check using state equation in 1525 ms returned sat
[2020-06-05 07:17:35] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 42 ms.
[2020-06-05 07:17:53] [INFO ] Added : 790 causal constraints over 158 iterations in 18144 ms. Result :unknown
[2020-06-05 07:17:54] [INFO ] [Real]Absence check using 401 positive place invariants in 205 ms returned sat
[2020-06-05 07:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:55] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2020-06-05 07:17:55] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:17:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:17:56] [INFO ] [Nat]Absence check using 401 positive place invariants in 167 ms returned sat
[2020-06-05 07:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:57] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2020-06-05 07:17:57] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 60 ms.
[2020-06-05 07:18:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t386 0) (and (> t795 0) (< o795 o386)))") while checking expression at index 31
[2020-06-05 07:18:16] [INFO ] [Real]Absence check using 401 positive place invariants in 226 ms returned sat
[2020-06-05 07:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:17] [INFO ] [Real]Absence check using state equation in 1603 ms returned sat
[2020-06-05 07:18:17] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 49 ms.
[2020-06-05 07:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:18:18] [INFO ] [Nat]Absence check using 401 positive place invariants in 211 ms returned sat
[2020-06-05 07:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:20] [INFO ] [Nat]Absence check using state equation in 1764 ms returned sat
[2020-06-05 07:18:20] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 51 ms.
[2020-06-05 07:18:37] [INFO ] Added : 798 causal constraints over 160 iterations in 17892 ms. Result :unknown
[2020-06-05 07:18:38] [INFO ] [Real]Absence check using 401 positive place invariants in 175 ms returned sat
[2020-06-05 07:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:39] [INFO ] [Real]Absence check using state equation in 1294 ms returned sat
[2020-06-05 07:18:39] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:18:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:18:40] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:41] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2020-06-05 07:18:41] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 68 ms.
[2020-06-05 07:18:59] [INFO ] Added : 792 causal constraints over 159 iterations in 18066 ms. Result :unknown
[2020-06-05 07:19:00] [INFO ] [Real]Absence check using 401 positive place invariants in 165 ms returned sat
[2020-06-05 07:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:01] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2020-06-05 07:19:01] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 50 ms.
[2020-06-05 07:19:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:19:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 205 ms returned sat
[2020-06-05 07:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:03] [INFO ] [Nat]Absence check using state equation in 1515 ms returned sat
[2020-06-05 07:19:03] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:19:20] [INFO ] Added : 793 causal constraints over 160 iterations in 17404 ms. Result :sat
[2020-06-05 07:19:21] [INFO ] [Real]Absence check using 401 positive place invariants in 169 ms returned sat
[2020-06-05 07:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:22] [INFO ] [Real]Absence check using state equation in 1678 ms returned sat
[2020-06-05 07:19:22] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:19:23] [INFO ] [Nat]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:24] [INFO ] [Nat]Absence check using state equation in 1614 ms returned sat
[2020-06-05 07:19:24] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 42 ms.
[2020-06-05 07:19:40] [INFO ] Added : 791 causal constraints over 159 iterations in 15959 ms. Result :sat
[2020-06-05 07:19:41] [INFO ] [Real]Absence check using 401 positive place invariants in 172 ms returned sat
[2020-06-05 07:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:42] [INFO ] [Real]Absence check using state equation in 1608 ms returned sat
[2020-06-05 07:19:42] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:19:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:19:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 188 ms returned sat
[2020-06-05 07:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:44] [INFO ] [Nat]Absence check using state equation in 1670 ms returned sat
[2020-06-05 07:19:45] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:20:03] [INFO ] Added : 790 causal constraints over 159 iterations in 18019 ms. Result :unknown
[2020-06-05 07:20:03] [INFO ] [Real]Absence check using 401 positive place invariants in 210 ms returned sat
[2020-06-05 07:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:20:04] [INFO ] [Real]Absence check using state equation in 1413 ms returned sat
[2020-06-05 07:20:04] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:20:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:20:05] [INFO ] [Nat]Absence check using 401 positive place invariants in 209 ms returned sat
[2020-06-05 07:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:20:06] [INFO ] [Nat]Absence check using state equation in 1281 ms returned sat
[2020-06-05 07:20:06] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:20:23] [INFO ] Added : 795 causal constraints over 160 iterations in 17263 ms. Result :sat
[2020-06-05 07:20:24] [INFO ] [Real]Absence check using 401 positive place invariants in 211 ms returned sat
[2020-06-05 07:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:20:25] [INFO ] [Real]Absence check using state equation in 1688 ms returned sat
[2020-06-05 07:20:26] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:20:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:20:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 220 ms returned sat
[2020-06-05 07:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:20:28] [INFO ] [Nat]Absence check using state equation in 1727 ms returned sat
[2020-06-05 07:20:28] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:20:46] [INFO ] Added : 793 causal constraints over 159 iterations in 17888 ms. Result :unknown
[2020-06-05 07:20:46] [INFO ] [Real]Absence check using 401 positive place invariants in 208 ms returned sat
[2020-06-05 07:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:20:48] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2020-06-05 07:20:48] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:20:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:20:48] [INFO ] [Nat]Absence check using 401 positive place invariants in 207 ms returned sat
[2020-06-05 07:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:20:49] [INFO ] [Nat]Absence check using state equation in 1433 ms returned sat
[2020-06-05 07:20:50] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:21:06] [INFO ] Added : 795 causal constraints over 160 iterations in 16965 ms. Result :sat
[2020-06-05 07:21:07] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-05 07:21:07] [INFO ] Flatten gal took : 339 ms
FORMULA ShieldRVt-PT-100A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 07:21:07] [INFO ] Applying decomposition
[2020-06-05 07:21:07] [INFO ] Flatten gal took : 160 ms
[2020-06-05 07:21:07] [INFO ] Decomposing Gal with order
[2020-06-05 07:21:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 07:21:08] [INFO ] Removed a total of 300 redundant transitions.
[2020-06-05 07:21:08] [INFO ] Flatten gal took : 188 ms
[2020-06-05 07:21:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 77 ms.
[2020-06-05 07:21:08] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2020-06-05 07:21:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-100A @ 3570 seconds
spx_run: Lost feasibility 10 times - iter 869 and 23 nodes.
spx_run: Lost feasibility 10 times - iter 869 and 23 nodes.
spx_run: Lost feasibility 10 times - iter 787 and 3 nodes.
spx_run: Lost feasibility 10 times - iter 787 and 3 nodes.

FORMULA ShieldRVt-PT-100A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1759
rslt: Output for LTLFireability @ ShieldRVt-PT-100A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 07:21:09 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p19))",
"processed_size": 12,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))))))",
"processed_size": 164,
"rewrites": 99
},
"result":
{
"edges": 5232,
"markings": 4493,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p95))",
"processed_size": 12,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 555
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 555
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p115 <= 0)))",
"processed_size": 17,
"rewrites": 99
},
"result":
{
"edges": 550,
"markings": 387,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p435 <= 0)) R (X (X (X (F (((p79 <= 0)))))) AND ((p286 <= 0) OR (p289 <= 0))))",
"processed_size": 82,
"rewrites": 99
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p692) AND (1 <= p693) AND (1 <= p696))))",
"processed_size": 53,
"rewrites": 99
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((1 <= p193)) U (F (((1 <= p784) AND (1 <= p786) AND (1 <= p791))) AND F (((p427 <= 0) OR (p436 <= 0) OR (p442 <= 0) OR (p46 <= 0) OR (p49 <= 0)))))",
"processed_size": 153,
"rewrites": 99
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p19))",
"processed_size": 12,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))))))",
"processed_size": 164,
"rewrites": 99
},
"result":
{
"edges": 5232,
"markings": 4493,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p95))",
"processed_size": 12,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3580,
"runtime": 1811.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(((** U **) AND X((G(**) OR *))))) : (G(F((X(*) AND *))) OR **) : (X(**) OR (G(F((G(*) OR (G(*) AND *)))) AND X(F(**)))) : F(G(**)) : F(G((** OR X(**)))) : (** OR ((** U X(F(**))) AND X(G(**)))) : X(((* R *) OR (G(**) OR *))) : (G(*) AND X((X(X(G(**))) AND F(**)))) : F((G((G(*) OR (* OR (* OR *)))) AND X((F(**) AND (** AND (** AND **)))))) : (* R (X(X(X(F(*)))) AND *)) : (** U (F(**) AND F(**)))"
},
"net":
{
"arcs": 3404,
"conflict_clusters": 203,
"places": 803,
"places_significant": 402,
"singleton_clusters": 0,
"transitions": 802
},
"result":
{
"preliminary_value": "unknown unknown unknown no unknown unknown unknown no unknown yes no ",
"value": "unknown unknown unknown no unknown unknown unknown no unknown yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1605/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25696
lola: finding significant places
lola: 803 places, 802 transitions, 402 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p600 <= 1)
lola: LP says that atomic proposition is always true: (p602 <= 1)
lola: LP says that atomic proposition is always true: (p607 <= 1)
lola: LP says that atomic proposition is always true: (p600 <= 1)
lola: LP says that atomic proposition is always true: (p602 <= 1)
lola: LP says that atomic proposition is always true: (p607 <= 1)
lola: LP says that atomic proposition is always true: (p665 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p696 <= 1)
lola: LP says that atomic proposition is always true: (p698 <= 1)
lola: LP says that atomic proposition is always true: (p703 <= 1)
lola: LP says that atomic proposition is always true: (p587 <= 1)
lola: LP says that atomic proposition is always true: (p596 <= 1)
lola: LP says that atomic proposition is always true: (p602 <= 1)
lola: LP says that atomic proposition is always true: (p739 <= 1)
lola: LP says that atomic proposition is always true: (p692 <= 1)
lola: LP says that atomic proposition is always true: (p693 <= 1)
lola: LP says that atomic proposition is always true: (p696 <= 1)
lola: LP says that atomic proposition is always true: (p616 <= 1)
lola: LP says that atomic proposition is always true: (p618 <= 1)
lola: LP says that atomic proposition is always true: (p623 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p315 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p330 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p435 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p784 <= 1)
lola: LP says that atomic proposition is always true: (p786 <= 1)
lola: LP says that atomic proposition is always true: (p791 <= 1)
lola: LP says that atomic proposition is always true: (p784 <= 1)
lola: LP says that atomic proposition is always true: (p786 <= 1)
lola: LP says that atomic proposition is always true: (p791 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: NOT(F (G (X ((NOT((((1 <= p323)) U ((1 <= p600) AND (1 <= p602) AND (1 <= p607)))) OR X ((NOT(G (((1 <= p600) AND (1 <= p602) AND (1 <= p607)))) AND ((p665 <= 0))))))))) : (X (G (NOT(G ((X (((1 <= p19))) OR ((1 <= p19))))))) OR ((1 <= p19))) : (NOT(F (G ((F (((1 <= p696) AND (1 <= p698) AND (1 <= p703))) U ((1 <= p587) AND (1 <= p596) AND (1 <= p602)))))) U X (((1 <= p739)))) : X (G (F (G (X (((1 <= p692) AND (1 <= p693) AND (1 <= p696))))))) : F (G ((X (((p616 <= 0) OR (p618 <= 0) OR (p623 <= 0))) OR X (X (((1 <= p78) AND (1 <= p81))))))) : (((1 <= p95)) OR ((((1 <= p294) AND (1 <= p297)) U F (X (((1 <= p296) AND (1 <= p298) AND (1 <= p303))))) AND X (G (((p294 <= 0) OR (p297 <= 0)))))) : (NOT(X ((((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) U ((1 <= p36) AND (1 <= p37) AND (1 <= p40))))) OR NOT(X ((NOT(G (((1 <= p315) AND (1 <= p324) AND (1 <= p330)))) AND ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0)))))) : ((NOT(F (((1 <= p115)))) AND G (NOT(X (X (NOT(X (((1 <= p236) AND (1 <= p237) AND (1 <= p240))))))))) AND F (X (((1 <= p236) AND (1 <= p237) AND (1 <= p240))))) : F ((NOT(F ((((F (((1 <= p190) AND (1 <= p193))) AND ((1 <= p91))) AND ((1 <= p100))) AND ((1 <= p106))))) AND X ((((F (((1 <= p91) AND (1 <= p100) AND (1 <= p106))) AND ((1 <= p4))) AND ((1 <= p5))) AND ((1 <= p8)))))) : NOT((((1 <= p435)) U (X (X (X (G (((1 <= p79)))))) OR ((1 <= p286) AND (1 <= p289))))) : (((1 <= p193)) U (F (((((1 <= p427) AND (1 <= p436) AND (1 <= p442)) OR ((1 <= p784) AND (1 <= p786) AND (1 <= p791))) U ((1 <= p784) AND (1 <= p786) AND (1 <= p791)))) AND F (((p427 <= 0) OR (p436 <= 0) OR (p442 <= 0) OR (p46 <= 0) OR (p49 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p323)) U ((1 <= p600) AND (1 <= p602) AND (1 <= p607))) AND X ((G (((1 <= p600) AND (1 <= p602) AND (1 <= p607))) OR ((1 <= p665)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p323)) U ((1 <= p600) AND (1 <= p602) AND (1 <= p607))) AND X ((G (((1 <= p600) AND (1 <= p602) AND (1 <= p607))) OR ((1 <= p665)))))))
lola: processed formula length: 150
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 997644 markings, 997644 edges, 199529 markings/sec, 0 secs
lola: 2052943 markings, 2052943 edges, 211060 markings/sec, 5 secs
lola: 3106821 markings, 3106821 edges, 210776 markings/sec, 10 secs
lola: 4160441 markings, 4160440 edges, 210724 markings/sec, 15 secs
lola: 5183807 markings, 5183807 edges, 204673 markings/sec, 20 secs
lola: 6149313 markings, 6149312 edges, 193101 markings/sec, 25 secs
lola: 7174848 markings, 7174848 edges, 205107 markings/sec, 30 secs
lola: 8207930 markings, 8207930 edges, 206616 markings/sec, 35 secs
lola: 9238975 markings, 9238974 edges, 206209 markings/sec, 40 secs
lola: 10260266 markings, 10260266 edges, 204258 markings/sec, 45 secs
lola: 11294648 markings, 11294648 edges, 206876 markings/sec, 50 secs
lola: 12314915 markings, 12314914 edges, 204053 markings/sec, 55 secs
lola: 13341187 markings, 13341187 edges, 205254 markings/sec, 60 secs
lola: 14349388 markings, 14349388 edges, 201640 markings/sec, 65 secs
lola: 15386438 markings, 15386437 edges, 207410 markings/sec, 70 secs
lola: 16244423 markings, 16245342 edges, 171597 markings/sec, 75 secs
lola: 16834532 markings, 16835107 edges, 118022 markings/sec, 80 secs
lola: 17283873 markings, 17284078 edges, 89868 markings/sec, 85 secs
lola: 17738665 markings, 17738665 edges, 90958 markings/sec, 90 secs
lola: 18255455 markings, 18256979 edges, 103358 markings/sec, 95 secs
lola: 18821025 markings, 18821024 edges, 113114 markings/sec, 100 secs
lola: 19419797 markings, 19419800 edges, 119754 markings/sec, 105 secs
lola: 20047340 markings, 20047339 edges, 125509 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((X (((p19 <= 0))) AND ((p19 <= 0))))) OR ((1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p19))
lola: processed formula length: 12
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((p19 <= 0))) AND ((p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p19 <= 0))) AND ((p19 <= 0)))))
lola: processed formula length: 43
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1029429 markings, 1029428 edges, 205886 markings/sec, 0 secs
lola: 2131957 markings, 2131957 edges, 220506 markings/sec, 5 secs
lola: 3232714 markings, 3232714 edges, 220151 markings/sec, 10 secs
lola: 4333491 markings, 4333491 edges, 220155 markings/sec, 15 secs
lola: 5364560 markings, 5364560 edges, 206214 markings/sec, 20 secs
lola: 6414950 markings, 6414950 edges, 210078 markings/sec, 25 secs
lola: 7515916 markings, 7515916 edges, 220193 markings/sec, 30 secs
lola: 8616492 markings, 8616491 edges, 220115 markings/sec, 35 secs
lola: 9715063 markings, 9715063 edges, 219714 markings/sec, 40 secs
lola: 10816958 markings, 10816958 edges, 220379 markings/sec, 45 secs
lola: 11919385 markings, 11919385 edges, 220485 markings/sec, 50 secs
lola: 12946542 markings, 12946541 edges, 205431 markings/sec, 55 secs
lola: 13855837 markings, 13855837 edges, 181859 markings/sec, 60 secs
lola: 14770418 markings, 14770417 edges, 182916 markings/sec, 65 secs
lola: 15694047 markings, 15694047 edges, 184726 markings/sec, 70 secs
lola: 16463288 markings, 16463772 edges, 153848 markings/sec, 75 secs
lola: 17224740 markings, 17226089 edges, 152290 markings/sec, 80 secs
lola: 18062045 markings, 18062242 edges, 167461 markings/sec, 85 secs
lola: 18621652 markings, 18621651 edges, 111921 markings/sec, 90 secs
lola: 19242347 markings, 19242349 edges, 124139 markings/sec, 95 secs
lola: 19847834 markings, 19847836 edges, 121097 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p739))) OR (G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0)))))) AND X (F (((1 <= p739))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))))))
lola: processed formula length: 164
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4493 markings, 5232 edges
lola: ========================================
lola: subprocess 3 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p739)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p739)))
lola: processed formula length: 17
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 948751 markings, 948751 edges, 189750 markings/sec, 0 secs
lola: 2074264 markings, 2074264 edges, 225103 markings/sec, 5 secs
lola: 3199308 markings, 3199312 edges, 225009 markings/sec, 10 secs
lola: 4332867 markings, 4332867 edges, 226712 markings/sec, 15 secs
lola: 5465051 markings, 5465050 edges, 226437 markings/sec, 20 secs
lola: 6597330 markings, 6597330 edges, 226456 markings/sec, 25 secs
lola: 7729588 markings, 7729588 edges, 226452 markings/sec, 30 secs
lola: 8863946 markings, 8863946 edges, 226872 markings/sec, 35 secs
lola: 10003386 markings, 10003386 edges, 227888 markings/sec, 40 secs
lola: 11142301 markings, 11142301 edges, 227783 markings/sec, 45 secs
lola: 12265463 markings, 12265462 edges, 224632 markings/sec, 50 secs
lola: 13391961 markings, 13391960 edges, 225300 markings/sec, 55 secs
lola: 14519093 markings, 14519093 edges, 225426 markings/sec, 60 secs
lola: 15659280 markings, 15659280 edges, 228037 markings/sec, 65 secs
lola: 16415071 markings, 16415191 edges, 151158 markings/sec, 70 secs
lola: 16913010 markings, 16913479 edges, 99588 markings/sec, 75 secs
lola: 17545469 markings, 17545563 edges, 126492 markings/sec, 80 secs
lola: 18108142 markings, 18108142 edges, 112535 markings/sec, 85 secs
lola: 18751488 markings, 18751487 edges, 128669 markings/sec, 90 secs
lola: 19329336 markings, 19329335 edges, 115570 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 3 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p616 <= 0) OR (p618 <= 0) OR (p623 <= 0)) OR X (((1 <= p78) AND (1 <= p81))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p616 <= 0) OR (p618 <= 0) OR (p623 <= 0)) OR X (((1 <= p78) AND (1 <= p81))))))
lola: processed formula length: 90
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 896947 markings, 896946 edges, 179389 markings/sec, 0 secs
lola: 2025527 markings, 2025527 edges, 225716 markings/sec, 5 secs
lola: 3141085 markings, 3141084 edges, 223112 markings/sec, 10 secs
lola: 4237445 markings, 4237444 edges, 219272 markings/sec, 15 secs
lola: 5282489 markings, 5282489 edges, 209009 markings/sec, 20 secs
lola: 6335165 markings, 6335165 edges, 210535 markings/sec, 25 secs
lola: 7443207 markings, 7443206 edges, 221608 markings/sec, 30 secs
lola: 8567316 markings, 8567316 edges, 224822 markings/sec, 35 secs
lola: 9683082 markings, 9683082 edges, 223153 markings/sec, 40 secs
lola: 10765426 markings, 10765428 edges, 216469 markings/sec, 45 secs
lola: 11866625 markings, 11866625 edges, 220240 markings/sec, 50 secs
lola: 12958385 markings, 12958384 edges, 218352 markings/sec, 55 secs
lola: 14084696 markings, 14084696 edges, 225262 markings/sec, 60 secs
lola: 15220149 markings, 15220149 edges, 227091 markings/sec, 65 secs
lola: 16141046 markings, 16141183 edges, 184179 markings/sec, 70 secs
lola: 16610224 markings, 16610655 edges, 93836 markings/sec, 75 secs
lola: 17154265 markings, 17154264 edges, 108808 markings/sec, 80 secs
lola: 17780322 markings, 17780321 edges, 125211 markings/sec, 85 secs
lola: 18462449 markings, 18463077 edges, 136425 markings/sec, 90 secs
lola: 19058762 markings, 19058762 edges, 119263 markings/sec, 95 secs
lola: 19667888 markings, 19667888 edges, 121825 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p95)) OR ((((1 <= p294) AND (1 <= p297)) U X (F (((1 <= p296) AND (1 <= p298) AND (1 <= p303))))) AND X (G (((p294 <= 0) OR (p297 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p95))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p95))
lola: processed formula length: 12
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p294 <= 0) OR (p297 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p294 <= 0) OR (p297 <= 0))))
lola: processed formula length: 37
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 863284 markings, 863284 edges, 172657 markings/sec, 0 secs
lola: 2008896 markings, 2008896 edges, 229122 markings/sec, 5 secs
lola: 3148719 markings, 3148719 edges, 227965 markings/sec, 10 secs
lola: 4292148 markings, 4292148 edges, 228686 markings/sec, 15 secs
lola: 5422955 markings, 5422955 edges, 226161 markings/sec, 20 secs
lola: 6568390 markings, 6568390 edges, 229087 markings/sec, 25 secs
lola: 7718175 markings, 7718175 edges, 229957 markings/sec, 30 secs
lola: 8867841 markings, 8867840 edges, 229933 markings/sec, 35 secs
lola: 10020141 markings, 10020141 edges, 230460 markings/sec, 40 secs
lola: 11168145 markings, 11168145 edges, 229601 markings/sec, 45 secs
lola: 12307721 markings, 12307720 edges, 227915 markings/sec, 50 secs
lola: 13447186 markings, 13447186 edges, 227893 markings/sec, 55 secs
lola: 14528498 markings, 14528497 edges, 216262 markings/sec, 60 secs
lola: 15673655 markings, 15673655 edges, 229031 markings/sec, 65 secs
lola: 16453682 markings, 16453828 edges, 156005 markings/sec, 70 secs
lola: 16925090 markings, 16925172 edges, 94282 markings/sec, 75 secs
lola: 17522355 markings, 17523662 edges, 119453 markings/sec, 80 secs
lola: 18180785 markings, 18181086 edges, 131686 markings/sec, 85 secs
lola: 18838063 markings, 18838063 edges, 131456 markings/sec, 90 secs
lola: 19468326 markings, 19468326 edges, 126053 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p294) AND (1 <= p297)) U X (F (((1 <= p296) AND (1 <= p298) AND (1 <= p303)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p294) AND (1 <= p297)) U X (F (((1 <= p296) AND (1 <= p298) AND (1 <= p303)))))
lola: processed formula length: 87
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1103496 markings, 1103495 edges, 220699 markings/sec, 0 secs
lola: 2282467 markings, 2282467 edges, 235794 markings/sec, 5 secs
lola: 3450801 markings, 3450801 edges, 233667 markings/sec, 10 secs
lola: 4628694 markings, 4628694 edges, 235579 markings/sec, 15 secs
lola: 5694835 markings, 5694834 edges, 213228 markings/sec, 20 secs
lola: 6870231 markings, 6870231 edges, 235079 markings/sec, 25 secs
lola: 8038392 markings, 8038392 edges, 233632 markings/sec, 30 secs
lola: 9214133 markings, 9214133 edges, 235148 markings/sec, 35 secs
lola: 10395586 markings, 10395586 edges, 236291 markings/sec, 40 secs
lola: 11576102 markings, 11576101 edges, 236103 markings/sec, 45 secs
lola: 12761532 markings, 12761531 edges, 237086 markings/sec, 50 secs
lola: 13939888 markings, 13939888 edges, 235671 markings/sec, 55 secs
lola: 15104957 markings, 15104957 edges, 233014 markings/sec, 60 secs
lola: 16275700 markings, 16275700 edges, 234149 markings/sec, 65 secs
lola: 17387862 markings, 17387862 edges, 222432 markings/sec, 70 secs
lola: 18570008 markings, 18570008 edges, 236429 markings/sec, 75 secs
lola: 19341875 markings, 19342110 edges, 154373 markings/sec, 80 secs
lola: 20122091 markings, 20122396 edges, 156043 markings/sec, 85 secs
lola: 20737090 markings, 20737094 edges, 123000 markings/sec, 90 secs
lola: 21467295 markings, 21467305 edges, 146041 markings/sec, 95 secs
lola: 22039459 markings, 22039458 edges, 114433 markings/sec, 100 secs
lola: 22786964 markings, 22786963 edges, 149501 markings/sec, 105 secs
lola: 23383956 markings, 23383955 edges, 119398 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 5 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p16) AND (1 <= p18) AND (1 <= p23)) R ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0))) OR (G (((1 <= p315) AND (1 <= p324) AND (1 <= p330))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p16) AND (1 <= p18) AND (1 <= p23)) R ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0))) OR (G (((1 <= p315) AND (1 <= p324) AND (1 <= p330))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p40)))))
lola: processed formula length: 196
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 957747 markings, 957746 edges, 191549 markings/sec, 0 secs
lola: 2069789 markings, 2069788 edges, 222408 markings/sec, 5 secs
lola: 3150983 markings, 3150983 edges, 216239 markings/sec, 10 secs
lola: 4260922 markings, 4260922 edges, 221988 markings/sec, 15 secs
lola: 5357763 markings, 5357763 edges, 219368 markings/sec, 20 secs
lola: 6425886 markings, 6425885 edges, 213625 markings/sec, 25 secs
lola: 7492601 markings, 7492601 edges, 213343 markings/sec, 30 secs
lola: 8605088 markings, 8605090 edges, 222497 markings/sec, 35 secs
lola: 9723431 markings, 9723431 edges, 223669 markings/sec, 40 secs
lola: 10843989 markings, 10843992 edges, 224112 markings/sec, 45 secs
lola: 11953093 markings, 11953093 edges, 221821 markings/sec, 50 secs
lola: 13052413 markings, 13052413 edges, 219864 markings/sec, 55 secs
lola: 14163592 markings, 14163591 edges, 222236 markings/sec, 60 secs
lola: 15281094 markings, 15281093 edges, 223500 markings/sec, 65 secs
lola: 16287242 markings, 16287596 edges, 201230 markings/sec, 70 secs
lola: 17005291 markings, 17005569 edges, 143610 markings/sec, 75 secs
lola: 17779156 markings, 17781126 edges, 154773 markings/sec, 80 secs
lola: 18456530 markings, 18456530 edges, 135475 markings/sec, 85 secs
lola: 19219185 markings, 19219470 edges, 152531 markings/sec, 90 secs
lola: 19854272 markings, 19854272 edges, 127017 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p115 <= 0))) AND X ((X (X (G (((1 <= p236) AND (1 <= p237) AND (1 <= p240))))) AND F (((1 <= p236) AND (1 <= p237) AND (1 <= p240))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p115 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p115 <= 0)))
lola: processed formula length: 17
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 387 markings, 550 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((G (((p190 <= 0) OR (p193 <= 0))) OR (((p91 <= 0)) OR (((p100 <= 0)) OR ((p106 <= 0)))))) AND X ((F (((1 <= p91) AND (1 <= p100) AND (1 <= p106))) AND (((1 <= p4)) AND (((1 <= p5)) AND ((1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G (((p190 <= 0) OR (p193 <= 0))) OR (((p91 <= 0)) OR (((p100 <= 0)) OR ((p106 <= 0)))))) AND X ((F (((1 <= p91) AND (1 <= p100) AND (1 <= p106))) AND (((1 <= p4)) AND (((1 <= p5)) AND ((1 <= p8))))))))
lola: processed formula length: 210
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1025396 markings, 1025396 edges, 205079 markings/sec, 0 secs
lola: 2099201 markings, 2099201 edges, 214761 markings/sec, 5 secs
lola: 3168935 markings, 3168935 edges, 213947 markings/sec, 10 secs
lola: 4237522 markings, 4237522 edges, 213717 markings/sec, 15 secs
lola: 5217717 markings, 5217717 edges, 196039 markings/sec, 20 secs
lola: 6286565 markings, 6286565 edges, 213770 markings/sec, 25 secs
lola: 7360467 markings, 7360467 edges, 214780 markings/sec, 30 secs
lola: 8453973 markings, 8453972 edges, 218701 markings/sec, 35 secs
lola: 9536279 markings, 9536286 edges, 216461 markings/sec, 40 secs
lola: 10615080 markings, 10615079 edges, 215760 markings/sec, 45 secs
lola: 11684985 markings, 11684985 edges, 213981 markings/sec, 50 secs
lola: 12750224 markings, 12750223 edges, 213048 markings/sec, 55 secs
lola: 13822263 markings, 13822262 edges, 214408 markings/sec, 60 secs
lola: 14901808 markings, 14901808 edges, 215909 markings/sec, 65 secs
lola: 15917000 markings, 15917026 edges, 203038 markings/sec, 70 secs
lola: 16564055 markings, 16564183 edges, 129411 markings/sec, 75 secs
lola: 17233888 markings, 17234109 edges, 133967 markings/sec, 80 secs
lola: 17774360 markings, 17774397 edges, 108094 markings/sec, 85 secs
lola: 18418544 markings, 18418543 edges, 128837 markings/sec, 90 secs
lola: 18994514 markings, 18994513 edges, 115194 markings/sec, 95 secs
lola: 19576123 markings, 19576122 edges, 116322 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p435 <= 0)) R (X (X (X (F (((p79 <= 0)))))) AND ((p286 <= 0) OR (p289 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p435 <= 0)) R (X (X (X (F (((p79 <= 0)))))) AND ((p286 <= 0) OR (p289 <= 0))))
lola: processed formula length: 82
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 1333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p692) AND (1 <= p693) AND (1 <= p696))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p692) AND (1 <= p693) AND (1 <= p696))))
lola: processed formula length: 53
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 2667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p193)) U (F (((1 <= p784) AND (1 <= p786) AND (1 <= p791))) AND F (((p427 <= 0) OR (p436 <= 0) OR (p442 <= 0) OR (p46 <= 0) OR (p49 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p193)) U (F (((1 <= p784) AND (1 <= p786) AND (1 <= p791))) AND F (((p427 <= 0) OR (p436 <= 0) OR (p442 <= 0) OR (p46 <= 0) OR (p49 <= 0)))))
lola: processed formula length: 153
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p323)) U ((1 <= p600) AND (1 <= p602) AND (1 <= p607))) AND X ((G (((1 <= p600) AND (1 <= p602) AND (1 <= p607))) OR ((1 <= p665)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p323)) U ((1 <= p600) AND (1 <= p602) AND (1 <= p607))) AND X ((G (((1 <= p600) AND (1 <= p602) AND (1 <= p607))) OR ((1 <= p665)))))))
lola: processed formula length: 150
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 920367 markings, 920367 edges, 184073 markings/sec, 0 secs
lola: 1910641 markings, 1910641 edges, 198055 markings/sec, 5 secs
lola: 2947795 markings, 2947794 edges, 207431 markings/sec, 10 secs
lola: 3991758 markings, 3991761 edges, 208793 markings/sec, 15 secs
lola: 4966428 markings, 4966428 edges, 194934 markings/sec, 20 secs
lola: 6013345 markings, 6013344 edges, 209383 markings/sec, 25 secs
lola: 7044664 markings, 7044663 edges, 206264 markings/sec, 30 secs
lola: 8003360 markings, 8003359 edges, 191739 markings/sec, 35 secs
lola: 9002823 markings, 9002823 edges, 199893 markings/sec, 40 secs
lola: 9965413 markings, 9965413 edges, 192518 markings/sec, 45 secs
lola: 10989769 markings, 10989768 edges, 204871 markings/sec, 50 secs
lola: 12023716 markings, 12023716 edges, 206789 markings/sec, 55 secs
lola: 13044333 markings, 13044333 edges, 204123 markings/sec, 60 secs
lola: 14076998 markings, 14076998 edges, 206533 markings/sec, 65 secs
lola: 15125063 markings, 15125063 edges, 209613 markings/sec, 70 secs
lola: 16139895 markings, 16140231 edges, 202966 markings/sec, 75 secs
lola: 16998557 markings, 16998886 edges, 171732 markings/sec, 80 secs
lola: 17803833 markings, 17803958 edges, 161055 markings/sec, 85 secs
lola: 18634278 markings, 18635062 edges, 166089 markings/sec, 90 secs
lola: 19236113 markings, 19236112 edges, 120367 markings/sec, 95 secs
lola: 19853842 markings, 19853841 edges, 123546 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F ((X (((p19 <= 0))) AND ((p19 <= 0))))) OR ((1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p19))
lola: processed formula length: 12
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (((p19 <= 0))) AND ((p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p19 <= 0))) AND ((p19 <= 0)))))
lola: processed formula length: 43
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1031023 markings, 1031022 edges, 206205 markings/sec, 0 secs
lola: 2135447 markings, 2135447 edges, 220885 markings/sec, 5 secs
lola: 3116592 markings, 3116591 edges, 196229 markings/sec, 10 secs
lola: 4154483 markings, 4154483 edges, 207578 markings/sec, 15 secs
lola: 5193642 markings, 5193641 edges, 207832 markings/sec, 20 secs
lola: 6221472 markings, 6221472 edges, 205566 markings/sec, 25 secs
lola: 7258042 markings, 7258042 edges, 207314 markings/sec, 30 secs
lola: 8318326 markings, 8318325 edges, 212057 markings/sec, 35 secs
lola: 9350400 markings, 9350399 edges, 206415 markings/sec, 40 secs
lola: 10388464 markings, 10388463 edges, 207613 markings/sec, 45 secs
lola: 11435933 markings, 11435933 edges, 209494 markings/sec, 50 secs
lola: 12447926 markings, 12447926 edges, 202399 markings/sec, 55 secs
lola: 13545207 markings, 13545207 edges, 219456 markings/sec, 60 secs
lola: 14646626 markings, 14646626 edges, 220284 markings/sec, 65 secs
lola: 15754967 markings, 15754966 edges, 221668 markings/sec, 70 secs
lola: 16668560 markings, 16669012 edges, 182719 markings/sec, 75 secs
lola: 17351585 markings, 17351643 edges, 136605 markings/sec, 80 secs
lola: 17893355 markings, 17893354 edges, 108354 markings/sec, 85 secs
lola: 18492830 markings, 18494645 edges, 119895 markings/sec, 90 secs
lola: 19031450 markings, 19031450 edges, 107724 markings/sec, 95 secs
lola: 19564596 markings, 19564596 edges, 106629 markings/sec, 100 secs
lola: 20242432 markings, 20243250 edges, 135567 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p739))) OR (G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0)))))) AND X (F (((1 <= p739))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))) OR (G (((p696 <= 0) OR (p698 <= 0) OR (p703 <= 0))) AND ((p587 <= 0) OR (p596 <= 0) OR (p602 <= 0))))))
lola: processed formula length: 164
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4493 markings, 5232 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((1 <= p739)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p739)))
lola: processed formula length: 17
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1080109 markings, 1080109 edges, 216022 markings/sec, 0 secs
lola: 2225175 markings, 2225179 edges, 229013 markings/sec, 5 secs
lola: 3369036 markings, 3369036 edges, 228772 markings/sec, 10 secs
lola: 4506402 markings, 4506401 edges, 227473 markings/sec, 15 secs
lola: 5648471 markings, 5648471 edges, 228414 markings/sec, 20 secs
lola: 6676567 markings, 6676567 edges, 205619 markings/sec, 25 secs
lola: 7796611 markings, 7796611 edges, 224009 markings/sec, 30 secs
lola: 8827843 markings, 8827842 edges, 206246 markings/sec, 35 secs
lola: 9873214 markings, 9873214 edges, 209074 markings/sec, 40 secs
lola: 10950985 markings, 10950984 edges, 215554 markings/sec, 45 secs
lola: 12010465 markings, 12010465 edges, 211896 markings/sec, 50 secs
lola: 13075874 markings, 13075874 edges, 213082 markings/sec, 55 secs
lola: 14143209 markings, 14143209 edges, 213467 markings/sec, 60 secs
lola: 15222768 markings, 15222768 edges, 215912 markings/sec, 65 secs
lola: 16117137 markings, 16117165 edges, 178874 markings/sec, 70 secs
lola: 16819317 markings, 16819497 edges, 140436 markings/sec, 75 secs
lola: 17407259 markings, 17407529 edges, 117588 markings/sec, 80 secs
lola: 18144971 markings, 18145288 edges, 147542 markings/sec, 85 secs
lola: 18661432 markings, 18661432 edges, 103292 markings/sec, 90 secs
lola: 19364799 markings, 19364800 edges, 140673 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((p616 <= 0) OR (p618 <= 0) OR (p623 <= 0)) OR X (((1 <= p78) AND (1 <= p81))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p616 <= 0) OR (p618 <= 0) OR (p623 <= 0)) OR X (((1 <= p78) AND (1 <= p81))))))
lola: processed formula length: 90
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 814342 markings, 814342 edges, 162868 markings/sec, 0 secs
lola: 1923172 markings, 1923171 edges, 221766 markings/sec, 5 secs
lola: 3008295 markings, 3008295 edges, 217025 markings/sec, 10 secs
lola: 4125362 markings, 4125361 edges, 223413 markings/sec, 15 secs
lola: 5119686 markings, 5119686 edges, 198865 markings/sec, 20 secs
lola: 6229770 markings, 6229770 edges, 222017 markings/sec, 25 secs
lola: 7326392 markings, 7326392 edges, 219324 markings/sec, 30 secs
lola: 8433903 markings, 8433903 edges, 221502 markings/sec, 35 secs
lola: 9504863 markings, 9504867 edges, 214192 markings/sec, 40 secs
lola: 10606422 markings, 10606421 edges, 220312 markings/sec, 45 secs
lola: 11719790 markings, 11719790 edges, 222674 markings/sec, 50 secs
lola: 12819165 markings, 12819165 edges, 219875 markings/sec, 55 secs
lola: 13866505 markings, 13866505 edges, 209468 markings/sec, 60 secs
lola: 14992345 markings, 14992345 edges, 225168 markings/sec, 65 secs
lola: 16024203 markings, 16024256 edges, 206372 markings/sec, 70 secs
lola: 16619906 markings, 16620292 edges, 119141 markings/sec, 75 secs
lola: 17214856 markings, 17214964 edges, 118990 markings/sec, 80 secs
lola: 17842334 markings, 17843867 edges, 125496 markings/sec, 85 secs
lola: 18386261 markings, 18386389 edges, 108785 markings/sec, 90 secs
lola: 18997097 markings, 18997114 edges, 122167 markings/sec, 95 secs
lola: 19604089 markings, 19604261 edges, 121398 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((1 <= p95)) OR ((((1 <= p294) AND (1 <= p297)) U X (F (((1 <= p296) AND (1 <= p298) AND (1 <= p303))))) AND X (G (((p294 <= 0) OR (p297 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p95))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p95))
lola: processed formula length: 12
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G (((p294 <= 0) OR (p297 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p294 <= 0) OR (p297 <= 0))))
lola: processed formula length: 37
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 989589 markings, 989588 edges, 197918 markings/sec, 0 secs
lola: 2127743 markings, 2127743 edges, 227631 markings/sec, 5 secs
lola: 3252802 markings, 3252811 edges, 225012 markings/sec, 10 secs
lola: 4398276 markings, 4398276 edges, 229095 markings/sec, 15 secs
lola: 5529852 markings, 5529852 edges, 226315 markings/sec, 20 secs
lola: 6639208 markings, 6639208 edges, 221871 markings/sec, 25 secs
lola: 7643137 markings, 7643136 edges, 200786 markings/sec, 30 secs
lola: 8689094 markings, 8689094 edges, 209191 markings/sec, 35 secs
lola: 9810029 markings, 9810029 edges, 224187 markings/sec, 40 secs
lola: 10950416 markings, 10950416 edges, 228077 markings/sec, 45 secs
lola: 12094751 markings, 12094750 edges, 228867 markings/sec, 50 secs
lola: 13163107 markings, 13163107 edges, 213671 markings/sec, 55 secs
lola: 14307653 markings, 14307652 edges, 228909 markings/sec, 60 secs
lola: 15460030 markings, 15460030 edges, 230475 markings/sec, 65 secs
lola: 16291255 markings, 16291356 edges, 166245 markings/sec, 70 secs
lola: 17029627 markings, 17030024 edges, 147674 markings/sec, 75 secs
lola: 17640170 markings, 17640342 edges, 122109 markings/sec, 80 secs
lola: 18288275 markings, 18288275 edges, 129621 markings/sec, 85 secs
lola: 19125214 markings, 19125240 edges, 167388 markings/sec, 90 secs
lola: 19794402 markings, 19794402 edges, 133838 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((1 <= p294) AND (1 <= p297)) U X (F (((1 <= p296) AND (1 <= p298) AND (1 <= p303)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p294) AND (1 <= p297)) U X (F (((1 <= p296) AND (1 <= p298) AND (1 <= p303)))))
lola: processed formula length: 87
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1101189 markings, 1101189 edges, 220238 markings/sec, 0 secs
lola: 2267993 markings, 2267993 edges, 233361 markings/sec, 5 secs
lola: 3426928 markings, 3426927 edges, 231787 markings/sec, 10 secs
lola: 4511980 markings, 4511980 edges, 217010 markings/sec, 15 secs
lola: 5693419 markings, 5693419 edges, 236288 markings/sec, 20 secs
lola: 6861909 markings, 6861909 edges, 233698 markings/sec, 25 secs
lola: 8024800 markings, 8024799 edges, 232578 markings/sec, 30 secs
lola: 9168876 markings, 9168876 edges, 228815 markings/sec, 35 secs
lola: 10330537 markings, 10330537 edges, 232332 markings/sec, 40 secs
lola: 11472356 markings, 11472356 edges, 228364 markings/sec, 45 secs
lola: 12627178 markings, 12627178 edges, 230964 markings/sec, 50 secs
lola: 13771528 markings, 13771528 edges, 228870 markings/sec, 55 secs
lola: 14912174 markings, 14912174 edges, 228129 markings/sec, 60 secs
lola: 16053052 markings, 16053052 edges, 228176 markings/sec, 65 secs
lola: 17211612 markings, 17211612 edges, 231712 markings/sec, 70 secs
lola: 18362189 markings, 18362189 edges, 230115 markings/sec, 75 secs
lola: 19229363 markings, 19229394 edges, 173435 markings/sec, 80 secs
lola: 19845462 markings, 19845481 edges, 123220 markings/sec, 85 secs
lola: 20531710 markings, 20531710 edges, 137250 markings/sec, 90 secs
lola: 21401628 markings, 21401627 edges, 173984 markings/sec, 95 secs
lola: 22013041 markings, 22013041 edges, 122283 markings/sec, 100 secs
lola: 22795233 markings, 22795233 edges, 156438 markings/sec, 105 secs
lola: 23369471 markings, 23369470 edges, 114848 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p16) AND (1 <= p18) AND (1 <= p23)) R ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0))) OR (G (((1 <= p315) AND (1 <= p324) AND (1 <= p330))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p16) AND (1 <= p18) AND (1 <= p23)) R ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0))) OR (G (((1 <= p315) AND (1 <= p324) AND (1 <= p330))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p40)))))
lola: processed formula length: 196
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1004098 markings, 1004097 edges, 200820 markings/sec, 0 secs
lola: 2093384 markings, 2093384 edges, 217857 markings/sec, 5 secs
lola: 3159804 markings, 3159804 edges, 213284 markings/sec, 10 secs
lola: 4171989 markings, 4171989 edges, 202437 markings/sec, 15 secs
lola: 5244017 markings, 5244017 edges, 214406 markings/sec, 20 secs
lola: 6306226 markings, 6306225 edges, 212442 markings/sec, 25 secs
lola: 7291646 markings, 7291646 edges, 197084 markings/sec, 30 secs
lola: 8382236 markings, 8382236 edges, 218118 markings/sec, 35 secs
lola: 9471881 markings, 9471881 edges, 217929 markings/sec, 40 secs
lola: 10559525 markings, 10559524 edges, 217529 markings/sec, 45 secs
lola: 11643704 markings, 11643704 edges, 216836 markings/sec, 50 secs
lola: 12721359 markings, 12721362 edges, 215531 markings/sec, 55 secs
lola: 13818384 markings, 13818383 edges, 219405 markings/sec, 60 secs
lola: 14922438 markings, 14922440 edges, 220811 markings/sec, 65 secs
lola: 15953692 markings, 15953692 edges, 206251 markings/sec, 70 secs
lola: 16574145 markings, 16574232 edges, 124091 markings/sec, 75 secs
lola: 17143479 markings, 17143737 edges, 113867 markings/sec, 80 secs
lola: 17725552 markings, 17725551 edges, 116415 markings/sec, 85 secs
lola: 18335996 markings, 18336310 edges, 122089 markings/sec, 90 secs
lola: 18846838 markings, 18846889 edges, 102168 markings/sec, 95 secs
lola: 19398839 markings, 19398838 edges, 110400 markings/sec, 100 secs
lola: 19933975 markings, 19933974 edges, 107027 markings/sec, 105 secs
lola: 20211928 markings, 20211928 edges, 55591 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F ((G ((G (((p190 <= 0) OR (p193 <= 0))) OR (((p91 <= 0)) OR (((p100 <= 0)) OR ((p106 <= 0)))))) AND X ((F (((1 <= p91) AND (1 <= p100) AND (1 <= p106))) AND (((1 <= p4)) AND (((1 <= p5)) AND ((1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G (((p190 <= 0) OR (p193 <= 0))) OR (((p91 <= 0)) OR (((p100 <= 0)) OR ((p106 <= 0)))))) AND X ((F (((1 <= p91) AND (1 <= p100) AND (1 <= p106))) AND (((1 <= p4)) AND (((1 <= p5)) AND ((1 <= p8))))))))
lola: processed formula length: 210
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 893059 markings, 893059 edges, 178612 markings/sec, 0 secs
lola: 1911465 markings, 1911464 edges, 203681 markings/sec, 5 secs
lola: 2923441 markings, 2923440 edges, 202395 markings/sec, 10 secs
lola: 3938840 markings, 3938839 edges, 203080 markings/sec, 15 secs
lola: 4938168 markings, 4938167 edges, 199866 markings/sec, 20 secs
lola: 5950725 markings, 5950724 edges, 202511 markings/sec, 25 secs
lola: 6856676 markings, 6856675 edges, 181190 markings/sec, 30 secs
lola: 7870185 markings, 7870185 edges, 202702 markings/sec, 35 secs
lola: 8896650 markings, 8896649 edges, 205293 markings/sec, 40 secs
lola: 9915411 markings, 9915410 edges, 203752 markings/sec, 45 secs
lola: 10912443 markings, 10912443 edges, 199406 markings/sec, 50 secs
lola: 11924864 markings, 11924863 edges, 202484 markings/sec, 55 secs
lola: 12923002 markings, 12923002 edges, 199628 markings/sec, 60 secs
lola: 13932039 markings, 13932039 edges, 201807 markings/sec, 65 secs
lola: 14961867 markings, 14961867 edges, 205966 markings/sec, 70 secs
lola: 15943900 markings, 15944019 edges, 196407 markings/sec, 75 secs
lola: 16664872 markings, 16665114 edges, 144194 markings/sec, 80 secs
lola: 16942508 markings, 16942508 edges, 55527 markings/sec, 85 secs
lola: 17580866 markings, 17580899 edges, 127672 markings/sec, 90 secs
lola: 17845180 markings, 17845179 edges, 52863 markings/sec, 95 secs
lola: 18412496 markings, 18412496 edges, 113463 markings/sec, 100 secs
lola: 18948737 markings, 18948739 edges, 107248 markings/sec, 105 secs
lola: 19536152 markings, 19536151 edges, 117483 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown unknown no unknown unknown unknown no unknown yes no
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown no unknown yes no
lola: memory consumption: 3580 KB
lola: time consumption: 1811 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

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="ShieldRVt-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is ShieldRVt-PT-100A, 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 r211-tajo-159033478401082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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