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-159033478401066.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-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.1K May 14 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.7K May 13 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:55 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 136K 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-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1591340416869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 07:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:00:21] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2020-06-05 07:00:21] [INFO ] Transformed 403 places.
[2020-06-05 07:00:21] [INFO ] Transformed 403 transitions.
[2020-06-05 07:00:21] [INFO ] Found NUPN structural information;
[2020-06-05 07:00:21] [INFO ] Parsed PT model containing 403 places and 403 transitions in 241 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 760 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0]
// Phase 1: matrix 402 rows 403 cols
[2020-06-05 07:00:22] [INFO ] Computed 201 place invariants in 22 ms
[2020-06-05 07:00:23] [INFO ] [Real]Absence check using 201 positive place invariants in 121 ms returned sat
[2020-06-05 07:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:24] [INFO ] [Real]Absence check using state equation in 1508 ms returned sat
[2020-06-05 07:00:25] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 89 ms.
[2020-06-05 07:00:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:00:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 560 ms returned sat
[2020-06-05 07:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:26] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2020-06-05 07:00:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 101 ms.
[2020-06-05 07:00:31] [INFO ] Added : 397 causal constraints over 80 iterations in 4385 ms. Result :sat
[2020-06-05 07:00:31] [INFO ] [Real]Absence check using 201 positive place invariants in 68 ms returned sat
[2020-06-05 07:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:32] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2020-06-05 07:00:32] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 51 ms.
[2020-06-05 07:00:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:00:33] [INFO ] [Nat]Absence check using 201 positive place invariants in 85 ms returned sat
[2020-06-05 07:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:33] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2020-06-05 07:00:34] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 51 ms.
[2020-06-05 07:00:39] [INFO ] Added : 395 causal constraints over 80 iterations in 6009 ms. Result :sat
[2020-06-05 07:00:40] [INFO ] [Real]Absence check using 201 positive place invariants in 321 ms returned sat
[2020-06-05 07:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:42] [INFO ] [Real]Absence check using state equation in 1856 ms returned sat
[2020-06-05 07:00:42] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 80 ms.
[2020-06-05 07:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:00:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 99 ms returned sat
[2020-06-05 07:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:43] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2020-06-05 07:00:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-06-05 07:00:48] [INFO ] Added : 397 causal constraints over 80 iterations in 4476 ms. Result :sat
[2020-06-05 07:00:49] [INFO ] [Real]Absence check using 201 positive place invariants in 1286 ms returned sat
[2020-06-05 07:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:50] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2020-06-05 07:00:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 59 ms.
[2020-06-05 07:00:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:00:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 148 ms returned sat
[2020-06-05 07:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:52] [INFO ] [Nat]Absence check using state equation in 1632 ms returned sat
[2020-06-05 07:00:53] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 51 ms.
[2020-06-05 07:00:56] [INFO ] Added : 399 causal constraints over 81 iterations in 4006 ms. Result :sat
[2020-06-05 07:00:57] [INFO ] [Real]Absence check using 201 positive place invariants in 286 ms returned sat
[2020-06-05 07:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:58] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2020-06-05 07:00:58] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 40 ms.
[2020-06-05 07:00:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:00:58] [INFO ] [Nat]Absence check using 201 positive place invariants in 154 ms returned sat
[2020-06-05 07:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:00:59] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2020-06-05 07:00:59] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 54 ms.
[2020-06-05 07:01:03] [INFO ] Added : 399 causal constraints over 80 iterations in 3795 ms. Result :sat
[2020-06-05 07:01:03] [INFO ] [Real]Absence check using 201 positive place invariants in 104 ms returned sat
[2020-06-05 07:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:04] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2020-06-05 07:01:04] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2020-06-05 07:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 886 ms returned sat
[2020-06-05 07:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:07] [INFO ] [Nat]Absence check using state equation in 2270 ms returned sat
[2020-06-05 07:01:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 46 ms.
[2020-06-05 07:01:12] [INFO ] Added : 397 causal constraints over 80 iterations in 4531 ms. Result :sat
[2020-06-05 07:01:12] [INFO ] [Real]Absence check using 201 positive place invariants in 118 ms returned sat
[2020-06-05 07:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:13] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2020-06-05 07:01:13] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 30 ms.
[2020-06-05 07:01:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 746 ms returned sat
[2020-06-05 07:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:16] [INFO ] [Nat]Absence check using state equation in 1992 ms returned sat
[2020-06-05 07:01:16] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 51 ms.
[2020-06-05 07:01:21] [INFO ] Added : 397 causal constraints over 80 iterations in 4610 ms. Result :sat
[2020-06-05 07:01:21] [INFO ] [Real]Absence check using 201 positive place invariants in 176 ms returned sat
[2020-06-05 07:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:22] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2020-06-05 07:01:22] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 21 ms.
[2020-06-05 07:01:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 440 ms returned sat
[2020-06-05 07:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:24] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2020-06-05 07:01:24] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-06-05 07:01:27] [INFO ] Added : 397 causal constraints over 80 iterations in 3455 ms. Result :sat
[2020-06-05 07:01:28] [INFO ] [Real]Absence check using 201 positive place invariants in 144 ms returned sat
[2020-06-05 07:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:28] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2020-06-05 07:01:28] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-06-05 07:01:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:29] [INFO ] [Nat]Absence check using 201 positive place invariants in 100 ms returned sat
[2020-06-05 07:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:30] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2020-06-05 07:01:30] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 23 ms.
[2020-06-05 07:01:34] [INFO ] Added : 397 causal constraints over 80 iterations in 3780 ms. Result :sat
[2020-06-05 07:01:35] [INFO ] [Real]Absence check using 201 positive place invariants in 1266 ms returned sat
[2020-06-05 07:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:37] [INFO ] [Real]Absence check using state equation in 1808 ms returned sat
[2020-06-05 07:01:37] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2020-06-05 07:01:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 154 ms returned sat
[2020-06-05 07:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:39] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2020-06-05 07:01:39] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2020-06-05 07:01:42] [INFO ] Added : 400 causal constraints over 81 iterations in 3971 ms. Result :sat
[2020-06-05 07:01:43] [INFO ] [Real]Absence check using 201 positive place invariants in 154 ms returned sat
[2020-06-05 07:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:44] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2020-06-05 07:01:44] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-06-05 07:01:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 204 ms returned sat
[2020-06-05 07:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:45] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2020-06-05 07:01:45] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 23 ms.
[2020-06-05 07:01:49] [INFO ] Added : 400 causal constraints over 81 iterations in 3726 ms. Result :sat
[2020-06-05 07:01:49] [INFO ] [Real]Absence check using 201 positive place invariants in 178 ms returned sat
[2020-06-05 07:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:50] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2020-06-05 07:01:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 31 ms.
[2020-06-05 07:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 210 ms returned sat
[2020-06-05 07:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:51] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2020-06-05 07:01:51] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 47 ms.
[2020-06-05 07:01:55] [INFO ] Added : 396 causal constraints over 80 iterations in 3883 ms. Result :sat
[2020-06-05 07:01:55] [INFO ] [Real]Absence check using 201 positive place invariants in 94 ms returned sat
[2020-06-05 07:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:56] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2020-06-05 07:01:57] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 61 ms.
[2020-06-05 07:01:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:01:57] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-06-05 07:01:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:01:58] [INFO ] [Nat]Absence check using state equation in 1499 ms returned sat
[2020-06-05 07:01:58] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 63 ms.
[2020-06-05 07:02:04] [INFO ] Added : 395 causal constraints over 79 iterations in 5210 ms. Result :sat
[2020-06-05 07:02:04] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 07:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:04] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2020-06-05 07:02:04] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2020-06-05 07:02:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 111 ms returned sat
[2020-06-05 07:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:05] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2020-06-05 07:02:05] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 57 ms.
[2020-06-05 07:02:09] [INFO ] Added : 396 causal constraints over 80 iterations in 3132 ms. Result :sat
[2020-06-05 07:02:09] [INFO ] [Real]Absence check using 201 positive place invariants in 106 ms returned sat
[2020-06-05 07:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:11] [INFO ] [Real]Absence check using state equation in 2311 ms returned sat
[2020-06-05 07:02:11] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 59 ms.
[2020-06-05 07:02:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:12] [INFO ] [Nat]Absence check using 201 positive place invariants in 179 ms returned sat
[2020-06-05 07:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:13] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2020-06-05 07:02:13] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-06-05 07:02:17] [INFO ] Added : 395 causal constraints over 80 iterations in 4599 ms. Result :sat
[2020-06-05 07:02:18] [INFO ] [Real]Absence check using 201 positive place invariants in 143 ms returned sat
[2020-06-05 07:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:20] [INFO ] [Real]Absence check using state equation in 2771 ms returned sat
[2020-06-05 07:02:20] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 33 ms.
[2020-06-05 07:02:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 155 ms returned sat
[2020-06-05 07:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:22] [INFO ] [Nat]Absence check using state equation in 1156 ms returned sat
[2020-06-05 07:02:22] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-06-05 07:02:26] [INFO ] Added : 399 causal constraints over 81 iterations in 4177 ms. Result :sat
[2020-06-05 07:02:27] [INFO ] [Real]Absence check using 201 positive place invariants in 152 ms returned sat
[2020-06-05 07:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:28] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2020-06-05 07:02:28] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 30 ms.
[2020-06-05 07:02:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:28] [INFO ] [Nat]Absence check using 201 positive place invariants in 97 ms returned sat
[2020-06-05 07:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:29] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2020-06-05 07:02:29] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 38 ms.
[2020-06-05 07:02:33] [INFO ] Added : 395 causal constraints over 80 iterations in 3649 ms. Result :sat
[2020-06-05 07:02:34] [INFO ] [Real]Absence check using 201 positive place invariants in 1261 ms returned sat
[2020-06-05 07:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:35] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2020-06-05 07:02:35] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2020-06-05 07:02:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 60 ms returned sat
[2020-06-05 07:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:35] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2020-06-05 07:02:35] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 44 ms.
[2020-06-05 07:02:40] [INFO ] Added : 393 causal constraints over 79 iterations in 4292 ms. Result :sat
[2020-06-05 07:02:40] [INFO ] [Real]Absence check using 201 positive place invariants in 421 ms returned sat
[2020-06-05 07:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:41] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2020-06-05 07:02:41] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-06-05 07:02:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-06-05 07:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:43] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2020-06-05 07:02:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 37 ms.
[2020-06-05 07:02:48] [INFO ] Added : 397 causal constraints over 80 iterations in 4731 ms. Result :sat
[2020-06-05 07:02:48] [INFO ] [Real]Absence check using 201 positive place invariants in 91 ms returned sat
[2020-06-05 07:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:49] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-06-05 07:02:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2020-06-05 07:02:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 131 ms returned sat
[2020-06-05 07:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:49] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2020-06-05 07:02:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 59 ms.
[2020-06-05 07:02:53] [INFO ] Added : 398 causal constraints over 81 iterations in 3283 ms. Result :sat
[2020-06-05 07:02:53] [INFO ] [Real]Absence check using 201 positive place invariants in 85 ms returned sat
[2020-06-05 07:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:53] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2020-06-05 07:02:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2020-06-05 07:02:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:02:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 315 ms returned sat
[2020-06-05 07:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:02:55] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2020-06-05 07:02:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 44 ms.
[2020-06-05 07:02:59] [INFO ] Added : 396 causal constraints over 80 iterations in 4379 ms. Result :sat
[2020-06-05 07:02:59] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 07:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:00] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-06-05 07:03:00] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-06-05 07:03:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 82 ms returned sat
[2020-06-05 07:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:01] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2020-06-05 07:03:01] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2020-06-05 07:03:04] [INFO ] Added : 396 causal constraints over 80 iterations in 3719 ms. Result :sat
[2020-06-05 07:03:05] [INFO ] [Real]Absence check using 201 positive place invariants in 84 ms returned sat
[2020-06-05 07:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:05] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-05 07:03:05] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2020-06-05 07:03:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 65 ms returned sat
[2020-06-05 07:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:06] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2020-06-05 07:03:06] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 18 ms.
[2020-06-05 07:03:09] [INFO ] Added : 396 causal constraints over 80 iterations in 2993 ms. Result :sat
[2020-06-05 07:03:09] [INFO ] [Real]Absence check using 201 positive place invariants in 80 ms returned sat
[2020-06-05 07:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:09] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2020-06-05 07:03:09] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 57 ms.
[2020-06-05 07:03:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:09] [INFO ] [Nat]Absence check using 201 positive place invariants in 61 ms returned sat
[2020-06-05 07:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:10] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2020-06-05 07:03:10] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 20 ms.
[2020-06-05 07:03:14] [INFO ] Added : 398 causal constraints over 80 iterations in 4113 ms. Result :sat
[2020-06-05 07:03:14] [INFO ] [Real]Absence check using 201 positive place invariants in 126 ms returned sat
[2020-06-05 07:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:15] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2020-06-05 07:03:15] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 36 ms.
[2020-06-05 07:03:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 85 ms returned sat
[2020-06-05 07:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:16] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2020-06-05 07:03:16] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-06-05 07:03:18] [INFO ] Added : 389 causal constraints over 79 iterations in 2610 ms. Result :sat
[2020-06-05 07:03:19] [INFO ] [Real]Absence check using 201 positive place invariants in 1039 ms returned sat
[2020-06-05 07:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:22] [INFO ] [Real]Absence check using state equation in 2619 ms returned sat
[2020-06-05 07:03:22] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 33 ms.
[2020-06-05 07:03:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-06-05 07:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:23] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2020-06-05 07:03:23] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-06-05 07:03:26] [INFO ] Added : 398 causal constraints over 81 iterations in 3305 ms. Result :sat
[2020-06-05 07:03:27] [INFO ] [Real]Absence check using 201 positive place invariants in 147 ms returned sat
[2020-06-05 07:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:29] [INFO ] [Real]Absence check using state equation in 1943 ms returned sat
[2020-06-05 07:03:29] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 40 ms.
[2020-06-05 07:03:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 1259 ms returned sat
[2020-06-05 07:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:32] [INFO ] [Nat]Absence check using state equation in 2031 ms returned sat
[2020-06-05 07:03:32] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-06-05 07:03:38] [INFO ] Added : 397 causal constraints over 80 iterations in 5917 ms. Result :sat
[2020-06-05 07:03:39] [INFO ] [Real]Absence check using 201 positive place invariants in 873 ms returned sat
[2020-06-05 07:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:40] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2020-06-05 07:03:40] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 31 ms.
[2020-06-05 07:03:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 89 ms returned sat
[2020-06-05 07:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:43] [INFO ] [Nat]Absence check using state equation in 2590 ms returned sat
[2020-06-05 07:03:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-06-05 07:03:46] [INFO ] Added : 397 causal constraints over 80 iterations in 3874 ms. Result :sat
[2020-06-05 07:03:47] [INFO ] [Real]Absence check using 201 positive place invariants in 392 ms returned sat
[2020-06-05 07:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:49] [INFO ] [Real]Absence check using state equation in 2246 ms returned sat
[2020-06-05 07:03:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 43 ms.
[2020-06-05 07:03:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:03:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 137 ms returned sat
[2020-06-05 07:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:03:51] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2020-06-05 07:03:51] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 41 ms.
[2020-06-05 07:03:54] [INFO ] Added : 398 causal constraints over 81 iterations in 3054 ms. Result :sat
[2020-06-05 07:03:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 07:03:54] [INFO ] Flatten gal took : 127 ms
FORMULA ShieldRVt-PT-050A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 07:03:54] [INFO ] Applying decomposition
[2020-06-05 07:03:54] [INFO ] Flatten gal took : 46 ms
[2020-06-05 07:03:54] [INFO ] Decomposing Gal with order
[2020-06-05 07:03:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 07:03:54] [INFO ] Removed a total of 150 redundant transitions.
[2020-06-05 07:03:54] [INFO ] Flatten gal took : 87 ms
[2020-06-05 07:03:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2020-06-05 07:03:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-05 07:03:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-050A @ 3570 seconds

FORMULA ShieldRVt-PT-050A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-050A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ShieldRVt-PT-050A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for LTLFireability @ ShieldRVt-PT-050A

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))",
"processed_size": 45,
"rewrites": 117
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 0,
"aneg": 8,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (((G (F (((p92 <= 0) OR (p93 <= 0) OR (p96 <= 0)))) AND ((p272 <= 0) OR (p274 <= 0) OR (p279 <= 0))) OR (((p88 <= 0)) OR (((p90 <= 0)) OR (((p95 <= 0)) OR (((p44 <= 0)) OR (((p45 <= 0)) OR ((p48 <= 0)))))))))",
"processed_size": 214,
"rewrites": 115
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (((p197 <= 0))) AND ((1 <= p395)))))",
"processed_size": 45,
"rewrites": 115
},
"result":
{
"edges": 314,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p317))))",
"processed_size": 21,
"rewrites": 115
},
"result":
{
"edges": 384,
"markings": 384,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F (((F (((1 <= p181))) U ((1 <= p251) AND (1 <= p260) AND (1 <= p266))) OR X (G (((1 <= p158) AND (1 <= p161) AND (1 <= p181)))))))",
"processed_size": 134,
"rewrites": 115
},
"result":
{
"edges": 540,
"markings": 540,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(F (((1 <= p380) AND (1 <= p381) AND (1 <= p384))) U (G (F (((1 <= p44) AND (1 <= p45) AND (1 <= p48)))) OR X (((1 <= p349)))))",
"processed_size": 127,
"rewrites": 115
},
"result":
{
"edges": 376,
"markings": 376,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p126 <= 0) OR (p129 <= 0))))",
"processed_size": 37,
"rewrites": 115
},
"result":
{
"edges": 290,
"markings": 204,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "G (((p176 <= 0) OR (p178 <= 0) OR (p183 <= 0)))",
"processed_size": 49,
"rewrites": 115
},
"result":
{
"edges": 159,
"markings": 115,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (((((1 <= p302) AND (1 <= p305)) R (((p302 <= 0) OR (p305 <= 0)) AND ((p119 <= 0)))) AND (((1 <= p70)) AND (((1 <= p73)) AND ((p119 <= 0))))))",
"processed_size": 145,
"rewrites": 115
},
"result":
{
"edges": 99,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((F (G (((p204 <= 0) OR (p205 <= 0) OR (p208 <= 0)))) OR (((p245 <= 0)) OR ((1 <= p44) AND (1 <= p45) AND (1 <= p48))))))",
"processed_size": 128,
"rewrites": 115
},
"result":
{
"edges": 2683835,
"markings": 2471700,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))",
"processed_size": 49,
"rewrites": 115
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((G (((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))) OR (G (((p160 <= 0) OR (p162 <= 0) OR (p167 <= 0))) AND ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))))))",
"processed_size": 164,
"rewrites": 115
},
"result":
{
"edges": 8071,
"markings": 5178,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 52792,
"runtime": 28.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(*) : (G(**) AND (X((** AND *)) AND F(**))) : G(F((F(G(*)) OR (* OR **)))) : X(((G(F(*)) AND *) OR (* OR (* OR (* OR (* OR (* OR *))))))) : (G(F((G(*) OR (G(*) AND *)))) OR G(**)) : F(G(*)) : F(((* R *) AND (** AND (** AND **)))) : X(X(X((F(**) AND (* R *))))) : X(G((G(*) AND *))) : X(F(**)) : X(F(((F(**) U **) OR X(G(**))))) : (F(**) U (G(F(**)) OR X(**))) : ((* R (G(*) OR *)) U ((** U **) OR X(**))) : F((X((X(**) U (F(**) AND **))) OR **))"
},
"net":
{
"arcs": 1704,
"conflict_clusters": 103,
"places": 403,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 402
},
"result":
{
"preliminary_value": "no no no yes no no no no no no no no yes no ",
"value": "no no no yes no no no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 805/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12896
lola: finding significant places
lola: 403 places, 402 transitions, 202 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p316 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 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: (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: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 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: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p333 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 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: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p349 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: NOT((F (((1 <= p307) AND (1 <= p316) AND (1 <= p322) AND (1 <= p176) AND (1 <= p178) AND (1 <= p183))) U F (((1 <= p176) AND (1 <= p178) AND (1 <= p183))))) : (((G (((p124 <= 0) OR (p125 <= 0) OR (p128 <= 0))) AND X (((1 <= p217)))) AND NOT(X (((1 <= p235) AND (1 <= p244) AND (1 <= p250))))) AND F (((1 <= p235) AND (1 <= p244) AND (1 <= p250)))) : NOT(G (F ((G ((G (F (((1 <= p204) AND (1 <= p205) AND (1 <= p208)))) AND ((1 <= p245)))) AND G (NOT(F (((1 <= p44) AND (1 <= p45) AND (1 <= p48))))))))) : NOT(X ((((((((F (G (((1 <= p92) AND (1 <= p93) AND (1 <= p96)))) OR ((1 <= p272) AND (1 <= p274) AND (1 <= p279))) AND ((1 <= p88))) AND ((1 <= p90))) AND ((1 <= p95))) AND ((1 <= p44))) AND ((1 <= p45))) AND ((1 <= p48))))) : (G (NOT(G (((((1 <= p160) AND (1 <= p162) AND (1 <= p167)) U F (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))) U ((1 <= p235) AND (1 <= p244) AND (1 <= p250)))))) OR G (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))) : X (G (NOT(G (X (F (((1 <= p126) AND (1 <= p129)))))))) : F ((((NOT((((p302 <= 0) OR (p305 <= 0)) U (((1 <= p302) AND (1 <= p305)) OR ((1 <= p119))))) AND ((1 <= p70))) AND ((1 <= p73))) AND ((p119 <= 0)))) : X ((F (X (X (((1 <= p161))))) AND X (X (NOT(((((1 <= p296) AND (1 <= p298) AND (1 <= p303)) OR ((1 <= p333))) U ((p296 <= 0) OR (p298 <= 0) OR (p303 <= 0)))))))) : NOT(F (X ((F (((1 <= p197))) OR ((p395 <= 0)))))) : X (F (((((1 <= p205)) U X (NOT((G (((1 <= p139))) U X (((1 <= p205))))))) U ((1 <= p317))))) : F (X (F (((F (((1 <= p181))) U ((1 <= p251) AND (1 <= p260) AND (1 <= p266))) OR G (X (((1 <= p158) AND (1 <= p161) AND (1 <= p181)))))))) : (F (((1 <= p380) AND (1 <= p381) AND (1 <= p384))) U (G (F (((1 <= p44) AND (1 <= p45) AND (1 <= p48)))) OR X (((1 <= p349))))) : (NOT((((1 <= p239)) U (F (((1 <= p45))) AND ((1 <= p45))))) U ((((1 <= p157)) U ((1 <= p45))) OR X (((p157 <= 0))))) : F ((X ((X (((1 <= p281))) U (F (((1 <= p369))) AND ((1 <= p281))))) OR ((1 <= p43))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p124 <= 0) OR (p125 <= 0) OR (p128 <= 0))) AND (X ((((1 <= p217)) AND ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0)))) AND F (((1 <= p235) AND (1 <= p244) AND (1 <= p250)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p235) AND (1 <= p244) AND (1 <= p250)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))
lola: processed formula length: 45
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (F (((p92 <= 0) OR (p93 <= 0) OR (p96 <= 0)))) AND ((p272 <= 0) OR (p274 <= 0) OR (p279 <= 0))) OR (((p88 <= 0)) OR (((p90 <= 0)) OR (((p95 <= 0)) OR (((p44 <= 0)) OR (((p45 <= 0)) OR ((p48 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (F (((p92 <= 0) OR (p93 <= 0) OR (p96 <= 0)))) AND ((p272 <= 0) OR (p274 <= 0) OR (p279 <= 0))) OR (((p88 <= 0)) OR (((p90 <= 0)) OR (((p95 <= 0)) OR (((p44 <= 0)) OR (((p45 <= 0)) OR ((p48 <= 0)))))))))
lola: processed formula length: 214
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((F (((1 <= p161))) AND ((((p296 <= 0) OR (p298 <= 0) OR (p303 <= 0)) AND ((p333 <= 0))) R ((1 <= p296) AND (1 <= p298) AND (1 <= p303)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((F (((1 <= p161))) AND ((((p296 <= 0) OR (p298 <= 0) OR (p303 <= 0)) AND ((p333 <= 0))) R ((1 <= p296) AND (1 <= p298) AND (1 <= p303)))))))
lola: processed formula length: 151
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p197 <= 0))) AND ((1 <= p395)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p197 <= 0))) AND ((1 <= p395)))))
lola: processed formula length: 45
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p317))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p317))))
lola: processed formula length: 21
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 384 markings, 384 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((F (((1 <= p181))) U ((1 <= p251) AND (1 <= p260) AND (1 <= p266))) OR X (G (((1 <= p158) AND (1 <= p161) AND (1 <= p181)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((F (((1 <= p181))) U ((1 <= p251) AND (1 <= p260) AND (1 <= p266))) OR X (G (((1 <= p158) AND (1 <= p161) AND (1 <= p181)))))))
lola: processed formula length: 134
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 540 markings, 540 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p380) AND (1 <= p381) AND (1 <= p384))) U (G (F (((1 <= p44) AND (1 <= p45) AND (1 <= p48)))) OR X (((1 <= p349)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p380) AND (1 <= p381) AND (1 <= p384))) U (G (F (((1 <= p44) AND (1 <= p45) AND (1 <= p48)))) OR X (((1 <= p349)))))
lola: processed formula length: 127
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 376 markings, 376 edges
lola: ========================================
lola: subprocess 7 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p239 <= 0)) R (G (((p45 <= 0))) OR ((p45 <= 0)))) U ((((1 <= p157)) U ((1 <= p45))) OR X (((p157 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p239 <= 0)) R (G (((p45 <= 0))) OR ((p45 <= 0)))) U ((((1 <= p157)) U ((1 <= p45))) OR X (((p157 <= 0)))))
lola: processed formula length: 110
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((X (((1 <= p281))) U (F (((1 <= p369))) AND ((1 <= p281))))) OR ((1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((X (((1 <= p281))) U (F (((1 <= p369))) AND ((1 <= p281))))) OR ((1 <= p43))))
lola: processed formula length: 85
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 171 markings, 171 edges
lola: ========================================
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p126 <= 0) OR (p129 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p126 <= 0) OR (p129 <= 0))))
lola: processed formula length: 37
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 204 markings, 290 edges
lola: ========================================
lola: subprocess 10 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p176 <= 0) OR (p178 <= 0) OR (p183 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p176 <= 0) OR (p178 <= 0) OR (p183 <= 0)))
lola: processed formula length: 49
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 115 markings, 159 edges
lola: ========================================
lola: subprocess 11 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p302) AND (1 <= p305)) R (((p302 <= 0) OR (p305 <= 0)) AND ((p119 <= 0)))) AND (((1 <= p70)) AND (((1 <= p73)) AND ((p119 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p302) AND (1 <= p305)) R (((p302 <= 0) OR (p305 <= 0)) AND ((p119 <= 0)))) AND (((1 <= p70)) AND (((1 <= p73)) AND ((p119 <= 0))))))
lola: processed formula length: 145
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 99 edges
lola: ========================================
lola: subprocess 12 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((p204 <= 0) OR (p205 <= 0) OR (p208 <= 0)))) OR (((p245 <= 0)) OR ((1 <= p44) AND (1 <= p45) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((p204 <= 0) OR (p205 <= 0) OR (p208 <= 0)))) OR (((p245 <= 0)) OR ((1 <= p44) AND (1 <= p45) AND (1 <= p48))))))
lola: processed formula length: 128
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 603472 markings, 635043 edges, 120694 markings/sec, 0 secs
lola: 1226582 markings, 1311011 edges, 124622 markings/sec, 5 secs
lola: 1841472 markings, 1983916 edges, 122978 markings/sec, 10 secs
lola: 2458255 markings, 2669075 edges, 123357 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2471700 markings, 2683835 edges
lola: ========================================
lola: subprocess 13 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G (((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))) OR (G (((p160 <= 0) OR (p162 <= 0) OR (p167 <= 0))) AND ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0)))))) OR G (((1 <= p160) AND (1 <= p162) AND (1 <= p167))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))
lola: processed formula length: 49
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
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: (G (F ((G (((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))) OR (G (((p160 <= 0) OR (p162 <= 0) OR (p167 <= 0))) AND ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0)))))) OR G (((1 <= p160) AND (1 <= p162) AND (1 <= p167))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p160) AND (1 <= p162) AND (1 <= p167)))
lola: processed formula length: 49
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))) OR (G (((p160 <= 0) OR (p162 <= 0) OR (p167 <= 0))) AND ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))) OR (G (((p160 <= 0) OR (p162 <= 0) OR (p167 <= 0))) AND ((p235 <= 0) OR (p244 <= 0) OR (p250 <= 0))))))
lola: processed formula length: 164
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5178 markings, 8071 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no no no yes no
lola:
preliminary result: no no no yes no no no no no no no no yes no
lola: ========================================
lola: memory consumption: 52792 KB
lola: time consumption: 28 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVt-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478401066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050A.tgz
mv ShieldRVt-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;