fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033478401084
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldRVt-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15779.990 3600000.00 3642318.00 86445.80 ?TTFF?TFT??F???F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478401084.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401084
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591340904507

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:08:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 07:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:08:26] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2020-06-05 07:08:26] [INFO ] Transformed 803 places.
[2020-06-05 07:08:26] [INFO ] Transformed 803 transitions.
[2020-06-05 07:08:26] [INFO ] Found NUPN structural information;
[2020-06-05 07:08:26] [INFO ] Parsed PT model containing 803 places and 803 transitions in 153 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 815 ms. (steps per millisecond=122 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 802 rows 803 cols
[2020-06-05 07:08:27] [INFO ] Computed 401 place invariants in 20 ms
[2020-06-05 07:08:27] [INFO ] [Real]Absence check using 401 positive place invariants in 181 ms returned sat
[2020-06-05 07:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:29] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2020-06-05 07:08:29] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 101 ms.
[2020-06-05 07:08:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:08:30] [INFO ] [Nat]Absence check using 401 positive place invariants in 362 ms returned sat
[2020-06-05 07:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:31] [INFO ] [Nat]Absence check using state equation in 1483 ms returned sat
[2020-06-05 07:08:31] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 141 ms.
[2020-06-05 07:08:49] [INFO ] Added : 770 causal constraints over 154 iterations in 17991 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:08:50] [INFO ] [Real]Absence check using 401 positive place invariants in 626 ms returned sat
[2020-06-05 07:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:52] [INFO ] [Real]Absence check using state equation in 1886 ms returned sat
[2020-06-05 07:08:52] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 81 ms.
[2020-06-05 07:08:52] [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 187 ms returned sat
[2020-06-05 07:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:08:54] [INFO ] [Nat]Absence check using state equation in 1515 ms returned sat
[2020-06-05 07:08:54] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 70 ms.
[2020-06-05 07:09:12] [INFO ] Added : 792 causal constraints over 159 iterations in 17978 ms. Result :sat
[2020-06-05 07:09:13] [INFO ] [Real]Absence check using 401 positive place invariants in 233 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 1289 ms returned sat
[2020-06-05 07:09:14] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:09:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:14] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:09:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:16] [INFO ] [Nat]Absence check using state equation in 1572 ms returned sat
[2020-06-05 07:09:16] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 31 ms.
[2020-06-05 07:09:31] [INFO ] Added : 794 causal constraints over 160 iterations in 15231 ms. Result :sat
[2020-06-05 07:09:32] [INFO ] [Real]Absence check using 401 positive place invariants in 228 ms returned sat
[2020-06-05 07:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:33] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2020-06-05 07:09:33] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 53 ms.
[2020-06-05 07:09:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:34] [INFO ] [Nat]Absence check using 401 positive place invariants in 157 ms returned sat
[2020-06-05 07:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:35] [INFO ] [Nat]Absence check using state equation in 1378 ms returned sat
[2020-06-05 07:09:35] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:09:53] [INFO ] Added : 793 causal constraints over 159 iterations in 18324 ms. Result :unknown
[2020-06-05 07:09:54] [INFO ] [Real]Absence check using 401 positive place invariants in 256 ms returned sat
[2020-06-05 07:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:55] [INFO ] [Real]Absence check using state equation in 1360 ms returned sat
[2020-06-05 07:09:55] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 41 ms.
[2020-06-05 07:09:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:09:56] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:09:57] [INFO ] [Nat]Absence check using state equation in 1433 ms returned sat
[2020-06-05 07:09:57] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 52 ms.
[2020-06-05 07:10: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: Stream closed (=> (> t350 0) (and (> t777 0) (< o777 o350)))") while checking expression at index 4
[2020-06-05 07:10:16] [INFO ] [Real]Absence check using 401 positive place invariants in 228 ms returned sat
[2020-06-05 07:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:17] [INFO ] [Real]Absence check using state equation in 1337 ms returned sat
[2020-06-05 07:10:17] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 37 ms.
[2020-06-05 07:10:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:18] [INFO ] [Nat]Absence check using 401 positive place invariants in 192 ms returned sat
[2020-06-05 07:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:19] [INFO ] [Nat]Absence check using state equation in 1389 ms returned sat
[2020-06-05 07:10:19] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 58 ms.
[2020-06-05 07:10:37] [INFO ] Added : 794 causal constraints over 159 iterations in 18018 ms. Result :sat
[2020-06-05 07:10:37] [INFO ] [Real]Absence check using 401 positive place invariants in 223 ms returned sat
[2020-06-05 07:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:39] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2020-06-05 07:10:39] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 47 ms.
[2020-06-05 07:10:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:10:39] [INFO ] [Nat]Absence check using 401 positive place invariants in 233 ms returned sat
[2020-06-05 07:10:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:10:41] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2020-06-05 07:10:41] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 50 ms.
[2020-06-05 07:10:59] [INFO ] Added : 793 causal constraints over 159 iterations in 18153 ms. Result :unknown
[2020-06-05 07:11:00] [INFO ] [Real]Absence check using 401 positive place invariants in 225 ms returned sat
[2020-06-05 07:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:01] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2020-06-05 07:11:01] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:11:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:11:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 229 ms returned sat
[2020-06-05 07:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:03] [INFO ] [Nat]Absence check using state equation in 1579 ms returned sat
[2020-06-05 07:11:03] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:11:21] [INFO ] Added : 797 causal constraints over 160 iterations in 17433 ms. Result :sat
[2020-06-05 07:11:21] [INFO ] [Real]Absence check using 401 positive place invariants in 213 ms returned sat
[2020-06-05 07:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:22] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2020-06-05 07:11:22] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 60 ms.
[2020-06-05 07:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:11:23] [INFO ] [Nat]Absence check using 401 positive place invariants in 161 ms returned sat
[2020-06-05 07:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:24] [INFO ] [Nat]Absence check using state equation in 1514 ms returned sat
[2020-06-05 07:11:24] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 77 ms.
[2020-06-05 07:11:42] [INFO ] Added : 787 causal constraints over 158 iterations in 18181 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:11:43] [INFO ] [Real]Absence check using 401 positive place invariants in 206 ms returned sat
[2020-06-05 07:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:44] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2020-06-05 07:11:44] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 35 ms.
[2020-06-05 07:11:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:11:44] [INFO ] [Nat]Absence check using 401 positive place invariants in 161 ms returned sat
[2020-06-05 07:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:11:46] [INFO ] [Nat]Absence check using state equation in 1504 ms returned sat
[2020-06-05 07:11:46] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 57 ms.
[2020-06-05 07:12:04] [INFO ] Added : 785 causal constraints over 157 iterations in 18224 ms. Result :unknown
[2020-06-05 07:12:04] [INFO ] [Real]Absence check using 401 positive place invariants in 176 ms returned sat
[2020-06-05 07:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:06] [INFO ] [Real]Absence check using state equation in 1244 ms returned sat
[2020-06-05 07:12:06] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 34 ms.
[2020-06-05 07:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:12:06] [INFO ] [Nat]Absence check using 401 positive place invariants in 169 ms returned sat
[2020-06-05 07:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:07] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
[2020-06-05 07:12:08] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 47 ms.
[2020-06-05 07:12:26] [INFO ] Added : 789 causal constraints over 158 iterations in 18335 ms. Result :sat
[2020-06-05 07:12:26] [INFO ] [Real]Absence check using 401 positive place invariants in 165 ms returned sat
[2020-06-05 07:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:27] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2020-06-05 07:12:28] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 76 ms.
[2020-06-05 07:12:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:12:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 225 ms returned sat
[2020-06-05 07:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:29] [INFO ] [Nat]Absence check using state equation in 1421 ms returned sat
[2020-06-05 07:12:30] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 110 ms.
[2020-06-05 07:12:48] [INFO ] Added : 796 causal constraints over 160 iterations in 18201 ms. Result :unknown
[2020-06-05 07:12:48] [INFO ] [Real]Absence check using 401 positive place invariants in 156 ms returned sat
[2020-06-05 07:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:49] [INFO ] [Real]Absence check using state equation in 1392 ms returned sat
[2020-06-05 07:12:49] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:12:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:12:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 174 ms returned sat
[2020-06-05 07:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:12:51] [INFO ] [Nat]Absence check using state equation in 1463 ms returned sat
[2020-06-05 07:12:52] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 82 ms.
[2020-06-05 07:13:10] [INFO ] Added : 795 causal constraints over 160 iterations in 18184 ms. Result :sat
[2020-06-05 07:13:10] [INFO ] Deduced a trap composed of 3 places in 662 ms
[2020-06-05 07:13:10] [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: Stream closed (> (+ s0 s187 s188) 0)") while checking expression at index 12
[2020-06-05 07:13:11] [INFO ] [Real]Absence check using 401 positive place invariants in 203 ms returned sat
[2020-06-05 07:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:12] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2020-06-05 07:13:12] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:13:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:13:12] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:14] [INFO ] [Nat]Absence check using state equation in 1386 ms returned sat
[2020-06-05 07:13:14] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:13:32] [INFO ] Added : 786 causal constraints over 158 iterations in 18275 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:13:32] [INFO ] [Real]Absence check using 401 positive place invariants in 221 ms returned sat
[2020-06-05 07:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:34] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2020-06-05 07:13:34] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 34 ms.
[2020-06-05 07:13:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:13:34] [INFO ] [Nat]Absence check using 401 positive place invariants in 172 ms returned sat
[2020-06-05 07:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:35] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2020-06-05 07:13:35] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 36 ms.
[2020-06-05 07:13:53] [INFO ] Added : 794 causal constraints over 160 iterations in 17220 ms. Result :sat
[2020-06-05 07:13:53] [INFO ] [Real]Absence check using 401 positive place invariants in 221 ms returned sat
[2020-06-05 07:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:55] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2020-06-05 07:13:55] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 58 ms.
[2020-06-05 07:13:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:13:55] [INFO ] [Nat]Absence check using 401 positive place invariants in 181 ms returned sat
[2020-06-05 07:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:13:57] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2020-06-05 07:13:57] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 41 ms.
[2020-06-05 07:14:14] [INFO ] Added : 791 causal constraints over 159 iterations in 17610 ms. Result :sat
[2020-06-05 07:14:15] [INFO ] [Real]Absence check using 401 positive place invariants in 232 ms returned sat
[2020-06-05 07:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:16] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2020-06-05 07:14:16] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 86 ms.
[2020-06-05 07:14:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:14:16] [INFO ] [Nat]Absence check using 401 positive place invariants in 165 ms returned sat
[2020-06-05 07:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:18] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2020-06-05 07:14:18] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:14:36] [INFO ] Added : 788 causal constraints over 158 iterations in 18331 ms. Result :sat
[2020-06-05 07:14:36] [INFO ] [Real]Absence check using 401 positive place invariants in 224 ms returned sat
[2020-06-05 07:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:38] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2020-06-05 07:14:38] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 64 ms.
[2020-06-05 07:14:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:14:38] [INFO ] [Nat]Absence check using 401 positive place invariants in 219 ms returned sat
[2020-06-05 07:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:40] [INFO ] [Nat]Absence check using state equation in 1201 ms returned sat
[2020-06-05 07:14:40] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 32 ms.
[2020-06-05 07:14:57] [INFO ] Added : 796 causal constraints over 160 iterations in 17700 ms. Result :sat
[2020-06-05 07:14:58] [INFO ] [Real]Absence check using 401 positive place invariants in 198 ms returned sat
[2020-06-05 07:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:14:59] [INFO ] [Real]Absence check using state equation in 1355 ms returned sat
[2020-06-05 07:14:59] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 75 ms.
[2020-06-05 07:14:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:15:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 270 ms returned sat
[2020-06-05 07:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:01] [INFO ] [Nat]Absence check using state equation in 1362 ms returned sat
[2020-06-05 07:15:01] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:15:19] [INFO ] Added : 760 causal constraints over 152 iterations in 18219 ms. Result :unknown
[2020-06-05 07:15:20] [INFO ] [Real]Absence check using 401 positive place invariants in 171 ms returned sat
[2020-06-05 07:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:21] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2020-06-05 07:15:21] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:15:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:15:22] [INFO ] [Nat]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:23] [INFO ] [Nat]Absence check using state equation in 1380 ms returned sat
[2020-06-05 07:15:23] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:15:41] [INFO ] Added : 790 causal constraints over 158 iterations in 18261 ms. Result :unknown
[2020-06-05 07:15:42] [INFO ] [Real]Absence check using 401 positive place invariants in 309 ms returned sat
[2020-06-05 07:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:43] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2020-06-05 07:15:43] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 31 ms.
[2020-06-05 07:15:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:15:44] [INFO ] [Nat]Absence check using 401 positive place invariants in 149 ms returned sat
[2020-06-05 07:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:15:45] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2020-06-05 07:15:45] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 31 ms.
[2020-06-05 07:16:01] [INFO ] Added : 794 causal constraints over 159 iterations in 16700 ms. Result :sat
[2020-06-05 07:16:02] [INFO ] [Real]Absence check using 401 positive place invariants in 229 ms returned sat
[2020-06-05 07:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:03] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2020-06-05 07:16:03] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 53 ms.
[2020-06-05 07:16:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:16:04] [INFO ] [Nat]Absence check using 401 positive place invariants in 214 ms returned sat
[2020-06-05 07:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:05] [INFO ] [Nat]Absence check using state equation in 1381 ms returned sat
[2020-06-05 07:16:05] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 55 ms.
[2020-06-05 07:16:24] [INFO ] Added : 790 causal constraints over 158 iterations in 18267 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:16:24] [INFO ] [Real]Absence check using 401 positive place invariants in 215 ms returned sat
[2020-06-05 07:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:25] [INFO ] [Real]Absence check using state equation in 1430 ms returned sat
[2020-06-05 07:16:25] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 56 ms.
[2020-06-05 07:16:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:16:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 234 ms returned sat
[2020-06-05 07:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:27] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2020-06-05 07:16:27] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 54 ms.
[2020-06-05 07:16:46] [INFO ] Added : 790 causal constraints over 158 iterations in 18253 ms. Result :unknown
[2020-06-05 07:16:46] [INFO ] [Real]Absence check using 401 positive place invariants in 222 ms returned sat
[2020-06-05 07:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:47] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2020-06-05 07:16:47] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 52 ms.
[2020-06-05 07:16:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:16:48] [INFO ] [Nat]Absence check using 401 positive place invariants in 162 ms returned sat
[2020-06-05 07:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:16:49] [INFO ] [Nat]Absence check using state equation in 1271 ms returned sat
[2020-06-05 07:16:49] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 68 ms.
[2020-06-05 07:17:08] [INFO ] Added : 775 causal constraints over 155 iterations in 18437 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:17:08] [INFO ] [Real]Absence check using 401 positive place invariants in 232 ms returned sat
[2020-06-05 07:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:09] [INFO ] [Real]Absence check using state equation in 1361 ms returned sat
[2020-06-05 07:17:09] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 63 ms.
[2020-06-05 07:17:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:17:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 266 ms returned sat
[2020-06-05 07:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:11] [INFO ] [Nat]Absence check using state equation in 1362 ms returned sat
[2020-06-05 07:17:11] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 62 ms.
[2020-06-05 07:17:30] [INFO ] Added : 794 causal constraints over 159 iterations in 18206 ms. Result :sat
[2020-06-05 07:17:30] [INFO ] [Real]Absence check using 401 positive place invariants in 172 ms returned sat
[2020-06-05 07:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:31] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2020-06-05 07:17:31] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 45 ms.
[2020-06-05 07:17:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:17:32] [INFO ] [Nat]Absence check using 401 positive place invariants in 246 ms returned sat
[2020-06-05 07:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:33] [INFO ] [Nat]Absence check using state equation in 1367 ms returned sat
[2020-06-05 07:17:33] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 61 ms.
[2020-06-05 07:17:50] [INFO ] Added : 791 causal constraints over 159 iterations in 17108 ms. Result :sat
[2020-06-05 07:17:51] [INFO ] [Real]Absence check using 401 positive place invariants in 170 ms returned sat
[2020-06-05 07:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:52] [INFO ] [Real]Absence check using state equation in 1619 ms returned sat
[2020-06-05 07:17:52] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:17:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:17:53] [INFO ] [Nat]Absence check using 401 positive place invariants in 210 ms returned sat
[2020-06-05 07:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:17:54] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2020-06-05 07:17:54] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 47 ms.
[2020-06-05 07:18:12] [INFO ] Added : 787 causal constraints over 158 iterations in 18171 ms. Result :unknown
[2020-06-05 07:18:13] [INFO ] [Real]Absence check using 401 positive place invariants in 169 ms returned sat
[2020-06-05 07:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:14] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2020-06-05 07:18:14] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 68 ms.
[2020-06-05 07:18:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:18:15] [INFO ] [Nat]Absence check using 401 positive place invariants in 238 ms returned sat
[2020-06-05 07:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:16] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2020-06-05 07:18:16] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:18:34] [INFO ] Added : 791 causal constraints over 159 iterations in 18288 ms. Result :unknown
[2020-06-05 07:18:34] [INFO ] [Real]Absence check using 401 positive place invariants in 167 ms returned sat
[2020-06-05 07:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:36] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2020-06-05 07:18:36] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 44 ms.
[2020-06-05 07:18:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:18:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 211 ms returned sat
[2020-06-05 07:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:38] [INFO ] [Nat]Absence check using state equation in 1324 ms returned sat
[2020-06-05 07:18:38] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 44 ms.
[2020-06-05 07:18:56] [INFO ] Added : 794 causal constraints over 159 iterations in 18342 ms. Result :unknown
[2020-06-05 07:18:56] [INFO ] [Real]Absence check using 401 positive place invariants in 307 ms returned sat
[2020-06-05 07:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:18:58] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2020-06-05 07:18:58] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 48 ms.
[2020-06-05 07:18:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:18:59] [INFO ] [Nat]Absence check using 401 positive place invariants in 223 ms returned sat
[2020-06-05 07:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:19:00] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2020-06-05 07:19:00] [INFO ] Computed and/alt/rep : 801/3499/801 causal constraints in 59 ms.
[2020-06-05 07:19:17] [INFO ] Added : 791 causal constraints over 159 iterations in 17012 ms. Result :sat
[2020-06-05 07:19:18] [INFO ] Flatten gal took : 213 ms
[2020-06-05 07:19:18] [INFO ] Flatten gal took : 86 ms
[2020-06-05 07:19:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 07:19:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldRVt-PT-100A @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA ShieldRVt-PT-100A-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1462
rslt: Output for CTLFireability @ 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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 07:19:18 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((1 <= p509)) U ((1 <= p380) AND (1 <= p381) AND (1 <= p384))))",
"processed_size": 67,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(A(((1 <= p487)) U ((1 <= p327))))",
"processed_size": 36,
"rewrites": 47
},
"net":
{
"conflict_clusters": 203,
"singleton_clusters": 0
},
"result":
{
"edges": 27329,
"markings": 27131,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(((p230 <= 0) OR (p233 <= 0)))",
"processed_size": 33,
"rewrites": 46
},
"net":
{
"conflict_clusters": 203,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p318 <= 0) OR (p321 <= 0))))",
"processed_size": 37,
"rewrites": 47
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((1 <= p608) AND (1 <= p610) AND (1 <= p615)) OR ((1 <= p684) AND (1 <= p685) AND (1 <= p688)) OR ((1 <= p295) AND (((1 <= p291)) OR ((1 <= p539)) OR ((1 <= p540) AND (1 <= p541) AND (1 <= p544)) OR ((1 <= p139) AND (1 <= p148) AND (1 <= p154)))))",
"processed_size": 251,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p719))))",
"processed_size": 21,
"rewrites": 46
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AX(((p767 <= 0) OR ((1 <= p747) AND (1 <= p756) AND (1 <= p762) AND ((p151 <= 0)))))",
"processed_size": 85,
"rewrites": 46
},
"net":
{
"conflict_clusters": 203,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p345))))",
"processed_size": 21,
"rewrites": 46
},
"result":
{
"edges": 59,
"markings": 60,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((p469 <= 0))))",
"processed_size": 21,
"rewrites": 47
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 362
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G (((p211 <= 0))))",
"processed_size": 21,
"rewrites": 47
},
"result":
{
"edges": 78,
"markings": 79,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(E(((p111 <= 0)) R ((p641 <= 0))))",
"processed_size": 36,
"rewrites": 47
},
"net":
{
"conflict_clusters": 203,
"singleton_clusters": 0
},
"result":
{
"edges": 123,
"markings": 62,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 690
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p163) AND (1 <= p172) AND (1 <= p178))",
"processed_size": 45,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 920
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p235) AND ((p270 <= 0) OR (p273 <= 0) OR (p321 <= 0)) AND (1 <= p244) AND (1 <= p250) AND (1 <= p133))))",
"processed_size": 119,
"rewrites": 46
},
"result":
{
"edges": 91,
"markings": 92,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 920
},
"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 <= p683))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((1 <= p560) AND (1 <= p562) AND (1 <= p567) AND (((1 <= p699) AND (1 <= p708) AND (1 <= p714)) OR ((1 <= p756) AND (1 <= p757) AND (1 <= p760) AND (1 <= p349))))",
"processed_size": 163,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G (((p719 <= 0))))",
"processed_size": 21,
"rewrites": 47
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"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 <= p683))",
"processed_size": 13,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 21,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3364,
"runtime": 2108.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(A(G(**)))) OR **) : (E(F(A((** U **)))) AND (E(F(A(X(**)))) OR (A((** U **)) OR E(X(*))))) : (E(F(**)) OR **) : (E(G(E(X(*)))) AND (E((* R *)) AND A(G(*)))) : A(G(**)) : A((E(G(**)) U A(G(*)))) : (A(X(**)) AND (E(F(**)) OR (** OR (** OR **)))) : A(G(*)) : E(F(**)) : A(G(E(F(*)))) : A(G(E(F(**)))) : (E(G(*)) AND ((E(G(**)) OR A(G(*))) AND (A(G(*)) OR **))) : A(G((** OR A(X(**))))) : E(G(E(F(**)))) : E(X(E(G(E(F(**)))))) : A(G(E((* R *))))"
},
"net":
{
"arcs": 3404,
"conflict_clusters": 203,
"places": 803,
"places_significant": 402,
"singleton_clusters": 0,
"transitions": 802
},
"result":
{
"preliminary_value": "unknown yes yes no no unknown yes no yes unknown unknown no unknown unknown unknown no ",
"value": "unknown yes yes no no unknown yes no yes unknown unknown no unknown unknown unknown 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p544 <= 1)
lola: LP says that atomic proposition is always true: (p546 <= 1)
lola: LP says that atomic proposition is always true: (p551 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p683 <= 1)
lola: LP says that atomic proposition is always true: (p487 <= 1)
lola: LP says that atomic proposition is always true: (p327 <= 1)
lola: LP says that atomic proposition is always true: (p724 <= 1)
lola: LP says that atomic proposition is always true: (p725 <= 1)
lola: LP says that atomic proposition is always true: (p728 <= 1)
lola: LP says that atomic proposition is always true: (p509 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p381 <= 1)
lola: LP says that atomic proposition is always true: (p384 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p333 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p318 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p469 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p747 <= 1)
lola: LP says that atomic proposition is always true: (p756 <= 1)
lola: LP says that atomic proposition is always true: (p762 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p767 <= 1)
lola: LP says that atomic proposition is always true: (p719 <= 1)
lola: LP says that atomic proposition is always true: (p608 <= 1)
lola: LP says that atomic proposition is always true: (p610 <= 1)
lola: LP says that atomic proposition is always true: (p615 <= 1)
lola: LP says that atomic proposition is always true: (p684 <= 1)
lola: LP says that atomic proposition is always true: (p685 <= 1)
lola: LP says that atomic proposition is always true: (p688 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: LP says that atomic proposition is always true: (p539 <= 1)
lola: LP says that atomic proposition is always true: (p540 <= 1)
lola: LP says that atomic proposition is always true: (p541 <= 1)
lola: LP says that atomic proposition is always true: (p544 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p345 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p761 <= 1)
lola: LP says that atomic proposition is always true: (p763 <= 1)
lola: LP says that atomic proposition is always true: (p772 <= 1)
lola: LP says that atomic proposition is always true: (p778 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p382 <= 1)
lola: LP says that atomic proposition is always true: (p385 <= 1)
lola: LP says that atomic proposition is always true: (p480 <= 1)
lola: LP says that atomic proposition is always true: (p482 <= 1)
lola: LP says that atomic proposition is always true: (p487 <= 1)
lola: LP says that atomic proposition is always true: (p719 <= 1)
lola: LP says that atomic proposition is always true: (p560 <= 1)
lola: LP says that atomic proposition is always true: (p562 <= 1)
lola: LP says that atomic proposition is always true: (p567 <= 1)
lola: LP says that atomic proposition is always true: (p699 <= 1)
lola: LP says that atomic proposition is always true: (p708 <= 1)
lola: LP says that atomic proposition is always true: (p714 <= 1)
lola: LP says that atomic proposition is always true: (p756 <= 1)
lola: LP says that atomic proposition is always true: (p757 <= 1)
lola: LP says that atomic proposition is always true: (p760 <= 1)
lola: LP says that atomic proposition is always true: (p349 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p752 <= 1)
lola: LP says that atomic proposition is always true: (p754 <= 1)
lola: LP says that atomic proposition is always true: (p759 <= 1)
lola: LP says that atomic proposition is always true: (p480 <= 1)
lola: LP says that atomic proposition is always true: (p482 <= 1)
lola: LP says that atomic proposition is always true: (p487 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p781 <= 1)
lola: LP says that atomic proposition is always true: (p579 <= 1)
lola: LP says that atomic proposition is always true: (p588 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p641 <= 1)
lola: (E (F (A (G (((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203)))))) OR ((1 <= p683))) : (E (F (A ((((1 <= p487)) U ((1 <= p327)))))) AND ((E (F (A (X (((1 <= p724) AND (1 <= p725) AND (1 <= p728)))))) OR A ((((1 <= p509)) U ((1 <= p380) AND (1 <= p381) AND (1 <= p384))))) OR NOT(A (X (((1 <= p230) AND (1 <= p233))))))) : (E (F (((1 <= p235) AND ((p270 <= 0) OR (p273 <= 0) OR (p321 <= 0)) AND (1 <= p244) AND (1 <= p250) AND (1 <= p133)))) OR ((1 <= p163) AND (1 <= p172) AND (1 <= p178))) : ((NOT(A (F (A (X (((1 <= p3))))))) AND NOT(A ((((1 <= p333)) U ((1 <= p229)))))) AND NOT(E (F (((1 <= p318) AND (1 <= p321)))))) : A (G (((p469 <= 0)))) : A ((E (G (((p2 <= 0) OR (p4 <= 0) OR (p10 <= 0)))) U NOT(E (F (((1 <= p390) AND (1 <= p393))))))) : (A (X (((p767 <= 0) OR ((1 <= p747) AND (1 <= p756) AND (1 <= p762) AND ((p151 <= 0)))))) AND (((E (F (((1 <= p719)))) OR ((1 <= p608) AND (1 <= p610) AND (1 <= p615))) OR ((1 <= p684) AND (1 <= p685) AND (1 <= p688))) OR ((1 <= p295) AND (((1 <= p291)) OR ((1 <= p539)) OR ((1 <= p540) AND (1 <= p541) AND (1 <= p544)) OR ((1 <= p139) AND (1 <= p148) AND (1 <= p154)))))) : NOT(E (F (((1 <= p211))))) : E (F (((1 <= p345)))) : A (G (NOT(A (G (((1 <= p259) AND (1 <= p268) AND (1 <= p274) AND (1 <= p761))))))) : A (G (E (F (E (F (((1 <= p763) AND (1 <= p772) AND (1 <= p778)))))))) : ((NOT(A (F (A (F (((1 <= p139) AND (1 <= p148) AND (1 <= p154))))))) AND (E (G (((p382 <= 0) OR (p385 <= 0)))) OR NOT(E (F (((1 <= p480) AND (1 <= p482) AND (1 <= p487))))))) AND (NOT(E (F (((1 <= p719))))) OR ((1 <= p560) AND (1 <= p562) AND (1 <= p567) AND (((1 <= p699) AND (1 <= p708) AND (1 <= p714)) OR ((1 <= p756) AND (1 <= p757) AND (1 <= p760) AND (1 <= p349)))))) : A (G ((((p504 <= 0) OR (p506 <= 0) OR (p511 <= 0) OR (p157 <= 0) OR (p752 <= 0) OR (p754 <= 0) OR (p759 <= 0)) OR A (X (((1 <= p480) AND (1 <= p482) AND (1 <= p487) AND (1 <= p57))))))) : E (G (E (F ((((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440)))))))) : E (X (E (G (E (F (((1 <= p390) AND (1 <= p393)))))))) : A (G (NOT(A ((((1 <= p111)) U ((1 <= p641)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A ((((1 <= p487)) U ((1 <= p327)))))) AND (E (F (A (X (((1 <= p724) AND (1 <= p725) AND (1 <= p728)))))) OR (A ((((1 <= p509)) U ((1 <= p380) AND (1 <= p381) AND (1 <= p384)))) OR E (X (((p230 <= 0) OR (p233 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p509)) U ((1 <= p380) AND (1 <= p381) AND (1 <= p384))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p509)) U ((1 <= p380) AND (1 <= p381) AND (1 <= p384))))
lola: processed formula length: 67
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p509))
lola: state equation task get result unparse finished id 0
lola: 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A ((((1 <= p487)) U ((1 <= p327))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A(((1 <= p487)) U ((1 <= p327))))
lola: processed formula length: 36
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27131 markings, 27329 edges
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p230 <= 0) OR (p233 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p230 <= 0) OR (p233 <= 0)))
lola: processed formula length: 33
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X (((p3 <= 0)))))) AND (E ((((p333 <= 0)) R ((p229 <= 0)))) AND A (G (((p318 <= 0) OR (p321 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p318 <= 0) OR (p321 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p318 <= 0) OR (p321 <= 0))))
lola: processed formula length: 37
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p318) AND (1 <= p321))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 63 markings, 62 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p767 <= 0) OR ((1 <= p747) AND (1 <= p756) AND (1 <= p762) AND ((p151 <= 0)))))) AND (E (F (((1 <= p719)))) OR (((1 <= p608) AND (1 <= p610) AND (1 <= p615)) OR (((1 <= p684) AND (1 <= p685) AND (1 <= p688)) OR ((1 <= p295) AND (((1 <= p291)) OR ((1 <= p539)) OR ((1 <= p540) AND (1 <= p541) AND (1 <= p544)) OR ((1 <= p139) AND (1 <= p148) AND (1 <= p154))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p608) AND (1 <= p610) AND (1 <= p615)) OR (((1 <= p684) AND (1 <= p685) AND (1 <= p688)) OR ((1 <= p295) AND (((1 <= p291)) OR ((1 <= p539)) OR ((1 <= p540) AND (1 <= p541) AND (1 <= p544)) OR ((1 <= p139) AND (1 <= p148) AND (1 <= p154))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p608) AND (1 <= p610) AND (1 <= p615)) OR ((1 <= p684) AND (1 <= p685) AND (1 <= p688)) OR ((1 <= p295) AND (((1 <= p291)) OR ((1 <= p539)) OR ((1 <= p540) AND (1 <= p541) AND (1 <= p544)) OR ((1 <= p139) AND (1 <= p148) AND (1 <= p154)))))
lola: processed formula length: 251
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 15 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p719))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p719))))
lola: processed formula length: 21
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p719))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p767 <= 0) OR ((1 <= p747) AND (1 <= p756) AND (1 <= p762) AND ((p151 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p767 <= 0) OR ((1 <= p747) AND (1 <= p756) AND (1 <= p762) AND ((p151 <= 0)))))
lola: processed formula length: 85
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p504 <= 0) OR (p506 <= 0) OR (p511 <= 0) OR (p157 <= 0) OR (p752 <= 0) OR (p754 <= 0) OR (p759 <= 0)) OR A (X (((1 <= p480) AND (1 <= p482) AND (1 <= p487) AND (1 <= p57)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p504 <= 0) OR (p506 <= 0) OR (p511 <= 0) OR (p157 <= 0) OR (p752 <= 0) OR (p754 <= 0) OR (p759 <= 0)) OR AX(((1 <= p480) AND (1 <= p482) AND (1 <= p487) AND (1 <= p57)))))
lola: processed formula length: 183
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1102875 markings, 1102875 edges, 220575 markings/sec, 0 secs
lola: 2179394 markings, 2179394 edges, 215304 markings/sec, 5 secs
lola: 3245879 markings, 3245879 edges, 213297 markings/sec, 10 secs
lola: 4272533 markings, 4272533 edges, 205331 markings/sec, 15 secs
lola: 5358772 markings, 5358772 edges, 217248 markings/sec, 20 secs
lola: 6412097 markings, 6412097 edges, 210665 markings/sec, 25 secs
lola: 7550228 markings, 7550228 edges, 227626 markings/sec, 30 secs
lola: 8696346 markings, 8696345 edges, 229224 markings/sec, 35 secs
lola: 9838746 markings, 9838745 edges, 228480 markings/sec, 40 secs
lola: 10986553 markings, 10986552 edges, 229561 markings/sec, 45 secs
lola: 12127474 markings, 12127474 edges, 228184 markings/sec, 50 secs
lola: 13270481 markings, 13270481 edges, 228601 markings/sec, 55 secs
lola: 14405783 markings, 14405782 edges, 227060 markings/sec, 60 secs
lola: 15556350 markings, 15556353 edges, 230113 markings/sec, 65 secs
lola: 16527962 markings, 16528035 edges, 194322 markings/sec, 70 secs
lola: 17090302 markings, 17090409 edges, 112468 markings/sec, 75 secs
lola: 17822584 markings, 17822728 edges, 146456 markings/sec, 80 secs
lola: 18530306 markings, 18530920 edges, 141544 markings/sec, 85 secs
lola: 19251222 markings, 19251232 edges, 144183 markings/sec, 90 secs
lola: 19906714 markings, 19906891 edges, 131098 markings/sec, 95 secs
lola: 20577374 markings, 20577374 edges, 134132 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (E (F (((1 <= p390) AND (1 <= p393))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EG(EF(((1 <= p390) AND (1 <= p393)))))
lola: processed formula length: 41
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 655186 markings, 1359533 edges, 131037 markings/sec, 0 secs
lola: 1328037 markings, 2755617 edges, 134570 markings/sec, 5 secs
lola: 1971336 markings, 4090398 edges, 128660 markings/sec, 10 secs
lola: 2656647 markings, 5512332 edges, 137062 markings/sec, 15 secs
lola: 3341776 markings, 6933894 edges, 137026 markings/sec, 20 secs
lola: 3974907 markings, 8247576 edges, 126626 markings/sec, 25 secs
lola: 4650818 markings, 9650028 edges, 135182 markings/sec, 30 secs
lola: 5334386 markings, 11068344 edges, 136714 markings/sec, 35 secs
lola: 6006469 markings, 12462859 edges, 134417 markings/sec, 40 secs
lola: 6670573 markings, 13840791 edges, 132821 markings/sec, 45 secs
lola: 7340989 markings, 15231841 edges, 134083 markings/sec, 50 secs
lola: 8015378 markings, 16631119 edges, 134878 markings/sec, 55 secs
lola: 8688890 markings, 18028574 edges, 134702 markings/sec, 60 secs
lola: 9360514 markings, 19422126 edges, 134325 markings/sec, 65 secs
lola: 10033074 markings, 20817614 edges, 134512 markings/sec, 70 secs
lola: 10704151 markings, 22210033 edges, 134215 markings/sec, 75 secs
lola: 11357537 markings, 23565729 edges, 130677 markings/sec, 80 secs
lola: 11992123 markings, 24882426 edges, 126917 markings/sec, 85 secs
lola: 12663755 markings, 26275997 edges, 134326 markings/sec, 90 secs
lola: 13343639 markings, 27686673 edges, 135977 markings/sec, 95 secs
lola: 14017315 markings, 29084490 edges, 134735 markings/sec, 100 secs
lola: 14690058 markings, 30480349 edges, 134549 markings/sec, 105 secs
lola: 15361557 markings, 31873652 edges, 134300 markings/sec, 110 secs
lola: 16030741 markings, 33262111 edges, 133837 markings/sec, 115 secs
lola: 16665627 markings, 34579520 edges, 126977 markings/sec, 120 secs
lola: 17232365 markings, 35755390 edges, 113348 markings/sec, 125 secs
lola: 17613299 markings, 36545977 edges, 76187 markings/sec, 130 secs
lola: 18161984 markings, 37684223 edges, 109737 markings/sec, 135 secs
lola: 18588355 markings, 38568902 edges, 85274 markings/sec, 140 secs
lola: 19001082 markings, 39425263 edges, 82545 markings/sec, 145 secs
lola: 19477421 markings, 40413605 edges, 95268 markings/sec, 150 secs
lola: 19986395 markings, 41469684 edges, 101795 markings/sec, 155 secs
lola: 20421298 markings, 42372054 edges, 86981 markings/sec, 160 secs
lola: 20713857 markings, 42979061 edges, 58512 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p345))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p345))))
lola: processed formula length: 21
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p345))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 60 markings, 59 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p469 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p469 <= 0))))
lola: processed formula length: 21
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p469))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p211 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p211 <= 0))))
lola: processed formula length: 21
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p211))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p763) AND (1 <= p772) AND (1 <= p778))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p763) AND (1 <= p772) AND (1 <= p778))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p763 <= 0) OR (p772 <= 0) OR (p778 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p763) AND (1 <= p772) AND (1 <= p778))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 754481 markings, 911285 edges, 150896 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1517666 markings, 1900443 edges, 152637 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2265268 markings, 2864822 edges, 149520 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2868706 markings, 3680183 edges, 120688 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3697214 markings, 4776636 edges, 165702 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4590379 markings, 5903551 edges, 178633 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5438130 markings, 7023556 edges, 169550 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6252593 markings, 8135994 edges, 162893 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 7051359 markings, 9261322 edges, 159753 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7826466 markings, 10372692 edges, 155021 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 8584011 markings, 11477297 edges, 151509 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9343089 markings, 12593826 edges, 151816 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 10219503 markings, 13747205 edges, 175283 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 11085660 markings, 14882265 edges, 173231 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 11902072 markings, 16025928 edges, 163282 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 12698116 markings, 17176484 edges, 159209 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 13574361 markings, 18303525 edges, 175249 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 14384196 markings, 19413972 edges, 161967 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 15158163 markings, 20496730 edges, 154793 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 15909144 markings, 21575699 edges, 150196 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 16647828 markings, 22633800 edges, 147737 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 17532198 markings, 23750521 edges, 176874 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 18333285 markings, 24853204 edges, 160217 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 19103252 markings, 25928354 edges, 153993 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 19855903 markings, 27013660 edges, 150530 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 20557749 markings, 28024907 edges, 140369 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 21243677 markings, 29027911 edges, 137186 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 21930974 markings, 30050011 edges, 137459 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 22796668 markings, 31152189 edges, 173139 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 23606225 markings, 32272117 edges, 161911 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 24387746 markings, 33355006 edges, 156304 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 25140726 markings, 34435369 edges, 150596 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 25928651 markings, 35522765 edges, 157585 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 26770080 markings, 36626715 edges, 168286 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 27565456 markings, 37728548 edges, 159075 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 28225291 markings, 38659572 edges, 131967 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 28778002 markings, 39453931 edges, 110542 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 29523723 markings, 40450396 edges, 149144 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 30204193 markings, 41307338 edges, 136094 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 30817672 markings, 42117184 edges, 122696 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 31465849 markings, 42986816 edges, 129635 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 32104215 markings, 43866798 edges, 127673 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 32812979 markings, 44756345 edges, 141753 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 33483285 markings, 45637930 edges, 134061 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 34104483 markings, 46437491 edges, 124240 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0) OR (p761 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0) OR (p761 <= 0))
lola: processed formula length: 61
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p259) AND (1 <= p268) AND (1 <= p274) AND (1 <= p761))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0) OR (p761 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 947605 markings, 947604 edges, 189521 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1828234 markings, 1828234 edges, 176126 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2766406 markings, 2766406 edges, 187634 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3848542 markings, 3848541 edges, 216427 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4809252 markings, 4809252 edges, 192142 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 5894901 markings, 5894901 edges, 217130 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7001145 markings, 7001145 edges, 221249 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8124144 markings, 8124144 edges, 224600 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9242805 markings, 9242805 edges, 223732 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10364394 markings, 10364393 edges, 224318 markings/sec, 45 secs
sara: warning, failure of lp_solve (at job 99)
lola: sara is running 50 secs || sara is running 50 secs || 11471150 markings, 11471149 edges, 221351 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12584633 markings, 12584632 edges, 222697 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13694205 markings, 13694205 edges, 221914 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14812177 markings, 14812177 edges, 223594 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15934945 markings, 15934945 edges, 224554 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17056118 markings, 17056118 edges, 224235 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 18003459 markings, 18003458 edges, 189468 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18515551 markings, 18515551 edges, 102418 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19283049 markings, 19283049 edges, 153500 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 19958349 markings, 19958350 edges, 135060 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 20658041 markings, 20658040 edges, 139938 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 21340834 markings, 21340835 edges, 136559 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E ((((p111 <= 0)) R ((p641 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E(((p111 <= 0)) R ((p641 <= 0))))
lola: processed formula length: 36
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 62 markings, 123 edges
lola: ========================================
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (((p2 <= 0) OR (p4 <= 0) OR (p10 <= 0)))) U A (G (((p390 <= 0) OR (p393 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG(((p2 <= 0) OR (p4 <= 0) OR (p10 <= 0))) U AG(((p390 <= 0) OR (p393 <= 0))))
lola: processed formula length: 83
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1046972 markings, 1047125 edges, 209394 markings/sec, 0 secs
lola: 2203319 markings, 2203472 edges, 231269 markings/sec, 5 secs
lola: 3388041 markings, 3388194 edges, 236944 markings/sec, 10 secs
lola: 4571912 markings, 4572065 edges, 236774 markings/sec, 15 secs
lola: 5752982 markings, 5753134 edges, 236214 markings/sec, 20 secs
lola: 6936199 markings, 6936352 edges, 236643 markings/sec, 25 secs
lola: 8120863 markings, 8121018 edges, 236933 markings/sec, 30 secs
lola: 9298329 markings, 9298482 edges, 235493 markings/sec, 35 secs
lola: 10472036 markings, 10472189 edges, 234741 markings/sec, 40 secs
lola: 11652028 markings, 11652181 edges, 235998 markings/sec, 45 secs
lola: 12814348 markings, 12814500 edges, 232464 markings/sec, 50 secs
lola: 13993547 markings, 13993700 edges, 235840 markings/sec, 55 secs
lola: 15170173 markings, 15170326 edges, 235325 markings/sec, 60 secs
lola: 16331334 markings, 16331487 edges, 232232 markings/sec, 65 secs
lola: 17490660 markings, 17490813 edges, 231865 markings/sec, 70 secs
lola: 18586899 markings, 18587052 edges, 219248 markings/sec, 75 secs
lola: 19781232 markings, 19781385 edges, 238867 markings/sec, 80 secs
lola: 20920707 markings, 20920860 edges, 227895 markings/sec, 85 secs
lola: 22062203 markings, 22062356 edges, 228299 markings/sec, 90 secs
lola: 23182923 markings, 23183076 edges, 224144 markings/sec, 95 secs
lola: 24226139 markings, 24226291 edges, 208643 markings/sec, 100 secs
lola: 25047754 markings, 25048047 edges, 164323 markings/sec, 105 secs
lola: 25784800 markings, 25785005 edges, 147409 markings/sec, 110 secs
lola: 26675177 markings, 26675395 edges, 178075 markings/sec, 115 secs
lola: 27575344 markings, 27575497 edges, 180033 markings/sec, 120 secs
lola: 28380375 markings, 28380528 edges, 161006 markings/sec, 125 secs
lola: 29042475 markings, 29042627 edges, 132420 markings/sec, 130 secs
lola: 29820036 markings, 29820188 edges, 155512 markings/sec, 135 secs
lola: 29852257 markings, 29852410 edges, 6444 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p235) AND ((p270 <= 0) OR (p273 <= 0) OR (p321 <= 0)) AND (1 <= p244) AND (1 <= p250) AND (1 <= p133)))) OR ((1 <= p163) AND (1 <= p172) AND (1 <= p178)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p163) AND (1 <= p172) AND (1 <= p178))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p163) AND (1 <= p172) AND (1 <= p178))
lola: processed formula length: 45
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 13 will run for 920 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p235) AND ((p270 <= 0) OR (p273 <= 0) OR (p321 <= 0)) AND (1 <= p244) AND (1 <= p250) AND (1 <= p133))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p235) AND ((p270 <= 0) OR (p273 <= 0) OR (p321 <= 0)) AND (1 <= p244) AND (1 <= p250) AND (1 <= p133))))
lola: processed formula length: 119
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p235) AND ((p270 <= 0) OR (p273 <= 0) OR (p321 <= 0)) AND (1 <= p244) AND (1 <= p250) AND (1 <= p133))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 92 markings, 91 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 920 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203)))))) OR ((1 <= p683)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 920 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p683))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p683))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.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 14 will run for 1381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p544 <= 0) OR (p546 <= 0) OR (p551 <= 0) OR (p203 <= 0))
lola: processed formula length: 61
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: ((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((p544 <= 0) OR (p546 <= 0) OR (p551 <= 0) OR (p203 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-14-0.sara
sara: try reading problem file CTLFireability-14-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 986538 markings, 986538 edges, 197308 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2058341 markings, 2058341 edges, 214361 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3106670 markings, 3106670 edges, 209666 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4185042 markings, 4185043 edges, 215674 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5268637 markings, 5268637 edges, 216719 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6363545 markings, 6363544 edges, 218982 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7429601 markings, 7429600 edges, 213211 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8488944 markings, 8488943 edges, 211869 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9504343 markings, 9504343 edges, 203080 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10493338 markings, 10493338 edges, 197799 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11606411 markings, 11606410 edges, 222615 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12724717 markings, 12724716 edges, 223661 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13836256 markings, 13836256 edges, 222308 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14940365 markings, 14940365 edges, 220822 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 16021892 markings, 16022003 edges, 216305 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17083067 markings, 17083067 edges, 212235 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17722250 markings, 17722249 edges, 127837 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18556720 markings, 18556719 edges, 166894 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19215360 markings, 19215359 edges, 131728 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 19983258 markings, 19983257 edges, 153580 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 20689626 markings, 20689626 edges, 141274 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 21395003 markings, 21395003 edges, 141075 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: subprocess 14 will run for 1323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440))))
lola: processed formula length: 117
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p781)) OR (((p579 <= 0) OR (p588 <= 0) OR (p594 <= 0)) AND ((p436 <= 0) OR (p437 <= 0) OR (p440 <= 0))))
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 19 literals and 10 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: try reading problem file CTLFireability-14-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 976456 markings, 976456 edges, 195291 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2061408 markings, 2061407 edges, 216990 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3164573 markings, 3164573 edges, 220633 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3814165 markings, 3814165 edges, 129918 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4892405 markings, 4892405 edges, 215648 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6002298 markings, 6002298 edges, 221979 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7084663 markings, 7084662 edges, 216473 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8170934 markings, 8170934 edges, 217254 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9261826 markings, 9261826 edges, 218178 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10290429 markings, 10290429 edges, 205721 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11354963 markings, 11354963 edges, 212907 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12399589 markings, 12399588 edges, 208925 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13366761 markings, 13366761 edges, 193434 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14325166 markings, 14325166 edges, 191681 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15329048 markings, 15329048 edges, 200776 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16376324 markings, 16376324 edges, 209455 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17258952 markings, 17258951 edges, 176526 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18100880 markings, 18100880 edges, 168386 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 18760631 markings, 18760630 edges, 131950 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 19205393 markings, 19205392 edges, 88952 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 19976172 markings, 19976171 edges, 154156 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 20514588 markings, 20514588 edges, 107683 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 21208676 markings, 21208676 edges, 138818 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p139 <= 0) OR (p148 <= 0) OR (p154 <= 0)))) AND ((E (G (((p382 <= 0) OR (p385 <= 0)))) OR A (G (((p480 <= 0) OR (p482 <= 0) OR (p487 <= 0))))) AND (A (G (((p719 <= 0)))) OR ((1 <= p560) AND (1 <= p562) AND (1 <= p567) AND (((1 <= p699) AND (1 <= p708) AND (1 <= p714)) OR ((1 <= p756) AND (1 <= p757) AND (1 <= p760) AND (1 <= p349)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p560) AND (1 <= p562) AND (1 <= p567) AND (((1 <= p699) AND (1 <= p708) AND (1 <= p714)) OR ((1 <= p756) AND (1 <= p757) AND (1 <= p760) AND (1 <= p349))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p560) AND (1 <= p562) AND (1 <= p567) AND (((1 <= p699) AND (1 <= p708) AND (1 <= p714)) OR ((1 <= p756) AND (1 <= p757) AND (1 <= p760) AND (1 <= p349))))
lola: processed formula length: 163
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p719 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p719 <= 0))))
lola: processed formula length: 21
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p719))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p504 <= 0) OR (p506 <= 0) OR (p511 <= 0) OR (p157 <= 0) OR (p752 <= 0) OR (p754 <= 0) OR (p759 <= 0)) OR A (X (((1 <= p480) AND (1 <= p482) AND (1 <= p487) AND (1 <= p57)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
sara: try reading problem file CTLFireability-17-0.sara.
lola: processed formula: AG((((p504 <= 0) OR (p506 <= 0) OR (p511 <= 0) OR (p157 <= 0) OR (p752 <= 0) OR (p754 <= 0) OR (p759 <= 0)) OR AX(((1 <= p480) AND (1 <= p482) AND (1 <= p487) AND (1 <= p57)))))
lola: processed formula length: 183
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 890690 markings, 890690 edges, 178138 markings/sec, 0 secs
lola: 1899249 markings, 1899249 edges, 201712 markings/sec, 5 secs
lola: 2896966 markings, 2896965 edges, 199543 markings/sec, 10 secs
lola: 3986467 markings, 3986467 edges, 217900 markings/sec, 15 secs
lola: 5095404 markings, 5095403 edges, 221787 markings/sec, 20 secs
lola: 6142535 markings, 6142534 edges, 209426 markings/sec, 25 secs
lola: 7248884 markings, 7248884 edges, 221270 markings/sec, 30 secs
lola: 8367034 markings, 8367034 edges, 223630 markings/sec, 35 secs
lola: 9426907 markings, 9426907 edges, 211975 markings/sec, 40 secs
lola: 10486566 markings, 10486566 edges, 211932 markings/sec, 45 secs
lola: 11571961 markings, 11571961 edges, 217079 markings/sec, 50 secs
lola: 12635017 markings, 12635017 edges, 212611 markings/sec, 55 secs
lola: 13714533 markings, 13714533 edges, 215903 markings/sec, 60 secs
lola: 14684239 markings, 14684239 edges, 193941 markings/sec, 65 secs
lola: 15802821 markings, 15802821 edges, 223716 markings/sec, 70 secs
lola: 16708874 markings, 16708876 edges, 181211 markings/sec, 75 secs
lola: 17450832 markings, 17451015 edges, 148392 markings/sec, 80 secs
lola: 18279390 markings, 18279521 edges, 165712 markings/sec, 85 secs
lola: 19071411 markings, 19071478 edges, 158404 markings/sec, 90 secs
lola: 19727225 markings, 19727246 edges, 131163 markings/sec, 95 secs
lola: 20443752 markings, 20443751 edges, 143305 markings/sec, 100 secs
lola: 20701855 markings, 20701855 edges, 51621 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (G (E (F (((1 <= p390) AND (1 <= p393))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EG(EF(((1 <= p390) AND (1 <= p393)))))
lola: processed formula length: 41
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 601202 markings, 1247508 edges, 120240 markings/sec, 0 secs
lola: 1268374 markings, 2631824 edges, 133434 markings/sec, 5 secs
lola: 1943583 markings, 4032810 edges, 135042 markings/sec, 10 secs
lola: 2619822 markings, 5435934 edges, 135248 markings/sec, 15 secs
lola: 3296272 markings, 6839486 edges, 135290 markings/sec, 20 secs
lola: 3976936 markings, 8251783 edges, 136133 markings/sec, 25 secs
lola: 4654545 markings, 9657754 edges, 135522 markings/sec, 30 secs
lola: 5327048 markings, 11053114 edges, 134501 markings/sec, 35 secs
lola: 6005961 markings, 12461787 edges, 135783 markings/sec, 40 secs
lola: 6681536 markings, 13863543 edges, 135115 markings/sec, 45 secs
lola: 7354217 markings, 15259283 edges, 134536 markings/sec, 50 secs
lola: 8024490 markings, 16650025 edges, 134055 markings/sec, 55 secs
lola: 8687633 markings, 18025970 edges, 132629 markings/sec, 60 secs
lola: 9348727 markings, 19397698 edges, 132219 markings/sec, 65 secs
lola: 10019276 markings, 20789000 edges, 134110 markings/sec, 70 secs
lola: 10702508 markings, 22206620 edges, 136646 markings/sec, 75 secs
lola: 11383842 markings, 23620313 edges, 136267 markings/sec, 80 secs
lola: 12066793 markings, 25037363 edges, 136590 markings/sec, 85 secs
lola: 12751763 markings, 26458612 edges, 136994 markings/sec, 90 secs
lola: 13430898 markings, 27867731 edges, 135827 markings/sec, 95 secs
lola: 14112757 markings, 29282506 edges, 136372 markings/sec, 100 secs
lola: 14798900 markings, 30706196 edges, 137229 markings/sec, 105 secs
lola: 15482855 markings, 32125318 edges, 136791 markings/sec, 110 secs
lola: 16167590 markings, 33546077 edges, 136947 markings/sec, 115 secs
lola: 16779426 markings, 34815670 edges, 122367 markings/sec, 120 secs
lola: 17309139 markings, 35915121 edges, 105943 markings/sec, 125 secs
lola: 17850016 markings, 37036915 edges, 108175 markings/sec, 130 secs
lola: 18245345 markings, 37857181 edges, 79066 markings/sec, 135 secs
lola: 18741803 markings, 38887294 edges, 99292 markings/sec, 140 secs
lola: 19195869 markings, 39829397 edges, 90813 markings/sec, 145 secs
lola: 19692508 markings, 40859890 edges, 99328 markings/sec, 150 secs
lola: 20239100 markings, 41994003 edges, 109318 markings/sec, 155 secs
lola: 20669988 markings, 42888059 edges, 86178 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p763) AND (1 <= p772) AND (1 <= p778))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p763) AND (1 <= p772) AND (1 <= p778))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p763 <= 0) OR (p772 <= 0) OR (p778 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p763) AND (1 <= p772) AND (1 <= p778))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-18-1.sara.
sara: try reading problem file CTLFireability-18-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 773567 markings, 936901 edges, 154713 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1534946 markings, 1921219 edges, 152276 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2261751 markings, 2859660 edges, 145361 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2977563 markings, 3827778 edges, 143162 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3774782 markings, 4877130 edges, 159444 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4517324 markings, 5805032 edges, 148508 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5359928 markings, 6920739 edges, 168521 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6178839 markings, 8034490 edges, 163782 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6970875 markings, 9145862 edges, 158407 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7748975 markings, 10262389 edges, 155620 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 8509205 markings, 11367336 edges, 152046 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9262281 markings, 12473074 edges, 150615 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 10124838 markings, 13621293 edges, 172511 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 11005586 markings, 14770828 edges, 176150 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 11833003 markings, 15928017 edges, 165483 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 12628569 markings, 17072619 edges, 159113 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 13502200 markings, 18205837 edges, 174726 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 14318434 markings, 19321526 edges, 163247 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 15087114 markings, 20397123 edges, 153736 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 15840279 markings, 21475745 edges, 150633 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 16581546 markings, 22537801 edges, 148253 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 17456721 markings, 23652138 edges, 175035 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 18241688 markings, 24725198 edges, 156993 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 19004420 markings, 25786089 edges, 152546 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 19764932 markings, 26881610 edges, 152102 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 20516438 markings, 27965122 edges, 150301 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 21247783 markings, 29034176 edges, 146269 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 21972136 markings, 30109076 edges, 144871 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 22862367 markings, 31241058 edges, 178046 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 23676028 markings, 32366755 edges, 162732 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 24467239 markings, 33469609 edges, 158242 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 25236949 markings, 34571559 edges, 153942 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 26057986 markings, 35685702 edges, 164207 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 26909407 markings, 36815008 edges, 170284 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 27702599 markings, 37919574 edges, 158638 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 28375451 markings, 38874326 edges, 134570 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 28901911 markings, 39631282 edges, 105292 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 29528437 markings, 40455740 edges, 125305 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 30125076 markings, 41202804 edges, 119328 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 30675166 markings, 41934272 edges, 110018 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 31372464 markings, 42858963 edges, 139460 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 31933169 markings, 43622411 edges, 112141 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 32535981 markings, 44415549 edges, 120562 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 33085080 markings, 45107412 edges, 109820 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 33654747 markings, 45861091 edges, 113933 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 34338445 markings, 46754795 edges, 136740 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0) OR (p761 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0) OR (p761 <= 0))
lola: processed formula length: 61
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p259) AND (1 <= p268) AND (1 <= p274) AND (1 <= p761))
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0) OR (p761 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-1.sara
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 951833 markings, 951833 edges, 190367 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2002486 markings, 2002485 edges, 210131 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3041661 markings, 3041661 edges, 207835 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4079184 markings, 4079184 edges, 207505 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5135964 markings, 5135964 edges, 211356 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6189349 markings, 6189349 edges, 210677 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7229265 markings, 7229264 edges, 207983 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8265718 markings, 8265718 edges, 207291 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9326380 markings, 9326379 edges, 212132 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10394324 markings, 10394323 edges, 213589 markings/sec, 45 secs
sara: warning, failure of lp_solve (at job 99)
lola: sara is running 50 secs || sara is running 50 secs || 11474448 markings, 11474447 edges, 216025 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12512864 markings, 12512863 edges, 207683 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13582884 markings, 13582883 edges, 214004 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14668220 markings, 14668219 edges, 217067 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15764959 markings, 15764959 edges, 219348 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16857256 markings, 16857257 edges, 218459 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17520396 markings, 17520396 edges, 132628 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18026808 markings, 18026808 edges, 101282 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 18294633 markings, 18294633 edges, 53565 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 18798485 markings, 18798485 edges, 100770 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 19246169 markings, 19246168 edges, 89537 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 20121832 markings, 20121831 edges, 175133 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 20561166 markings, 20561165 edges, 87867 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 21120982 markings, 21120982 edges, 111963 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 21422119 markings, 21422119 edges, 60227 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 21475477 markings, 21475477 edges, 10672 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((E (G (((p2 <= 0) OR (p4 <= 0) OR (p10 <= 0)))) U A (G (((p390 <= 0) OR (p393 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG(((p2 <= 0) OR (p4 <= 0) OR (p10 <= 0))) U AG(((p390 <= 0) OR (p393 <= 0))))
lola: processed formula length: 83
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 981756 markings, 981909 edges, 196351 markings/sec, 0 secs
lola: 2116165 markings, 2116318 edges, 226882 markings/sec, 5 secs
lola: 3281414 markings, 3281567 edges, 233050 markings/sec, 10 secs
lola: 4448304 markings, 4448457 edges, 233378 markings/sec, 15 secs
lola: 5618016 markings, 5618172 edges, 233942 markings/sec, 20 secs
lola: 6784401 markings, 6784554 edges, 233277 markings/sec, 25 secs
lola: 7968186 markings, 7968339 edges, 236757 markings/sec, 30 secs
lola: 9134394 markings, 9134549 edges, 233242 markings/sec, 35 secs
lola: 10306899 markings, 10307052 edges, 234501 markings/sec, 40 secs
lola: 11496385 markings, 11496538 edges, 237897 markings/sec, 45 secs
lola: 12676789 markings, 12676942 edges, 236081 markings/sec, 50 secs
lola: 13788489 markings, 13788642 edges, 222340 markings/sec, 55 secs
lola: 14964230 markings, 14964383 edges, 235148 markings/sec, 60 secs
lola: 16150757 markings, 16150910 edges, 237305 markings/sec, 65 secs
lola: 17331333 markings, 17331486 edges, 236115 markings/sec, 70 secs
lola: 18541193 markings, 18541346 edges, 241972 markings/sec, 75 secs
lola: 19642999 markings, 19643152 edges, 220361 markings/sec, 80 secs
lola: 20804207 markings, 20804359 edges, 232242 markings/sec, 85 secs
lola: 21961274 markings, 21961427 edges, 231413 markings/sec, 90 secs
lola: 23181724 markings, 23181876 edges, 244090 markings/sec, 95 secs
lola: 24229579 markings, 24229804 edges, 209571 markings/sec, 100 secs
lola: 25162843 markings, 25163574 edges, 186653 markings/sec, 105 secs
lola: 25878253 markings, 25878406 edges, 143082 markings/sec, 110 secs
lola: 26655351 markings, 26655504 edges, 155420 markings/sec, 115 secs
lola: 27460757 markings, 27460912 edges, 161081 markings/sec, 120 secs
lola: 28144048 markings, 28144200 edges, 136658 markings/sec, 125 secs
lola: 28879130 markings, 28879283 edges, 147016 markings/sec, 130 secs
lola: 29832521 markings, 29832674 edges, 190678 markings/sec, 135 secs
lola: 29847740 markings, 29847892 edges, 3044 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203)))))) OR ((1 <= p683)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p683))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p683))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file CTLFireability.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: E (F (A (G (((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p544 <= 0) OR (p546 <= 0) OR (p551 <= 0) OR (p203 <= 0))
lola: processed formula length: 61
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p544 <= 0) OR (p546 <= 0) OR (p551 <= 0) OR (p203 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p544) AND (1 <= p546) AND (1 <= p551) AND (1 <= p203))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-22-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-22-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-22-0.sara.sara:
try reading problem file CTLFireability-22-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 918846 markings, 918845 edges, 183769 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1931758 markings, 1931757 edges, 202582 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2814489 markings, 2814489 edges, 176546 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3340002 markings, 3340001 edges, 105103 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4415597 markings, 4415597 edges, 215119 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 5492267 markings, 5492271 edges, 215334 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 6571062 markings, 6571062 edges, 215759 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 7650039 markings, 7650039 edges, 215795 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 8743934 markings, 8743934 edges, 218779 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 9898586 markings, 9898586 edges, 230930 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 10998540 markings, 10998540 edges, 219991 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12090284 markings, 12090283 edges, 218349 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13169260 markings, 13169260 edges, 215795 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14254900 markings, 14254900 edges, 217128 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15365997 markings, 15365997 edges, 222219 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16475708 markings, 16475708 edges, 221942 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17374927 markings, 17374926 edges, 179844 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18149443 markings, 18149442 edges, 154903 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 18985623 markings, 18985622 edges, 167236 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 19740559 markings, 19740559 edges, 150987 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 20521660 markings, 20521659 edges, 156220 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 21330491 markings, 21330490 edges, 161766 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 21478335 markings, 21478335 edges, 29569 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 21485481 markings, 21485480 edges, 1429 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 21490822 markings, 21490821 edges, 1068 markings/sec, 120 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: E (G (E (F ((((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440))))
lola: processed formula length: 117
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p781 <= 0)) AND (((1 <= p579) AND (1 <= p588) AND (1 <= p594)) OR ((1 <= p436) AND (1 <= p437) AND (1 <= p440))))
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: formula 0: (((1 <= p781)) OR (((p579 <= 0) OR (p588 <= 0) OR (p594 <= 0)) AND ((p436 <= 0) OR (p437 <= 0) OR (p440 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 19 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-22-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-22-1.sara
sara: try reading problem file CTLFireability-22-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-22-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 993364 markings, 993363 edges, 198673 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2065049 markings, 2065049 edges, 214337 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3159793 markings, 3159793 edges, 218949 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4242656 markings, 4242655 edges, 216573 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5322967 markings, 5322967 edges, 216062 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6411947 markings, 6411946 edges, 217796 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7487449 markings, 7487449 edges, 215100 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8580719 markings, 8580718 edges, 218654 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9678256 markings, 9678256 edges, 219507 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10762538 markings, 10762537 edges, 216856 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11821689 markings, 11821688 edges, 211830 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12891010 markings, 12891010 edges, 213864 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13962089 markings, 13962089 edges, 214216 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 15068784 markings, 15068784 edges, 221339 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 16185456 markings, 16185455 edges, 223334 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17182958 markings, 17182958 edges, 199500 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17824796 markings, 17824795 edges, 128368 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18446317 markings, 18446317 edges, 124304 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19087088 markings, 19087089 edges, 128154 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 19889320 markings, 19889319 edges, 160446 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 20471806 markings, 20471806 edges, 116497 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 21123027 markings, 21123026 edges, 130244 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 21348362 markings, 21348362 edges, 45067 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 21348465 markings, 21348464 edges, 21 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 21367441 markings, 21367441 edges, 3795 markings/sec, 120 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes yes no no unknown yes no yes unknown unknown no unknown unknown unknown no
lola:
preliminary result: unknown yes yes no no unknown yes no yes unknown unknown no unknown unknown unknown no
lola: memory consumption: 3364 KB
lola: time consumption: 2108 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="CTLFireability"
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 CTLFireability"
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-159033478401084"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;