Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-100100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.7K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 218K Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-100100-00
FORMULA_NAME RefineWMG-PT-100100-01
FORMULA_NAME RefineWMG-PT-100100-02
FORMULA_NAME RefineWMG-PT-100100-03
FORMULA_NAME RefineWMG-PT-100100-04
FORMULA_NAME RefineWMG-PT-100100-05
FORMULA_NAME RefineWMG-PT-100100-06
FORMULA_NAME RefineWMG-PT-100100-07
FORMULA_NAME RefineWMG-PT-100100-08
FORMULA_NAME RefineWMG-PT-100100-09
FORMULA_NAME RefineWMG-PT-100100-10
FORMULA_NAME RefineWMG-PT-100100-11
FORMULA_NAME RefineWMG-PT-100100-12
FORMULA_NAME RefineWMG-PT-100100-13
FORMULA_NAME RefineWMG-PT-100100-14
FORMULA_NAME RefineWMG-PT-100100-15

=== Now, execution of the tool begins

BK_START 1591227523627

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:38:44] [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-03 23:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:38:45] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-06-03 23:38:45] [INFO ] Transformed 504 places.
[2020-06-03 23:38:45] [INFO ] Transformed 403 transitions.
[2020-06-03 23:38:45] [INFO ] Parsed PT model containing 504 places and 403 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100007 steps, including 0 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:38:45] [INFO ] Computed 202 place invariants in 8 ms
[2020-06-03 23:38:45] [INFO ] [Real]Absence check using 202 positive place invariants in 76 ms returned sat
[2020-06-03 23:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:46] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2020-06-03 23:38:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:46] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2020-06-03 23:38:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2020-06-03 23:38:47] [INFO ] Added : 135 causal constraints over 27 iterations in 707 ms. Result :sat
[2020-06-03 23:38:47] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:48] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-06-03 23:38:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:48] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2020-06-03 23:38:48] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:38:48] [INFO ] Added : 26 causal constraints over 6 iterations in 182 ms. Result :sat
[2020-06-03 23:38:49] [INFO ] [Real]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:49] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-03 23:38:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2020-06-03 23:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:50] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2020-06-03 23:38:50] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2020-06-03 23:38:50] [INFO ] Added : 22 causal constraints over 5 iterations in 149 ms. Result :sat
[2020-06-03 23:38:51] [INFO ] [Real]Absence check using 202 positive place invariants in 968 ms returned sat
[2020-06-03 23:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:51] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2020-06-03 23:38:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:51] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:52] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-06-03 23:38:52] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:38:53] [INFO ] Added : 197 causal constraints over 40 iterations in 961 ms. Result :sat
[2020-06-03 23:38:53] [INFO ] [Real]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:53] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-06-03 23:38:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:54] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2020-06-03 23:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:54] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2020-06-03 23:38:54] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:38:55] [INFO ] Added : 158 causal constraints over 32 iterations in 752 ms. Result :sat
[2020-06-03 23:38:55] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:55] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2020-06-03 23:38:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:55] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:56] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2020-06-03 23:38:56] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:38:56] [INFO ] Added : 75 causal constraints over 15 iterations in 369 ms. Result :sat
[2020-06-03 23:38:56] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:57] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2020-06-03 23:38:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:57] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:57] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2020-06-03 23:38:58] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2020-06-03 23:38:58] [INFO ] Added : 75 causal constraints over 15 iterations in 372 ms. Result :sat
[2020-06-03 23:38:58] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:58] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-03 23:38:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:59] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:59] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2020-06-03 23:38:59] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:38:59] [INFO ] Added : 75 causal constraints over 15 iterations in 342 ms. Result :sat
[2020-06-03 23:38:59] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:00] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-03 23:39:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:00] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:00] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2020-06-03 23:39:01] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:01] [INFO ] Added : 84 causal constraints over 17 iterations in 392 ms. Result :sat
[2020-06-03 23:39:01] [INFO ] [Real]Absence check using 202 positive place invariants in 74 ms returned sat
[2020-06-03 23:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:01] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2020-06-03 23:39:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:02] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:02] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2020-06-03 23:39:02] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:39:02] [INFO ] Added : 75 causal constraints over 15 iterations in 355 ms. Result :sat
[2020-06-03 23:39:03] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:03] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2020-06-03 23:39:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:03] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:04] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2020-06-03 23:39:04] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2020-06-03 23:39:04] [INFO ] Added : 170 causal constraints over 34 iterations in 780 ms. Result :sat
[2020-06-03 23:39:05] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:05] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2020-06-03 23:39:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:05] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:06] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2020-06-03 23:39:06] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:39:06] [INFO ] Added : 179 causal constraints over 36 iterations in 832 ms. Result :sat
[2020-06-03 23:39:07] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:07] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2020-06-03 23:39:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:08] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2020-06-03 23:39:08] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:39:09] [INFO ] Added : 192 causal constraints over 39 iterations in 911 ms. Result :sat
[2020-06-03 23:39:09] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:09] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:39:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:09] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:10] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2020-06-03 23:39:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:39:10] [INFO ] Added : 158 causal constraints over 32 iterations in 734 ms. Result :sat
[2020-06-03 23:39:11] [INFO ] [Real]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:11] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2020-06-03 23:39:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:11] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:12] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2020-06-03 23:39:12] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:12] [INFO ] Added : 104 causal constraints over 21 iterations in 493 ms. Result :sat
[2020-06-03 23:39:12] [INFO ] [Real]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:13] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2020-06-03 23:39:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:13] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:13] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2020-06-03 23:39:13] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:39:14] [INFO ] Added : 192 causal constraints over 39 iterations in 946 ms. Result :sat
[2020-06-03 23:39:14] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:15] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-06-03 23:39:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:15] [INFO ] [Nat]Absence check using 202 positive place invariants in 247 ms returned sat
[2020-06-03 23:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:16] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2020-06-03 23:39:16] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:17] [INFO ] Added : 149 causal constraints over 30 iterations in 716 ms. Result :sat
[2020-06-03 23:39:17] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:17] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2020-06-03 23:39:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:17] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:18] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2020-06-03 23:39:18] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:39:19] [INFO ] Added : 198 causal constraints over 40 iterations in 1100 ms. Result :sat
[2020-06-03 23:39:19] [INFO ] [Real]Absence check using 202 positive place invariants in 201 ms returned sat
[2020-06-03 23:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:20] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2020-06-03 23:39:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:20] [INFO ] [Nat]Absence check using 202 positive place invariants in 106 ms returned sat
[2020-06-03 23:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:21] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2020-06-03 23:39:21] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:39:21] [INFO ] Added : 149 causal constraints over 30 iterations in 687 ms. Result :sat
[2020-06-03 23:39:21] [INFO ] [Real]Absence check using 202 positive place invariants in 58 ms returned sat
[2020-06-03 23:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:22] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-03 23:39:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 293 ms returned sat
[2020-06-03 23:39:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:23] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-06-03 23:39:23] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2020-06-03 23:39:24] [INFO ] Added : 145 causal constraints over 29 iterations in 838 ms. Result :sat
[2020-06-03 23:39:24] [INFO ] [Real]Absence check using 202 positive place invariants in 70 ms returned sat
[2020-06-03 23:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:24] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2020-06-03 23:39:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:24] [INFO ] [Nat]Absence check using 202 positive place invariants in 92 ms returned sat
[2020-06-03 23:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:25] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2020-06-03 23:39:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:39:25] [INFO ] Added : 17 causal constraints over 4 iterations in 114 ms. Result :sat
[2020-06-03 23:39:25] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2020-06-03 23:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:28] [INFO ] [Real]Absence check using state equation in 2972 ms returned sat
[2020-06-03 23:39:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 123 ms returned sat
[2020-06-03 23:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:29] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2020-06-03 23:39:29] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:39:30] [INFO ] Added : 144 causal constraints over 29 iterations in 976 ms. Result :sat
[2020-06-03 23:39:30] [INFO ] [Real]Absence check using 202 positive place invariants in 395 ms returned sat
[2020-06-03 23:39:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:31] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2020-06-03 23:39:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:31] [INFO ] [Nat]Absence check using 202 positive place invariants in 105 ms returned sat
[2020-06-03 23:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:31] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-03 23:39:31] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:39:32] [INFO ] Added : 111 causal constraints over 23 iterations in 525 ms. Result :sat
[2020-06-03 23:39:32] [INFO ] [Real]Absence check using 202 positive place invariants in 115 ms returned sat
[2020-06-03 23:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:32] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-06-03 23:39:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:33] [INFO ] [Nat]Absence check using 202 positive place invariants in 77 ms returned sat
[2020-06-03 23:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:33] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2020-06-03 23:39:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:34] [INFO ] Added : 104 causal constraints over 21 iterations in 528 ms. Result :sat
[2020-06-03 23:39:34] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:34] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2020-06-03 23:39:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 106 ms returned sat
[2020-06-03 23:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:35] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2020-06-03 23:39:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:36] [INFO ] Added : 111 causal constraints over 23 iterations in 582 ms. Result :sat
[2020-06-03 23:39:36] [INFO ] [Real]Absence check using 202 positive place invariants in 107 ms returned sat
[2020-06-03 23:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:36] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2020-06-03 23:39:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:37] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:37] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2020-06-03 23:39:37] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:39:38] [INFO ] Added : 124 causal constraints over 25 iterations in 625 ms. Result :sat
[2020-06-03 23:39:38] [INFO ] [Real]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:38] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2020-06-03 23:39:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:39] [INFO ] [Nat]Absence check using 202 positive place invariants in 139 ms returned sat
[2020-06-03 23:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:40] [INFO ] [Nat]Absence check using state equation in 1064 ms returned sat
[2020-06-03 23:39:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2020-06-03 23:39:41] [INFO ] Added : 198 causal constraints over 40 iterations in 973 ms. Result :sat
[2020-06-03 23:39:41] [INFO ] [Real]Absence check using 202 positive place invariants in 104 ms returned sat
[2020-06-03 23:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:42] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2020-06-03 23:39:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:42] [INFO ] [Nat]Absence check using 202 positive place invariants in 71 ms returned sat
[2020-06-03 23:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:42] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2020-06-03 23:39:42] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:39:43] [INFO ] Added : 187 causal constraints over 38 iterations in 952 ms. Result :sat
[2020-06-03 23:39:44] [INFO ] [Real]Absence check using 202 positive place invariants in 102 ms returned sat
[2020-06-03 23:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:44] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2020-06-03 23:39:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:39:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 104 ms returned sat
[2020-06-03 23:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:39:46] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2020-06-03 23:39:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 25 ms.
[2020-06-03 23:39:47] [INFO ] Added : 187 causal constraints over 38 iterations in 977 ms. Result :sat
[2020-06-03 23:39:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 23:39:50] [INFO ] Flatten gal took : 110 ms
FORMULA RefineWMG-PT-100100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:39:50] [INFO ] Flatten gal took : 27 ms
[2020-06-03 23:39:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-03 23:39:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-100100 @ 3570 seconds

FORMULA RefineWMG-PT-100100-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2634
rslt: Output for LTLFireability @ RefineWMG-PT-100100

{
"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": "Wed Jun 3 23:39:53 2020
",
"timelimit": 3570
},
"child":
[

{
"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": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G ((1 <= p202))",
"processed_size": 15,
"rewrites": 66
},
"result":
{
"edges": 13905,
"markings": 7596,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "X (G (((p202 <= 0) AND (p238 <= 0))))",
"processed_size": 37,
"rewrites": 66
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p101 <= 0) OR (p102 <= 0) OR (p104 <= 0))",
"processed_size": 43,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p455)) AND (F (((p441 <= 0) OR (p442 <= 0) OR (p444 <= 0))) OR (1 <= p455)))))",
"processed_size": 96,
"rewrites": 66
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"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 <= p101) AND (1 <= p102) AND (1 <= p104)))",
"processed_size": 49,
"rewrites": 66
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"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 (X ((p253 <= 0)))",
"processed_size": 19,
"rewrites": 66
},
"result":
{
"edges": 153,
"markings": 153,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (((p126 <= 0) OR (p127 <= 0) OR (p129 <= 0))) AND F ((F (((1 <= p126) AND (1 <= p127) AND (1 <= p129))) AND ((1 <= p126) AND ((1 <= p127) AND (1 <= p129)))))))",
"processed_size": 167,
"rewrites": 66
},
"result":
{
"edges": 102,
"markings": 102,
"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": 604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "G (F ((X (F ((1 <= p178))) OR (1 <= p150))))",
"processed_size": 44,
"rewrites": 66
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))) OR (G ((p225 <= 0)) AND X (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))))))",
"processed_size": 132,
"rewrites": 66
},
"result":
{
"edges": 202,
"markings": 203,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1007
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "F (G ((1 <= p490)))",
"processed_size": 19,
"rewrites": 66
},
"result":
{
"edges": 9,
"markings": 8,
"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": 1511
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G ((F (((p291 <= 0) OR (p292 <= 0) OR (p294 <= 0))) AND (1 <= p345))))",
"processed_size": 75,
"rewrites": 66
},
"result":
{
"edges": 9,
"markings": 8,
"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": 3022
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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 ((G ((p245 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))",
"processed_size": 68,
"rewrites": 66
},
"result":
{
"edges": 1631,
"markings": 1279,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3396,
"runtime": 936.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G(*)) OR (X(G(*)) AND G(**))) : (F(G((F(**) AND (F(**) OR **)))) AND (X(X(**)) OR (** OR (** OR **)))) : F(G((F(*) AND **))) : F(G(**)) : G((X(X((F(G(*)) AND G((** OR G(*)))))) OR **)) : (X(X(**)) OR (X(**) AND G(**))) : G((G(*) AND **)) : F((X(*) AND F((F(**) AND (** AND (** AND **)))))) : X(G((F(G(*)) AND X(*)))) : G(F((X(F(**)) OR **))) : F((X(F(**)) OR (G(*) AND X(F(**)))))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "no no no no unknown no no no unknown no yes ",
"value": "no no no no unknown no no no unknown no yes "
},
"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: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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: (G (NOT(F (X (((1 <= p202) OR (1 <= p238)))))) OR (NOT(F (X ((1 <= p202)))) AND G ((1 <= p202)))) : (G (F (G ((F (((p441 <= 0) OR (p442 <= 0) OR (p444 <= 0))) U (1 <= p455))))) AND (((X (X ((1 <= p455))) OR (p101 <= 0)) OR (p102 <= 0)) OR (p104 <= 0))) : F (X (X (G ((F (NOT(G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))))) AND (1 <= p345)))))) : (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0)) U F (X (F (G ((1 <= p490)))))) : G ((G (X (X (((1 <= p253) U NOT(F ((1 <= p410))))))) OR (1 <= p177))) : (X (X ((p253 <= 0))) OR (X ((1 <= p253)) AND G (((1 <= p101) AND (1 <= p102) AND (1 <= p104))))) : G ((NOT(F ((1 <= p245))) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0)))) : F (((1 <= p367) U F ((NOT(X (((1 <= p126) AND (1 <= p127) AND (1 <= p129)))) AND F ((((F (((1 <= p126) AND (1 <= p127) AND (1 <= p129))) AND (1 <= p126)) AND (1 <= p127)) AND (1 <= p129))))))) : NOT(X (((1 <= p455) U F ((F (G (F (((1 <= p141) AND (1 <= p142) AND (1 <= p144))))) OR X (((1 <= p461) AND (1 <= p462) AND (1 <= p464)))))))) : F (G (X (X (F ((X (F ((1 <= p178))) OR (1 <= p150))))))) : F ((NOT(((((((1 <= p23) U (1 <= p225)) AND (1 <= p26)) AND (1 <= p27)) AND (1 <= p29)) U F ((1 <= p225)))) U F (X (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))))))
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:318
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:335
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:371
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:422
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p202 <= 0) AND (p238 <= 0)))) OR (X (G ((p202 <= 0))) AND G ((1 <= p202))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p202))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p202))
lola: processed formula length: 15
lola: 66 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: 7596 markings, 13905 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p202 <= 0) AND (p238 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p202 <= 0) AND (p238 <= 0))))
lola: processed formula length: 37
lola: 66 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: 101 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((1 <= p455)) AND (F (((p441 <= 0) OR (p442 <= 0) OR (p444 <= 0))) OR (1 <= p455))))) AND (X (X ((1 <= p455))) OR ((p101 <= 0) OR ((p102 <= 0) OR (p104 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p101 <= 0) OR ((p102 <= 0) OR (p104 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p101 <= 0) OR (p102 <= 0) OR (p104 <= 0))
lola: processed formula length: 43
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p455)) AND (F (((p441 <= 0) OR (p442 <= 0) OR (p444 <= 0))) OR (1 <= p455)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p455)) AND (F (((p441 <= 0) OR (p442 <= 0) OR (p444 <= 0))) OR (1 <= p455)))))
lola: processed formula length: 96
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X ((F (G ((p410 <= 0))) AND G (((1 <= p253) OR G ((p410 <= 0))))))) OR (1 <= p177)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X ((F (G ((p410 <= 0))) AND G (((1 <= p253) OR G ((p410 <= 0))))))) OR (1 <= p177)))
lola: processed formula length: 91
lola: 66 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: 1433806 markings, 2157813 edges, 286761 markings/sec, 0 secs
lola: 2799072 markings, 4212525 edges, 273053 markings/sec, 5 secs
lola: 4175438 markings, 6283945 edges, 275273 markings/sec, 10 secs
lola: 5542827 markings, 8341860 edges, 273478 markings/sec, 15 secs
lola: 6882675 markings, 10358317 edges, 267970 markings/sec, 20 secs
lola: 8265999 markings, 12440289 edges, 276665 markings/sec, 25 secs
lola: 9634575 markings, 14499965 edges, 273715 markings/sec, 30 secs
lola: 10984277 markings, 16531217 edges, 269940 markings/sec, 35 secs
lola: 12336480 markings, 18566328 edges, 270441 markings/sec, 40 secs
lola: 13688324 markings, 20600874 edges, 270369 markings/sec, 45 secs
lola: 15024430 markings, 22611651 edges, 267221 markings/sec, 50 secs
lola: 16384403 markings, 24658496 edges, 271995 markings/sec, 55 secs
lola: 17742556 markings, 26702417 edges, 271631 markings/sec, 60 secs
lola: 19096699 markings, 28740482 edges, 270829 markings/sec, 65 secs
lola: 20475582 markings, 30815667 edges, 275777 markings/sec, 70 secs
lola: 21848701 markings, 32882222 edges, 274624 markings/sec, 75 secs
lola: 23181826 markings, 34888536 edges, 266625 markings/sec, 80 secs
lola: 24354666 markings, 36653678 edges, 234568 markings/sec, 85 secs
lola: 24579767 markings, 36992504 edges, 45020 markings/sec, 90 secs
lola: 25045135 markings, 37693008 edges, 93074 markings/sec, 95 secs
lola: 25656278 markings, 38613161 edges, 122229 markings/sec, 100 secs
lola: 26303001 markings, 39585941 edges, 129345 markings/sec, 105 secs
lola: 26930672 markings, 40530625 edges, 125534 markings/sec, 110 secs
lola: 27173260 markings, 40895703 edges, 48518 markings/sec, 115 secs
lola: 27173260 markings, 40895703 edges, 0 markings/sec, 120 secs
lola: 27474257 markings, 41348655 edges, 60199 markings/sec, 125 secs
lola: 27564460 markings, 41484425 edges, 18041 markings/sec, 130 secs
lola: 27694295 markings, 41679765 edges, 25967 markings/sec, 135 secs
lola: 27752806 markings, 41767868 edges, 11702 markings/sec, 140 secs
lola: 28289265 markings, 42575247 edges, 107292 markings/sec, 145 secs
lola: 28295169 markings, 42584165 edges, 1181 markings/sec, 150 secs
lola: 28401138 markings, 42743638 edges, 21194 markings/sec, 155 secs
lola: 29118100 markings, 43822689 edges, 143392 markings/sec, 160 secs
lola: 29563313 markings, 44492729 edges, 89043 markings/sec, 165 secs
lola: 30277280 markings, 45567207 edges, 142793 markings/sec, 170 secs
lola: 30363021 markings, 45696279 edges, 17148 markings/sec, 175 secs
lola: 30368994 markings, 45705200 edges, 1195 markings/sec, 180 secs
lola: 30371315 markings, 45708747 edges, 464 markings/sec, 185 secs
lola: 30418214 markings, 45779344 edges, 9380 markings/sec, 190 secs
lola: 30423872 markings, 45787842 edges, 1132 markings/sec, 195 secs
lola: 30423872 markings, 45787842 edges, 0 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p253 <= 0))) OR (X ((1 <= p253)) AND G (((1 <= p101) AND (1 <= p102) AND (1 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p101) AND (1 <= p102) AND (1 <= p104)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p101) AND (1 <= p102) AND (1 <= p104)))
lola: processed formula length: 49
lola: 66 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p253 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p253 <= 0)))
lola: processed formula length: 19
lola: 66 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: 153 markings, 153 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p126 <= 0) OR (p127 <= 0) OR (p129 <= 0))) AND F ((F (((1 <= p126) AND (1 <= p127) AND (1 <= p129))) AND ((1 <= p126) AND ((1 <= p127) AND (1 <= p129)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p126 <= 0) OR (p127 <= 0) OR (p129 <= 0))) AND F ((F (((1 <= p126) AND (1 <= p127) AND (1 <= p129))) AND ((1 <= p126) AND ((1 <= p127) AND (1 <= p129)))))))
lola: processed formula length: 167
lola: 66 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 5 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))) AND X (((p461 <= 0) OR (p462 <= 0) OR (p464 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))) AND X (((p461 <= 0) OR (p462 <= 0) OR (p464 <= 0))))))
lola: processed formula length: 117
lola: 66 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: 1456489 markings, 2191910 edges, 291298 markings/sec, 0 secs
lola: 2853278 markings, 4294114 edges, 279358 markings/sec, 5 secs
lola: 4018156 markings, 6047295 edges, 232976 markings/sec, 10 secs
lola: 5447659 markings, 8198645 edges, 285901 markings/sec, 15 secs
lola: 6869939 markings, 10339152 edges, 284456 markings/sec, 20 secs
lola: 8267418 markings, 12442414 edges, 279496 markings/sec, 25 secs
lola: 9668388 markings, 14550845 edges, 280194 markings/sec, 30 secs
lola: 11049352 markings, 16629164 edges, 276193 markings/sec, 35 secs
lola: 12483187 markings, 18787164 edges, 286767 markings/sec, 40 secs
lola: 13914348 markings, 20941049 edges, 286232 markings/sec, 45 secs
lola: 15301127 markings, 23028128 edges, 277356 markings/sec, 50 secs
lola: 16659872 markings, 25073008 edges, 271749 markings/sec, 55 secs
lola: 18065437 markings, 27188386 edges, 281113 markings/sec, 60 secs
lola: 19422477 markings, 29230759 edges, 271408 markings/sec, 65 secs
lola: 20797851 markings, 31300670 edges, 275075 markings/sec, 70 secs
lola: 22227854 markings, 33452823 edges, 286001 markings/sec, 75 secs
lola: 23598009 markings, 35514892 edges, 274031 markings/sec, 80 secs
lola: 24616752 markings, 37048140 edges, 203749 markings/sec, 85 secs
lola: 25006497 markings, 37634673 edges, 77949 markings/sec, 90 secs
lola: 25705034 markings, 38686467 edges, 139707 markings/sec, 95 secs
lola: 26829514 markings, 40383481 edges, 224896 markings/sec, 100 secs
lola: 26876615 markings, 40449204 edges, 9420 markings/sec, 105 secs
lola: 26876615 markings, 40449204 edges, 0 markings/sec, 110 secs
lola: 26876615 markings, 40449204 edges, 0 markings/sec, 115 secs
lola: 26876615 markings, 40449204 edges, 0 markings/sec, 120 secs
lola: 27798486 markings, 41836584 edges, 184374 markings/sec, 125 secs
lola: 27850664 markings, 41915132 edges, 10436 markings/sec, 130 secs
lola: 29018677 markings, 43673032 edges, 233603 markings/sec, 135 secs
lola: 29052884 markings, 43724547 edges, 6841 markings/sec, 140 secs
lola: 29052884 markings, 43724547 edges, 0 markings/sec, 145 secs
lola: 29948388 markings, 45072219 edges, 179101 markings/sec, 150 secs
lola: 30240761 markings, 45512243 edges, 58475 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((1 <= p178))) OR (1 <= p150))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((1 <= p178))) OR (1 <= p150))))
lola: processed formula length: 44
lola: 66 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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 7 will run for 755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))) OR (G ((p225 <= 0)) AND X (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))) OR (G ((p225 <= 0)) AND X (F (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))))))
lola: processed formula length: 132
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 203 markings, 202 edges
lola: ========================================
lola: subprocess 8 will run for 1007 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p490)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p490)))
lola: processed formula length: 19
lola: 66 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: add low 401
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, 9 edges
lola: ========================================
lola: subprocess 9 will run for 1511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p291 <= 0) OR (p292 <= 0) OR (p294 <= 0))) AND (1 <= p345))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p291 <= 0) OR (p292 <= 0) OR (p294 <= 0))) AND (1 <= p345))))
lola: processed formula length: 75
lola: 66 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: add low 401
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, 9 edges
lola: ========================================
lola: subprocess 10 will run for 3022 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p245 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p245 <= 0)) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))
lola: processed formula length: 68
lola: 66 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: 1279 markings, 1631 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (X ((F (G ((p410 <= 0))) AND G (((1 <= p253) OR G ((p410 <= 0))))))) OR (1 <= p177)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X ((F (G ((p410 <= 0))) AND G (((1 <= p253) OR G ((p410 <= 0))))))) OR (1 <= p177)))
lola: processed formula length: 91
lola: 66 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: 1415594 markings, 2130386 edges, 283119 markings/sec, 0 secs
lola: 2781468 markings, 4186002 edges, 273175 markings/sec, 5 secs
lola: 4135415 markings, 6223730 edges, 270789 markings/sec, 10 secs
lola: 5422677 markings, 8161059 edges, 257452 markings/sec, 15 secs
lola: 6673224 markings, 10043141 edges, 250109 markings/sec, 20 secs
lola: 8022007 markings, 12073074 edges, 269757 markings/sec, 25 secs
lola: 9378031 markings, 14113840 edges, 271205 markings/sec, 30 secs
lola: 10705937 markings, 16112353 edges, 265581 markings/sec, 35 secs
lola: 12050597 markings, 18136049 edges, 268932 markings/sec, 40 secs
lola: 13391655 markings, 20154312 edges, 268212 markings/sec, 45 secs
lola: 14716181 markings, 22147761 edges, 264905 markings/sec, 50 secs
lola: 16055358 markings, 24163275 edges, 267835 markings/sec, 55 secs
lola: 17367725 markings, 26138329 edges, 262473 markings/sec, 60 secs
lola: 18699536 markings, 28142735 edges, 266362 markings/sec, 65 secs
lola: 20030905 markings, 30146443 edges, 266274 markings/sec, 70 secs
lola: 21322906 markings, 32090907 edges, 258400 markings/sec, 75 secs
lola: 22625722 markings, 34051649 edges, 260563 markings/sec, 80 secs
lola: 23922984 markings, 36003958 edges, 259452 markings/sec, 85 secs
lola: 24966864 markings, 37575204 edges, 208776 markings/sec, 90 secs
lola: 25837184 markings, 38886032 edges, 174064 markings/sec, 95 secs
lola: 26990001 markings, 40621262 edges, 230563 markings/sec, 100 secs
lola: 27045143 markings, 40702857 edges, 11028 markings/sec, 105 secs
lola: 27340037 markings, 41146678 edges, 58979 markings/sec, 110 secs
lola: 28516490 markings, 42917231 edges, 235291 markings/sec, 115 secs
lola: 29367077 markings, 44197325 edges, 170117 markings/sec, 120 secs
lola: 29964802 markings, 45096897 edges, 119545 markings/sec, 125 secs
lola: 30019042 markings, 45178548 edges, 10848 markings/sec, 130 secs
lola: 30030911 markings, 45196445 edges, 2374 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))) AND X (((p461 <= 0) OR (p462 <= 0) OR (p464 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((p141 <= 0) OR (p142 <= 0) OR (p144 <= 0)))) AND X (((p461 <= 0) OR (p462 <= 0) OR (p464 <= 0))))))
lola: processed formula length: 117
lola: 66 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: 1398007 markings, 2103899 edges, 279601 markings/sec, 0 secs
lola: 2841648 markings, 4276567 edges, 288728 markings/sec, 5 secs
lola: 3880390 markings, 5839937 edges, 207748 markings/sec, 10 secs
lola: 5030587 markings, 7570935 edges, 230039 markings/sec, 15 secs
lola: 6435530 markings, 9685407 edges, 280989 markings/sec, 20 secs
lola: 7471488 markings, 11244481 edges, 207192 markings/sec, 25 secs
lola: 8880118 markings, 13364512 edges, 281726 markings/sec, 30 secs
lola: 10297009 markings, 15496932 edges, 283378 markings/sec, 35 secs
lola: 11639007 markings, 17516598 edges, 268400 markings/sec, 40 secs
lola: 13005291 markings, 19572841 edges, 273257 markings/sec, 45 secs
lola: 14429772 markings, 21716721 edges, 284896 markings/sec, 50 secs
lola: 15859531 markings, 23868471 edges, 285952 markings/sec, 55 secs
lola: 17273698 markings, 25996797 edges, 282833 markings/sec, 60 secs
lola: 18678061 markings, 28110380 edges, 280873 markings/sec, 65 secs
lola: 20111376 markings, 30267534 edges, 286663 markings/sec, 70 secs
lola: 21465453 markings, 32305401 edges, 270815 markings/sec, 75 secs
lola: 22899797 markings, 34464095 edges, 286869 markings/sec, 80 secs
lola: 24326782 markings, 36611696 edges, 285397 markings/sec, 85 secs
lola: 24845278 markings, 37392324 edges, 103699 markings/sec, 90 secs
lola: 25011583 markings, 37642511 edges, 33261 markings/sec, 95 secs
lola: 25577201 markings, 38496046 edges, 113124 markings/sec, 100 secs
lola: 26035927 markings, 39183977 edges, 91745 markings/sec, 105 secs
lola: 26698898 markings, 40181760 edges, 132594 markings/sec, 110 secs
lola: 26698898 markings, 40181760 edges, 0 markings/sec, 115 secs
lola: 26703220 markings, 40188297 edges, 864 markings/sec, 120 secs
lola: 27729922 markings, 41733436 edges, 205340 markings/sec, 125 secs
lola: 28766210 markings, 43293118 edges, 207258 markings/sec, 130 secs
lola: 29902281 markings, 45002824 edges, 227214 markings/sec, 135 secs
lola: 30009095 markings, 45163602 edges, 21363 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no unknown no no no unknown no yes
lola:
preliminary result: no no no no unknown no no no unknown no yes
lola: memory consumption: 3396 KB
lola: time consumption: 936 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="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r186-oct2-158987938500114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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