Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600706.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 98K Apr 27 15:14 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 Peterson-PT-2-00
FORMULA_NAME Peterson-PT-2-01
FORMULA_NAME Peterson-PT-2-02
FORMULA_NAME Peterson-PT-2-03
FORMULA_NAME Peterson-PT-2-04
FORMULA_NAME Peterson-PT-2-05
FORMULA_NAME Peterson-PT-2-06
FORMULA_NAME Peterson-PT-2-07
FORMULA_NAME Peterson-PT-2-08
FORMULA_NAME Peterson-PT-2-09
FORMULA_NAME Peterson-PT-2-10
FORMULA_NAME Peterson-PT-2-11
FORMULA_NAME Peterson-PT-2-12
FORMULA_NAME Peterson-PT-2-13
FORMULA_NAME Peterson-PT-2-14
FORMULA_NAME Peterson-PT-2-15

=== Now, execution of the tool begins

BK_START 1591163699858

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:55:02] [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 05:55:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:55:02] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-03 05:55:02] [INFO ] Transformed 102 places.
[2020-06-03 05:55:02] [INFO ] Transformed 126 transitions.
[2020-06-03 05:55:02] [INFO ] Parsed PT model containing 102 places and 126 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 246 ms. (steps per millisecond=406 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0]
[2020-06-03 05:55:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-06-03 05:55:03] [INFO ] Computed 11 place invariants in 10 ms
[2020-06-03 05:55:03] [INFO ] [Real]Absence check using 8 positive place invariants in 67 ms returned sat
[2020-06-03 05:55:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:03] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-06-03 05:55:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-03 05:55:03] [INFO ] [Real]Added 26 Read/Feed constraints in 19 ms returned sat
[2020-06-03 05:55:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-06-03 05:55:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 14 ms returned sat
[2020-06-03 05:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:04] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2020-06-03 05:55:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:55:04] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2020-06-03 05:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2020-06-03 05:55:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-06-03 05:55:05] [INFO ] Added : 117 causal constraints over 24 iterations in 647 ms. Result :sat
[2020-06-03 05:55:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:55:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:05] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2020-06-03 05:55:05] [INFO ] [Real]Added 26 Read/Feed constraints in 47 ms returned sat
[2020-06-03 05:55:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 50 ms returned sat
[2020-06-03 05:55:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 30 ms returned sat
[2020-06-03 05:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:05] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-06-03 05:55:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:05] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2020-06-03 05:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-06-03 05:55:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 48 ms.
[2020-06-03 05:55:06] [INFO ] Added : 116 causal constraints over 24 iterations in 411 ms. Result :sat
[2020-06-03 05:55:06] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2020-06-03 05:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2020-06-03 05:55:06] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:55:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 16 ms returned sat
[2020-06-03 05:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:06] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-06-03 05:55:06] [INFO ] [Real]Added 26 Read/Feed constraints in 21 ms returned sat
[2020-06-03 05:55:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:55:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:06] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2020-06-03 05:55:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:06] [INFO ] Deduced a trap composed of 29 places in 94 ms
[2020-06-03 05:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-06-03 05:55:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-06-03 05:55:07] [INFO ] Added : 110 causal constraints over 23 iterations in 327 ms. Result :sat
[2020-06-03 05:55:07] [INFO ] Deduced a trap composed of 8 places in 541 ms
[2020-06-03 05:55:08] [INFO ] Deduced a trap composed of 29 places in 539 ms
[2020-06-03 05:55:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1143 ms
[2020-06-03 05:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:55:08] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:08] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-03 05:55:08] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:55:08] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 16 ms returned sat
[2020-06-03 05:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:08] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-03 05:55:08] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:55:08] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 25 ms.
[2020-06-03 05:55:09] [INFO ] Added : 105 causal constraints over 21 iterations in 356 ms. Result :sat
[2020-06-03 05:55:09] [INFO ] Deduced a trap composed of 11 places in 633 ms
[2020-06-03 05:55:10] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-06-03 05:55:10] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2020-06-03 05:55:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 849 ms
[2020-06-03 05:55:10] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:55:10] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:10] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 05:55:10] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:55:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:55:10] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:10] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-03 05:55:10] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:10] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2020-06-03 05:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-06-03 05:55:10] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 23 ms.
[2020-06-03 05:55:10] [INFO ] Added : 110 causal constraints over 23 iterations in 410 ms. Result :sat
[2020-06-03 05:55:11] [INFO ] Deduced a trap composed of 8 places in 245 ms
[2020-06-03 05:55:11] [INFO ] Deduced a trap composed of 29 places in 50 ms
[2020-06-03 05:55:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2020-06-03 05:55:11] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:55:11] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:11] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-03 05:55:11] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-06-03 05:55:11] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:11] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-03 05:55:11] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:55:11] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 21 ms.
[2020-06-03 05:55:12] [INFO ] Added : 117 causal constraints over 24 iterations in 479 ms. Result :sat
[2020-06-03 05:55:12] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-06-03 05:55:12] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-03 05:55:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2020-06-03 05:55:12] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-06-03 05:55:12] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:12] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-03 05:55:12] [INFO ] [Real]Added 26 Read/Feed constraints in 31 ms returned sat
[2020-06-03 05:55:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:55:12] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:13] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2020-06-03 05:55:13] [INFO ] [Nat]Added 26 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:55:13] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-06-03 05:55:13] [INFO ] Added : 117 causal constraints over 24 iterations in 558 ms. Result :sat
[2020-06-03 05:55:13] [INFO ] Deduced a trap composed of 11 places in 114 ms
[2020-06-03 05:55:13] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2020-06-03 05:55:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2020-06-03 05:55:13] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-03 05:55:13] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:14] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-06-03 05:55:14] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:14] [INFO ] Deduced a trap composed of 8 places in 260 ms
[2020-06-03 05:55:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2020-06-03 05:55:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 21 ms returned sat
[2020-06-03 05:55:14] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:14] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2020-06-03 05:55:14] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:14] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-06-03 05:55:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2020-06-03 05:55:14] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:55:15] [INFO ] Added : 114 causal constraints over 23 iterations in 375 ms. Result :sat
[2020-06-03 05:55:15] [INFO ] Deduced a trap composed of 15 places in 57 ms
[2020-06-03 05:55:15] [INFO ] Deduced a trap composed of 8 places in 453 ms
[2020-06-03 05:55:15] [INFO ] Deduced a trap composed of 15 places in 170 ms
[2020-06-03 05:55:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 742 ms
[2020-06-03 05:55:16] [INFO ] [Real]Absence check using 8 positive place invariants in 66 ms returned sat
[2020-06-03 05:55:16] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 24 ms returned sat
[2020-06-03 05:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:16] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2020-06-03 05:55:16] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:16] [INFO ] Deduced a trap composed of 12 places in 249 ms
[2020-06-03 05:55:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2020-06-03 05:55:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:55:16] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:16] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2020-06-03 05:55:16] [INFO ] [Nat]Added 26 Read/Feed constraints in 32 ms returned sat
[2020-06-03 05:55:17] [INFO ] Deduced a trap composed of 12 places in 907 ms
[2020-06-03 05:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 919 ms
[2020-06-03 05:55:17] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-06-03 05:55:18] [INFO ] Added : 117 causal constraints over 24 iterations in 453 ms. Result :sat
[2020-06-03 05:55:18] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-06-03 05:55:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 21 ms returned sat
[2020-06-03 05:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:19] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2020-06-03 05:55:19] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:55:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:55:19] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:19] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2020-06-03 05:55:19] [INFO ] [Nat]Added 26 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:55:19] [INFO ] Deduced a trap composed of 22 places in 365 ms
[2020-06-03 05:55:19] [INFO ] Deduced a trap composed of 22 places in 101 ms
[2020-06-03 05:55:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 494 ms
[2020-06-03 05:55:20] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:55:20] [INFO ] Added : 115 causal constraints over 24 iterations in 463 ms. Result :sat
[2020-06-03 05:55:20] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2020-06-03 05:55:20] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-03 05:55:20] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:55:20] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:20] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-06-03 05:55:20] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:21] [INFO ] Deduced a trap composed of 11 places in 261 ms
[2020-06-03 05:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2020-06-03 05:55:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:55:21] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 17 ms returned sat
[2020-06-03 05:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:21] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-03 05:55:21] [INFO ] [Nat]Added 26 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:55:21] [INFO ] Deduced a trap composed of 12 places in 245 ms
[2020-06-03 05:55:21] [INFO ] Deduced a trap composed of 8 places in 264 ms
[2020-06-03 05:55:22] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 05:55:22] [INFO ] Deduced a trap composed of 22 places in 195 ms
[2020-06-03 05:55:22] [INFO ] Deduced a trap composed of 28 places in 46 ms
[2020-06-03 05:55:22] [INFO ] Deduced a trap composed of 22 places in 626 ms
[2020-06-03 05:55:23] [INFO ] Deduced a trap composed of 26 places in 87 ms
[2020-06-03 05:55:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1629 ms
[2020-06-03 05:55:23] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:55:23] [INFO ] Added : 117 causal constraints over 24 iterations in 629 ms. Result :sat
[2020-06-03 05:55:23] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-06-03 05:55:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 05:55:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 05:55:24] [INFO ] Flatten gal took : 123 ms
FORMULA Peterson-PT-2-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:55:24] [INFO ] Flatten gal took : 18 ms
[2020-06-03 05:55:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 29 ms.
[2020-06-03 05:55:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Peterson-PT-2 @ 3570 seconds

FORMULA Peterson-PT-2-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ Peterson-PT-2

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:55:25 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 18,
"adisj": 1,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (X (G ((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0))))))",
"processed_size": 588,
"rewrites": 75
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 49,
"adisj": 21,
"aneg": 1,
"comp": 132,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 132,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "G ((X ((((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86)))) AND (X (X ((X (G ((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0))))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))))) OR (((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0))))))",
"processed_size": 2153,
"rewrites": 75
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 48,
"adisj": 3,
"aneg": 1,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "F ((X (X ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))))) OR (X ((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0)))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))))))",
"processed_size": 1562,
"rewrites": 75
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 2,
"X": 2,
"aconj": 13,
"adisj": 16,
"aneg": 0,
"comp": 75,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 75,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) U ((1 <= p21) OR (1 <= p22) OR (1 <= p24))) U (X (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11)))) OR (G (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))) AND X (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11)))))))",
"processed_size": 1185,
"rewrites": 75
},
"result":
{
"edges": 6423,
"markings": 3105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 36,
"adisj": 6,
"aneg": 0,
"comp": 105,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 105,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "F ((X ((X (G ((F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))) AND ((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))) OR ((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78)))))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))))) AND (((1 <= p80) OR (1 <= p83) OR (1 <= p69) OR (1 <= p73) OR (1 <= p72) OR (1 <= p62)) AND ((1 <= p17) OR (1 <= p19) OR (1 <= p20)))))",
"processed_size": 1689,
"rewrites": 75
},
"result":
{
"edges": 4063,
"markings": 1551,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 12,
"adisj": 2,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(X (X ((((p65 <= 0) OR (p89 <= 0)) AND ((p57 <= 0) OR (p79 <= 0)) AND ((p61 <= 0) OR (p86 <= 0)) AND ((p68 <= 0) OR (p92 <= 0)) AND ((p66 <= 0) OR (p91 <= 0)) AND ((p67 <= 0) OR (p90 <= 0))))) U G ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))))",
"processed_size": 395,
"rewrites": 75
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((((1 <= p57) AND (1 <= p89)) U (1 <= p72)) AND (((1 <= p21) U G ((X (((1 <= p57) AND (1 <= p89))) OR ((1 <= p46) AND (1 <= p60))))) AND ((p57 <= 0) OR (p89 <= 0)))))",
"processed_size": 170,
"rewrites": 75
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X ((X (F ((p12 <= 0))) OR G (((1 <= p66) AND (1 <= p89))))) AND ((p12 <= 0) AND ((p47 <= 0) OR (p56 <= 0)))))",
"processed_size": 114,
"rewrites": 75
},
"result":
{
"edges": 12,
"markings": 10,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((((p92 <= 0) OR (p96 <= 0)) AND (G (((p92 <= 0) OR (p96 <= 0))) OR G (F (((p92 <= 0) OR (p96 <= 0))))))) AND (X (((p47 <= 0) OR (p88 <= 0))) OR ((p92 <= 0) OR (p96 <= 0)))))",
"processed_size": 184,
"rewrites": 75
},
"result":
{
"edges": 253,
"markings": 208,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((p46 <= 0) OR (p87 <= 0))))",
"processed_size": 35,
"rewrites": 75
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "(X (F ((1 <= p21))) U ((p46 <= 0) OR (p87 <= 0)))",
"processed_size": 50,
"rewrites": 75
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 5,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((G ((F (((p61 <= 0) OR (p86 <= 0))) OR (p24 <= 0))) OR (((p46 <= 0) OR (p59 <= 0)) AND (F (((p61 <= 0) OR (p86 <= 0))) OR (p24 <= 0))))))",
"processed_size": 146,
"rewrites": 75
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p17 <= 0) AND (p19 <= 0) AND (p20 <= 0))",
"processed_size": 42,
"rewrites": 77
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G (((1 <= p44) AND (1 <= p51))))",
"processed_size": 35,
"rewrites": 75
},
"result":
{
"edges": 32,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 3,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p47) AND (1 <= p88)) OR (G (F ((1 <= p72))) AND F (((1 <= p47) AND (1 <= p88)))))) AND (((p47 <= 0) OR (p88 <= 0)) OR (((1 <= p47) AND (1 <= p88)) OR (G (F ((1 <= p72))) AND F (((1 <= p47) AND (1 <= p88))))))))",
"processed_size": 226,
"rewrites": 75
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 13,
"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": 3566
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((1 <= p80) OR (p68 <= 0) OR (p86 <= 0)) AND ((p84 <= 0) OR (p22 <= 0))))",
"processed_size": 80,
"rewrites": 75
},
"result":
{
"edges": 651,
"markings": 462,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 101868,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(*))) : G((X(**) AND (X(X((X(G(*)) AND **))) OR **))) : F(**) : F((X(X(**)) OR (X(*) AND **))) : ((** U **) U (X(F(**)) OR (G(F(**)) AND X(F(**))))) : F((X((X(G((F(**) AND (** OR **)))) AND **)) AND (** AND **))) : (X(X(*)) U G(**)) : G((F((** OR (G(F(**)) AND F(**)))) AND (** OR (** OR (G(F(**)) AND F(**)))))) : X(((** U **) AND ((** U G((X(**) OR **))) AND **))) : F((X((X(F(*)) OR G(**))) AND (** AND **))) : F((F((* AND (G(*) OR G(F(*))))) AND (X(*) OR (** OR **)))) : ((X(F(**)) U **) OR X(G(*))) : F(G(*)) : X(F((G((F(*) OR *)) OR (* AND (F(*) OR *))))) : G(*)"
},
"net":
{
"arcs": 384,
"conflict_clusters": 65,
"places": 102,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 126
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no no no yes no ",
"value": "no no no no no no no no no yes no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 228/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 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: X (NOT(F (X ((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))))))) : G ((X ((((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86)))) AND (X (X ((X (NOT(F ((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))))) OR (((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0)))))) : F (((1 <= p17) OR (1 <= p19) OR (1 <= p20))) : F ((X (X ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))))) OR (NOT(X ((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))))) : (((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) U ((1 <= p21) OR (1 <= p22) OR (1 <= p24))) U (G (X (G (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))))) U F (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11)))))) : F (((X ((X (G (((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))) U ((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))))) AND ((1 <= p80) OR (1 <= p83) OR (1 <= p69) OR (1 <= p73) OR (1 <= p72) OR (1 <= p62))) AND ((1 <= p17) OR (1 <= p19) OR (1 <= p20)))) : (NOT(X (X ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))))) U G ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90))))) : G ((((p47 <= 0) OR (p88 <= 0)) U (G (F ((1 <= p72))) U ((1 <= p47) AND (1 <= p88))))) : X ((((((1 <= p57) AND (1 <= p89)) U (1 <= p72)) AND ((1 <= p21) U G ((X (((1 <= p57) AND (1 <= p89))) OR ((1 <= p46) AND (1 <= p60)))))) AND ((p57 <= 0) OR (p89 <= 0)))) : F (((NOT(X ((G (X ((1 <= p12))) AND NOT(G (((1 <= p66) AND (1 <= p89))))))) AND (p12 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)))) : F ((NOT(G ((F (G (((1 <= p92) AND (1 <= p96)))) U ((1 <= p92) AND (1 <= p96))))) AND ((NOT(X (((1 <= p47) AND (1 <= p88)))) OR (p92 <= 0)) OR (p96 <= 0)))) : ((F (X ((1 <= p21))) U ((p46 <= 0) OR (p87 <= 0))) OR NOT(F (X (((1 <= p46) AND (1 <= p87)))))) : G (F (NOT(F (((p44 <= 0) OR (p51 <= 0)))))) : NOT(G (X ((((1 <= p46) AND (1 <= p59)) U (G (((1 <= p61) AND (1 <= p86))) AND (1 <= p24)))))) : NOT(F ((((p80 <= 0) AND (1 <= p68) AND (1 <= p86)) OR ((1 <= p84) AND (1 <= p22)))))
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: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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p... (shortened)
lola: processed formula length: 588
lola: 75 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86)))) AND (X (X ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86)))) AND (X (X ... (shortened)
lola: processed formula length: 2153
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))))) OR (X ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))))) OR (X ... (shortened)
lola: processed formula length: 1562
lola: 75 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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) U ((1 <= p21) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) U ((1 <= p21) OR... (shortened)
lola: processed formula length: 1185
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 3105 markings, 6423 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((X (G ((F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))) AND ((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((X (G ((F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))) AND ((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1... (shortened)
lola: processed formula length: 1689
lola: 75 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: 1551 markings, 4063 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((p65 <= 0) OR (p89 <= 0)) AND ((p57 <= 0) OR (p79 <= 0)) AND ((p61 <= 0) OR (p86 <= 0)) AND ((p68 <= 0) OR (p92 <= 0)) AND ((p66 <= 0) OR (p91 <= 0)) AND ((p67 <= 0) OR (p90 <= 0))))) U G ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((((p65 <= 0) OR (p89 <= 0)) AND ((p57 <= 0) OR (p79 <= 0)) AND ((p61 <= 0) OR (p86 <= 0)) AND ((p68 <= 0) OR (p92 <= 0)) AND ((p66 <= 0) OR (p91 <= 0)) AND ((p67 <= 0) OR (p90 <= 0))))) U G ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))))
lola: processed formula length: 395
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p57) AND (1 <= p89)) U (1 <= p72)) AND (((1 <= p21) U G ((X (((1 <= p57) AND (1 <= p89))) OR ((1 <= p46) AND (1 <= p60))))) AND ((p57 <= 0) OR (p89 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p57) AND (1 <= p89)) U (1 <= p72)) AND (((1 <= p21) U G ((X (((1 <= p57) AND (1 <= p89))) OR ((1 <= p46) AND (1 <= p60))))) AND ((p57 <= 0) OR (p89 <= 0)))))
lola: processed formula length: 170
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((X (F ((p12 <= 0))) OR G (((1 <= p66) AND (1 <= p89))))) AND ((p12 <= 0) AND ((p47 <= 0) OR (p56 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((X (F ((p12 <= 0))) OR G (((1 <= p66) AND (1 <= p89))))) AND ((p12 <= 0) AND ((p47 <= 0) OR (p56 <= 0)))))
lola: processed formula length: 114
lola: 75 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: 10 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((p92 <= 0) OR (p96 <= 0)) AND (G (((p92 <= 0) OR (p96 <= 0))) OR G (F (((p92 <= 0) OR (p96 <= 0))))))) AND (X (((p47 <= 0) OR (p88 <= 0))) OR ((p92 <= 0) OR (p96 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((p92 <= 0) OR (p96 <= 0)) AND (G (((p92 <= 0) OR (p96 <= 0))) OR G (F (((p92 <= 0) OR (p96 <= 0))))))) AND (X (((p47 <= 0) OR (p88 <= 0))) OR ((p92 <= 0) OR (p96 <= 0)))))
lola: processed formula length: 184
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 208 markings, 253 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((1 <= p21))) U ((p46 <= 0) OR (p87 <= 0))) OR X (G (((p46 <= 0) OR (p87 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p46 <= 0) OR (p87 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p46 <= 0) OR (p87 <= 0))))
lola: processed formula length: 35
lola: 75 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p21))) U ((p46 <= 0) OR (p87 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((1 <= p21))) U ((p46 <= 0) OR (p87 <= 0)))
lola: processed formula length: 50
lola: 75 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: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F (((p61 <= 0) OR (p86 <= 0))) OR (p24 <= 0))) OR (((p46 <= 0) OR (p59 <= 0)) AND (F (((p61 <= 0) OR (p86 <= 0))) OR (p24 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F (((p61 <= 0) OR (p86 <= 0))) OR (p24 <= 0))) OR (((p46 <= 0) OR (p59 <= 0)) AND (F (((p61 <= 0) OR (p86 <= 0))) OR (p24 <= 0))))))
lola: processed formula length: 146
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p17) OR (1 <= p19) OR (1 <= p20)))
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: ((p17 <= 0) AND (p19 <= 0) AND (p20 <= 0))
lola: processed formula length: 42
lola: 77 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p44) AND (1 <= p51))))
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 <= p44) AND (1 <= p51))))
lola: processed formula length: 35
lola: 75 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: 31 markings, 32 edges
lola: ========================================
lola: subprocess 13 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p47) AND (1 <= p88)) OR (G (F ((1 <= p72))) AND F (((1 <= p47) AND (1 <= p88)))))) AND (((p47 <= 0) OR (p88 <= 0)) OR (((1 <= p47) AND (1 <= p88)) OR (G (F ((1 <= p72))) AND F (((1 <= p47) AND (1 <= p88))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p47) AND (1 <= p88)) OR (G (F ((1 <= p72))) AND F (((1 <= p47) AND (1 <= p88)))))) AND (((p47 <= 0) OR (p88 <= 0)) OR (((1 <= p47) AND (1 <= p88)) OR (G (F ((1 <= p72))) AND F (((1 <= p47) AND (1 <= p88))))))))
lola: processed formula length: 226
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 14 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p80) OR (p68 <= 0) OR (p86 <= 0)) AND ((p84 <= 0) OR (p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p80) OR (p68 <= 0) OR (p86 <= 0)) AND ((p84 <= 0) OR (p22 <= 0))))
lola: processed formula length: 80
lola: 75 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: 462 markings, 651 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no no no yes no
lola:
preliminary result: no no no no no no no no no yes no no no yes no
lola: memory consumption: 101868 KB
lola: time consumption: 4 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="Peterson-PT-2"
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 Peterson-PT-2, 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 r174-csrt-158987853600706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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