Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038006200250.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is AutoFlight-PT-48a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006200250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 309K May 5 16:51 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 AutoFlight-PT-48a-00
FORMULA_NAME AutoFlight-PT-48a-01
FORMULA_NAME AutoFlight-PT-48a-02
FORMULA_NAME AutoFlight-PT-48a-03
FORMULA_NAME AutoFlight-PT-48a-04
FORMULA_NAME AutoFlight-PT-48a-05
FORMULA_NAME AutoFlight-PT-48a-06
FORMULA_NAME AutoFlight-PT-48a-07
FORMULA_NAME AutoFlight-PT-48a-08
FORMULA_NAME AutoFlight-PT-48a-09
FORMULA_NAME AutoFlight-PT-48a-10
FORMULA_NAME AutoFlight-PT-48a-11
FORMULA_NAME AutoFlight-PT-48a-12
FORMULA_NAME AutoFlight-PT-48a-13
FORMULA_NAME AutoFlight-PT-48a-14
FORMULA_NAME AutoFlight-PT-48a-15

=== Now, execution of the tool begins

BK_START 1620440328133

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 02:18:49] [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]
[2021-05-08 02:18:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 02:18:49] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2021-05-08 02:18:49] [INFO ] Transformed 1127 places.
[2021-05-08 02:18:49] [INFO ] Transformed 1113 transitions.
[2021-05-08 02:18:49] [INFO ] Found NUPN structural information;
[2021-05-08 02:18:49] [INFO ] Parsed PT model containing 1127 places and 1113 transitions in 150 ms.
Ensure Unique test removed 192 transitions
Reduce redundant transitions removed 192 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 691 resets, run finished after 974 ms. (steps per millisecond=102 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 921 rows 1127 cols
[2021-05-08 02:18:50] [INFO ] Computed 258 place invariants in 40 ms
[2021-05-08 02:18:51] [INFO ] [Real]Absence check using 257 positive place invariants in 181 ms returned sat
[2021-05-08 02:18:51] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 02:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:18:53] [INFO ] [Real]Absence check using state equation in 2176 ms returned sat
[2021-05-08 02:18:53] [INFO ] State equation strengthened by 192 read => feed constraints.
[2021-05-08 02:18:53] [INFO ] [Real]Added 192 Read/Feed constraints in 24 ms returned sat
[2021-05-08 02:18:53] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 97 ms.
[2021-05-08 02:18:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:18:54] [INFO ] [Nat]Absence check using 257 positive place invariants in 196 ms returned sat
[2021-05-08 02:18:54] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:18:56] [INFO ] [Nat]Absence check using state equation in 2179 ms returned sat
[2021-05-08 02:18:56] [INFO ] [Nat]Added 192 Read/Feed constraints in 40 ms returned sat
[2021-05-08 02:18:56] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 59 ms.
[2021-05-08 02:19:11] [INFO ] Added : 799 causal constraints over 160 iterations in 15133 ms. Result :sat
[2021-05-08 02:19:11] [INFO ] [Real]Absence check using 257 positive place invariants in 161 ms returned sat
[2021-05-08 02:19:11] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 02:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:19:14] [INFO ] [Real]Absence check using state equation in 2163 ms returned sat
[2021-05-08 02:19:14] [INFO ] [Real]Added 192 Read/Feed constraints in 20 ms returned sat
[2021-05-08 02:19:14] [INFO ] Deduced a trap composed of 584 places in 509 ms
[2021-05-08 02:19:15] [INFO ] Deduced a trap composed of 588 places in 351 ms
[2021-05-08 02:19:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 973 ms
[2021-05-08 02:19:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:19:15] [INFO ] [Nat]Absence check using 257 positive place invariants in 161 ms returned sat
[2021-05-08 02:19:15] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:19:17] [INFO ] [Nat]Absence check using state equation in 2141 ms returned sat
[2021-05-08 02:19:17] [INFO ] [Nat]Added 192 Read/Feed constraints in 36 ms returned sat
[2021-05-08 02:19:18] [INFO ] Deduced a trap composed of 584 places in 321 ms
[2021-05-08 02:19:18] [INFO ] Deduced a trap composed of 588 places in 334 ms
[2021-05-08 02:19:18] [INFO ] Deduced a trap composed of 585 places in 338 ms
[2021-05-08 02:19:19] [INFO ] Deduced a trap composed of 595 places in 347 ms
[2021-05-08 02:19:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1536 ms
[2021-05-08 02:19:19] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 49 ms.
[2021-05-08 02:19:35] [INFO ] Added : 880 causal constraints over 176 iterations in 15963 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-08 02:19:35] [INFO ] [Real]Absence check using 257 positive place invariants in 157 ms returned sat
[2021-05-08 02:19:35] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 02:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:19:37] [INFO ] [Real]Absence check using state equation in 2137 ms returned sat
[2021-05-08 02:19:37] [INFO ] [Real]Added 192 Read/Feed constraints in 18 ms returned sat
[2021-05-08 02:19:38] [INFO ] Deduced a trap composed of 570 places in 331 ms
[2021-05-08 02:19:38] [INFO ] Deduced a trap composed of 569 places in 324 ms
[2021-05-08 02:19:38] [INFO ] Deduced a trap composed of 568 places in 326 ms
[2021-05-08 02:19:39] [INFO ] Deduced a trap composed of 583 places in 321 ms
[2021-05-08 02:19:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1482 ms
[2021-05-08 02:19:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:19:39] [INFO ] [Nat]Absence check using 257 positive place invariants in 155 ms returned sat
[2021-05-08 02:19:39] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:19:41] [INFO ] [Nat]Absence check using state equation in 2181 ms returned sat
[2021-05-08 02:19:41] [INFO ] [Nat]Added 192 Read/Feed constraints in 35 ms returned sat
[2021-05-08 02:19:42] [INFO ] Deduced a trap composed of 464 places in 334 ms
[2021-05-08 02:19:42] [INFO ] Deduced a trap composed of 575 places in 371 ms
[2021-05-08 02:19:42] [INFO ] Deduced a trap composed of 572 places in 364 ms
[2021-05-08 02:19:43] [INFO ] Deduced a trap composed of 570 places in 335 ms
[2021-05-08 02:19:43] [INFO ] Deduced a trap composed of 569 places in 332 ms
[2021-05-08 02:19:43] [INFO ] Deduced a trap composed of 568 places in 325 ms
[2021-05-08 02:19:44] [INFO ] Deduced a trap composed of 583 places in 332 ms
[2021-05-08 02:19:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2723 ms
[2021-05-08 02:19:44] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 48 ms.
[2021-05-08 02:19:59] [INFO ] Added : 890 causal constraints over 178 iterations in 14776 ms. Result :unknown
[2021-05-08 02:19:59] [INFO ] [Real]Absence check using 257 positive place invariants in 156 ms returned sat
[2021-05-08 02:19:59] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:20:01] [INFO ] [Real]Absence check using state equation in 2118 ms returned sat
[2021-05-08 02:20:01] [INFO ] [Real]Added 192 Read/Feed constraints in 18 ms returned sat
[2021-05-08 02:20:01] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 63 ms.
[2021-05-08 02:20:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:20:02] [INFO ] [Nat]Absence check using 257 positive place invariants in 155 ms returned sat
[2021-05-08 02:20:02] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:20:04] [INFO ] [Nat]Absence check using state equation in 2134 ms returned sat
[2021-05-08 02:20:04] [INFO ] [Nat]Added 192 Read/Feed constraints in 37 ms returned sat
[2021-05-08 02:20:04] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 49 ms.
[2021-05-08 02:20:14] [INFO ] Added : 634 causal constraints over 127 iterations in 10647 ms. Result :sat
[2021-05-08 02:20:15] [INFO ] [Real]Absence check using 257 positive place invariants in 156 ms returned sat
[2021-05-08 02:20:15] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:20:17] [INFO ] [Real]Absence check using state equation in 2106 ms returned sat
[2021-05-08 02:20:17] [INFO ] [Real]Added 192 Read/Feed constraints in 19 ms returned sat
[2021-05-08 02:20:17] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 50 ms.
[2021-05-08 02:20:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:20:18] [INFO ] [Nat]Absence check using 257 positive place invariants in 161 ms returned sat
[2021-05-08 02:20:18] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:20:20] [INFO ] [Nat]Absence check using state equation in 2204 ms returned sat
[2021-05-08 02:20:20] [INFO ] [Nat]Added 192 Read/Feed constraints in 39 ms returned sat
[2021-05-08 02:20:20] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 57 ms.
[2021-05-08 02:20:34] [INFO ] Added : 747 causal constraints over 150 iterations in 14485 ms. Result :sat
[2021-05-08 02:20:35] [INFO ] [Real]Absence check using 257 positive place invariants in 158 ms returned sat
[2021-05-08 02:20:35] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:20:37] [INFO ] [Real]Absence check using state equation in 2130 ms returned sat
[2021-05-08 02:20:37] [INFO ] [Real]Added 192 Read/Feed constraints in 19 ms returned sat
[2021-05-08 02:20:37] [INFO ] Deduced a trap composed of 585 places in 313 ms
[2021-05-08 02:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2021-05-08 02:20:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:20:38] [INFO ] [Nat]Absence check using 257 positive place invariants in 156 ms returned sat
[2021-05-08 02:20:38] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:20:40] [INFO ] [Nat]Absence check using state equation in 2152 ms returned sat
[2021-05-08 02:20:40] [INFO ] [Nat]Added 192 Read/Feed constraints in 35 ms returned sat
[2021-05-08 02:20:40] [INFO ] Deduced a trap composed of 585 places in 290 ms
[2021-05-08 02:20:40] [INFO ] Deduced a trap composed of 587 places in 309 ms
[2021-05-08 02:20:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 713 ms
[2021-05-08 02:20:40] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 47 ms.
[2021-05-08 02:20:57] [INFO ] Added : 845 causal constraints over 169 iterations in 16813 ms. Result :unknown
[2021-05-08 02:20:58] [INFO ] [Real]Absence check using 257 positive place invariants in 157 ms returned sat
[2021-05-08 02:20:58] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:21:00] [INFO ] [Real]Absence check using state equation in 2140 ms returned sat
[2021-05-08 02:21:00] [INFO ] [Real]Added 192 Read/Feed constraints in 18 ms returned sat
[2021-05-08 02:21:00] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 48 ms.
[2021-05-08 02:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:21:00] [INFO ] [Nat]Absence check using 257 positive place invariants in 154 ms returned sat
[2021-05-08 02:21:00] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:21:02] [INFO ] [Nat]Absence check using state equation in 2110 ms returned sat
[2021-05-08 02:21:02] [INFO ] [Nat]Added 192 Read/Feed constraints in 36 ms returned sat
[2021-05-08 02:21:02] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 46 ms.
[2021-05-08 02:21:20] [INFO ] Added : 899 causal constraints over 180 iterations in 17545 ms. Result :unknown
[2021-05-08 02:21:20] [INFO ] [Real]Absence check using 257 positive place invariants in 156 ms returned sat
[2021-05-08 02:21:20] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 02:21:22] [INFO ] [Real]Absence check using state equation in 2160 ms returned sat
[2021-05-08 02:21:22] [INFO ] [Real]Added 192 Read/Feed constraints in 19 ms returned sat
[2021-05-08 02:21:23] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 45 ms.
[2021-05-08 02:21:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 02:21:23] [INFO ] [Nat]Absence check using 257 positive place invariants in 155 ms returned sat
[2021-05-08 02:21:23] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 02:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 02:21:25] [INFO ] [Nat]Absence check using state equation in 2126 ms returned sat
[2021-05-08 02:21:25] [INFO ] [Nat]Added 192 Read/Feed constraints in 36 ms returned sat
[2021-05-08 02:21:25] [INFO ] Computed and/alt/rep : 920/7152/920 causal constraints in 46 ms.
[2021-05-08 02:21:43] [INFO ] Added : 830 causal constraints over 166 iterations in 17526 ms. Result :unknown
[2021-05-08 02:21:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-08 02:21:43] [INFO ] Flatten gal took : 139 ms
FORMULA AutoFlight-PT-48a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 02:21:43] [INFO ] Applying decomposition
[2021-05-08 02:21:43] [INFO ] Flatten gal took : 78 ms
[2021-05-08 02:21:43] [INFO ] Decomposing Gal with order
[2021-05-08 02:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 02:21:43] [INFO ] Removed a total of 210 redundant transitions.
[2021-05-08 02:21:43] [INFO ] Flatten gal took : 131 ms
[2021-05-08 02:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 54 ms.
[2021-05-08 02:21:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-08 02:21:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ AutoFlight-PT-48a @ 3570 seconds

FORMULA AutoFlight-PT-48a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-48a-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2127
rslt: Output for LTLFireability @ AutoFlight-PT-48a

{
"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": "Sat May 8 02:21:45 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 1,
"aconj": 9,
"adisj": 0,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND (((1 <= p974)) AND ((1 <= p1125))))) AND (X (((1 <= p338))) OR ((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND (((1 <= p974)) AND ((1 <= p1125))))))))",
"processed_size": 254,
"rewrites": 64
},
"result":
{
"edges": 128,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (G ((G (((1 <= p158) AND (1 <= p736))) AND (((1 <= p158)) AND ((1 <= p736)))))) U ((1 <= p34)))",
"processed_size": 98,
"rewrites": 64
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X ((F ((G (((1 <= p547))) AND ((1 <= p547)))) AND X (((1 <= p66))))) AND F (((1 <= p296)))))",
"processed_size": 96,
"rewrites": 64
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": "(((p224 <= 0) OR (p611 <= 0)) U (X (((1 <= p812))) AND ((1 <= p329))))",
"processed_size": 71,
"rewrites": 64
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((G (((1 <= p469))) AND ((1 <= p469)))) OR (F (((1 <= p380) AND (1 <= p469))) OR G (((1 <= p380))))))",
"processed_size": 107,
"rewrites": 64
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 451
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 451
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p110 <= 0))",
"processed_size": 13,
"rewrites": 66
},
"result":
{
"edges": 125,
"markings": 126,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 526
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (((p818 <= 0))) AND (G (((1 <= p54))) AND ((p747 <= 0) OR (p54 <= 0)))))",
"processed_size": 79,
"rewrites": 64
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 631
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 789
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (G (((1 <= p603)))) AND (F (((p591 <= 0))) OR X (G (((1 <= p603)))))))",
"processed_size": 76,
"rewrites": 64
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 789
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((((1 <= p789)) U (((1 <= p797)) OR (G (((1 <= p212))) AND F (((1 <= p797)))))) AND (X (((1 <= p789))) AND G (((1 <= p212)))))))",
"processed_size": 134,
"rewrites": 64
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"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": 1053
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F (((p192 <= 0))) AND ((X (X (F (((p303 <= 0) OR (p937 <= 0))))) AND (((1 <= p178)) OR ((1 <= p1089) AND (1 <= p1126)))) OR ((p192 <= 0)))))",
"processed_size": 146,
"rewrites": 64
},
"result":
{
"edges": 62647,
"markings": 20657,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1579
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p582))))",
"processed_size": 21,
"rewrites": 64
},
"result":
{
"edges": 128,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3159
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p368 <= 0))",
"processed_size": 13,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3312,
"runtime": 1443.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F(G((F(((** U **) AND (** AND **))) AND (X(**) OR ((** U **) AND (** AND **)))))) : (X(G((G(**) AND (** AND **)))) U **) : G((X((F((G(**) AND **)) AND X(**))) AND F(**))) : ((** U G(**)) OR F(**)) : (** U (X(**) AND **)) : G(((G(*) OR *) AND X(X(F(*))))) : X((G((G(**) AND **)) OR (F(**) OR G(**)))) : (F(**) AND X(**)) : F((X(*) AND (G(**) AND **))) : (G((X(G(**)) AND (F(*) OR X(G(**))))) OR X(G(**))) : X(F(((** U (** OR (G(**) AND F(**)))) AND (X(**) AND G(**))))) : G((F(**) AND ((X(X(F(*))) AND **) OR **)))"
},
"net":
{
"arcs": 3074,
"conflict_clusters": 639,
"places": 1127,
"places_significant": 869,
"singleton_clusters": 0,
"transitions": 921
},
"result":
{
"preliminary_value": "no no no no yes no unknown no no no no no no ",
"value": "no no no no yes no unknown no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2048/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1127
lola: finding significant places
lola: 1127 places, 921 transitions, 869 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p1018 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p582 <= 1)
lola: LP says that atomic proposition is always true: (p798 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p582 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p974 <= 1)
lola: LP says that atomic proposition is always true: (p1125 <= 1)
lola: LP says that atomic proposition is always true: (p370 <= 1)
lola: LP says that atomic proposition is always true: (p1074 <= 1)
lola: LP says that atomic proposition is always true: (p974 <= 1)
lola: LP says that atomic proposition is always true: (p1125 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p736 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p736 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p547 <= 1)
lola: LP says that atomic proposition is always true: (p547 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p368 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p368 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p611 <= 1)
lola: LP says that atomic proposition is always true: (p812 <= 1)
lola: LP says that atomic proposition is always true: (p329 <= 1)
lola: LP says that atomic proposition is always true: (p581 <= 1)
lola: LP says that atomic proposition is always true: (p1019 <= 1)
lola: LP says that atomic proposition is always true: (p1112 <= 1)
lola: LP says that atomic proposition is always true: (p1125 <= 1)
lola: LP says that atomic proposition is always true: (p469 <= 1)
lola: LP says that atomic proposition is always true: (p469 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p469 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p579 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p874 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p818 <= 1)
lola: LP says that atomic proposition is always true: (p818 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p747 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p591 <= 1)
lola: LP says that atomic proposition is always true: (p603 <= 1)
lola: LP says that atomic proposition is always true: (p343 <= 1)
lola: LP says that atomic proposition is always true: (p1020 <= 1)
lola: LP says that atomic proposition is always true: (p789 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p797 <= 1)
lola: LP says that atomic proposition is always true: (p789 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p937 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p1089 <= 1)
lola: LP says that atomic proposition is always true: (p1126 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: (F ((((F (((1 <= p1018))) OR ((1 <= p23))) OR ((1 <= p582))) OR ((1 <= p798) AND (1 <= p287)))) U F (G (((1 <= p582))))) : F (G (X ((X (((1 <= p338))) U (((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND ((1 <= p974))) AND ((1 <= p1125))))))) : (G (X (((G (((1 <= p158) AND (1 <= p736))) AND ((1 <= p158))) AND ((1 <= p736))))) U ((1 <= p34))) : G ((X ((F ((G (((1 <= p547))) AND ((1 <= p547)))) AND X (((1 <= p66))))) AND F (((1 <= p296))))) : ((((1 <= p368)) U G (((1 <= p202)))) OR F (((1 <= p368)))) : (((p224 <= 0) OR (p611 <= 0)) U (X (((1 <= p812))) AND ((1 <= p329)))) : NOT(F (((F (((p581 <= 0))) AND ((1 <= p1019))) OR G (X (NOT(F (NOT(X (((1 <= p1112) AND (1 <= p1125))))))))))) : X (((G ((G (((1 <= p469))) AND ((1 <= p469)))) OR F (((1 <= p380) AND (1 <= p469)))) OR G (((1 <= p380))))) : (F ((((1 <= p110)) U (F (((1 <= p579))) U (((1 <= p45) AND (1 <= p874)) U ((1 <= p110)))))) AND X (((1 <= p241)))) : (((1 <= p818)) U F (((NOT(X (((1 <= p818)))) AND G (((1 <= p54)))) AND ((p747 <= 0) OR (p54 <= 0))))) : (NOT(F ((G (((1 <= p591))) U X (NOT(G (((1 <= p603)))))))) OR G (X (((1 <= p343) AND (1 <= p1020))))) : F (X ((((((1 <= p789)) U (G (((1 <= p212))) U ((1 <= p797)))) AND X (((1 <= p789)))) AND G (((1 <= p212)))))) : G (((X (F (NOT(X (((1 <= p303) AND (1 <= p937)))))) AND (((1 <= p178)) OR ((1 <= p1089) AND (1 <= p1126)))) U ((p192 <= 0))))
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND (((1 <= p974)) AND ((1 <= p1125))))) AND (X (((1 <= p338))) OR ((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND (((1 <= p974)) AND ((1 <= p1125))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND (((1 <= p974)) AND ((1 <= p1125))))) AND (X (((1 <= p338))) OR ((((1 <= p974) AND (1 <= p1125)) U ((1 <= p370) AND (1 <= p1074))) AND (((1 <= p974)) AND ((1 <= p1125))))))))
lola: processed formula length: 254
lola: 64 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: 127 markings, 128 edges
lola: ========================================
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G (((1 <= p158) AND (1 <= p736))) AND (((1 <= p158)) AND ((1 <= p736)))))) U ((1 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((G (((1 <= p158) AND (1 <= p736))) AND (((1 <= p158)) AND ((1 <= p736)))))) U ((1 <= p34)))
lola: processed formula length: 98
lola: 64 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((F ((G (((1 <= p547))) AND ((1 <= p547)))) AND X (((1 <= p66))))) AND F (((1 <= p296)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((F ((G (((1 <= p547))) AND ((1 <= p547)))) AND X (((1 <= p66))))) AND F (((1 <= p296)))))
lola: processed formula length: 96
lola: 64 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: 127 markings, 127 edges
lola: ========================================
lola: subprocess 3 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p224 <= 0) OR (p611 <= 0)) U (X (((1 <= p812))) AND ((1 <= p329))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p224 <= 0) OR (p611 <= 0)) U (X (((1 <= p812))) AND ((1 <= p329))))
lola: processed formula length: 71
lola: 64 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 4 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G (((1 <= p581))) OR ((p1019 <= 0))) AND X (X (F (((p1112 <= 0) OR (p1125 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (((1 <= p581))) OR ((p1019 <= 0))) AND X (X (F (((p1112 <= 0) OR (p1125 <= 0)))))))
lola: processed formula length: 91
lola: 64 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: 457454 markings, 504362 edges, 91491 markings/sec, 0 secs
lola: 908163 markings, 1009918 edges, 90142 markings/sec, 5 secs
lola: 1357958 markings, 1515733 edges, 89959 markings/sec, 10 secs
lola: 1803176 markings, 2022385 edges, 89044 markings/sec, 15 secs
lola: 2252199 markings, 2527882 edges, 89805 markings/sec, 20 secs
lola: 2695906 markings, 3034211 edges, 88741 markings/sec, 25 secs
lola: 3137932 markings, 3540658 edges, 88405 markings/sec, 30 secs
lola: 3578351 markings, 4047804 edges, 88084 markings/sec, 35 secs
lola: 4026979 markings, 4553441 edges, 89726 markings/sec, 40 secs
lola: 4470675 markings, 5059785 edges, 88739 markings/sec, 45 secs
lola: 4912218 markings, 5566356 edges, 88309 markings/sec, 50 secs
lola: 5351136 markings, 6072898 edges, 87784 markings/sec, 55 secs
lola: 5792425 markings, 6579402 edges, 88258 markings/sec, 60 secs
lola: 6229903 markings, 7087037 edges, 87496 markings/sec, 65 secs
lola: 6664966 markings, 7594746 edges, 87013 markings/sec, 70 secs
lola: 7102860 markings, 8102335 edges, 87579 markings/sec, 75 secs
lola: 7550499 markings, 8608068 edges, 89528 markings/sec, 80 secs
lola: 7993768 markings, 9114030 edges, 88654 markings/sec, 85 secs
lola: 8434620 markings, 9620801 edges, 88170 markings/sec, 90 secs
lola: 8874281 markings, 10127481 edges, 87932 markings/sec, 95 secs
lola: 9314659 markings, 10633916 edges, 88076 markings/sec, 100 secs
lola: 9751423 markings, 11140738 edges, 87353 markings/sec, 105 secs
lola: 10185226 markings, 11647860 edges, 86761 markings/sec, 110 secs
lola: 10621958 markings, 12155317 edges, 87346 markings/sec, 115 secs
lola: 11062254 markings, 12661946 edges, 88059 markings/sec, 120 secs
lola: 11499261 markings, 13169139 edges, 87401 markings/sec, 125 secs
lola: 11932817 markings, 13676161 edges, 86711 markings/sec, 130 secs
lola: 12366525 markings, 14183638 edges, 86742 markings/sec, 135 secs
lola: 12800984 markings, 14691742 edges, 86892 markings/sec, 140 secs
lola: 13232103 markings, 15200064 edges, 86224 markings/sec, 145 secs
lola: 13660331 markings, 15708722 edges, 85646 markings/sec, 150 secs
lola: 14096392 markings, 16215922 edges, 87212 markings/sec, 155 secs
lola: 14542990 markings, 16721667 edges, 89320 markings/sec, 160 secs
lola: 14986572 markings, 17227850 edges, 88716 markings/sec, 165 secs
lola: 15426620 markings, 17734416 edges, 88010 markings/sec, 170 secs
lola: 15867127 markings, 18240971 edges, 88101 markings/sec, 175 secs
lola: 16307224 markings, 18747907 edges, 88019 markings/sec, 180 secs
lola: 16744367 markings, 19255123 edges, 87429 markings/sec, 185 secs
lola: 17177831 markings, 19762751 edges, 86693 markings/sec, 190 secs
lola: 17615665 markings, 20269593 edges, 87567 markings/sec, 195 secs
lola: 18055080 markings, 20775933 edges, 87883 markings/sec, 200 secs
lola: 18492077 markings, 21283031 edges, 87399 markings/sec, 205 secs
lola: 18924306 markings, 21789379 edges, 86446 markings/sec, 210 secs
lola: 19357705 markings, 22295664 edges, 86680 markings/sec, 215 secs
lola: 19790200 markings, 22802289 edges, 86499 markings/sec, 220 secs
lola: 20219733 markings, 23308875 edges, 85907 markings/sec, 225 secs
lola: 20645869 markings, 23815979 edges, 85227 markings/sec, 230 secs
lola: 21079563 markings, 24322066 edges, 86739 markings/sec, 235 secs
lola: 21518447 markings, 24827676 edges, 87777 markings/sec, 240 secs
lola: 21954478 markings, 25333588 edges, 87206 markings/sec, 245 secs
lola: 22387089 markings, 25840238 edges, 86522 markings/sec, 250 secs
lola: 22820583 markings, 26346831 edges, 86699 markings/sec, 255 secs
lola: 23253857 markings, 26854156 edges, 86655 markings/sec, 260 secs
lola: 23683864 markings, 27361251 edges, 86001 markings/sec, 265 secs
lola: 24110697 markings, 27869087 edges, 85367 markings/sec, 270 secs
lola: 24541243 markings, 28376395 edges, 86109 markings/sec, 275 secs
lola: 24973962 markings, 28882797 edges, 86544 markings/sec, 280 secs
lola: 25403545 markings, 29389516 edges, 85917 markings/sec, 285 secs
lola: 25828043 markings, 29894038 edges, 84900 markings/sec, 290 secs
lola: 26254094 markings, 30400513 edges, 85210 markings/sec, 295 secs
lola: 26680479 markings, 30906861 edges, 85277 markings/sec, 300 secs
lola: 27104143 markings, 31414366 edges, 84733 markings/sec, 305 secs
lola: 27525074 markings, 31921894 edges, 84186 markings/sec, 310 secs
lola: 27954319 markings, 32428563 edges, 85849 markings/sec, 315 secs
lola: 28401287 markings, 32933701 edges, 89394 markings/sec, 320 secs
lola: 28844192 markings, 33439387 edges, 88581 markings/sec, 325 secs
lola: 29284184 markings, 33945316 edges, 87998 markings/sec, 330 secs
lola: 29723336 markings, 34451188 edges, 87830 markings/sec, 335 secs
lola: 30163271 markings, 34957367 edges, 87987 markings/sec, 340 secs
lola: 30599323 markings, 35463383 edges, 87210 markings/sec, 345 secs
lola: 31032425 markings, 35969803 edges, 86620 markings/sec, 350 secs
lola: 31468593 markings, 36476351 edges, 87234 markings/sec, 355 secs
lola: 31908077 markings, 36982204 edges, 87897 markings/sec, 360 secs
lola: 32344575 markings, 37488799 edges, 87300 markings/sec, 365 secs
lola: 32777663 markings, 37995340 edges, 86618 markings/sec, 370 secs
lola: 33210765 markings, 38502014 edges, 86620 markings/sec, 375 secs
lola: 33644506 markings, 39009317 edges, 86748 markings/sec, 380 secs
lola: 34074779 markings, 39516598 edges, 86055 markings/sec, 385 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no no unknown no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8037904 KB
lola: time consumption: 411 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G (((1 <= p469))) AND ((1 <= p469)))) OR (F (((1 <= p380) AND (1 <= p469))) OR G (((1 <= p380))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G (((1 <= p469))) AND ((1 <= p469)))) OR (F (((1 <= p380) AND (1 <= p469))) OR G (((1 <= p380))))))
lola: processed formula length: 107
lola: 64 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 6 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p110))) AND X (((1 <= p241))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p110)))
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: ((p110 <= 0))
lola: processed formula length: 13
lola: 66 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: 126 markings, 125 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p818 <= 0))) AND (G (((1 <= p54))) AND ((p747 <= 0) OR (p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p818 <= 0))) AND (G (((1 <= p54))) AND ((p747 <= 0) OR (p54 <= 0)))))
lola: processed formula length: 79
lola: 64 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: 127 markings, 127 edges
lola: ========================================
lola: subprocess 8 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (G (((1 <= p603)))) AND (F (((p591 <= 0))) OR X (G (((1 <= p603))))))) OR X (G (((1 <= p343) AND (1 <= p1020)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p343) AND (1 <= p1020))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p343) AND (1 <= p1020))))
lola: processed formula length: 38
lola: 64 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 9 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((1 <= p603)))) AND (F (((p591 <= 0))) OR X (G (((1 <= p603)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((1 <= p603)))) AND (F (((p591 <= 0))) OR X (G (((1 <= p603)))))))
lola: processed formula length: 76
lola: 64 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: 126 markings, 126 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((1 <= p789)) U (((1 <= p797)) OR (G (((1 <= p212))) AND F (((1 <= p797)))))) AND (X (((1 <= p789))) AND G (((1 <= p212)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((1 <= p789)) U (((1 <= p797)) OR (G (((1 <= p212))) AND F (((1 <= p797)))))) AND (X (((1 <= p789))) AND G (((1 <= p212)))))))
lola: processed formula length: 134
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 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: 127 markings, 127 edges
lola: ========================================
lola: subprocess 10 will run for 1053 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p192 <= 0))) AND ((X (X (F (((p303 <= 0) OR (p937 <= 0))))) AND (((1 <= p178)) OR ((1 <= p1089) AND (1 <= p1126)))) OR ((p192 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p192 <= 0))) AND ((X (X (F (((p303 <= 0) OR (p937 <= 0))))) AND (((1 <= p178)) OR ((1 <= p1089) AND (1 <= p1126)))) OR ((p192 <= 0)))))
lola: processed formula length: 146
lola: 64 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: 20657 markings, 62647 edges
lola: ========================================
lola: subprocess 11 will run for 1579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p582))))
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 <= p582))))
lola: processed formula length: 21
lola: 64 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: 127 markings, 128 edges
lola: ========================================
lola: subprocess 12 will run for 3159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p368)) U G (((1 <= p202)))) OR F (((1 <= p368))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p368)))
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: ((p368 <= 0))
lola: processed formula length: 13
lola: 66 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((G (((1 <= p581))) OR ((p1019 <= 0))) AND X (X (F (((p1112 <= 0) OR (p1125 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (((1 <= p581))) OR ((p1019 <= 0))) AND X (X (F (((p1112 <= 0) OR (p1125 <= 0)))))))
lola: processed formula length: 91
lola: 64 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: 457799 markings, 504743 edges, 91560 markings/sec, 0 secs
lola: 908134 markings, 1009883 edges, 90067 markings/sec, 5 secs
lola: 1357624 markings, 1515372 edges, 89898 markings/sec, 10 secs
lola: 1802418 markings, 2021535 edges, 88959 markings/sec, 15 secs
lola: 2251162 markings, 2526671 edges, 89749 markings/sec, 20 secs
lola: 2694892 markings, 3033055 edges, 88746 markings/sec, 25 secs
lola: 3137051 markings, 3539626 edges, 88432 markings/sec, 30 secs
lola: 3577179 markings, 4046468 edges, 88026 markings/sec, 35 secs
lola: 4025381 markings, 4551648 edges, 89640 markings/sec, 40 secs
lola: 4468881 markings, 5057738 edges, 88700 markings/sec, 45 secs
lola: 4910651 markings, 5564537 edges, 88354 markings/sec, 50 secs
lola: 5349851 markings, 6071449 edges, 87840 markings/sec, 55 secs
lola: 5791237 markings, 6578013 edges, 88277 markings/sec, 60 secs
lola: 6228221 markings, 7085110 edges, 87397 markings/sec, 65 secs
lola: 6663031 markings, 7592473 edges, 86962 markings/sec, 70 secs
lola: 7100899 markings, 8100098 edges, 87574 markings/sec, 75 secs
lola: 7548247 markings, 8605505 edges, 89470 markings/sec, 80 secs
lola: 7991654 markings, 9111652 edges, 88681 markings/sec, 85 secs
lola: 8432402 markings, 9618215 edges, 88150 markings/sec, 90 secs
lola: 8871874 markings, 10124692 edges, 87894 markings/sec, 95 secs
lola: 9312113 markings, 10630917 edges, 88048 markings/sec, 100 secs
lola: 9748927 markings, 11137831 edges, 87363 markings/sec, 105 secs
lola: 10182890 markings, 11645098 edges, 86793 markings/sec, 110 secs
lola: 10619164 markings, 12152071 edges, 87255 markings/sec, 115 secs
lola: 11059263 markings, 12658433 edges, 88020 markings/sec, 120 secs
lola: 11496343 markings, 13165659 edges, 87416 markings/sec, 125 secs
lola: 11929864 markings, 13672601 edges, 86704 markings/sec, 130 secs
lola: 12363338 markings, 14179865 edges, 86695 markings/sec, 135 secs
lola: 12797430 markings, 14687458 edges, 86818 markings/sec, 140 secs
lola: 13228323 markings, 15195553 edges, 86179 markings/sec, 145 secs
lola: 13656477 markings, 15704068 edges, 85631 markings/sec, 150 secs
lola: 14092130 markings, 16211050 edges, 87131 markings/sec, 155 secs
lola: 14538431 markings, 16716321 edges, 89260 markings/sec, 160 secs
lola: 14981705 markings, 17222442 edges, 88655 markings/sec, 165 secs
lola: 15421687 markings, 17728762 edges, 87996 markings/sec, 170 secs
lola: 15861504 markings, 18234670 edges, 87963 markings/sec, 175 secs
lola: 16301107 markings, 18740831 edges, 87921 markings/sec, 180 secs
lola: 16737513 markings, 19247205 edges, 87281 markings/sec, 185 secs
lola: 17170497 markings, 19754142 edges, 86597 markings/sec, 190 secs
lola: 17607854 markings, 20260770 edges, 87471 markings/sec, 195 secs
lola: 18047051 markings, 20766724 edges, 87839 markings/sec, 200 secs
lola: 18483537 markings, 21273163 edges, 87297 markings/sec, 205 secs
lola: 18916580 markings, 21780334 edges, 86609 markings/sec, 210 secs
lola: 19350239 markings, 22287088 edges, 86732 markings/sec, 215 secs
lola: 19783099 markings, 22794036 edges, 86572 markings/sec, 220 secs
lola: 20213411 markings, 23301492 edges, 86062 markings/sec, 225 secs
lola: 20640545 markings, 23809673 edges, 85427 markings/sec, 230 secs
lola: 21074849 markings, 24316744 edges, 86861 markings/sec, 235 secs
lola: 21515008 markings, 24823660 edges, 88032 markings/sec, 240 secs
lola: 21951628 markings, 25330315 edges, 87324 markings/sec, 245 secs
lola: 22385227 markings, 25838012 edges, 86720 markings/sec, 250 secs
lola: 22819146 markings, 26345145 edges, 86784 markings/sec, 255 secs
lola: 23252378 markings, 26852419 edges, 86646 markings/sec, 260 secs
lola: 23682834 markings, 27360050 edges, 86091 markings/sec, 265 secs
lola: 24110086 markings, 27868361 edges, 85450 markings/sec, 270 secs
lola: 24541184 markings, 28376327 edges, 86220 markings/sec, 275 secs
lola: 24973896 markings, 28882723 edges, 86542 markings/sec, 280 secs
lola: 25404516 markings, 29390628 edges, 86124 markings/sec, 285 secs
lola: 25831059 markings, 29897759 edges, 85309 markings/sec, 290 secs
lola: 26256663 markings, 30403549 edges, 85121 markings/sec, 295 secs
lola: 26682482 markings, 30909285 edges, 85164 markings/sec, 300 secs
lola: 27105630 markings, 31416178 edges, 84630 markings/sec, 305 secs
lola: 27525916 markings, 31922910 edges, 84057 markings/sec, 310 secs
lola: 27954666 markings, 32428950 edges, 85750 markings/sec, 315 secs
lola: 28400650 markings, 32932970 edges, 89197 markings/sec, 320 secs
lola: 28842531 markings, 33437455 edges, 88376 markings/sec, 325 secs
lola: 29281243 markings, 33941915 edges, 87742 markings/sec, 330 secs
lola: 29719387 markings, 34446648 edges, 87629 markings/sec, 335 secs
lola: 30158522 markings, 34951766 edges, 87827 markings/sec, 340 secs
lola: 30593668 markings, 35456712 edges, 87029 markings/sec, 345 secs
lola: 31026000 markings, 35962107 edges, 86466 markings/sec, 350 secs
lola: 31460781 markings, 36467286 edges, 86956 markings/sec, 355 secs
lola: 31899387 markings, 36971915 edges, 87721 markings/sec, 360 secs
lola: 32334933 markings, 37477326 edges, 87109 markings/sec, 365 secs
lola: 32767196 markings, 37982748 edges, 86453 markings/sec, 370 secs
lola: 33199466 markings, 38488641 edges, 86454 markings/sec, 375 secs
lola: 33632606 markings, 38995003 edges, 86628 markings/sec, 380 secs
lola: 34062481 markings, 39501888 edges, 85975 markings/sec, 385 secs
lola: 34490579 markings, 40010298 edges, 85620 markings/sec, 390 secs
lola: 34922280 markings, 40516833 edges, 86340 markings/sec, 395 secs
lola: 35361666 markings, 41022076 edges, 87877 markings/sec, 400 secs
lola: 35797579 markings, 41527900 edges, 87183 markings/sec, 405 secs
lola: 36230376 markings, 42033759 edges, 86559 markings/sec, 410 secs
lola: 36662763 markings, 42540038 edges, 86477 markings/sec, 415 secs
lola: 37096048 markings, 43046418 edges, 86657 markings/sec, 420 secs
lola: 37525877 markings, 43553237 edges, 85966 markings/sec, 425 secs
lola: 37952876 markings, 44060078 edges, 85400 markings/sec, 430 secs
lola: 38381051 markings, 44566536 edges, 85635 markings/sec, 435 secs
lola: 38814550 markings, 45072818 edges, 86700 markings/sec, 440 secs
lola: 39244720 markings, 45580126 edges, 86034 markings/sec, 445 secs
lola: 39671193 markings, 46086159 edges, 85295 markings/sec, 450 secs
lola: 40096915 markings, 46593240 edges, 85144 markings/sec, 455 secs
lola: 40524390 markings, 47100096 edges, 85495 markings/sec, 460 secs
lola: 40947957 markings, 47607725 edges, 84713 markings/sec, 465 secs
lola: 41369309 markings, 48114988 edges, 84270 markings/sec, 470 secs
lola: 41792997 markings, 48622389 edges, 84738 markings/sec, 475 secs
lola: 42233512 markings, 49127283 edges, 88103 markings/sec, 480 secs
lola: 42669185 markings, 49632801 edges, 87135 markings/sec, 485 secs
lola: 43102402 markings, 50137767 edges, 86643 markings/sec, 490 secs
lola: 43533799 markings, 50644363 edges, 86279 markings/sec, 495 secs
lola: 43966838 markings, 51149051 edges, 86608 markings/sec, 500 secs
lola: 44396360 markings, 51655727 edges, 85904 markings/sec, 505 secs
lola: 44824342 markings, 52162360 edges, 85596 markings/sec, 510 secs
lola: 45250890 markings, 52669734 edges, 85310 markings/sec, 515 secs
lola: 45685514 markings, 53175886 edges, 86925 markings/sec, 520 secs
lola: 46115585 markings, 53683043 edges, 86014 markings/sec, 525 secs
lola: 46543354 markings, 54189152 edges, 85554 markings/sec, 530 secs
lola: 46967892 markings, 54696448 edges, 84908 markings/sec, 535 secs
lola: 47396518 markings, 55203311 edges, 85725 markings/sec, 540 secs
lola: 47820211 markings, 55711175 edges, 84739 markings/sec, 545 secs
lola: 48242947 markings, 56218817 edges, 84547 markings/sec, 550 secs
lola: 48661953 markings, 56727082 edges, 83801 markings/sec, 555 secs
lola: 49096947 markings, 57232460 edges, 86999 markings/sec, 560 secs
lola: 49526618 markings, 57739288 edges, 85934 markings/sec, 565 secs
lola: 49955108 markings, 58245229 edges, 85698 markings/sec, 570 secs
lola: 50378212 markings, 58752269 edges, 84621 markings/sec, 575 secs
lola: 50807021 markings, 59258266 edges, 85762 markings/sec, 580 secs
lola: 51230231 markings, 59765591 edges, 84642 markings/sec, 585 secs
lola: 51654138 markings, 60273030 edges, 84781 markings/sec, 590 secs
lola: 52072460 markings, 60781406 edges, 83664 markings/sec, 595 secs
lola: 52501571 markings, 61288358 edges, 85822 markings/sec, 600 secs
lola: 52925591 markings, 61795521 edges, 84804 markings/sec, 605 secs
lola: 53348763 markings, 62302445 edges, 84634 markings/sec, 610 secs
lola: 53767220 markings, 62810219 edges, 83691 markings/sec, 615 secs
lola: 54189267 markings, 63317139 edges, 84409 markings/sec, 620 secs
lola: 54607912 markings, 63824943 edges, 83729 markings/sec, 625 secs
lola: 55025251 markings, 64332751 edges, 83468 markings/sec, 630 secs
lola: 55438393 markings, 64840873 edges, 82628 markings/sec, 635 secs
lola: 55874831 markings, 65346240 edges, 87288 markings/sec, 640 secs
lola: 56318819 markings, 65850615 edges, 88798 markings/sec, 645 secs
lola: 56761041 markings, 66355583 edges, 88444 markings/sec, 650 secs
lola: 57198550 markings, 66861157 edges, 87502 markings/sec, 655 secs
lola: 57639700 markings, 67366978 edges, 88230 markings/sec, 660 secs
lola: 58077843 markings, 67873354 edges, 87629 markings/sec, 665 secs
lola: 58514003 markings, 68379435 edges, 87232 markings/sec, 670 secs
lola: 58945565 markings, 68886493 edges, 86312 markings/sec, 675 secs
lola: 59385124 markings, 69392087 edges, 87912 markings/sec, 680 secs
lola: 59822941 markings, 69898297 edges, 87563 markings/sec, 685 secs
lola: 60258971 markings, 70404256 edges, 87206 markings/sec, 690 secs
lola: 60689717 markings, 70910516 edges, 86149 markings/sec, 695 secs
lola: 61124179 markings, 71416451 edges, 86892 markings/sec, 700 secs
lola: 61555139 markings, 71922833 edges, 86192 markings/sec, 705 secs
lola: 61985005 markings, 72429782 edges, 85973 markings/sec, 710 secs
lola: 62410148 markings, 72937205 edges, 85029 markings/sec, 715 secs
lola: 62846962 markings, 73442274 edges, 87363 markings/sec, 720 secs
lola: 63284509 markings, 73947855 edges, 87509 markings/sec, 725 secs
lola: 63720042 markings, 74453207 edges, 87107 markings/sec, 730 secs
lola: 64149931 markings, 74958311 edges, 85978 markings/sec, 735 secs
lola: 64584161 markings, 75464221 edges, 86846 markings/sec, 740 secs
lola: 65015050 markings, 75970169 edges, 86178 markings/sec, 745 secs
lola: 65444602 markings, 76476564 edges, 85910 markings/sec, 750 secs
lola: 65869549 markings, 76983323 edges, 84989 markings/sec, 755 secs
lola: 66301754 markings, 77489538 edges, 86441 markings/sec, 760 secs
lola: 66732989 markings, 77995644 edges, 86247 markings/sec, 765 secs
lola: 67161850 markings, 78501405 edges, 85772 markings/sec, 770 secs
lola: 67586924 markings, 79007969 edges, 85015 markings/sec, 775 secs
lola: 68014015 markings, 79514348 edges, 85418 markings/sec, 780 secs
lola: 68439482 markings, 80021319 edges, 85093 markings/sec, 785 secs
lola: 68862192 markings, 80527754 edges, 84542 markings/sec, 790 secs
lola: 69276829 markings, 81029197 edges, 82927 markings/sec, 795 secs
lola: 69702656 markings, 81529780 edges, 85165 markings/sec, 800 secs
lola: 70136806 markings, 82029789 edges, 86830 markings/sec, 805 secs
lola: 70568830 markings, 82531145 edges, 86405 markings/sec, 810 secs
lola: 70995671 markings, 83030825 edges, 85368 markings/sec, 815 secs
lola: 71422088 markings, 83529891 edges, 85283 markings/sec, 820 secs
lola: 71849311 markings, 84029318 edges, 85445 markings/sec, 825 secs
lola: 72273693 markings, 84529555 edges, 84876 markings/sec, 830 secs
lola: 72695543 markings, 85030473 edges, 84370 markings/sec, 835 secs
lola: 73119543 markings, 85531662 edges, 84800 markings/sec, 840 secs
lola: 73548037 markings, 86032117 edges, 85699 markings/sec, 845 secs
lola: 73971949 markings, 86532152 edges, 84782 markings/sec, 850 secs
lola: 74392030 markings, 87030197 edges, 84016 markings/sec, 855 secs
lola: 74809795 markings, 87528369 edges, 83553 markings/sec, 860 secs
lola: 75231275 markings, 88027836 edges, 84296 markings/sec, 865 secs
lola: 75647957 markings, 88527265 edges, 83336 markings/sec, 870 secs
lola: 76062758 markings, 89025917 edges, 82960 markings/sec, 875 secs
lola: 76475387 markings, 89524948 edges, 82526 markings/sec, 880 secs
lola: 76902320 markings, 90021583 edges, 85387 markings/sec, 885 secs
lola: 77326135 markings, 90521444 edges, 84763 markings/sec, 890 secs
lola: 77749728 markings, 91021800 edges, 84719 markings/sec, 895 secs
lola: 78166762 markings, 91521701 edges, 83407 markings/sec, 900 secs
lola: 78590292 markings, 92021667 edges, 84706 markings/sec, 905 secs
lola: 79020030 markings, 92536808 edges, 85948 markings/sec, 910 secs
lola: 79437542 markings, 93036247 edges, 83502 markings/sec, 915 secs
lola: 79866670 markings, 93558008 edges, 85826 markings/sec, 920 secs
lola: 80290103 markings, 94057868 edges, 84687 markings/sec, 925 secs
lola: 80708081 markings, 94557728 edges, 83596 markings/sec, 930 secs
lola: 81125826 markings, 95057891 edges, 83549 markings/sec, 935 secs
lola: 81537653 markings, 95557583 edges, 82365 markings/sec, 940 secs
lola: 81953439 markings, 96057438 edges, 83157 markings/sec, 945 secs
lola: 82365951 markings, 96557017 edges, 82502 markings/sec, 950 secs
lola: 82777394 markings, 97057595 edges, 82289 markings/sec, 955 secs
lola: 83183348 markings, 97556447 edges, 81191 markings/sec, 960 secs
lola: 83605708 markings, 98055575 edges, 84472 markings/sec, 965 secs
lola: 84038816 markings, 98554534 edges, 86622 markings/sec, 970 secs
lola: 84505105 markings, 99095527 edges, 93258 markings/sec, 975 secs
lola: 84708205 markings, 99333183 edges, 40620 markings/sec, 980 secs
lola: 84708390 markings, 99333401 edges, 37 markings/sec, 985 secs
lola: 84708630 markings, 99333691 edges, 48 markings/sec, 990 secs
lola: 84714707 markings, 99340781 edges, 1215 markings/sec, 995 secs
lola: 84714952 markings, 99341075 edges, 49 markings/sec, 1000 secs
lola: 84715158 markings, 99341321 edges, 41 markings/sec, 1005 secs
lola: 84722449 markings, 99349773 edges, 1458 markings/sec, 1010 secs
lola: 84728597 markings, 99356844 edges, 1230 markings/sec, 1015 secs
lola: 84728804 markings, 99357088 edges, 41 markings/sec, 1020 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes no unknown no no no no no no
lola:
preliminary result: no no no no yes no unknown no no no no no no
lola: memory consumption: 3312 KB
lola: time consumption: 1443 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="AutoFlight-PT-48a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is AutoFlight-PT-48a, 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 r011-tall-162038006200250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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