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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.0K May 14 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:46 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 109K 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-040A-00
FORMULA_NAME ShieldRVt-PT-040A-01
FORMULA_NAME ShieldRVt-PT-040A-02
FORMULA_NAME ShieldRVt-PT-040A-03
FORMULA_NAME ShieldRVt-PT-040A-04
FORMULA_NAME ShieldRVt-PT-040A-05
FORMULA_NAME ShieldRVt-PT-040A-06
FORMULA_NAME ShieldRVt-PT-040A-07
FORMULA_NAME ShieldRVt-PT-040A-08
FORMULA_NAME ShieldRVt-PT-040A-09
FORMULA_NAME ShieldRVt-PT-040A-10
FORMULA_NAME ShieldRVt-PT-040A-11
FORMULA_NAME ShieldRVt-PT-040A-12
FORMULA_NAME ShieldRVt-PT-040A-13
FORMULA_NAME ShieldRVt-PT-040A-14
FORMULA_NAME ShieldRVt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1591339300637

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:41:42] [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 06:41:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:41:42] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-06-05 06:41:42] [INFO ] Transformed 323 places.
[2020-06-05 06:41:42] [INFO ] Transformed 323 transitions.
[2020-06-05 06:41:42] [INFO ] Found NUPN structural information;
[2020-06-05 06:41:42] [INFO ] Parsed PT model containing 323 places and 323 transitions in 127 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0]
// Phase 1: matrix 322 rows 323 cols
[2020-06-05 06:41:42] [INFO ] Computed 161 place invariants in 10 ms
[2020-06-05 06:41:43] [INFO ] [Real]Absence check using 161 positive place invariants in 75 ms returned sat
[2020-06-05 06:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:43] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-06-05 06:41:43] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2020-06-05 06:41:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 51 ms returned sat
[2020-06-05 06:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:44] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2020-06-05 06:41:44] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 26 ms.
[2020-06-05 06:41:45] [INFO ] Added : 316 causal constraints over 64 iterations in 1793 ms. Result :sat
[2020-06-05 06:41:46] [INFO ] [Real]Absence check using 161 positive place invariants in 89 ms returned sat
[2020-06-05 06:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:46] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2020-06-05 06:41:46] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 45 ms.
[2020-06-05 06:41:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:46] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned sat
[2020-06-05 06:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:47] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-06-05 06:41:47] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 53 ms.
[2020-06-05 06:41:49] [INFO ] Added : 317 causal constraints over 64 iterations in 2602 ms. Result :sat
[2020-06-05 06:41:50] [INFO ] [Real]Absence check using 161 positive place invariants in 100 ms returned sat
[2020-06-05 06:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:50] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2020-06-05 06:41:50] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2020-06-05 06:41:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 609 ms returned sat
[2020-06-05 06:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:51] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2020-06-05 06:41:51] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 47 ms.
[2020-06-05 06:41:53] [INFO ] Added : 319 causal constraints over 64 iterations in 1977 ms. Result :sat
[2020-06-05 06:41:54] [INFO ] [Real]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-06-05 06:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:54] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2020-06-05 06:41:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:41:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 83 ms returned sat
[2020-06-05 06:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:55] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2020-06-05 06:41:55] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 36 ms.
[2020-06-05 06:41:56] [INFO ] Added : 319 causal constraints over 65 iterations in 1759 ms. Result :sat
[2020-06-05 06:41:57] [INFO ] [Real]Absence check using 161 positive place invariants in 107 ms returned sat
[2020-06-05 06:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:57] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2020-06-05 06:41:57] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 30 ms.
[2020-06-05 06:41:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:58] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2020-06-05 06:41:58] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:41:59] [INFO ] Added : 317 causal constraints over 64 iterations in 1591 ms. Result :sat
[2020-06-05 06:41:59] [INFO ] [Real]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-06-05 06:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:00] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-06-05 06:42:00] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:42:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:00] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-06-05 06:42:00] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:42:03] [INFO ] Added : 318 causal constraints over 65 iterations in 2211 ms. Result :sat
[2020-06-05 06:42:03] [INFO ] [Real]Absence check using 161 positive place invariants in 108 ms returned sat
[2020-06-05 06:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:04] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2020-06-05 06:42:04] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:04] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:04] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2020-06-05 06:42:04] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 31 ms.
[2020-06-05 06:42:06] [INFO ] Added : 319 causal constraints over 64 iterations in 1870 ms. Result :sat
[2020-06-05 06:42:06] [INFO ] [Real]Absence check using 161 positive place invariants in 72 ms returned sat
[2020-06-05 06:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:07] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-06-05 06:42:07] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 49 ms.
[2020-06-05 06:42:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 93 ms returned sat
[2020-06-05 06:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:07] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2020-06-05 06:42:07] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:09] [INFO ] Added : 317 causal constraints over 64 iterations in 1580 ms. Result :sat
[2020-06-05 06:42:09] [INFO ] [Real]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-06-05 06:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:09] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-06-05 06:42:09] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:42:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:09] [INFO ] [Nat]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:10] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-06-05 06:42:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2020-06-05 06:42:12] [INFO ] Added : 320 causal constraints over 66 iterations in 2160 ms. Result :sat
[2020-06-05 06:42:12] [INFO ] [Real]Absence check using 161 positive place invariants in 65 ms returned sat
[2020-06-05 06:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:12] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-05 06:42:12] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 76 ms returned sat
[2020-06-05 06:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:13] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2020-06-05 06:42:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:15] [INFO ] Added : 317 causal constraints over 64 iterations in 1650 ms. Result :sat
[2020-06-05 06:42:15] [INFO ] [Real]Absence check using 161 positive place invariants in 65 ms returned sat
[2020-06-05 06:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:15] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-05 06:42:15] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 29 ms.
[2020-06-05 06:42:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-06-05 06:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:16] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2020-06-05 06:42:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:17] [INFO ] Added : 320 causal constraints over 65 iterations in 1480 ms. Result :sat
[2020-06-05 06:42:17] [INFO ] [Real]Absence check using 161 positive place invariants in 50 ms returned sat
[2020-06-05 06:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:17] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-06-05 06:42:17] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:42:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:18] [INFO ] [Nat]Absence check using 161 positive place invariants in 73 ms returned sat
[2020-06-05 06:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:18] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2020-06-05 06:42:18] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:42:19] [INFO ] Added : 319 causal constraints over 65 iterations in 1500 ms. Result :sat
[2020-06-05 06:42:20] [INFO ] [Real]Absence check using 161 positive place invariants in 46 ms returned sat
[2020-06-05 06:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:20] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-06-05 06:42:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:42:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:20] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2020-06-05 06:42:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:42:22] [INFO ] Added : 318 causal constraints over 64 iterations in 1738 ms. Result :sat
[2020-06-05 06:42:22] [INFO ] [Real]Absence check using 161 positive place invariants in 67 ms returned sat
[2020-06-05 06:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:23] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2020-06-05 06:42:23] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 29 ms.
[2020-06-05 06:42:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:23] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2020-06-05 06:42:23] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:25] [INFO ] Added : 316 causal constraints over 65 iterations in 1779 ms. Result :sat
[2020-06-05 06:42:25] [INFO ] [Real]Absence check using 161 positive place invariants in 72 ms returned sat
[2020-06-05 06:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:25] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2020-06-05 06:42:26] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 76 ms returned sat
[2020-06-05 06:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:26] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-06-05 06:42:26] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 28 ms.
[2020-06-05 06:42:28] [INFO ] Added : 319 causal constraints over 64 iterations in 1872 ms. Result :sat
[2020-06-05 06:42:28] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:28] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-05 06:42:28] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:42:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:42:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:29] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2020-06-05 06:42:29] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:42:31] [INFO ] Added : 316 causal constraints over 64 iterations in 1866 ms. Result :sat
[2020-06-05 06:42:31] [INFO ] [Real]Absence check using 161 positive place invariants in 49 ms returned sat
[2020-06-05 06:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:31] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-06-05 06:42:31] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2020-06-05 06:42:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:42:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:32] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-06-05 06:42:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:42:34] [INFO ] Added : 319 causal constraints over 65 iterations in 2331 ms. Result :sat
[2020-06-05 06:42:34] [INFO ] [Real]Absence check using 161 positive place invariants in 60 ms returned sat
[2020-06-05 06:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:34] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-05 06:42:34] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2020-06-05 06:42:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:35] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2020-06-05 06:42:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:42:37] [INFO ] Added : 320 causal constraints over 65 iterations in 2210 ms. Result :sat
[2020-06-05 06:42:37] [INFO ] [Real]Absence check using 161 positive place invariants in 62 ms returned sat
[2020-06-05 06:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:38] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-06-05 06:42:38] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:38] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2020-06-05 06:42:38] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2020-06-05 06:42:40] [INFO ] Added : 319 causal constraints over 65 iterations in 2020 ms. Result :sat
[2020-06-05 06:42:41] [INFO ] [Real]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:41] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-05 06:42:41] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:41] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2020-06-05 06:42:42] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 29 ms.
[2020-06-05 06:42:43] [INFO ] Added : 318 causal constraints over 65 iterations in 1946 ms. Result :sat
[2020-06-05 06:42:44] [INFO ] [Real]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:44] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2020-06-05 06:42:44] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 26 ms.
[2020-06-05 06:42:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:44] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2020-06-05 06:42:45] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:42:46] [INFO ] Added : 319 causal constraints over 65 iterations in 1650 ms. Result :sat
[2020-06-05 06:42:46] [INFO ] [Real]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:47] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-05 06:42:47] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:47] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2020-06-05 06:42:47] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:42:49] [INFO ] Added : 317 causal constraints over 64 iterations in 1650 ms. Result :sat
[2020-06-05 06:42:49] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:49] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-05 06:42:49] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 72 ms returned sat
[2020-06-05 06:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:50] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-05 06:42:50] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:42:52] [INFO ] Added : 315 causal constraints over 64 iterations in 1717 ms. Result :sat
[2020-06-05 06:42:52] [INFO ] [Real]Absence check using 161 positive place invariants in 67 ms returned sat
[2020-06-05 06:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:52] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-06-05 06:42:52] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:42:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:52] [INFO ] [Nat]Absence check using 161 positive place invariants in 77 ms returned sat
[2020-06-05 06:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:53] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2020-06-05 06:42:53] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:42:55] [INFO ] Added : 317 causal constraints over 64 iterations in 1977 ms. Result :sat
[2020-06-05 06:42:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 06:42:55] [INFO ] Flatten gal took : 109 ms
FORMULA ShieldRVt-PT-040A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:42:55] [INFO ] Applying decomposition
[2020-06-05 06:42:55] [INFO ] Flatten gal took : 40 ms
[2020-06-05 06:42:55] [INFO ] Decomposing Gal with order
[2020-06-05 06:42:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 06:42:55] [INFO ] Removed a total of 120 redundant transitions.
[2020-06-05 06:42:55] [INFO ] Flatten gal took : 79 ms
[2020-06-05 06:42:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2020-06-05 06:42:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-05 06:42:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-040A @ 3570 seconds

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

FORMULA ShieldRVt-PT-040A-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA ShieldRVt-PT-040A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

{
"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 06:42:56 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 4,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(X ((X (G (((1 <= p91) AND (1 <= p100) AND (1 <= p106)))) OR ((1 <= p131) AND (1 <= p140) AND (1 <= p146)))) U (X (((1 <= p99))) AND (X (F (((1 <= p59)))) OR ((1 <= p91) AND (1 <= p100) AND (1 <= p106)))))",
"processed_size": 205,
"rewrites": 127
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 0,
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p283 <= 0)) R ((p292 <= 0) OR (p293 <= 0) OR (p296 <= 0))))",
"processed_size": 67,
"rewrites": 127
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"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 <= p117))))",
"processed_size": 21,
"rewrites": 127
},
"result":
{
"edges": 344,
"markings": 344,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p223))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))))",
"processed_size": 69,
"rewrites": 127
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F (((1 <= p259))) OR G (((p287 <= 0))))))",
"processed_size": 48,
"rewrites": 127
},
"result":
{
"edges": 227,
"markings": 227,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0) OR ((1 <= p30) AND (1 <= p33)))) AND (((1 <= p270) AND (1 <= p273)) U (((1 <= p86) AND (1 <= p89)) U ((1 <= p96) AND (1 <= p98) AND (1 <= p103))))))",
"processed_size": 199,
"rewrites": 127
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 689
},
"exit":
{
"localtimelimitreached": false
},
"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": "((p4 <= 0) OR (p5 <= 0) OR (p8 <= 0))",
"processed_size": 39,
"rewrites": 129
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 861
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p245 <= 0))))",
"processed_size": 21,
"rewrites": 127
},
"result":
{
"edges": 25093,
"markings": 13028,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1149
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0))) AND ((1 <= p99)))))",
"processed_size": 76,
"rewrites": 127
},
"result":
{
"edges": 267,
"markings": 238,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1723
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129)))) AND (((p126 <= 0) OR (p129 <= 0)) OR (F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129))))))",
"processed_size": 186,
"rewrites": 127
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3447
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 3,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G (((p163 <= 0) OR (p172 <= 0) OR (p178 <= 0))) OR ((((p39 <= 0)) AND ((p251 <= 0))) R (((1 <= p76) AND (1 <= p77) AND (1 <= p80) AND (1 <= p39)) OR ((1 <= p251))))))",
"processed_size": 173,
"rewrites": 127
},
"result":
{
"edges": 18775,
"markings": 14370,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3580,
"runtime": 254.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((X(G(**)) OR **)) U (X(**) AND (X(F(**)) OR **))) : G(F((G(*) AND *))) : G((F((F(**) OR **)) AND (** OR (F(**) OR **)))) : (X((* R *)) OR G(F((G(*) OR (X(*) AND *))))) : F((G((F(**) AND (** AND (** AND (** AND (** AND (** AND **))))))) OR (* AND X((F(**) AND (** AND (** AND (** AND (** AND (** AND **)))))))))) : F((G(*) OR (* R *))) : X(F(**)) : X((G(**) OR **)) : F(G(*)) : X(G((F(**) OR G(*)))) : X((G(**) AND (** U (** U **)))) : F(**)"
},
"net":
{
"arcs": 1364,
"conflict_clusters": 83,
"places": 323,
"places_significant": 162,
"singleton_clusters": 0,
"transitions": 322
},
"result":
{
"preliminary_value": "no no no yes unknown no no no no no no no ",
"value": "no no no yes unknown no no no no no no 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: 645/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10336
lola: finding significant places
lola: 323 places, 322 transitions, 162 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: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 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: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 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: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 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: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: (X ((G (X (((1 <= p91) AND (1 <= p100) AND (1 <= p106)))) OR ((1 <= p131) AND (1 <= p140) AND (1 <= p146)))) U (X (((1 <= p99))) AND (F (X (((1 <= p59)))) OR ((1 <= p91) AND (1 <= p100) AND (1 <= p106))))) : G (X (NOT(G (X ((F (((1 <= p259) AND (1 <= p268) AND (1 <= p274))) OR ((p99 <= 0)))))))) : G ((((p126 <= 0) OR (p129 <= 0)) U (F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129))))) : (NOT(X ((((1 <= p283)) U ((1 <= p292) AND (1 <= p293) AND (1 <= p296))))) OR X (G (NOT(F (G ((X (((1 <= p167))) U ((1 <= p131) AND (1 <= p140) AND (1 <= p146))))))))) : NOT(G ((((1 <= p211)) U NOT(X (((((((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND ((1 <= p40))) AND ((1 <= p42))) AND ((1 <= p47))) AND ((1 <= p211))) AND ((1 <= p220))) AND ((1 <= p226)))))))) : F ((NOT(F (((1 <= p163) AND (1 <= p172) AND (1 <= p178)))) OR NOT(((((1 <= p39)) OR ((1 <= p251))) U (((p76 <= 0) OR (p77 <= 0) OR (p80 <= 0) OR (p39 <= 0)) AND ((p251 <= 0))))))) : F (X (F (((1 <= p117))))) : X ((G (((1 <= p223))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) : X (F (NOT(X (F (((1 <= p245))))))) : G (NOT(X ((((1 <= p155) AND (1 <= p164) AND (1 <= p170)) U F ((NOT(F (((1 <= p259)))) AND F (((1 <= p287))))))))) : (X (G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0) OR ((1 <= p30) AND (1 <= p33))))) AND X ((((1 <= p270) AND (1 <= p273)) U (((1 <= p86) AND (1 <= p89)) U ((1 <= p96) AND (1 <= p98) AND (1 <= p103)))))) : F (((1 <= p4) AND (1 <= p5) AND (1 <= p8)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G (((1 <= p91) AND (1 <= p100) AND (1 <= p106)))) OR ((1 <= p131) AND (1 <= p140) AND (1 <= p146)))) U (X (((1 <= p99))) AND (X (F (((1 <= p59)))) OR ((1 <= p91) AND (1 <= p100) AND (1 <= p106)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((X (G (((1 <= p91) AND (1 <= p100) AND (1 <= p106)))) OR ((1 <= p131) AND (1 <= p140) AND (1 <= p146)))) U (X (((1 <= p99))) AND (X (F (((1 <= p59)))) OR ((1 <= p91) AND (1 <= p100) AND (1 <= p106)))))
lola: processed formula length: 205
lola: 127 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p283 <= 0)) R ((p292 <= 0) OR (p293 <= 0) OR (p296 <= 0)))) OR G (F ((G (((p131 <= 0) OR (p140 <= 0) OR (p146 <= 0))) OR (X (((p167 <= 0))) AND ((p131 <= 0) OR (p140 <= 0) OR (p146 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p283 <= 0)) R ((p292 <= 0) OR (p293 <= 0) OR (p296 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p283 <= 0)) R ((p292 <= 0) OR (p293 <= 0) OR (p296 <= 0))))
lola: processed formula length: 67
lola: 127 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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))) OR (((p211 <= 0)) AND X ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))) OR (((p211 <= 0)) AND X ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))))))
lola: processed formula length: 364
lola: 127 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 24 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: 2028573 markings, 2028572 edges, 405715 markings/sec, 0 secs
lola: 4125750 markings, 4125750 edges, 419435 markings/sec, 5 secs
lola: 6223977 markings, 6223977 edges, 419645 markings/sec, 10 secs
lola: 8307802 markings, 8307802 edges, 416765 markings/sec, 15 secs
lola: 10403195 markings, 10403195 edges, 419079 markings/sec, 20 secs
lola: 12503259 markings, 12503259 edges, 420013 markings/sec, 25 secs
lola: 14564479 markings, 14564482 edges, 412244 markings/sec, 30 secs
lola: 16594703 markings, 16594703 edges, 406045 markings/sec, 35 secs
lola: 18694308 markings, 18694308 edges, 419921 markings/sec, 40 secs
lola: 20733963 markings, 20733962 edges, 407931 markings/sec, 45 secs
lola: 22825771 markings, 22825771 edges, 418362 markings/sec, 50 secs
lola: 24837043 markings, 24837043 edges, 402254 markings/sec, 55 secs
lola: 26824325 markings, 26824325 edges, 397456 markings/sec, 60 secs
lola: 28869543 markings, 28869543 edges, 409044 markings/sec, 65 secs
lola: 30335534 markings, 30335595 edges, 293198 markings/sec, 70 secs
lola: 31342912 markings, 31343119 edges, 201476 markings/sec, 75 secs
lola: 32347605 markings, 32348006 edges, 200939 markings/sec, 80 secs
lola: 33356935 markings, 33356935 edges, 201866 markings/sec, 85 secs
lola: 34594523 markings, 34594533 edges, 247518 markings/sec, 90 secs
lola: 35648945 markings, 35648952 edges, 210884 markings/sec, 95 secs
lola: 36838593 markings, 36838593 edges, 237930 markings/sec, 100 secs
lola: 37454056 markings, 37454055 edges, 123093 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p117))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p117))))
lola: processed formula length: 21
lola: 127 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: 344 markings, 344 edges
lola: ========================================
lola: subprocess 4 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p223))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p223))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))))
lola: processed formula length: 69
lola: 127 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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 5 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p259))) OR G (((p287 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p259))) OR G (((p287 <= 0))))))
lola: processed formula length: 48
lola: 127 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: 227 markings, 227 edges
lola: ========================================
lola: subprocess 6 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0) OR ((1 <= p30) AND (1 <= p33)))) AND (((1 <= p270) AND (1 <= p273)) U (((1 <= p86) AND (1 <= p89)) U ((1 <= p96) AND (1 <= p98) AND (1 <= p103))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0) OR ((1 <= p30) AND (1 <= p33)))) AND (((1 <= p270) AND (1 <= p273)) U (((1 <= p86) AND (1 <= p89)) U ((1 <= p96) AND (1 <= p98) AND (1 <= p103))))))
lola: processed formula length: 199
lola: 127 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 254 markings, 254 edges
lola: ========================================
lola: subprocess 7 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p4) AND (1 <= p5) AND (1 <= p8)))
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: ((p4 <= 0) OR (p5 <= 0) OR (p8 <= 0))
lola: processed formula length: 39
lola: 129 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p245 <= 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 (((p245 <= 0))))
lola: processed formula length: 21
lola: 127 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: 13028 markings, 25093 edges
lola: ========================================
lola: subprocess 9 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0))) AND ((1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p259 <= 0) OR (p268 <= 0) OR (p274 <= 0))) AND ((1 <= p99)))))
lola: processed formula length: 76
lola: 127 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: 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: 238 markings, 267 edges
lola: ========================================
lola: subprocess 10 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129)))) AND (((p126 <= 0) OR (p129 <= 0)) OR (F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129)))) AND (((p126 <= 0) OR (p129 <= 0)) OR (F (((1 <= p301) AND (1 <= p169))) OR ((1 <= p126) AND (1 <= p129))))))
lola: processed formula length: 186
lola: 127 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: 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p163 <= 0) OR (p172 <= 0) OR (p178 <= 0))) OR ((((p39 <= 0)) AND ((p251 <= 0))) R (((1 <= p76) AND (1 <= p77) AND (1 <= p80) AND (1 <= p39)) OR ((1 <= p251))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p163 <= 0) OR (p172 <= 0) OR (p178 <= 0))) OR ((((p39 <= 0)) AND ((p251 <= 0))) R (((1 <= p76) AND (1 <= p77) AND (1 <= p80) AND (1 <= p39)) OR ((1 <= p251))))))
lola: processed formula length: 173
lola: 127 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: 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: 14370 markings, 18775 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))) OR (((p211 <= 0)) AND X ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))) OR (((p211 <= 0)) AND X ((F (((1 <= p40) AND (1 <= p42) AND (1 <= p47))) AND (((1 <= p40)) AND (((1 <= p42)) AND (((1 <= p47)) AND (((1 <= p211)) AND (((1 <= p220)) AND ((1 <= p226))))))))))))
lola: processed formula length: 364
lola: 127 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 24 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: 2004663 markings, 2004663 edges, 400933 markings/sec, 0 secs
lola: 4194628 markings, 4194628 edges, 437993 markings/sec, 5 secs
lola: 6325438 markings, 6325438 edges, 426162 markings/sec, 10 secs
lola: 8449177 markings, 8449177 edges, 424748 markings/sec, 15 secs
lola: 10571155 markings, 10571154 edges, 424396 markings/sec, 20 secs
lola: 12749692 markings, 12749691 edges, 435707 markings/sec, 25 secs
lola: 14838281 markings, 14838281 edges, 417718 markings/sec, 30 secs
lola: 16762746 markings, 16762745 edges, 384893 markings/sec, 35 secs
lola: 18738630 markings, 18738630 edges, 395177 markings/sec, 40 secs
lola: 20728454 markings, 20728459 edges, 397965 markings/sec, 45 secs
lola: 22676430 markings, 22676429 edges, 389595 markings/sec, 50 secs
lola: 24669170 markings, 24669170 edges, 398548 markings/sec, 55 secs
lola: 26589354 markings, 26589354 edges, 384037 markings/sec, 60 secs
lola: 28513765 markings, 28513764 edges, 384882 markings/sec, 65 secs
lola: 30180673 markings, 30181264 edges, 333382 markings/sec, 70 secs
lola: 30974966 markings, 30975185 edges, 158859 markings/sec, 75 secs
lola: 32283524 markings, 32283696 edges, 261712 markings/sec, 80 secs
lola: 33159216 markings, 33159215 edges, 175138 markings/sec, 85 secs
lola: 34071865 markings, 34071865 edges, 182530 markings/sec, 90 secs
lola: 35034294 markings, 35034294 edges, 192486 markings/sec, 95 secs
lola: 35592622 markings, 35592621 edges, 111666 markings/sec, 100 secs
lola: 36638629 markings, 36638628 edges, 209201 markings/sec, 105 secs
lola: 37257298 markings, 37257297 edges, 123734 markings/sec, 110 secs
lola: 37469863 markings, 37469862 edges, 42513 markings/sec, 115 secs
lola: 37470671 markings, 37470671 edges, 162 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes unknown no no no no no no no
lola:
preliminary result: no no no yes unknown no no no no no no no
lola: memory consumption: 3580 KB
lola: time consumption: 254 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-040A"
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-040A, 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-159033478301050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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